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,138 Documents
Optimization of speed droop governor operation at the gas turbine cogeneration unit Benriwati Maharmi; Ilham Cholid; Syafii Syafii; Engla Harda Arya
Indonesian Journal of Electrical Engineering and Computer Science Vol 33, No 1: January 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v33.i1.pp20-30

Abstract

Variations in customer demand for active power can impact frequency levels, potentially leading to instability within the electrical power system. To uphold system stability, it becomes essential to control the provision of active power to ensure the frequency remains consistent. This research aims to develop a simulation model for optimizing of the operation of the speed droop governor at the gas turbine cogeneration unit. This research used the quantitative method and descriptive statistical analysis techniques. The simulation model was employed as a simulator for operating the speed droop governor for frequency regulation in the electrical system. The gas turbine cogeneration unit 2 operational data of the speed droop values was used to analyze the influence of the generating unit’s response to changes in frequency. The analysis and simulation results revealed the gas turbine cogeneration unit 2 speed droop value of 4%, which was considered ideal for maintaining the stability of the 60 Hz nominal frequency required by customers.
Identification of soluble solid content and total acid content using real-time visual inspection system Moorthy, C. H. V. K. N. S. N.; Tripathi, Mukesh Kumar; Hudagi, Manjunath R.; Hadimani, Lingaraj A.; Chavan, Gayatri Sanjay; Angadi, Sanjeevkumar
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 1: July 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i1.pp238-246

Abstract

This paper presents the framework for identifying materials using a fused descriptor-based approach, leverage computer vision techniques. The system is structured into three phases: derivation, extraction, and portrayal. Initially, the system employs K-means gathering techniques for establishing derivation. Following derivation, the system utilizes variety, texture, and shape-based feature extraction methods to extract relevant features from the soluble solid content and total acid content using real-time visual inspection system. A “consolidating” fusion feature is explored in the final phase using classification algorithms like C4.5, support vector machines (SVM), and k-nearest neighbors (KNN). The performance evaluation of the recognition system demonstrates promising results, with accuracy rates of 97.89%, 94.60%, and 90.25% achieved by using C4.5, SVM, and KNN separately. This indicates that the proposed fusion strategy effectively supports accurately recognizing materials using a fused descriptor-based approach.
Encrypted image processing using compression and reversible data hiding Yasmina Zine; Meriem Boumehed; Naima Hadj Said
Indonesian Journal of Electrical Engineering and Computer Science Vol 34, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v34.i3.pp1593-1602

Abstract

Reversible data hiding within encrypted images reversible data hiding in encrypted images (RDH-EI) is a highly effective technique for image processing in the field of encryption. This paper, propose a RDH-EI technique, which utilizes bit-plane compression and various image scanning directions to generate vacant space for data embedding, referred to as vacating room. Initially, the prediction error of the pre-processed image is computed. Subsequently, each bit-plane image is converted into a bit-stream by following the pixel scan order employed before compression. The compressed image is then encrypted employing a stream cipher. Through the process of substitution, the secret data and additional information are incorporated into the acquired image without any knowledge of the original content or the encrypted key. Finally, the generated image is transmitted or archived. The experiments provide evidence that the proposed method surpasses the most advanced methods currently available.
Advances of vehicular ad hoc network using machine learning approach See Thian Meng; Sumendra Yogarayan; Siti Fatimah Abdul Razak; Subarmaniam Kannan; Afizan Azman
Indonesian Journal of Electrical Engineering and Computer Science Vol 32, No 3: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v32.i3.pp1426-1433

Abstract

Vehicular Ad hoc Networks (VANETs) play a crucial role in Intelligent Transportation Systems (ITS), enabling seamless communication between vehicles and other entities. VANETs provide a wide range of services, allowing vehicles to communicate with each other and with roadside infrastructure. With the increasing amount of data generated by VANETs, machine learning approaches have emerged as valuable tools to address complex challenges in this domain. This paper presents a comprehensive literature review on the application of machine learning in VANETs. The paper discusses the potential challenges and future research directions in the field, emphasizing the need for more accessible machine learning solutions for VANETs. This review emphasizes the significant role of machine learning approach in advancing the capabilities of VANETs and shaping the future of intelligent transportation systems.
Rhinitis phototherapy prototype with timer based on light energy Erika Loniza; Mita Junita; Yessi Jusman; Siti Nurul Aqmariah Mohd Kanafiah; Kurnia Chairunnisa
Indonesian Journal of Electrical Engineering and Computer Science Vol 34, No 2: May 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v34.i2.pp861-869

Abstract

The set of timers in using phototherapy is major problem which has to be resolved to get a good performance of rhinitis phototherapy. This research aims to develop a prototype of phototherapy for allergic rhinitis, incorporating a timer based on light energy. The prototype utilizes a laser diode as a visible light source, specifically with a wavelength of 650 nm. The recommended safe and effective dose of light energy ranges from 1 to 10 Joules, which has been converted into minutes. Measurement tests indicate an average wavelength of 652.40 nm for the right laser, with a measurement uncertainty of ±0.11, and 653.23 nm for the left laser, with a measurement uncertainty of ±0.05. The laser diode source has an average voltage of 1.91 volts and an average current of 1.89 milliamperes, with a measurement uncertainty of ±0.00 and ±0.01, respectively. Additionally, the average discrepancy in the timer is 0.082 minutes for the 10-minute setting and 0.082 minutes for the 20-minute setting. These results confirm the effectiveness and suitability of the developed tool for practical use. The proposed method was useful for rhinitis therapy by using light energy.
A hybrid deep learning approach for enhanced network intrusion detection K. Prabu; P. Sudhakar
Indonesian Journal of Electrical Engineering and Computer Science Vol 33, No 3: March 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v33.i3.pp1915-1923

Abstract

The contemporary era places paramount importance on network security and cloud environments, driven by increased data transmission demands, the flexibility of cloud services, and the prevalence of global resources. Addressing the escalating threat of computer malware, the development of efficient intrusion detection systems (IDS) is imperative. This research focuses on the challenges posed by imbalanced datasets and the necessity for unsupervised learning to enhance network security. The proposed hybrid deep learning method utilizes raw data from the CSE-CIC-IDS-2018 dataset, integrating imbalanced and unsupervised learning techniques. After preprocessing and normalization, feature extraction through principal component analysis (PCA) reduces dimensionality from seventy-eight fields to ten essential features. Clustering, employing the density-based spatial clustering of applications with noise (DBSCAN) algorithm optimized with particle swarm optimization (PSO), is applied to the extracted features, distinguishing between attack and non-attack packets. Addressing dataset imbalances, imbalanced learning techniques are employed, and unsupervised learning is exemplified through the AutoEncoder (AE) algorithm. The attack cluster’s data is input into AE, a deep learning-based approach, yielding outputs for attack classification. The proposed technique (PCA+DBSCANPSO+AE) achieves an impressive 99.19% accuracy in intrusion detection, surpassing contemporary methodologies and five existing techniques. This research not only enhances accuracy but also addresses imbalanced learning challenges, utilizing the power of unsupervised learning for robust network security.
The object detection model uses combined extraction with KNN and RF classification Kurniati, Florentina Tatrin; Manongga, Daniel HF; Sembiring, Irwan; Wijono, Sutarto; Huizen, Roy Rudolf
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 1: July 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i1.pp436-445

Abstract

Object detection plays an important role in various fields. Developing detection models for 2D objects that experience rotation and texture variations is a challenge. In this research, the initial stage of the proposed model integrates the gray-level co-occurrence matrix (GLCM) and local binary patterns (LBP) texture feature extraction to obtain feature vectors. The next stage is classifying features using k-nearest neighbors (KNN) and random forest (RF), as well as voting ensemble (VE). System testing used a dataset of 4,437 2D images, the results for KNN accuracy were 92.7% and F1-score 92.5%, while RF performance was lower. Although GLCM features improve performance on both algorithms, KNN is more consistent. The VE approach provides the best performance with an accuracy of 93.9% and an F1-score of 93.8%, this shows the effectiveness of the ensemble technique in increasing object detection accuracy. This study contributes to the field of object detection with a new approach combining GLCM and LBP as feature vectors as well as VE for classification.
Design of battery state of charge monitoring and control system using coulomb counting method based Syafii Syafii; Irfan El Fakhri; Thoriq Kurnia Agung; Farah Azizah
Indonesian Journal of Electrical Engineering and Computer Science Vol 33, No 2: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v33.i2.pp736-745

Abstract

Lead-acid batteries are commonly used in photovoltaic systems to store solar energy for continuous use. However, lead-acid batteries have a relatively short lifespan due to frequent over-charging and over-discharging. A battery management system (BMS) is essential for accurately predicting the battery state of charge (SoC) value in order to extend the battery lifespan. In this research, a BMS is developed using the coulomb counting method to estimate the SoC value of a lead-acid battery. The coulomb counting algorithm provides a reliable estimation of the battery’s SoC value by calculating the incoming and outgoing currents. The BMS also uses two normally closed relays to prevent overcharging and over-discharging. The first relay turns on when the SoC reaches 100% full charge and turns off when the SoC decreases to 70%. The second relay turns on when the SoC reaches 20%. The BMS was tested using Blynk, a cloud-based internet of things (IoT) platform. The results showed that the BMS successfully provided monitoring and reliable control of the lead-acid battery, with a low margin of error. This demonstrates that the developed BMS can be practically implemented in photovoltaic (PV)-battery systems to extend the battery lifespan and improve the overall performance of the system.
Energy aware reliable routing model for sensor network enabled internet of things environment Padmini Mysuru Srikantha; Sampath Kuzhalvaimozhi; Samaresh Mallikarjun Silli; Suraj Prakash; Tanay Verma; Varun Manjunatha
Indonesian Journal of Electrical Engineering and Computer Science Vol 32, No 3: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v32.i3.pp1678-1685

Abstract

Wireless sensor networks (WSNs), which are facilitated by the internet of things (IoTs), can be difficult to improve the lifespan of the network target area. Although the hotspot issue (i.e., the cluster head closest to the base station fails quickly) is mitigated by the clustered-based routing technique, it still has an important effect on the network's lifespan and target area. However, improper distribution of load between cluster heads has been shown to negatively impact network lifespan efficiency, so even though unequal clusters have been utilized successfully to tackle the hotspot issue, further work is needed. This study provides an energy-aware reliable routing (EARR) model for resolving the hotspot as well as load balancing issues simultaneously. To extend the lifespan of the network, the EARR model effectively minimizes energy consumption by the cluster heads using enhanced multi-objective optimization parameters. Further, EARR provides improved routing optimization metrics to improve data delivery with energy efficiency, less delay, and packet loss. The results of the experiments demonstrate that the EARR model provides excellent throughput and lifespan efficiency with low delay and communication overhead.
Dual-blend insight recommendation system for e-commerce recommendations and enhance personalization Sinzy Silvester; Shaji Kurain
Indonesian Journal of Electrical Engineering and Computer Science Vol 34, No 2: May 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v34.i2.pp1181-1191

Abstract

E-commerce, short for electronic commerce, refers to the buying and selling of goods and services over the internet. This digital transaction model has revolutionized the way businesses operate and consumers shop. In response to the burgeoning complexity of e-commerce datasets, this work addresses the need for advanced recommendation systems. This work introduces the dual-blend insight recommendation system (DIRS) model for personalized e-commerce recommendation system. The DIRS model involves dataset loading, preprocessing, and feature extraction, enabling training with recurrent neural network (RNN) and Bayesian personalized ranking (BPR) models. Recommendations are generated based on user-defined functions, i.e., location and session, and evaluation metrics such as hit rate (HR) and mean reciprocal rate (MRR) highlight DIRS’s superior performance. The model is evaluated using the Tmall dataset. Results reveal DIRS consistently outperforms alternative algorithms, showcasing its effectiveness in 10k and 20k recommendation sets. This study provides valuable insights into optimizing e-commerce recommendations, emphasizing DIRS as a powerful model for enhancing user experience and engagement.

Filter by Year

2012 2026


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