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 6,301 Documents
 553   554   555   556   557 
A light-weight and generalizable deep learning model for the prediction of COVID-19 from chest X-ray images Zobair, Md Jakaria; Orpa, Refat Tasfia; Ashef, Mahir; Siddiquee, Shah Md Tanvir; Chakraborty, Narayan Ranjan; Habib, Ahsan
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.pp4068-4077

Abstract

The detection of coronavirus disease (COVID-19) using standard laboratory tests, such as reverse transcription polymerase chain reaction (RT-PCR), is time-consuming. Complex medical imaging problems are currently being solved using machine learning and deep learning techniques. Our proposed solution utilizes chest radiography imaging techniques, which have shown to be a faster alternative for detecting COVID-19. We present an efficient and lightweight deep learning architecture for identifying COVID-19 using chest X-ray images which achieve 99.81% accuracy in intra-database testing and 100% accuracy in cross-validation testing on a separate data set. The results demonstrate the potential of our proposed model as a reliable tool for COVID-19 diagnosis using chest X-ray images, which can have a significant impact on improving the efficiency of COVID-19 diagnosis and treatment.
Automated classification of brain tumor-based magnetic resonance imaging using deep learning approach Owida, Hamza Abu; AlMahadin, Ghayth; Al-Nabulsi, Jamal I.; Turab, Nidal; Abuowaida, Suhaila; Alshdaifat, Nawaf
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i3.pp3150-3158

Abstract

The treatment of brain tumors poses significant challenges and contributes to a significant number of deaths on a global scale. The process of identifying brain tumors in medical practice involves the visual analysis of photographs by healthcare experts, who manually delineate the tumor locations. However, this approach is characterized by its time-consuming nature and susceptibility to errors. In recent years, scholars have put forth automated approaches to early detection of brain tumors. However, these techniques face challenges attributed to their limited precision and significant false-positive rates. There is a need for an effective methodology to identify and classify tumors, which involves extracting reliable features and achieving precise disease classification. This work presents a novel model architecture that is derived from the EfficientNetB3. The suggested framework has been trained and assessed on a dataset consisting of 7,023 magnetic resonance images. The findings of this study indicate that the fused feature vector exhibits superior performance compared to the individual vectors. Furthermore, the technique that was provided showed superior performance compared to the currently available systems and attained a 100% accuracy rate. As a result, it is viable to employ this technique within a clinical environment for the purpose of categorizing brain tumors based on magnetic resonance images scans.
A combined control method of supply harmonic current and source harmonic voltage for series hybrid active power filter Thuyen, Chau Minh; Nguyen, Hoai Thuong; Thao, Phan Thi Bich
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 6: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i6.pp6057-6065

Abstract

The series hybrid active power filter (SHAPF) is known as a very effective harmonic filtering model in power systems. Typically, SHAPF is controlled by a control method based either on the harmonic voltage of the load or on the supply harmonic current. However, the above two methods have the disadvantage of requiring the control coefficient much be large enough, which easily causes system instability. Therefore, this paper presents a new control method for SHAPF. It is a combined control method of the supply harmonic current and the source harmonic voltage. The advantage of the proposed method is the ability to reduce the total harmonic distortion of the supply current and voltage applied to the load with a control coefficient that is not too large. A fuzzy-proportional integral controller is designed for the proposed control method to reduce the compensation error in steady state under variable load conditions. Mathematical models and simulation results have demonstrated the effectiveness of the proposed method in reducing the total harmonic distortion of the supply current, voltage applied to the load and minimize the compensation error at steady state.
Device-to-device based path selection for post disaster communication using hybrid intelligence Balakrishna, Yashoda Mandekolu; Shivashetty, Vrinda
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 1: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i1.pp796-810

Abstract

Public safety network communication methods are concurrence with emerging networks to provide enhanced strategies and services for catastrophe management. If the cellular network is damaged after a calamity, a new-generation network like the internet of things (IoT) is ready to assure network access. In this paper, we suggested a framework of hybrid intelligence to find and re-connect the isolated nodes to the functional area to save life. We look at a situation in which the devices in the hazard region can constantly monitor the radio environment to self-detect the occurrence of a disaster, switch to the device-to-device (D2D) communication mode, and establish a vital connection. The oscillating spider monkey optimization (OSMO) approach forms clusters of the devices in the disaster area to improve network efficiency. The devices in the secluded area use the cluster heads as relay nodes to the operational site. An oscillating particle swarm optimization (OPSO) with a priority-based path encoding technique is used for path discovery. The suggested approach improves the energy efficiency of the network by selecting a routing path based on the remaining energy of the device, channel quality, and hop count, thus increasing network stability and packet delivery.
Model reference adaptive control of networked systems with state and input delays Wafi, Moh Kamalul; Indriawati, Katherin; Widjiantoro, Bambang L.
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 5: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i5.pp5055-5063

Abstract

Adaptive control strategies have been developed in response to more advanced complex systems and to deal with uncertain systems while maintaining the desired conditions. This paper addresses the networked unknown and unstable heterogeneous systems following a stable reference (leader), which is related to network synchronization. We deliver two different scenarios; each agent both fully communicates to the leader and shares communication among neighborhood agents and the leader. The communication among agents and the leader are weighted using Laplacian-like matrix and the model weight matrix in turn. Also, the state and input delays are induced to the systems to capture the real limited communication while the prediction of the reference signals and the augmented systems are proposed to deal with them. Moreover, the rigorous mathematical foundations of two adaptive laws, the stability analysis, the threshold of network, and the communication network are thoroughly presented. Also, the numerical illustrations of the two scenarios are given to show the effectiveness of the proposed method in the networked system. The results show that for both scenarios working on the required setting, the perfect tracking to the leader is guaranteed. Beyond that, the future research would implement the distributed adaptive control-oriented learning of networked system under some faults.
Improvement of misalignment tolerance in free-space optical interconnects Al-Ababneh, Nedal; Aldiabat, Hasan
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 1: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i1.pp426-434

Abstract

In this paper, the use of micro lenses with non-uniform transmittance apertures as an alternative to those with uniform transmittance apertures in optical communication systems is proposed. In particular, we consider the use of micro lenses with tapered Gaussian transmittance profiles to improve the misalignment tolerance in optical interconnects. We study the effects of utilizing Gaussian transmittance profiles on the propagation of light beams and the signal to crosstalk ratio of misaligned optical systems. Moreover, we consider the use of uniform transmittance profiles in optical systems for the sake of comparison. To this end, the crosstalk optical noise is modeled at the plane of the detectors array considering the two scenarios of uniform and Gaussian apertures. This was possible after finding the optical field for both scenarios at the of the detectors array. Numerical results clearly demonstrate the significant improvement in decreasing the crosstalk and increasing the signal to crosstalk ratio in the considered optical systems upon utilizing the Gaussian profiles.
Automatic notes based on video records of online meetings using the latent Dirichlet allocation method Arianto, Rakhmat; Asmara, Rosa Andrie; Nurhasan, Usman; Rahmanto, Anugrah Nur
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.pp4147-4153

Abstract

Meeting minutes can also be used as a benchmark for whether the meeting objectives have been achieved or not. Minutes are taken during the meeting until the end of the meeting, which contain essential points from the meeting. Minutes in online meetings are currently still done manually, and generally, every meeting is recorded as documentation that requires more human resources to change the recording of the meeting file. Based on the problems above, a solution to this problem is needed by creating an automatic note-taking system that can assist the note-takers in concluding the meeting, especially in the Information Technology Department. This study uses the latent Dirichlet allocation (LDA) method to determine text summarization and topic modeling. Based on this research, the system calculation using the LDA method produces a pretty good accuracy value for text summarization of 57.91% and topic modeling with a coherence score of 64.56%. Based on this research, the implementation of the latent Dirichlet allocation method for text summarization and topic modeling provides a fairly good level of similarity accuracy when compared to the minutes that are written manually and can be implemented in the Information Technology Department.
Network intrusion detection system by applying ensemble model for smart home Amru, Malothu; Jagadeesh Kannan, Raju; Narasimhan Ganesh, Enthrakandi; Muthumarilakshmi, Surulivelu; Padmanaban, Kuppan; Jeyapriya, Jeyaprakash; Murugan, Subbiah
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i3.pp3485-3494

Abstract

The exponential advancements in recent technologies for surveillance become an important part of life. Though the internet of things (IoT) has gained more attention to develop smart infrastructure, it also provides a large attack surface for intruders. Therefore, it requires identifying the attacks as soon as possible to provide a secure environment. In this work, the network intrusion detection system, by applying the ensemble model (NIDSE) for Smart Homes is designed to identify the attacks in the smart home devices. The problem of classifying attacks is considered a classification predictive modeling using eXtreme gradient boosting (XGBoosting). It is an ensemble approach where the models are added sequentially to correct the errors until no further improvements or high performance can be made. The performance of the NIDSE is tested on the IoT network intrusion (IoT-NI) dataset. It has various types of network attacks, including host discovery, synchronized sequence number (SYN), acknowledgment (ACK), and hypertext transfer protocol (HTTP) flooding. Results from the cross-validation approach show that the XGBoosting classifier classifies the nine attacks with micro average precision of 94% and macro average precision of 85%.
Efficient smart distributed face identification using the MixMaxSim decision function Ahmadi, Sayed Mohammad; Dianat, Rouhollah
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 6: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i6.pp7145-7157

Abstract

Recognizing a large number of people is a common challenge in face identification applications, involving decreased accuracy, increased memory and time complexities. To address these issues, this study introduces a three-module approach: “toilers,” “affinity-meter,” and “decision-maker.” Unlike the random distribution methods used in previous solutions, this method employs clustering to distribute the problem into subnetworks called “toilers.” The toiler’s module calculates the likelihood of test data belonging to each class of each toiler, using the last layer outputs of deep learning models. Meanwhile, the affinity-meter module determines the similarity between the test data and the average of each class, employing a similarity measure. The decision-maker module combines the reports from the previous two modules and selects the final class, utilizing a mix of the max-max criterion and the similarity criterion. The proposed method outperforms existing solutions, achieving improved recall, precision, and F1-score. It effectively addresses memory, speed, and accuracy issues in face identification, surpassing both no-distribution and random methods on Glint360K, VGGFace2, and MS-Celeb-1M datasets. Overall, this method offers a more efficient and accurate approach by distributing the problem into subnetworks, demonstrating superior performance and scalability for large-scale face recognition applications.
A systematic review of in-memory database over multi-tenancy Shah, Arpita; Bhatt, Nikita
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1720-1729

Abstract

The significant cost and time are essential to obtain a comprehensive response, the response time to a query across a peer-to-peer database is one of the most challenging issues. This is particularly exact when dealing with large-scale data processing, where the traditional approach of processing data on a single machine may not be sufficient. The need for a scalable, reliable, and secure data processing system is becoming increasingly important. Managing a single in-memory database instance for multiple tenants is often easier than managing separate databases for each tenant. The research work is focused on scalability with multi-tenancy and more efficiency with a faster querying performance using in-memory database approach. We compare the performance of a row-oriented approach and column-oriented approach on our benchmark human resources (HR) schema using Oracle TimesTen in-memory database. Also, we captured some of the key advantages on optimization dimension(s) are the traditional approach, late-materialization, compression and invisible join on column-store (c-store) and row-base. When compression and late materialization are enabled in a query set; it improves the overall performance of query sets. In particular, the paper aims to elucidate the motivations behind multi-tenant application requirements concerning the database engine and highlight major designs over in-memory database for the tenancy approach on cloud.

Page 555 of 631 | Total Record : 6301

 553   554   555   556   557 

Filter by Year

2011 2026


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