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 9,138 Documents
 830   831   832   833   834 
Survey of IoT and AI applications: future challenges and opportunities in agriculture Elhattab, Kamal; Elatar, Said
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 3: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i3.pp1655-1663

Abstract

The internet of things (IoT) connects physical objects through sensors, software, and communication technologies, enabling efficient data collection and sharing. This interconnection promotes automation, real-time monitoring, and improved decision-making across various sectors. In agriculture, the integration of IoT with artificial intelligence (AI) is revolutionizing resource management by providing farmers with real-time information on crop health, climate conditions, and soil quality. This paper explores how IoT and AI are transforming traditional agricultural practices to enhance both efficiency and sustainability. Through an in-depth analysis of existing literature and practical applications in the sector, this study identifies significant advancements in crop management, reduction of losses, and resource optimization. Additionally, it highlights persistent challenges such as data security and interoperability. The aim is to address these challenges and propose innovative solutions to optimize agricultural processes. The results indicate that while IoT and AI offer substantial benefits, further advancements and solutions are needed to fully leverage these technologies for sustainable agricultural development.
Improved dung beetle optimization algorithm and finite element analysis for spindle optimization Haohao, Ma; As’arry, Azizan; Xuping, Wu; Shah Ismail, Mohd Idris; Ramli, Hafiz Rashidi; Saad, Mohd Sazli; Delgoshaei, Aidin
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 1: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i1.pp559-569

Abstract

This research introduces an integrated optimization methodology for spindle design, combining the improved dung beetle optimization (IDBO) algorithm with finite element analysis (FEA). The IDBO algorithm, enhanced in population initialization and convergence factors, minimizes total deformation and mass, addressing a multi-objective optimization model. The obtained optimal parameters guide the construction of a finite element model, considering additional factors like stiffness and maximum stress. The ensuing FEA produces a foundation for constructing a response surface, further optimized to refine the initial design. Through the combination of the IDBO algorithm and FEA method, the mass of the spindle is reduced from 46.582 kg obtained by the IDBO algorithm solution to 28.479 kg, a total reduction of 38.86%, while meeting design requirements such as maximum total deformation. Modal analysis up to the sixth order validates the design correctness reveals dynamic spindle behavior and guarantees the design requirements. The study demonstrates the reliability and effectiveness of the proposed IDBO algorithm in conjunction with FEA, providing a versatile framework for engineering optimization.
Deep learning utilization in Sundanese script recognition for cultural preservation Rosalina, Rosalina; Afriliana, Nunik; Utomo, Wiranto Herry; Sahuri, Genta
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 3: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i3.pp1759-1768

Abstract

This study addresses the challenge of preserving the Sundanese script, a traditional writing system of the Sundanese community in Indonesia, which is at risk of being forgotten due to technological advancements. To tackle this problem, we propose a deep learning approach using the YOLOv8 model for the automatic recognition of Sundanese characters. Our methodology includes creating a comprehensive dataset, applying augmentation techniques, and annotating the characters. The trained model achieved a precision of 95% after 150 epochs, demonstrating its effectiveness in recognizing Sundanese characters. While some variability in accuracy was observed for certain characters and real-time applications, the results indicate the feasibility and promise of using deep learning for Sundanese script recognition. This research highlights the potential of technological solutions to digitize and preserve the Sundanese script, ensuring its continued legacy and accessibility for future generations. Thus, we contribute to cultural preservation by providing a method to safeguard the Sundanese script against obsolescence.
Urban traffic congestion and its association with gas station density: insights from Google Maps data Hasabi, Rafif; Kurniawan, Robert; Sugiarto, Sugiarto; Tri Wahyuni, Ribut Nurul; Nurmawati, Erna
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1618-1626

Abstract

Analyzing air pollution caused by traffic conditions requires appropriate indicators. Currently, air pollution indicators are approximated by the number of vehicles and gas station density. However, this approach cannot provide information at a smaller level. This study aims to identify traffic congestion distribution from Google Maps data as an alternative air pollution indicator at smaller level using map digitization method. In addition, this study examines its relationship with the existing indicator called gas station density. The results show that the digitization method can map the traffic congestion distribution where most areas in West, North, and Central Jakarta are classified as high traffic. In addition, this study found that there is a strong and significant relationship of 0.58277 between traffic congestion distribution and gas station density. Thus, traffic congestion distribution and gas station density data from Google Maps can be used as an indicator of traffic-related air pollution, especially land transportation. Furthermore, this research is expected to serve as a basis for the government in determining mitigation strategies related to traffic congestion and the resulting emissions.
An innovative machine learning optimization-based data fusion strategy for distributed wireless sensor networks Sollapure, Naganna Shankar; Govindaswamy, Poornima
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 2: November 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i2.pp1012-1022

Abstract

Self-sufficient sensors scattered over different regions of the world comprise distributed wireless sensor networks (DWSNs), which track a range of environmental and physical factors such as pressure, temperature, vibration, sound, motion, and pollution. The use of data fusion becomes essential for combining information from various sensors and system performance. In this study, we suggested the multi-class support vector machine (SDF-MCSVM) with synthetic minority over-sampling techniques (SMOTE) data fusion for wireless sensor network (WSN) performance. The dataset includes 1,334 instances of hourly averaged answers for 12 variables from an AIR quality chemical multisensor device. To create a balanced dataset, the unbalanced data was first pre-processed using the SMOTE. The grey wolf optimization (GWO) approach is then used to reduce features in an effort to improve the efficacy and efficiency of feature selection procedures. This method is applied to classify the fused feature vectors into multiple categories at once to improve classification performance in WSNs and address unbalance datasets. The result shows the proposed method reaches high precision, accuracy, F1-score, recall, and specificity. The computational complexity and processing time were decreased in the study by using the proposed method. This is great potential for accurate and timely data fusion in dispersed WSNs with the successful integration of data fusion technologies.
Network load balancing and data categorization in cloud computing Komathi, Arunachalam; Kishore, Somala Rama; Velmurugan, Athiyoor Kannan; Pavithra, Maddipetlolu Rajendran; Selvaraj, Yoganand; Begum, Akbar Sumaiya; Muthukumaran, Dhakshnamoorthy
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i3.pp1942-1951

Abstract

Cloud computing (CC) is rising quickly as a successful model presenting an on-demand structure. In the CC, the present investigation shows that load-balancing methods established on meta-heuristics offer better solutions for appropriate scheduling and allotment of resources. Conversely, several traditional approaches believe in only some quality of service (QoS) metrics and reject several significant components. Network load balancing and data categorization (NBDC) is proposed. This approach aims to enhance load balancing in the cloud field. This approach consists of two phases: the support vector machine (SVM) algorithm-based data categorization and the ant colony optimization (ACO) algorithm for distributing the network load on the virtual machine (VM). The SVM algorithm performs several data formats, such as text, image, audio, and video, resultant data class that offers high categorization accuracy in the cloud. The ACO algorithm reaches an efficient load balancing based on the time of execution (TE), time of throughput (TT), time of overhead (TO), time of optimization, and migration count (MC). Simulation results related to the baseline approach demonstrate an enhanced system function in terms of service level agreement violation, throughput, execution time, energy utilization, and execution time.
Optimizing hyperspectral classification: spectral similarity-based band selection with chord k-means Chander Goud, Origanti Subhash; Sarma, Thogarachetti Hitendra; Bindu, Chigarapalle Shobha
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 2: November 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i2.pp1309-1318

Abstract

Band selection is crucial for achieving high classification accuracy in hyperspectral image (HSI) analysis, especially when ground truth data are limited. While unsupervised algorithms are preferred in such scenarios, the effectiveness of k-means clustering depends heavily on the choice of similarity measure. This article presents a novel two-level clustering approach for band selection. In the first level, bands are clustered using k-means with various similarity measures such as Euclidean distance, spectral angle mapper (SAM), and spectral information divergence (SID). Subsequently, the second level leverages the chord metric k-means clustering to form clusters of HSI scenes upon optimal band clusters from the first level. This initial band selection reduces dimensionality and guides subsequent k-means clustering. The proposed chord-based clustering method, utilizing the chord metric, outperforms standard k-means variants, demonstrating significant improvements in accuracy. Experimental results on publicly available hyperspectral datasets confirm the effectiveness of the proposed approach as an alternative to traditional k-means algorithms, showcasing significant improvements in accuracy.
Development of an algorithm for integrated UAV groups using visible light communication technology Alibekkyzy, Karygash; Keribayeva, Talshyn; Koshekov, Kayrat; Baidildina, Aizhan; Bugubayeva, Alina; Azamatova, Zhanerke
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 1: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i1.pp41-52

Abstract

Our research group dedicated its idea in developing and analyzing an algorithm for transforming integrated unmanned aerial vehicle (UAV) groups (IUGs) using visible light communication (VLC) technology. This innovative approach is designed to enhance UAV network coordination, addressing the complex challenges of communication within these networks. The primary issue addressed is the pressing need for advanced communication mechanisms within UAV networks to ensure efficient. This is a robust data transfer and complex coordination between UAVs. The existing systems lack the required adaptability and efficiency, leading to operational inefficiencies and reduced effectiveness in UAV applications. The main results of the study are concluded in the design and implementation of the conversion algorithm. Which provides efficient and reliable data transmission and sophisticated coordination between UAVs. Through careful mathematical modeling of UAV group dynamics and extensive MATLAB simulations, the study demonstrates the algorithm's ability to effectively control UAV formations. This method gives adaptability to different operational requirements and supports collision-free maneuvers. The algorithm's innovative design and the comprehensive approach adopted in the study, including the use of VLC technology and the integration of advanced restructuring methods, enable the effective resolution of the identified communication challenges within UAV networks.
Enhancing network security using unsupervised learning approach to combat zero-day attack Perumal, Rajakumar; Karuppiah, Tamilarasi; Panneerselvam, Uppiliraja; Annamalai, Venkatesan; Kaliyaperumal, Prabu
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 2: November 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i2.pp1284-1293

Abstract

Machine learning (ML) and advanced neural network methodologies like deep learning (DL) techniques have been increasingly utilized in developing intrusion detection systems (IDS). However, the growing quantity and diversity of cyber-attacks pose a significant challenge for IDS solutions reliant on historical attack signatures. This highlights the industry's need for resilient IDSs that can identify zero-day attacks. Current studies focusing on outlier-based zero-day detection are hindered by elevated false-negative rates, thereby constraining their practical efficacy. This paper suggests utilizing an autoencoder (AE) approach for zero-day attack detection, aiming to achieve high recall while minimizing false negatives. Evaluation is conducted using well-established IDS datasets, CICIDS2017 and CSECICIDS2018. The model's efficacy is demonstrated by contrasting its performance with that of a one-class support vector machine (OCSVM). The research underscores the OCSVM's capability in distinguishing zero-day attacks from normal behavior. Leveraging the encoding-decoding capabilities of AEs, the proposed model exhibits promising results in detecting complex zero-day attacks, achieving accuracies ranging from 93% to 99% across datasets. Finally, the paper discusses the balance between recall and fallout, offering valuable insights into model performance.
Identification of faults in rotating machines using high precision FBG vibration sensor: a case study on PM schemes Nayak, Dipak Ranjan; Ghuge, Nilam N.; Mohapatra, Ambarish G.; Sharma, Pramod; Nayak, Narayan; Satapathy, Satyapriya; Khanna, Ashish
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 1: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i1.pp535-547

Abstract

Predictive maintenance (PM) is a data-driven approach to performing proactive maintenance by analyzing the condition of the equipment in any industrial setting. The high-precision sensors are widely adapted to meticulously analyze critical maintenance conditions using such a data-driven approach. In a similar context, a fiber brag grating (FBG) sensor is a passive and high-precision sensor that is widely used in industries where conventional sensors are not preferred. Broadly, this article presents four sub elements of the proposed integrated system such as the design of the sensor element, signal processing scheme (SPS), machine learning (ML) model for predicting anomalies, and decision support system (DSS) to suggest maintenance actions. Also, this article highlights an experimental case study on vibration monitoring and analysis of real-time signals for making proactive maintenance decisions. An FBG vibration sensor of center wavelength 1,550 nm is designed and utilized to acquire real-time vibration signatures of a rotating machine under test. A piezoelectric vibration sensor is used with the FBG sensor to compare the vibration response obtained during the test. Pre-processing of raw signals is performed using a moving average filter (MAV) followed by a low pass filter to nullify the effect of noise. To obtain proactive maintenance decisions, a DSS model is prepared by considering the processed vibration signatures. Various maintenance conditions are tested during the experimental analysis and detailed results analysis are presented.

Page 832 of 914 | Total Record : 9138

 830   831   832   833   834 

Filter by Year

2012 2026


Reset
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