cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Tole Sutikno
Contact Email
ijece@iaesjournal.com
Phone
-
Journal Mail Official
ijece@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Electrical and Computer Engineering
Published by Institute of Advanced Engineering and Science
ISSN : 20888708     EISSN : 27222578     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Electrical & Electronics Engineering
International Journal of Electrical and Computer Engineering (IJECE, ISSN: 2088-8708, a SCOPUS indexed Journal, SNIP: 1.001; SJR: 0.296; CiteScore: 0.99; SJR & CiteScore Q2 on both of the Electrical & Electronics Engineering, and Computer Science) is the official publication of the Institute of Advanced Engineering and Science (IAES). The journal is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the global world.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 88 Documents
 2   3   4   5   6 
Search results for , issue "Vol 15, No 6: December 2025" : 88 Documents clear
Plant disease detection and classification: based on machine learning and Eig(Hess)-co-occurrence histograms of oriented gradients Mehdi, El Aroussi El; Latifa, Barakat; Hassan, Silkan
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5336-5346

Abstract

Agricultural districts provide high-quality food and contribute substantially to economic growth and population support. However, plant diseases can directly reduce food production and threaten species diversity. The use of precise, automated detection techniques for early disease identification can improve food quality and mitigate economic losses. Over the past decade, numerous methods have been proposed for plant disease classification, and in recent years the focus has shifted toward deep learning approaches because of their outstanding performance. In this study, we employ the Eig(Hess)-co-occurrence histograms of oriented gradients (CoHOG) descriptor alongside pre-trained machine-learning models to accurately identify various plant diseases. We apply principal component analysis (PCA) for dimensionality reduction, thereby enhancing computational efficiency and overall model performance. Our experiments were conducted on the popular PlantVillage database, which contains 54,305 images across 38 disease classes. We evaluate model performance using classification accuracy, sensitivity, specificity, and F1-score, and we perform a comparative analysis against state-of-the-art methods. The findings indicate that the approach we proposed achieves up to 99.83% accuracy, outperforming existing models. Additionally, we test the robustness of our method under various conditions to highlight its potential for real-world agricultural applications.
Detecting lung nodules in computed tomography images based on deep learning Hien, Lam Thanh; Tu, Le Anh; Hieu, Pham Trung; Duc, Pham Minh; Nang, Nguyen Van; Toan, Do Nang
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5604-5615

Abstract

Lung cancer is currently recognized as one of the most dangerous cancers, with high mortality rate. In order to deal with lung cancer, an important task is to detect lung nodules early to improve patient survival rates, and computed tomography (CT) scans are crucial data for this. In this research, we propose a deep learning-based method for detecting lung nodules in the CT images with the goal of increasing the likelihood of nodule appearance in the input data of the network, making it easier for the model to focus on relevant areas while reducing noise from areas unrelated to the result. Specifically, we propose a simple lung region segmentation process and optimize the hyperparameters of the faster region-based convolutional neural networks (faster R-CNN) model based on the analysis of nodule characteristics in CT image data. In our experiments, to evaluate the effectiveness of our proposals, we conducted tests on the standard LUNA16 dataset with different backbone configurations for the model, namely ResNet50, ResNet50v2, and MobileNet. The best results achieved were 0.86 mAP50 and 0.91 Recall for the Resnet50, and 0.84 mAP50 and 0.94 Recall for the ResNet50v2. These impressive outcomes underscore the success of our method and establish a robust basis for future studies to further integrate AI into healthcare solutions.
Simulation and experimental validation of modular multilevel converters capable of producing arbitrary voltage levels using the space vector modulation method Cuong, Tran Hung; Hieu, Pham Chi; Phuong, Pham Viet
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5234-5248

Abstract

Modular multilevel converters (MMC) used forDC-AC energy conversion are becoming popular to connect distributed energy systems to the power systems. There are many modulation methods that can be applied to the MMC. The space vector modulation (SVM) method can produce a maximum number of levels, i.e., 2N+1, in which N is the number of sub- modules (SMs) per branch of the MMC. The SVM method can generate rules to apply to MMCs with any number of levels. The goal of this proposal is to easily expand the number of voltage levels of the MMC when necessary while still ensuring the quality requirements of the system. The proposed SVM method only selects the three nearest vectors to generate optimal transition states, therefore making the computations simpler and more efficient. This has reduced the computational load when compared to the previously applied SVM methods. This advantage ensures an optimal switching process and harmonic quality which will significantly improve the effectiveness of the proposed method was demonstrated through simulations on MATLAB/Simulink and experimental tests on 13-levels voltage MMC converter system using a 309 field-programmable gate array (FPGA) kit.
Fractional fuzzy based static var compensator control for damping enhancement of inter-area oscillations Zabaiou, Tarik; Benayad, Khadidja
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5130-5143

Abstract

Over time, the insertion of flexible alternating current transmission system (FACTS) components in the power grid became primordial to maintain the overall system stability. This paper proposed an innovative approach called hybrid auxiliary damping control based wide-area measurements for the static var compensator (SVC). The presented controller is a fractional-order fuzzy proportional integral derivative (FOFPID). Its principal task is to damp inter-area low frequency oscillations (LFOs) and to improve the power system stability over the transient dynamics. Then, a metaheuristic grey wolf optimization (GWO) method is applied to adjust the controller’s gains. The SVC-based FOFPID control scheme is implemented in a two-area four- machine test system employing the rotor speed deviations of generators as input signal. A comparative analysis of the elaborated controller with the integer PID and the fractional-order PID (FOPID) is performed to emphasize its effectiveness under a three-phase perturbation. Furthermore, a load variation effect test is completed to attest the control strategy robustness. Based on dynamic simulation results and performance indices, the suggested controller shows its robustness and provides increased efficiency for inter- area oscillations damping.
Breast cancer detection using ensemble methods Ghazy, Alaa Mohamed; Nafea, Hala Bahy; Zaki, Fayez Wanis; Amer, Hanan Mohamed
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5633-5646

Abstract

Breast cancer (BC) is one of the most common cancers among women. This study's framework is divided into three phases. Firstly, a majority hard voting approach is used to apply an ensemble classification mechanism as a decision fusion technique on the level of convolutional neural networks (CNNs). Five pre-trained CNNs—visual geometry group 19 (VGG19), densely connected convolutional network 201 (DenseNet201), residual network 50 (ResNet50), mobile network version 2 (MobileNetV2), and inception version 3 (InceptionV3)—are evaluated, using a data splitting test ratio represents 30% of the total dataset. Secondly, the classification results of the five CNNs are compared to get the best-performance model. Then, seven state of art machine classifiers—decision tree (DT), histogram-based gradient boosting classifier (HGB), support vector machine (SVM), random forest (RF), logistic regression (LR), gradient boosting (GB), and extreme gradient boosting (XGB)—are used to improve system performance on the feature vector that was taken from this CNN model. Thirdly, to improve robustness, a majority hard voting technique is used at the external classifier level using the highest four classifiers selected based on their accuracy. Several experiments were conducted in this study, and the results showed that ResNet50 produced the best results in terms of precision and accuracy. The majority voting mechanism improves the system’s accuracy to 99.85% through CNNs and to 100% through traditional classifiers.
Identification types of plant using convolutional neural network Notonegoro, Radityo Hendratmojo Jati; Hustinawaty, Hustinawaty
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5827-5836

Abstract

Artificial intelligence can be implemented in fields that related to environmental education by providing knowledge for taxonomy which recognize and identify plant species based on its features. The variety of plant species that inhabit in a certain area allows many plant species to be found that look similar so that difficult to distinguish and recognize a particular plant. Convolutional neural network (CNN) often used in object detection, you only look once (YOLO), one of CNN’s object detections, could identify object in real time and obtained good performance and accuracy in several researched. However, no studies have ever identified a plant from its flowers, leaves, and fruits. Therefore, the main object of this paper is identified types of plant with CNN (YOLOv8). The YOLOv8 model with 0.01 learning rate, 32 batch size, stochastic gradient descent (SGD) optimizer obtained highest precision of 69.62% and F1 score of 61.22%, recall of 54.73%, mAP50 and mAP50 – 90 on the training data of 57.61% and 42.49%.
The evolution of routing in VANET: an analysis of solutions based on artificial intelligence and software-defined networks Sánchez, Lewys Correa; Parra, Octavio José Salcedo; Gómez, Jorge
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5388-5400

Abstract

This study explored the evolution of vehicular ad hoc networks (VANET) and focused on the challenges and opportunities for routing in these dynamic environments. Despite advancements in traditional protocols, a significant gap persists in the ability to adapt to highly mobile environments with variable traffic, which limits routing efficiency and quality of service. Emerging technologies, such as artificial intelligence (AI) and software- defined networks (SDN), are discussed that have the potential to revolutionize the management of VANET. Machine learning can be used to predict traffic, optimize routes, and adapt routing protocols in real-time. Furthermore, SDN can simplify routing management and enable greater flexibility in network configurations. A comprehensive overview of the convergence of AI and SDN is presented, and the potential complementarities between these technologies to address routing challenges in VANET are explored. Finally, the implications of efficient routing in VANET for road safety, traffic management, and the development of new applications are discussed, and future research lines are identified to address challenges such as scalability, data security, and computational efficiency in vehicular environments.
Optimized passive and active shielding of magnetic induction generated by ultra-high-voltage overhead power lines Houicher, Salah-Eddine; Djekidel, Rabah; Bessidek, Sid Ahmed
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5144-5161

Abstract

This paper presents computational modeling to assess and limit the magnetic induction levels emitted by an extra-high-voltage (EHV) overhead transmission line of 750 kV using the fundamental principle of Biot-Savart law in magnetostatics. An optimization technique based on the grey wolf optimizer (GWO) algorithm is employed to determine the appropriate location of the passive and active loop conductors, and the associated parameters to shielding to achieve better compensation of magnetic induction in an interest zone. The resulting magnetic induction of the ultra high voltage (UHV) overhead power line exhibits a crest value of 27.78 μT at the middle of the right-of-way, which can be considered unacceptable by strict protection standards. Generally, the magnetic compensation loops optimally located under the phase conductors of the power transmission system reduce the magnetic induction levels along the transmission line corridor. The passive loop attenuates the maximum magnetic induction by a rate of 29.7%. Therefore, the performance of the active loop is better; it provides a greater reduction with a rate reaching 53.24%. The simulation results were tested with those derived by the elliptical polarization process. An excellent concordance was found, which made it possible to ensure the adopted method.
Optimization of a level shifter integrated with a gate driver using TSMC 130 nm CMOS technology Guissi, Hicham; Slaoui, Khadija
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5223-5233

Abstract

Modern electronic systems increasingly operate across multiple voltage domains, necessitating robust and efficient level shifter (LS) circuits to ensure reliable inter-domain communication. In low-power digital applications, minimizing propagation delay and transition time is critical for achieving high-speed and energy-efficient operation. This work presents a high-performance level shifter optimized for integration within Li-ion battery charger systems. The proposed design achieves a substantial reduction in propagation delays from 0.15 to 0.09062 ns while preserving signal integrity. When integrated with a gate driver, the overall structure exhibits a propagation delay of 0.20468 ns and a transition time of 0.014 ns, marking a significant improvement from the previous 0.036 ns. Furthermore, the proposed circuit occupies only 0.00039 mm² of silicon area, representing a 92% reduction compared to prior implementations (0.05 mm²). The complete design was implemented using Taiwan semiconductor manufacturing company (TSMC) 130 nm complementary metal–oxide– semiconductor (CMOS) technology, with both schematic simulation and layout carried out in the Cadence Virtuoso design environment. These results underscore the potential of the proposed solution for compact and high-efficiency system-on-chip (SoC) battery management applications.
Memoryless state-recovery cryptanalysis method for lightweight stream cipher – A5/1 Audumbar, Khedkar Aboli; Khot, Uday Pandit; Hogade, Balaji G.
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5453-5465

Abstract

Cryptology refers to the discipline concerned with securing communication and data in transit by transforming it into an unintelligible form, thereby preventing interpretation by unauthorized entities. Cryptanalysis is the study and practice of analyzing cryptographic systems with the aim of uncovering their weaknesses, finding vulnerabilities and obtaining unauthorized access to encrypted data. A5/1 is a lightweight stream cipher used to protect GSM communications. There are two memoryless cryptanalysis techniques used for this cipher which are Golic’s Guess-and-determine attack and Zhang’s Near Collision attack. In this paper a new guessing technique called move guessing technique used to construct linear equation filter along with Golic’s guess and determine technique is studied. Two modifications in move guessing technique are proposed for recovery of internal states S0 and S1. Further, a novel algorithm is proposed to select the modification to get minimum time complexity for recovery of internal states S0 and S1. The proposed algorithm gives minimum time complexity of 229.3138 at t = 14 for recovery of S0 state and 243.246 for recovery of S1 at t = 22.

Page 4 of 9 | Total Record : 88

 2   3   4   5   6 

Filter by Year

2025 2025


Reset
Filter By Issues
All Issue Vol 16, No 1: February 2026 Vol 15, No 6: December 2025 Vol 15, No 5: October 2025 Vol 15, No 4: August 2025 Vol 15, No 3: June 2025 Vol 15, No 2: April 2025 Vol 15, No 1: February 2025 Vol 14, No 6: December 2024 Vol 14, No 5: October 2024 Vol 14, No 4: August 2024 Vol 14, No 3: June 2024 Vol 14, No 2: April 2024 Vol 14, No 1: February 2024 Vol 13, No 6: December 2023 Vol 13, No 5: October 2023 Vol 13, No 4: August 2023 Vol 13, No 3: June 2023 Vol 13, No 2: April 2023 Vol 13, No 1: February 2023 Vol 12, No 6: December 2022 Vol 12, No 5: October 2022 Vol 12, No 4: August 2022 Vol 12, No 3: June 2022 Vol 12, No 2: April 2022 Vol 12, No 1: February 2022 Vol 11, No 6: December 2021 Vol 11, No 5: October 2021 Vol 11, No 4: August 2021 Vol 11, No 3: June 2021 Vol 11, No 2: April 2021 Vol 11, No 1: February 2021 Vol 10, No 6: December 2020 Vol 10, No 5: October 2020 Vol 10, No 4: August 2020 Vol 10, No 3: June 2020 Vol 10, No 2: April 2020 Vol 10, No 1: February 2020 Vol 9, No 6: December 2019 Vol 9, No 5: October 2019 Vol 9, No 4: August 2019 Vol 9, No 3: June 2019 Vol 9, No 2: April 2019 Vol 9, No 1: February 2019 Vol 8, No 6: December 2018 Vol 8, No 5: October 2018 Vol 8, No 4: August 2018 Vol 8, No 3: June 2018 Vol 8, No 2: April 2018 Vol 8, No 1: February 2018 Vol 7, No 6: December 2017 Vol 7, No 5: October 2017 Vol 7, No 4: August 2017 Vol 7, No 3: June 2017 Vol 7, No 2: April 2017 Vol 7, No 1: February 2017 Vol 6, No 6: December 2016 Vol 6, No 5: October 2016 Vol 6, No 4: August 2016 Vol 6, No 3: June 2016 Vol 6, No 2: April 2016 Vol 6, No 1: February 2016 Vol 5, No 6: December 2015 Vol 5, No 5: October 2015 Vol 5, No 4: August 2015 Vol 5, No 3: June 2015 Vol 5, No 2: April 2015 Vol 5, No 1: February 2015 Vol 4, No 6: December 2014 Vol 4, No 5: October 2014 Vol 4, No 4: August 2014 Vol 4, No 3: June 2014 Vol 4, No 2: April 2014 Vol 4, No 1: February 2014 Vol 3, No 6: December 2013 Vol 3, No 5: October 2013 Vol 3, No 4: August 2013 Vol 3, No 3: June 2013 Vol 3, No 2: April 2013 Vol 3, No 1: February 2013 Vol 2, No 6: December 2012 Vol 2, No 5: October 2012 Vol 2, No 4: August 2012 Vol 2, No 3: June 2012 Vol 2, No 2: April 2012 Vol 2, No 1: February 2012 Vol 1, No 2: December 2011 Vol 1, No 1: September 2011 More Issue