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 66 Documents
 3   4   5   6   7 
Search results for , issue "Vol 35, No 2: August 2024" : 66 Documents clear
Edge-platforms based decision-support approach for solar panels inspection with YOLOv8 deep neural-network El Karch, Hajar; Mezouari, Abdelkader; Natij, Youssef; El Gouri, Rachid
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp853-866

Abstract

This paper presents an innovative AI-based method for autonomous inspection, designed to enhance energy production efficiency by optimizing cleaning strategies for soiled photovoltaic panels, using advanced artificial intelligence algorithms to analyze panel conditions and environmental factors in real-time, allowing for targeted cleaning interventions. Based on the advanced YOLOv8 deep learning algorithm and computer vision approach, the proposed method offers distinct advantages in real-time detection and classification of various types of soiling and dust accumulation compared on solar panels to traditional methods, and underwent satisfactory testing across diverse scenarios. The NVIDIA Jetson Nano, the Raspberry Pi4 embedded devices, and the Raspberry Pi4 combined with NCS2 accelerator are used for implementing our approach. A comparison aims to provide a detailed exploration of the most suitable embedded platform for deploying our advanced system was discussed. This comparison considers processing speed and accuracy, energy consumption, and overall performance in executing the computationally intensive tasks. The results demonstrate that our model achieves high accuracy in detecting soiling and enhancing the model's detection speed. With an average precision of 99.5%, this approach ensures accurate fault identification, underscoring the effectiveness of computer vision using deep learning algorithms for detection tasks across a wide range of scenarios.
Image classification based on few-shot learning algorithms: a review Qi, Qiao; Ahmad, Azlin; Ke, Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp933-943

Abstract

Image classification is a critical task in the field of computer vision, and its importance has significantly increased over the past few years. Machine learning and deep learning techniques have demonstrated immense potential in this field. However, traditional image classification models require a vast amount of training data, which can be challenging and expensive to obtain. To overcome this limitation, researchers are turning to few-shot learning, which aims to classify images with limited training samples. This paper presents a detailed analysis of the field of image classification using few-shot learning. First, it investigates the use of data augmentation, transfer learning, and meta-learning methods in this field. Then, it introduces several commonly used datasets and evaluation metrics in few-shot classification, compares several classical few-shot classification methods, and summarizes the experimental results obtained from public datasets. Finally, this paper analyzes the current challenges in few-shot image classification and suggests potential future directions.
Advancing cryptography: a novel hybrid cipher design merging Feistel and SPN structures Venkataramanna, Ramya Kothur; Hosur Sriram, Manjunatha Reddy; Reddy, Bharathi Chowda
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp751-760

Abstract

In the dynamic field of cryptography, lightweight ciphers play a pivotal role in overcoming resource constraints in modern applications. This paper introduces a lightweight cryptographic algorithm by seamlessly merging the proven characteristics of the Feistel cipher CLEFIA with the advanced substitution-permutation network (SPN) framework of RECTANGLE for key generation. The algorithm incorporates a specially optimized feather S-box, balancing efficiency and security in both CLEFIA and RECTANGLE components. The RECTANGLE key generation, vital for the proposed lightweight technique, enhances overall cryptographic security and efficiency. Meticulous consideration of resource limitations maintains the algorithm's lightweight nature, making it well-suited for applications with restricted computational resources. To validate the efficacy of the lightweight algorithm, extensive evaluation on encrypted data is conducted using National Institute of Standards and Technology (NIST) tools, known for assessing cryptographic algorithm quality. Results reveal a high degree of randomness, indicative of robust resistance against cryptographic attacks. This manuscript provides a comprehensive examination of the lightweight algorithm, emphasizing key attributes, security enhancements, and successful integration of the optimized feather S-box. Rigorous testing, particularly NIST tool-based randomness analysis, offers empirical evidence of the algorithm's resilience against attacks, establishing its suitability for secure data encryption in resource-limited environments. 
The De Bruijn graph of non-sequential pattern repetitions in DNA strings Fong, Wan Heng; Ildrussi, Ahmed; Yosman, Ahmad Firdaus
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp787-794

Abstract

In molecular biology, constructing a genome based on substantially many reads from multitudes of deoxyribonucleic acid (DNA) strings has become an insurmountable task; one which has been continuously addressed by the introduction of various assembly algorithms based on three steps called the overlap-layout-consensus strategy. In the overlap step, the De Bruijn graph is one of many graphs that illustrate the data of all the assembly algorithms. In this article, by using definitions and methods of mathematical induction, some properties of the De Bruijn graph of one time and two times non-sequential repetition of patterns in a DNA string are presented. Examples of these De Bruijn graphs are also given. From there, a generalisation of said properties for m times non-sequential pattern repetition in a DNA string is acquired by means of mathematical induction, as well. The theoretical work in this research is invaluable to develop algorithms that increase the computational efficiency of assembly algorithms.
Design of a chatbot in a mobile application for managing payments and controlling activities in a fast school organization Medina, Gustavo Teves; Cano Lengua, Miguel Angel; Medrano, Hugo Villaverde
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp1271-1286

Abstract

The fast school (FS) educational organization, like many contemporary educational institutions, faces challenges in efficient payment management and rigorous control of activities. Technology, particularly through mobile applications, has shown to be a potential solution to these problems, allowing institutions to stay at the forefront and provide optimized services to their educational community. Therefore, this research work focuses on how a chatbot, integrated into a mobile application, can improve payment management and control of activities in the FS educational organization. Through a detailed study on current trends in educational technology, the design and development of a chatbot adapted to the specific needs of the organization is presented. This chatbot not only facilitates payment processes, offering immediate responses and managing transactions, but also allows for more efficient control of academic and extracurricular activities, improving the experience of its users. In conclusion, the integration of chatbots in mobile applications is presented as a viable and promising solution to face and overcome management challenges in modern educational environments, providing adaptive and user-centered tools that enhance the operational efficiency of institutions. This work is developed with the Scrum methodology and presents a security gateway validated by a digital token.
Improved moth search algorithm with mutation operator for numerical optimization problems Ghaleb, Sanaa A. A.; Mohamad, Mumtazimah; Mohammed Ghanem, Waheed Ali Hussein; Alhadi, Arifah Che; Nasser, Abdullah B.; Aldowah, Hanan
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp1022-1031

Abstract

The moth search algorithm (MSA) is a meta-heuristic optimization technique inspired by moth behavior, has shown remarkable efficacy in solving optimization challenges. However, its poor exploration capability results in an imbalance between exploitation and exploration. To address this issue, this research introduces a new mutation operator to enhance exploration by increasing population diversity. The proposed enhanced moth search algorithm (EMSA) aims to expedite convergence and improve overall robustness by exploring new solutions more effectively. Evaluation on ten benchmark functions demonstrates EMSA's superior exploration capabilities, efficiently tackling optimization problems and yielding more optimal solutions within the search space. Compared to conventional MSA and other established algorithms, EMSA delivers well-balanced results, showcasing its effectiveness in optimizing the search space. In the future, the EMSA could potentially find applications in addressing real-world engineering optimization challenges.

Page 7 of 7 | Total Record : 66

 3   4   5   6   7 

Filter by Year

2024 2024


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