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 111 Documents
 2   3   4   5   6 
Search results for , issue "Vol 14, No 4: August 2024" : 111 Documents clear
Optimized automated testing: test case generation and maintenance using latent semantic analysis-based TextRank and particle swarm optimization algorithms Swathi, Baswaraju; Kolisetty, Soma Sekhar
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4315-4324

Abstract

Software development would have to include automated testing to ensure the finished product and performs as intended. However, the process of Test Case Generation and Maintenance can be time-consuming and error-prone, especially when manual methods are used. This research proposes a new approach to improve the efficiency and accuracy of automated testing using latent semantic analysis (LSA)-based TextRank (TR) and particle swarm optimization (PSO) algorithms. The study aims to evaluate the effectiveness of these algorithms in generating and optimizing test cases based on requirements analysis. To retrieve key information from the criteria, methods including text classification (TC), named entity recognition (NER), and sentiment analysis (SA) are used to evaluate the text. Test cases are then generated using LSA-based TR for text summarization and PSO for optimization. The aim of this work is to identify any limitations that need to be addressed and to evaluate the overall efficiency and accuracy of automated testing (AT) using proposed algorithms. The results of this research are expected to have important implications for the software industry, helps to improve the overall efficiency and accuracy of AT. The findings could guide future research that led to the creation of more advanced and effective tools for AT.
Enhancement of detection accuracy for preventing iris presentation attack Venkatesh, Priyanka; Shyam, Gopal Krishna; Alam, Sumbul
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4376-4385

Abstract

A system that recognizes the iris is susceptible to presentation attacks (PAs), in which a malicious party shows artefacts such as printed eyeballs, patterned contact lenses, or cosmetics to obscure their personal identity or manipulate someone else’s identity. In this study, we suggest the dual channel DenseNet presentation attack detection (DC-DenseNetPAD), an iris PA detector based on convolutional neural network architecture that is dependable and effective and is known as DenseNet. It displays generalizability across PA datasets, sensors, and artifacts. The efficiency of the suggested iris PA detection technique has been supported by tests performed on a popular dataset which is openly accessible (LivDet-2017 and LivDet-2015). The proposed technique outperforms state-of-the-art techniques with a true detection rate of 99.16% on LivDet-2017 and 98.40% on LivDet-2015. It is an improvement over the existing techniques using the LivDet-2017 dataset. We employ Grad-CAM as well as t-SNE plots to visualize intermediate feature distributions and fixation heatmaps in order to demonstrate how well DC-DenseNetPAD performs.
Performance analysis of deep unified model for facial expression recognition using convolution neural network Kavita, Kavita; Chhillar, Rajender Singh
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4046-4054

Abstract

Facial expression recognition has gathered substantial attention in computer vision applications, with the need for robust and accurate models that can decipher human emotions from facial images. Performance analysis of a novel hybrid model combines the strengths of residual network (ResNet) and dense network (DenseNet) architectures after applying preprocessing for facial expression recognition. The proposed hybrid model capitalizes on the complementary characteristics of ResNet's and DenseNet's densely connected blocks to enhance the model's capacity to extract discriminative features from facial images. This research evaluates the hybrid model performance and conducts a comprehensive benchmark against established facial expression recognition convolution neural network (CNN) models. The analysis encompasses key aspects of model performance, including classification accuracy, and adaptability with the LFW dataset for facial expressions such as Anger, Fear, Happy, Disgust, Sad, Surprise, along Neutral. The research observes that the proposed hybrid model is more accurate and efficient computationally than existing models consistently. This performance analysis eliminates information on the hybrid model's perspective to further facial expression recognition research.
MSAPersonality: a modern standard Arabic dataset for personality recognition Chraibi, Khaoula; Chaker, Ilham; Dhassi, Younes; Zahi, Azeddine
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4498-4507

Abstract

Automatic personality recognition is a task that attempts to automatically infer personality traits from a variety of data sources, including Text. Our words, whether spoken or written, reveal a lot about who we are. As people speak different languages, each with its own set of characteristics and level of complexity, identifying their personalities automatically might be language-dependent. This task requires an annotated text corpus with personality traits. However, the lack of corpora for languages other than English makes the task extremely challenging. We concentrated our efforts in this paper on the Arabic language in particular because it is understudied and lacks a corpus, despite being one of the most widely spoken languages in the world. Our primary goal was constructing our “MSAPersonality” dataset, which consists of 267 texts in modern standard Arabic that have been annotated with the Big Five personality traits. To evaluate the dataset and its potential for classification and regression, we used text preprocessing techniques, feature extraction, and machine learning algorithms. We obtained promising experimental results. Therefore, further research into predicting personality from Arabic text can be conducted.
Optimizing drone-assisted victim localization and identification in mass-disaster management: a study on feasible flying patterns and technical specifications Azmi, Intan Nabina; Kassim, Murizah; Mohd Yussoff, Yusnani; Md Tahir, Nooritawati
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4097-4109

Abstract

The prompt emphasizes the importance of identifying victims in a disaster area within 48 hours and highlights the potential benefits of using drones in search and rescue missions. However, the use of drones is limited by factors such as battery life, processing speed, and communication range. To address these limitations, the paper presents a detailed research study on the most effective flying pattern for drones during search and rescue missions. The study utilized energy consumption and coverage area as performance metrics and collected precise images that could be analyzed by the forensic team. The research was conducted using OMNET++ and fieldwork at Pulau Sebang, Melaka, in collaboration with search and rescue agencies in Malaysia. The results suggest that the square flying pattern is the most effective, as it provides the highest coverage area with reasonable energy utilization. Both simulation and fieldwork results showed coverage of 100% and 97.96%, respectively, for this pattern. Additionally, the paper provides technical specifications for rescue teams to use when deploying drones during search and rescue missions.
A bibliometric analysis of the landscape of measuring technology maturity in the enterprise internet of things Solis Pino, Andrés Felipe; Ruiz, Pablo H.; Mon, Alicia; Collazos, Cesar Alberto
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4697-4713

Abstract

The internet of things (IoT) is an emerging technology that has taken great relevance in the current socioeconomic context, especially in the business environment, due to its ability to generate competitive advantages. Its adoption presents challenges, such as understanding the value proposition, staff training, and ensuring connectivity and compatibility. In addition, it is crucial to establish the technological maturity of the IoT in enterprises to determine their current state and take steps to address these challenges. In this study, a bibliometric analysis of 431 articles from different scientific databases was performed using Bibliometrix and VOSviewer tools to determine the current state of the domain. The results indicate that the field is booming, with an annual growth rate of 22.58%. Its conceptual structure is composed of the IoT implemented in different contexts, in conjunction with the influence of sister technologies such as big data and blockchain, suggesting limited specificity in establishing the maturity of the enterprise IoT. Countries such as China and Brazil were found to be at the forefront in the area. A promising aspect is establishing standardized ways to measure technological maturity and provide guidelines for improving internet of things adoption.
Mean makespan task scheduling approach for the edge computing environment Saini, Nisha; Kumar, Jitender
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4714-4720

Abstract

Task scheduling in the edge computing environment poses significant challenges due to its inherent NP-hard nature. Several researchers concentrated on minimizing simple makespan, disregarding the reduction of the mean time to complete all tasks, resulting in uneven distributions of mean completion times. To address this issue, this study proposes a novel mean makespan task scheduling strategy (MMTSS) to minimize simple and mean makespan. MMTSS optimizes the utilization of virtual machine capacity and uses the mean makespan optimization to minimize the processing time of tasks. In addition, it reduces imbalance by evenly distributing tasks among virtual machines, which makes it easier to schedule batches subsequently. Using genetic algorithm optimization, MMTSS effectively lowers processing time and mean makespan, offering a viable approach for effective task scheduling in the edge computing environment. The simulation results, obtained using cloudlets ranging from 500 to 2000, explicitly demonstrate the improved performance of our approach in terms of both simple and mean makespan metrics.
Hybridization of the Q-learning and honey bee foraging algorithms for load balancing in cloud environments Adewale, Adeyinka Ajao; Obiazi, Oghorchukwuyem; Okokpujie, Kennedy; Koto, Omiloli
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4602-4615

Abstract

Load balancing (LB) is very critical in cloud computing because it keeps nodes from being overloading while others are idle or underutilized. Maintaining the quality of service (QoS) characteristics like response time, throughput, cost, makespan, resource utilization, and runtime is difficult in cloud computing due to load balancing. A robust resource allocation strategy contributes to the end user receiving high-quality cloud computing services. An effective LB strategy should improve and deliver required user satisfaction by efficiently using the resources of virtual machines (VM). The Q-learning method and the honey bee foraging load balancing algorithm were combined in this study. This hybrid combination of a load balancing algorithm and a machine learning method has reduced the runtime of load balancing activities and makespan, and increased task throughput in a cloud computing environment thereby enhancing routing activities. It achieved this by continuously tracking the usage histories of the VMs and altering the usage matrix to send jobs to the VMs with the best usage histories.
Brain tumor detection using a MobileNetV2-SSD model with modified feature pyramid network levels Hikmah, Nada Fitrieyatul; Hajjanto, Ariq Dreiki; A. Surbakti, Armand Faris; Prakosa, Nadhira Anindyafitri; Asmaria, Talitha; Sardjono, Tri Arief
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp3995-4004

Abstract

Brain tumors, a subset of these malignancies, demand accurate and efficient diagnosis. Traditional methods use non-invasive medical imaging like magnetic resonance imaging (MRI) and computed tomography (CT). Although necessary for diagnosis, manual brain MRI picture segmentation is tedious and time-consuming. Using deep learning is a promising solution. This study proposes an innovative approach for brain tumor detection, focusing on meningioma tumors. Utilizing threshold-based segmentation, the MobileNetV2 architecture, a modified feature pyramid network (FPN), and single shot MultiBox detector (SSD), our model achieves precise localization and object detection. Pre-processing techniques such as grayscale conversion, histogram equalization, and Gaussian filtering enhance the MRI image quality. Morphological operations and thresholding facilitate tumor segmentation. Data augmentation and a meticulous dataset division aid in model generalization. The architecture combines MobileNetV2 as a feature extractor, SSD for object detection, and FPN for detecting small objects. Modifications, including lowering the minimum FPN level, enhance small object detection accuracy. The proposed model achieved a recall value of around 98% and a precision value of around 89%. Additionally, the proposed model achieved approximately 93% on both the dice similarity coefficient (DSC) value and the index of similarity. Based on the promising results, our research holds significant advancements for the field of medical imaging and tumor detection.
Privacy-preserving reservation model for public facilities based on public Blockchain Basuki, Akbari Indra; Rosiyadi, Didi; Susanto, Hadi; Setiawan, Iwan; Salim, Taufik Ibnu
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4418-4429

Abstract

Ensuring fairness in the utilization of government-funded public facilities, such as co-working spaces, sports fields, and meeting rooms, is imperative to accommodate all citizens. However, meeting these requirements poses a significant challenge due to the high costs associated with maintaining digital infrastructure, employee wages, and cybersecurity expenses. Fortunately, Blockchain smart contracts present an economical and secure solution for managing digital infrastructure. They offer a pay-per-transaction schema, immutable transaction records, and role-based data updates. Despite these advantages, public blockchains raise concerns about data privacy since records are publicly readable. To address this issue, this study proposes a privacy-preserving mechanism for public facilities' reservation systems. The approach involves encrypting the reservation table with fully-homomorphic encryption (FHE). By employing FHE with binary masking and polynomial evaluation, the reservation table can be updated without decrypting the data. Consequently, citizens can discreetly book facilities without revealing their identities and eliminating the risk of overlapping schedules. The proposed system allows anyone to verify reservations without disclosing requested data and table contents. Moreover, the system operates autonomously without the need for human administration, ensuring enhanced user privacy.

Page 4 of 12 | Total Record : 111

 2   3   4   5   6 

Filter by Year

2024 2024


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