cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,226 Documents
 319   320   321   322   323 
Application of Grey Correlation Degree and TOPSIS Method in Evaluation of Power Quality Fan Li-Guo; Wang Hai-Feng
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 6: June 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Aiming at solving multi-criteria decision problems in power quality, a new decision-making method based on grey correlation degree and TOPSIS is proposed. On the basis of introducing the concept of grey correlation degree into traditional TOPSIS, a new relative similarity degree is established to decide power quality by combining Euclidean distance with grey correlation degree. Error originated from biased thinking due to subjective and objective factors in decision-making problem when using single method could be overcome by using the method and reliability of evaluation result in electric material tendering can be boosted up. Example shows that power quality could be effectively estimated by use the method and the method is an effective instruction for PQ evaluation. DOI : http://dx.doi.org/10.11591/telkomnika.v12i6.5251
Adaptive Control of Rotor-bearing System with Coupling Faults of Pedestal Looseness and Rub-impact JIA Limin; YAO Dechen; LI Xiaofeng; QIN Yong; CAI Guoqiang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: February 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Pedestal looseness and rub-impact are two important faults in rotating machinery. Once the Pedestal looseness is developed in a rotor system, the rotor is more likely to make contact with stator under tight clearance conditions. Due to the presence of both Pedestal looseness and rub-impact, the whole system becomes highly nonlinear and instability. The present study is aimed to simulate a chaotic system of the nonlinear rotor system and the system can adaptively be converted to normal working state under the circumstance of the chaotic state occasioned by outside perturbation for the complicated chaotic system. The nonlinear dynamic equations of rotor-bearing system with coupling faults of pedestal looseness and rub-impact force are derived and a multi-parameter adaptive control algorithm is given. As a result, it is found that those systems possess various nonlinear dynamical inherences. The numerical results also show that the parametric adaptive control method is appropriate to those rotor-bearing systems, outside interference under the state of chaos arising from the situation can be adaptive to adjust to normal working condition. It has strongly control capability of stability. The theoretical and practical idea for controlling rotor–bearing systems and optimizing their operation can be more precise. DOI: http://dx.doi.org/10.11591/telkomnika.v11i2.2054
Embedded System Based Power Plant Monitoring and Controlling J S Ashwin; N Manoharan
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 2: February 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i2.pp275-278

Abstract

An embedded based power plant system is used for checking the environmental condition based on different sensor. The microcontroller is fixed inside the boiler which is a turbine, to monitor the status and the information is passed through GSM. In this project we proposed the main water tank supplies number of boilers. The water level is controlled by a water level sensor, each evaporator has two channels, one is delta other one is outlet and the channels' valves are controlled by some temperature sensors composed in each package. From the GSM modem, the user will get the present status of the boiler level by sending a radiator ID number as message. When the temperature inside the boiler exceed the threshold value it will indicate as a warning to the concerned authority person to take the immediate step.
Verification and validation of IM-DeCRuD approach using DESMET for its applicability Jamaluddin Jasmis; Shamsul Jamel Elias; Azlan abdul Aziz; Mohd Zaki Zakaria; R Badlishah Ahmad; Roshidi Din; Rosmadi Bakar
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 3: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i3.pp1311-1317

Abstract

Requirements crosscutting in software development and maintenance have gradually become an important issue in software engineering with a growing need of traceability support to better understand the requirements crosscutting processes to comply with industrial standards. However, many recent works focusing on identification, modularization, composition and conflict dissolution of requirements crosscutting are mostly saturated at requirements level. Hence, these works fail to specify crosscutting properties for functional and non-functional requirements at other phases leading to insufficient support for software engineers. Recently, a new approach called the Identification, Modularization, Design Composition Rules and Conflict Dissolutions (IM-DeCRuD) was proposed to provide a special traceability to facilitate better understanding and reasoning towards requirements crosscutting implementation, along with a tool as a proof-of-concept. In this paper, the tool was evaluated and the results were verified by some experts in the industries. The feedbacks on applicability aspect were then gathered and analyzed using DESMET qualitative method. The outcome showed that the IM-DeCRuD was applicable to cope with the tedious engineering processes in handling crosscutting properties at requirements, analysis and design phases for system development and evolution.
Study on an Energy-aware Routing Algorithm for Agriculture WSN Huarui Wu; Chunjiang Zhao; Li Zhu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 7: July 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

As precision farming requires real-time, accurate and sustainable monitoring of the biotope of the field, energy consumption and network delay constitute the major factors affecting the performance of ZigBee-based Wireless Sensor Network (WSN) applied in agricultural production. Based on the AODVjr algorithm, this paper presents a new algorithm, namely NS-AODVjr. Featuring emphasis on energy control and dynamic routing, as well as balance between energy consumption and shortest path routing, this algorithm realizes maximum service time of the WSN while ensuring timely and effective transmission of the data in the monitoring process. After a simulation experiment with the Network Simulator tool, results show that, compared to the original algorithm, although the packet delivery rate and network delay witness no improvement, the new algorithm not only significantly reduces the device energy consumption, but also effectively expand the service time of the network. DOI: http://dx.doi.org/10.11591/telkomnika.v11i7.2799 
Optimization model for QoS based task scheduling in cloud computing environment Sirisha Potluri; Katta Subba Rao
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 2: May 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i2.pp1081-1088

Abstract

Shortest job first task scheduling algorithm allocates task based on the length of the task, i.e the task that will have small execution time will be scheduled first and the longer tasks will be executed later based on system availability. Min- Min algorithm will schedule short tasks parallel and long tasks will follow them. Short tasks will be executed until the system is free to schedule and execute longer tasks. Task Particle optimization model can be used for allocating the tasks in the network of cloud computing network by applying Quality of Service (QoS) to satisfy user’s needs. The tasks are categorized into different groups. Every one group contains the tasks with attributes (types of users and tasks, size and latency of the task). Once the task is allocated to a particular group, scheduler starts assigning these tasks to accessible services. The proposed optimization model includes Resource and load balancing Optimization, Non-linear objective function, Resource allocation model, Queuing Cost Model, Cloud cost estimation model and Task Particle optimization model for task scheduling in cloud computing environement. The main objectives identified are as follows. To propose an efficient task scheduling algorithm which maps the tasks to resources by using a dynamic load based distributed queue for dependent tasks so as to reduce cost, execution and tardiness time and to improve resource utilization and fault tolerance. To develop a multi-objective optimization based VM consolidation technique by considering the precedence of tasks, load balancing and fault tolerance and to aim for efficient resource allocation and performance of data center operations. To achieve a better migration performance model to efficiently model the requirements of memory, networking and task scheduling. To propose a QoS based resource allocation model using fitness function to optimize execution cost, execution time, energy consumption and task rejection ratio and to increase the throughput. QoS parameters such as reliability, availability, degree of imbalance, performance and SLA violation and response time for cloud services can be used to deliver better cloud services.
Takagi-Sugeno Fuzzy Model Identification for Small Scale Unmanned Helicopter Arbab Nighat Khizer; Dai Yaping; Syed Amjad Ali; Xu Xiang Yang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: January 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This paper presents system identification method for small unmanned helicopter based on Takagi Sugeno fuzzy models under hover. Firstly,the nonlinear discrete model of small unmanned helicopter with unknown parametersis determined by Takagi Sugeno system. Secondly, derivative based gradientmethod is used to identify unknown parameters of TS fuzzy model because in gradientadaptation, fuzzy system is not supposed to be linear in the parameters, so allfuzzy sets for input and output could be adjusted. The proposed method showedits effectiveness in terms of data matching obtained by the X-Plane©flight simulator. Obtained simulation results show high accuracy of themodeling method and better justification for real time applicability of theapproach DOI : http://dx.doi.org/10.11591/telkomnika.v12i1.3577
A Robust k-Means Type Algorithm for Soft Subspace Clustering and Its Application to Text Clustering Tiantian Yang; Jun Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 9: September 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i9.pp6993-6998

Abstract

Soft subspace clustering are effective clustering techniques for high dimensional datasets. In this work, a novel soft subspace clustering algorithm RSSKM are proposed. It is based on the incorporation of the alternative distance metric into the framework of k-means type algorithm for soft subspace clustering and can automatically calculates the feature weights of each cluster in the clustering process. The properties of RSSKM are also investigated. Experiments on real world text datasets are conducted and the results show that RSSKM outperformed some popular clustering algorithms for text mining, while still maintaining efficiency of the k-means clustering process.
A New Memory MapReduce Framework for Higher Access to Resources ZuKuan WEI; Bo HONG; JaeHong KIM
Indonesian Journal of Electrical Engineering and Computer Science Vol 4, No 3: December 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v4.i3.pp629-636

Abstract

The demand for highly parallel data processing platform was growing due to an explosion in the number of massive-scale data applications both in academia and industry. MapReduce was one of the most meaningful solutions to deal with big data distributed computing, This paper was based on the work of Hadoop MapReduce. In the face of massive data computing and calculation process, MapReduce generated a lot of dynamic data, but these data were discarded after the task completed. Meanwhile, a large number of dynamic data were written to HDFS during task execution, caused much unnecessary IO cost. In this paper, we analyzed existing distributed caching mechanism and proposed a new Memory MapReduce framework that has a real-time response to read or write request from task nodes, maintain related information about cache data. After performance testing, we could clearly find MapReduce with cache significantly improved in IO performance.
Key Escrow with Elliptic Curve Cryptography – Conceptual Framework for Distributed Mobile Networks B. Sugumar; M. Ramakrishnan
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: September 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v11.i3.pp1060-1067

Abstract

In the large scale distributive environment involving mobile network, metadata server and storage applications, the data access and the security measures are of paramount importance. In parallel application processing, data is distributed across multiple servers and storage location. Ensuring confidentiality and availability of the data to the authorised users at the appropriate time involves high level of encryption algorithms, key management schemes and security algorithms. In this paper, key escrow scheme is implemented with the light weighted symmetric algorithm, elliptic curve cryptography in the distributed environment. Key escrow centre is established along with the metadata server and the encryption keys are segmented and shared among the multiple sub agents using Shamir threshold sharing scheme. The implementation of Key Escrow mechanism with Elliptical Curve Cryptography provides wide range of flexibility and confidentiality in the distributed environment. It also eliminates private secret sub key problem and thereby ensuring better security.

Page 321 of 923 | Total Record : 9226

 319   320   321   322   323 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 42, No 1: April 2026 Vol 41, No 3: March 2026 Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue