cover
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
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,199 Documents
Reverse biased nanocrystalline graphite (NCG)/p-Si schottky junction for methane gas sensor A. A. Nawawi; S.M. Sultan; S.F.A. Rahmah; P.I. Khalid; S.H. Pu
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1217-1222

Abstract

An investigation on the effect of the reverse biased operation of NCG/p-Si Schottky contact during methane gas exposure at room temperature has been presented. The experimental results show the larger current shift at the reverse bias operation, compared to the forward bias by exposing to methane gas. This can be attributed to the adsorption of methane gas into the metal surface layer and produces a negative charge at the junction, thus reduces the barrier height of the device. The reverse barrier height was calculated under the reverse bias condition, demonstrated the value decreased from 0.58-0.53eV towards a higher concentration of methane gas. The Schottky junction also affected by the increase in a free carrier when exposure to the reducing gas such as methane. Raman spectra are reported to be detected at G, D and 2D band with the grain size 1.88nm to exhibit single crystallite graphite properties. The results correlate well with the 3D AFM scans reveal the RMS surface roughness of 1.1 to 2.8nm.
Net energy metering scheme based on time of use pricing for residents in Malaysia Abdul Hafiz Bin Razali
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1140-1146

Abstract

The current Malaysia’s net energy metering (NEM) scheme has been updated in 2019 that credits excess generation into the next billing month at retail rate compare to at displaced cost. The new NEM may attract more installation of solar photovoltaic (PV) system among residential customers. However, it is discovered that customers with low monthly electricity consumptions are still not benefited since their electricity cost is lower than the PV generation cost. Implementing time-of-use (TOU) pricing on NEM scheme may overcome the problem as it based on hourly energy usage. This paper compares the annualized energy cost of residential PV system under different TOU prices and NEM scheme. The results show that an optimized TOU prices as suggested in this paper may give financial benefits to all residential customers with PV system, including the one with low monthly consumption.
Simplified Gauss Hermite Filter Based on Sparse Grid Gauss Hermite Quadrature Gao Fu Quan; Chen Li Rong; Ding Chuan Hong; Liu Jian Feng
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 12: December 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In order to improve estimation accuracy of nonliear system with linear measurement model, simplifed gauss hermite filter based on sparse grid gauss hermite quadrature (SGHF) is proposed. Comparing to conventional Gauss-Hermite filter (GHF) based on tensor product gauss quadrature rule, simplified SGHF not only maintains GHF's advantage of precission controllable, high estimation accuracy, but also relieves the curse of dimension problem by reduce the number of gaussian intrgration points to the number of sigma points that scaled unscented transform uses. Theoretical analysis and experimental results show that estimation base on new filter performs significantly beter than extended kalman filter (EKF), and slightly better than unscented kalman filter (UKF) on estimation accuracy and convergence speed, and computational burden is significantly reduced comparing with traditional GHKF. DOI: http://dx.doi.org/10.11591/telkomnika.v11i12.3693
A Quick Image Registration Algorithm Based on Delaunay Triangulation Yongmei Zhang; Li Ma; Rui Zhang
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

The traditional image matching algorithms adopt more complex strategies when dealing with mismatch caused by a lot of noise. In this paper, a simple, intuitive and effective noise processing algorithm is proposed based on Delaunay triangulation in computational geometry. The algorithm extracts feature points using SIFT method, respectively establishes Delaunay triangulation in multi-spectral and panchromatic images, and removes the feature points that three points are collinear and four points are on circle by Delaunay triangulation, obtains the registration images through the correspondence between the Delaunay triangulations. The effect of image registration is evaluated by objective method. In the image matching, Delaunay triangulation is introduced. The establishment of Delaunay triangulation is independent of the selection of initial values. In general, a unique Delaunay triangulation can be got when a feature point set is given, and it can provide the accuracy of the algorithm. The algorithm is simple and clear for converting a lot of mismatch noise to the operation of Delaunay triangulation. Experiment results show the algorithm can keep the good rotation feature and translation invariance in SIFT method, the number of extraction feature points has been significantly reduced in the algorithm compared with SIFT method, registration speed and accuracy are better than the registration algorithm based on conventional SIFT method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i2.2004
An Overview of Electrical Tree Growth in Solid Insulating Material with Emphasis of Influencing Factors, Mathematical Models and Tree Suppression M.H. Ahmad; N. Bashir; H. Ahmad; A.A. Abd Jamil; A.A. Suleiman
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 8: August 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i8.pp5827-5846

Abstract

Nowadays, the most widely used insulating materials in high voltage equipment such as cables are polymeric insulations due to the numerous merits they possess with regards to electrical performance compared to paper insulations. However, electrical treeing, one of the dielectric pre-breakdown phenomena, has been considered as a major contribution to the failure of insulating polymeric materials. Thus, this paper provides an overview on the factors affecting the initiation and propagation of electrical tree.  Discussions on parameters that affect the growth of electrical treeing such as applied voltage, electric field enhancement, partial discharge, frequency of applied voltage and temperature are given. Some discussions on the various models are also highlighted. The tree related models being discussed herein include Weibull, Lognormal, Johnson SB, Dielectric Breakdown Model, Discharge-Avalanche Model, and Field-Driven Tree Growth. In addition, discussions on the use of nano-sized fillers in polymeric insulating material to inhibit electric treeing are highlighted.
Line balancing using heuristic procedure and simulation of assembly line Mohammad Huskhazrin Kharuddin; Mohammad Fadzli Ramli; Muhamad Hafiz Masran
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 2: February 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i2.pp774-782

Abstract

The assembly line is widely known because the use of it in manufacturing to process raw material into a complete product. There are many discussions and researches have been done in this field and the assembly line balancing problem is one of the topics that attract the interest of many researchers. The technique that frequently uses to solve assembly line balancing is a heuristic procedure. In this paper, a case study about the production of the power converter is studied. The assembly line of the power converter consists of 27 major tasks and 19 workstations. The existing heuristics procedures and a proposed heuristic procedure are used to solve the line balancing problem. After that, simulation is used to obtain the results and by comparing the results for each procedure, the most suitable procedure that should be used to solve the problem is selected.
N-tangle of the Superposition of Greenberger-Horne-Zeilinger States Xiu-Li Tu; Ting Zhang; Xian-Ming Wang; Xin-Wei Zha
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 6: June 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In the paper, use the n-tangle, as a measure of entanglement to investigate the superposition of Greenberger-Horne-Zeilinger states for even n qubits. The paper show that orthogonal basis with the GHZ state can be divided into two group via SLOCC –invariant. In the same group, an expression for any two superposed state is provided, when the superposition coefficient is real, the n-tangle of superposed state is invariable. Otherwise, In the different group, which can get a different expression if the superposed state come from different group. DOI: http://dx.doi.org/10.11591/telkomnika.v11i6.2718
Multi Dimension of Coarse to Fine Search Method Development for Solving Economic Dispatch Jangkung Raharjo; Adi Soeprijanto; Hermagasantos Zein
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 1: July 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i1.pp1-9

Abstract

Economic dispatch problem has grown along with the development of electric power business, for example in a competitive electric power business that offers electrical energy in the form of the step function, non-differentiable function. This is not a continuous function so there is no guarantee that those methods can execute the optimization problem well, especially the Lagrange and Direct methods. There are the non-differentiable functions within the optimization will become a challenge that should be solved. This paper proposes Coarse to Fine Search method development to solve the problem. The Coarse to Fine Search is able to work for differentiable or non-differentiable functions, but is only limited maximum three dimensions. The development is done to multi dimension so that it can solve the economic dispatch problem. We named it Multi Dimension of Coarse to Fine Search. The simulation results of eight power plants show the developed method can work well, it is always convergent and fast with the execution time of 2.63 - 38.30 seconds for 25 - 200 population and 50 - 200 delta search.
Research on Security of Routing Protocols Against Wormhole Attack in the Ad hoc Networks Yang Shengju; Shi Shaoting; Zhao Xinhui
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

As known that Ad hoc networks are made of a group of portable terminals and has many wireless transmitter as multi-hops autonomy system. While Ad hoc networks are very easy to be attacked by various kinds of network attacks, because it has limited resources, dynamic topology and open communication channel, etc. The wormhole attack is the common attack method, and it is an internal attack against routing protocols in the Ad hoc networks, the research on security of routing protocols against wormhole attack in the Ad hoc networks is to avoid the wormhole attack. In the study, the security routing mechanisms against wormhole attack in the Ad hoc networks are presented, on the basis of deeply research on wormhole attack principles and models. The modelling method and related simulations are presented in detailed to verify the effectiveness of security routing mechanisms. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4062
Stability and reliability of low voltage hybrid AC-DC microgrids power flow model in islanding operation hasti afianti; Ontoseno Penangsang; Adi Soeprijanto
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 1: July 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i1.pp32-41

Abstract

The problem of decreasing and increasing power flow in hybrid AC-DC microgrids in island operations is the concern of this research. This condition arises if one sub-microgrid cannot supply load power requirements, either due to a decrease in power at the source or an increase in load on the sub-microgrid network. As a result, in this research used the bidirectional converter as an interlinking converter, the converter can change the power flow from the ac sub microgrid to the dc sub microgrid and vice versa. With this bidirectional converter, load power requirements can be met even though there is a power change in one of the sub microgrid. The simulation in this research support by Simulink/Matlab software. The model is built in a low voltage system, and the power flow analysis is in steady-state condition with two different cases. The simulation results show the stability and reliability of the power flow in both sub microgrid with stable frequency and voltage when power and load change occur.

Filter by Year

2012 2026


Filter By Issues
All Issue 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