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
 344   345   346   347   348 
A Heuristic Greedy Algorithm for Scheduling Out-Tree Task Graphs Jian Jun Zhang; Wei Wen Hu; Mei Ni Yang
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 | DOI: 10.11591/ijeecs.v12.i6.pp4868-4875

Abstract

The scheduling of Out-Tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. Although there are a few heterogeneity based algorithms in the literature suitable for scheduling Out-Tree task graphs, they usually require significantly high scheduling costs and may not deliver good quality schedules with lower costs. This paper presents a heuristic greedy scheduling algorithm for Out-Tree task graphs with an objective to simultaneously meet high performance and fast scheduling time, which is based on list and task duplication, tries to find the best point between balancing loads and shortening the schedule length and improves the schedule performance without increasing the time complexity of the algorithm. The comparative study shows that the proposed algorithm surpasses previous approaches in terms of schedule length ratio, speedup and efficiency metrics.
A Novel QoS Routing Algorithm in Wireless Mesh Networks Liu Hui
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: March 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With the rapid development of information technology, people’s daily life becomes more and more dependent on wireless technologies. Wireless mesh network consists of a number of characteristics associated with the return path, with a strong fault tolerance, stability, widely used by the light to the city network construction, military applications, and key service providers and other fields. Compared with traditional wired communication technologies, how to provide qualified QoS routing service is a primary problem for wireless mesh networks waiting for effective solution. Regarding this problem, this paper applys the theory of Evolutionary Game to QoS routing algorithm for wireless mesh networks and proposed a novel algorithm called EGWRA which can not only improve the performance of traditional QoS routing protocols but also be able to reduce the cost of the routing algorithm. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2321
Optimal sizing and location of multiple distributed generation for power loss minimization using genetic algorithm Abdulhamid Musa; Tengku Juhana Tengku Hashim
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 2: November 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i2.pp956-963

Abstract

This paper presents a Genetic Algorithm (GA) for optimal location and sizing of multiple distributed generation (DG) for loss minimization. The study is implemented on a 33-bus radial distribution system to optimally allocate different numbers of DGs through the minimization of total active power losses and voltage deviation at power constraints of 0 – 2 MW and 0 – 3 MW respectively. The study proposed a PQ model of DG and Direct Load Flow (DLF) technique that uses Bus Incidence to Branch current (BIBC) and Branch Current to Bus Voltage (BCBV) matrices. The result obtained a minimum base case voltage level of 0.9898 p.u at bus 18 with variations of voltage improvements at other buses after single and multiple DG allocations in the system. Besides, the total power loss before DG allocation is observed as 0.2243 MW, and total power loss after DG allocation was determined based on the power constraints. Various optimal locations were seen depending on the power limits of different DG sizes. The results have shown that the impact of optimal allocation and sizing of three DG is more advantageous concerning voltage improvement, reduction of the voltage deviation and also total power loss in the distribution system. The results obtained in the 0 – 2 MW power limit is consistent to the 0 – 3 MW power limits regarding the influence of allocating DG to the network and minimization of total power losses.
A novel index modulation scheme with impedance matching Hye Yeong LEE; Soo Young Shin
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 3: June 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v14.i3.pp1203-1209

Abstract

Index modulation conveys more data given to indices of status of communication transmission item such as antenna and subcarrier. In this proposed system, we gave the index to the conditions of impedance matching or not. In the transmitter, antenna chooses one impedance according to the mapping table as active impedance. The receiver detects impedance index comparing of impedance between received signal and receivers. The proposed system improves not only transmitted information data by using impedance index but also spectral efficiency. In the simulation, Spectral Efficiency (SE) and Bit Error Rate (BER) were analyzed and compared to conventional modulation scheme.
Design of Low Power Low Noise Amplifier using Gm-boosted Technique Maizan Muhamad; Norhayati Soin; Harikrishnan Ramiah
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 3: March 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i3.pp685-689

Abstract

This paper presents the development of low noise amplifier integrated circuit using 130nm RFCMOS technology. The low noise amplifier function is to amplify extremely low noise amplifier without adding noise and preserving required signal to a noise ratio. A detailed methodology and analysis that leads to a low power LNA are being discussed throughout this paper. Inductively degenerated and Gm-boosted topology are used to design the circuit. Design specifications are focused for 802.11b/g/n IEEE Wireless LAN Standards with center frequency of 2.4 GHz. The best low noise amplifier provides a power gain (S21) of 19.841 dB with noise figure (NF) of 1.497 dB using the gm-boosted topology while the best low power amplifier drawing 4.19mW power from a 1.2V voltage supply using the inductively degenerated.
Optimal tuning of PI controller using genetic algorithm for wind turbine application Yamina Belgaid; M’hamed Helaimi; Rachid Taleb; Mohammed Benali Youcef
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 1: April 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i1.pp167-178

Abstract

Nowadays, wind turbine energy has an increased importance in electrical power applications since when it is considered as an essential inexhaustible and broadly available energy resource. An aerogenerator is a device that transforms a part of the kinetic energy of the wind into available mechanical energy on a transmission shaft, and then into electrical energy through a generator, which is in our case a dual power asynchronous machine. An important characteristic of a wind turbine is that the avail, able maximum power is provided only in a single given operating point, called Maximum Power Point. Many classical methods and controllers have been widely developed and implemented to track the maximum power point. Among drawbacks of a classical PI controller is that its parameters are not constant, these conventional control laws may be are insufficient because they are not robust, especially when the accuracy requirements and other dynamic characteristics of the system are strict. The new idea in this paper is to introduce the Genetic Algorithms theory into the controlstrategy that used inthe conversion chain of the wind turbine, in order to improve stability. Simulation results approve that the application of Genetic Algorithms to the PI regulator, minimize or eliminate the drawbacks of the classical PI regulator, and greatly promote the efficiency and stability of the wind turbine systems.
Energy demand forecasts based on improved Gray neural network algorithm Ying Jin Li; Fen Zhi Xu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: February 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Energy demand forecasting and energy consumption structure analysis were important foundation for energy planning and development of new energy, so energy forecasting result was required as close as possible to the actual value. To improve the prediction accuracy, this article combined back propagation (abbreviated bp) neural network and gray phase to build an improved gray neural network prediction method, and using genetic algorithms to optimize it. The experiment proved that this model has high prediction accuracy, and used it to predict the energy demand in Hebei Province, the results proved the validity of the model. Finally, the article also analyzed the energy structure and the development of new energy based on forecast results in Hebei Province. DOI : http://dx.doi.org/10.11591/telkomnika.v12i2.3731
Design of Fractional Order PID controller for dc motor using Genetic Algorithm Ashu Ahuja; Bhawna Tandon
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 12: December 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Design of fractional order PID (FOPID) controller for DC motor is proposed in this paper. A FOPID (PIλDμ) is a PID controller whose derivative and integral orders are fractional numbers rather than integers. Design stage of such controller consists of determining six parameters – proportional constant (Kp), integral constant (Ki), derivative constant (Kd), filter time constant (τd), integral order (λ) and derivative order (μ). The proposed approach poses the problem as designing a DC motor speed controller on the concept of fixed structure robust controller and mixed sensitivity H∞ method. The uncertainty caused by the parameter changes of motor resistance, motor inductance and load are formulated as multiplicative uncertainty weight, which are used in the objective function in the design. Genetic Algorithm (GA) and Simulated Annealing (SA) are employed to carry out the aforementioned design procedure. Comparisons are made with a PID with derivative first order filter controller and it is shown that the proposed FOPID controller can highly improve the system robustness with respect to model uncertainties. The comparison of PID and FOPID controllers is also been done on the basis of Time Domain Performance index i.e. ISE (Integral of Square Error).  http://dx.doi.org/10.11591/telkomnika.v12i12.6470 
Comparison Methods for Converting a Spindle Plant to Discrete System M. Khairudin
Indonesian Journal of Electrical Engineering and Computer Science Vol 1, No 3: March 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v1.i3.pp575-582

Abstract

This study presents comparison methods in the conversion of a spindle plant in order to obtain an accurate discrete system when compared to a continuous system of spindle.  The accurate conversion results of the continuous system into discrete form are required for implementing the control system of spindle. Comparison methods that will be conducted to convert  the  continuous system of spindle plant into discrete system through zero-order hold (ZOH), first-order hold (FOH), impulse invariant dicretisation, tustin (bilinear), and pole-zero matching methods. The performances of each method in the conversion process have been presented. Conversion performances of continous spindle plant into discrete form using FOH method, showed more accurate compared to other methods. Performances of the conversion accuracy of FOH method have been evaluated in terms of transient responses analysis that closed similar results with a continuous system of spindle plant. At the closed similar transient responses for the discrete system using FOH method show the final value, time to peak, percertages overshoot and setlling time are 0.863 v, 0.910 s, 0 % and 0.550 s respectively.
Community Detection Algorithm Based on Neighbor Similarity Jianjun Cheng; Hong Xu; Mahmud Gaybullaev; Mingwei Leng; Xiaoyun Chen
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 8: August 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Many complex networks have displayed the community structures, and the detection of community structure can give insights into the structural and functional information of these complex networks. In this paper, we proposed a neighbor similarity based new algorithm for community structure detection, in which we only consider the similarities between a node and its unclassified neighbors in the breadth-first traversal order, without considering other nodes’ influences; we take this node as a father node and its neighbors as the children nodes, to find out those children nodes which should belong in the same community with their father node. Then these children nodes are processed in the same way as their father node recursively, until the termination condition is reached. The most prominent property of our algorithm is that it has near liner time complexity, and furthermore it is a deterministic algorithm. We have tested our algorithm on several real networks, compared with some other algorithms, and the results have manifested that our algorithm outperforms the previous algorithms significantly. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3064 

Page 346 of 923 | Total Record : 9226

 344   345   346   347   348 

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