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,226 Documents
Development of Accurate BSIM4 Noise Parameters for CMOS 0.13-µm Transistors in Below 3-GHz LNA Application Asmaa Nur Aqilah Zainal Badri; Norlaili Mohd Noh; Shukri bin Korakkottil Kunhi Mohd; Asrulnizam Abd Manaf; Arjuna Marzuki; Mohd Tafir Mustaffa; Mohamed Fauzi Packeer Mohamed
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 3: June 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v10.i3.pp925-933

Abstract

Accurate transistor thermal noise model is crucial in IC design as it allows accurate selection of transistors for specific frequency application. The accuracy of the model is represented by the similarity between the simulated and the measured noise parameters (NPs). This work was based on a problem faced by a foundry concerning the dissimilarities between the measured and simulated NPs, especially minimum noise figure (NFmin) for frequencies below 3 GHz.
Using A Fuzzy Number Error Correction Approach to Improve Algorithms in Blind Identification Elmostafa ATIFY; Cherki DAOUI; Ahmed BOUMEZZOUGH
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 2: August 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i2.pp410-419

Abstract

As part of a detailed study on blind identification of Gaussian channels, the main  purpose was  to propose an algorithm based on cumulants and  fuzzy number approach  involved throughout the whole process of identification. Our objective was to compare the new design of the algorithm to the old one using the  higher order cumulants, namely  Alg1, Algat  and the Giannakis  algorithm. We were  able to demonstrate that the proposed method -fuzzy number error correction- increases the performance of the algorithm by calculating the ratio of squared errors of ALGaT and  AlgatF. The method can be applied to any algorithm for more improvement and effinciency.
Real Time Power Quality Phenomenon for Various Distribution Feeders C. Bharatiraja; Harish Chowdary V
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.pp10-16

Abstract

Power Quality (PQ) brings more challenges to the large- scale and medium scale industries because in the recent years most of them use high efficiency and low energy devices which cause vulnerable PQ disturbances at Point of Common Coupling (PCC). In this paper, the measurement at different times during load condition and analysis of all types of disturbances occurred has been done. When large rated equipments run, the disturbance (harmonics, RMS variations, and switching transients) levels are very high and poor power factor (PF) has also appeared. Due to this poor PF, reactive power consumption in load increases and accordingly total power increases. An electronic device such as LED lights, fluorescent lamps, computers, copy machines, and laser printers also disturb the supply voltage. We are very well known that every PQ problem directly or indirectly must affect economically. Many researchers have investigated PQ audit for over three decades. However these studies and analysis have been done only at simulation level. Hence, the PQ analyzer based study is required to find out the PQ issues at distribution feeders. It will be a valuable guide for researchers, who are interested in the domain of PQ and wish to explore the opportunities offered by these techniques for further improvement in the field of PQ. This paper gives a brief Real Time PQ measurement using PQ analyzer HIOKI PW3198 at Distribution Feeders and it gives an idea to the researcher to optimize problems-related to PQ with respect to the high rated and low rated electric machinery of different feeders at PCC level. This study further extends to analyze the grid disturbances and looks forward to the optimization methods for each individual PQ disturbance.
Capacitor Bank Voltage Equilibrium for MPPT in Single-Phase Single-Stage Five-Level Inverter for PV-Grid Application Leonardus Heru Pratomo; F. Danang Wijaya; Eka Firmansyah
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 1: April 2015
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Single-phase single-stage PV-Grid system using a five-level inverter has been investigated. Some of integration systems used two-stage converters, while others used single-stage converter. However, two-stage converters had a very complicated problem. The first converter acted as a maximum power point tracker to maximize power generated by sunlight energy to electric power, implemented by PV. The second stage was used as an interface to the grid. In single stage-converter was very simple in which an inverter was used for a maximum power point tracker and interface to the grid. This paper is designed to develop a single-stage PV-Grid system using a single-phase voltage source five-level inverter. The voltage equilibrium on capacitor was to make PV generate maximum power; hence, the equilibrium voltage between PV and five-level inverter output was proposed to deliver that maximum power generated by PV to the grid. Here, an analysis and a simulation were performed to demonstrate the design effectiveness. DOI: http://dx.doi.org/10.11591/telkomnika.v14i1.7646
Wireless Sensor Network Path Optimization Based on Hybrid Algorithm Zeyu Sun; Zhenping LI
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 9: September 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

One merit of genetic algorithm is fast overall searching, but this algorithm usually results in low efficiency because of large quantities of redundant codes. The advantages of ant colony algorithm are strong suitability and good robustness while its disadvantages are tendency to stagnation, slow speed of convergence. Put forward based on improved ant colony algorithm for wireless sensor network path optimization approach will first need to pass the data in the shortest path for transmission, assuming that transmission path jam, it will clog information sent to the initial position, so the follow-up need to pass data can choose other reasonable path so as to avoid the defects of the traditional method. Genetic ant colony is proposed to avoid the faults of both algorithms above. The proposed algorithm determines distribution of pheromones on path through fast searching and changing the operation of selection operator, crossover operator and mutation operator of genetic ant colony, and then solves the problems efficiently through parallelism, positive feedback and iteration of ant colony algorithm. Therefore, the faults of both algorithms are conquered and the aim of combinational optimization is achieved. At last, the validity and feasibility is demonstrated by means of simulation experiment of traveling salesman problem. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3290 
A new hyhbrid coefficient of conjugate gradient method Nur Syarafina Mohamed; Mustafa Mamat; Mohd Rivaie; Shazlyn Milleana Shaharudin
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 3: June 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i3.pp1454-1463

Abstract

Hybridization is one of the popular approaches in modifying the conjugate gradient method. In this paper, a new hybrid conjugate gradient is suggested and analyzed in which the parameter is evaluated as a convex combination of  while using exact line search. The proposed method is shown to possess both sufficient descent and global convergence properties. Numerical performances show that the proposed method is promising and has overpowered other hybrid conjugate gradient methods in its number of iterations and central processing unit per time. 
Conjunctive Fuzzy Keyword Search over Encrypted Data in Cloud Computing Jianhua Yu
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 Cloud Computing becomes prevalent, more and more sensitive information are centralized into the cloud.  In this paper, for the first time we formalize and solve the problem of efficient conjunctive fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Conjunctive fuzzy keyword search greatly enhances system usability by returning the matching files when users' searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity. Through rigorous security analysis, we show that our proposed solution is privacy-preserving. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4357 
Loan Default Prediction on Large Imbalanced Data Using Random Forests Lifeng Zhou; Hong Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 6: October 2012
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In this paper, we propose an improved random forest algorithm which allocates weights to decision trees in the forest during tree aggregation for prediction and their weights are easily calculated based on out-of-bag errors in training. We compare the performance of our proposed algorithm and the original one on loan default prediction datasets. We also use these two algorithms to create two kinds of balanced random forests to deal with imbalanced data problem. Experiments results show that our proposed algorithm beats the original random forest in terms of both balanced and overall accuracy metrics. Experiments also show that parallel random forests can greatly improve random forests’ efficiency during the learning process.DOI: http://dx.doi.org/10.11591/telkomnika.v10i6.1323
Development of an Automated Three-Phase Distribution Box System N M Nor; N S Zemri; S A Daud; T Ibrahim; H Daud
Indonesian Journal of Electrical Engineering and Computer Science Vol 6, No 2: May 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v6.i2.pp233-240

Abstract

Most electrical appliances require continuous power supply. For domestic use, crucial appliances such as refrigerator, aquarium and alarm system highly depend upon the continuity of power supply. However, if they are left without electricity due to power outage or blackouts caused by internal or external disturbance, the discontinuity of power supply could be a critical issue to some involving party. Blackouts may be due to short circuit, fault or the overloading of electricity mains. During power outage, Residual Current Device (RCD) detects fault currents from live to the neutral wire within circuit and will trip to prevent shock. This circumstance can increase safety when a house is left unoccupied. Be that as it may, the power will remain switched off until manually reset by man. Thus, this paper presented a new concept of Three-Phase distribution box system in order to overcome tripping problem. This system will be able to identify and isolate the fault using measurement of current flow into each Miniature Circuit Breaker (MCB) of appliances and current flowing out from each of the load. The measured current value will be compared and the maximum allowable difference is 30mA. If the current difference exceeds the maximum limit then the fault MCB will be detected. Hence RCD will be automatically close the circuit after determining the fault location via the motor operation to make sure of power stability and evade any property loss.
Developing Corpora using Wikipedia and Word2vec for Word Sense Disambiguation Farza Nurifan; Riyanarto Sarno; Cahyaningtyas Sekar Wahyuni
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: December 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i3.pp1239-1246

Abstract

Word Sense Disambiguation (WSD) is one of the most difficult problems in the artificial intelligence field or well known as AI-hard or AI-complete. A lot of problems can be solved using word sense disambiguation approaches like sentiment analysis, machine translation, search engine relevance, coherence, anaphora resolution, and inference. In this paper, we do research to solve WSD problem with two small corpora. We propose the use of Word2vec and Wikipedia to develop the corpora. After developing the corpora, we measure the sentence similarity with the corpora using cosine similarity to determine the meaning of the ambiguous word. Lastly, to improve accuracy, we use Lesk algorithms and Wu Palmer similarity to deal with problems when there is no word from a sentence in the corpora (we call it as semantic similarity). The results of our research show an 86.94% accuracy rate and the semantic similarity improve the accuracy rate by 12.96% in determining the meaning of ambiguous words.

Filter by Year

2012 2026


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