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,174 Documents
 631   632   633   634   635 
Efficient hearing aid algorithm using DCT with uniformly re-sampled and recursively modified audiogram values K. Ayyappa Swamy; Zachariah C. Alex
Indonesian Journal of Electrical Engineering and Computer Science Vol 23, No 1: July 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v23.i1.pp237-246

Abstract

People with the hearing problems have different listening preferences and characteristics in hearing loss. So, hearing aids need algorithms that provide amplification based on frequency, so that the hearing-impaired persons can use hearing aids comfortably for a long duration. In this paper, a new algorithm is proposed for hearing aids in order to compensate for sensorineural and conductive hearing loss using discrete cosine transform (DCT). DCT coefficients of the input audio signal are multiplied with uniformly resampled and recursively modified audiogram values to compensate for hearing loss. This algorithm comprised of 4 stages namely precomputation to calculate gain values from audiogram, DCT, gain adjustment, and inverse DCT. In the above stated stages except precomputation, each stage requires only one matrix multiplication, which makes the proposed algorithm computational efficient. Performance of the proposed algorithm is compared with uniform filter banks, non-uniform filter banks, variable filter bank and reconfigurable filter banks. The algorithm is tested using audiograms with four different hearing loss cases. It is proved that the proposed algorithm provides less complexity, minimized delay and better matching with all types of audiograms, further, it also avoids degradation of audio signal due to sampling rate conversions in variable and reconfigurable filter banks.
Sliding mode control with observer for permanent magnet synchronous machine drives Muhammad Haziq Nashren Razali; Jurifa Mat Lazi; Zulkifilie Ibrahim; Md Hairul Nizam Talib; Fizatul Aini Patakor
Indonesian Journal of Electrical Engineering and Computer Science Vol 25, No 1: January 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v25.i1.pp89-97

Abstract

This paper aims to develop the sliding mode control (SMC) scheme in sensorless permanent magnet synchronous machine (PMSM) drives to replace conventional proportional integral (PI) speed control. The SMC is formulated based on the integral sliding surface of the speed error. And the error is corrected based on the concept of Lyapunov stability. The SMC is designed with the load torque observer so that the disturbance can be estimated as feedback to the controller. The vector control technique which is also known as field-oriented control (FOC) is also used to split the stator current into the magnetic field generating part which is the direct axis and the torque generating part which is the quadrature axis. This can be done by using Park and Clarke transformations. The performance of the proposed SMC is tested under changes in load-torque and without load for different speed commands. The results prove that the SMC produces robust performances under variations of speeds and load disturbances. The effectiveness of the proposed method is verified and simulated by using MATLAB/SIMULINK software.
An energy consumption minimization approach in wireless sensor networks Muhsin J. Al-Amery; Mohammed H. Ghadban
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i3.pp1485-1494

Abstract

There is no doubt that the most challenging aspect in the wireless sensor networks (WSN) is the lifetime, due to limitations in their energy. WSN depends on a specific group of sensor nodes to gather the data from other nodes and forward it to the base station (BS). These nodes are called cluster heads. Having reliable cluster head’s (CH) means longer life to the network. In this paper, a versatile calculation has been acquainted and analyzed for selecting the CH that maintains the least vitality utilization in the network with appropriate life time during every correspondence round. The altered methodology depends on the improved calendar of the time division multiple access (TDMA) plans. This methodology is created to decide the next CH based on lifetime, expended vitality, number of CH’s, and the frequent contact to the BS. A comparative analysis is introduced, the proposed algorithm assistant cluster heads (ACHS) shows energizing outcomes in vitality utilization in WSNs just as expanding the general system dependability with reasonable viability and productivity in terms of lifetime. The ACHS strategy shows a decrease in the WSN vitality utilization up to about 25% and shows an expansion in the system life time by 30% than the upgraded timetable of time TDMA plan approach.
Dispatching the problems in implementing mobile payment services from consumer attitude perspective Hoang Thien Van; Vo Anh Tien; Huynh Cong Danh; Hoang-Sy Nguyen
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp590-597

Abstract

Due to the abundance of internet and e-commerce (electronic commerce), an excessive amount of data has been generated causing an overload of information to the current network infrastructure. As an attempt to solve this problem, there is a shift to mobile payment in the field of E-commerce. Thus, it is essential to study the adoption level of such service for global markets in general and the Vietnamese market in specific. In this paper, we study the consumers' attitude toward mobile payment, investigated with the theory of planned behavior (TPB) from three perspectives, namely the consumer innovativeness, perceived benefit, and perceived risk. Accordingly, there are six hypotheses proposed to study the consumers' attitude toward the service. Thanks to the structural equation modeling (SEM) method, a population of 250 Vietnamese mobile payment users was analyzed to confirm five out of the six hypotheses. It is drawn that the attitude toward the service is correlated positively with the innovativeness and the perceived benefit, while being correlated negatively with the perceived risk. Besides, the resulted model can elucidate approximately 49% the consumers' intention to reuse the mobile payment service.
Multiloop low bandwidth communication-based power sharing control for microgrids Erum Pathan; Afarulrazi Abu Bakar; Mubashir Hayat Khan; Muhammad Asad; Haider Arshad
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 2: February 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i2.pp682-690

Abstract

In parallel-connected inverter-based microgrids, the reactive power sharing accuracy can not have satisfactory results effortlessly. Mismatch in feeder impedances of the parallel-connected inverter-based microgrids is a significant cause of inaccurate reactive power-sharing. In voltage source inverters (VSI) based microgrids, especially for the islanded mode of operation, the conventional centralized or decentralized control techniques are not much helpful to control the voltage deviations due to impedance mismatch. Mismatch of the feeder impedance is compensated by the addition of fixed virtual impedance. Whereas, the change in the virtual impedance is compensated by adaptive virtual impedance-based control techniques which are helpful to mitigate power-sharing errors, but in most of the control schemes virtual impedance-based control mechanism needs pre-knowledge of feeder impedance which increases the computational burden. This paper presents a decentralized virtual impedance-based power sharing control. In the proposed control solution to mitigate reactive power sharing errors in distributed generation (DG) units, mismatch of the parallel-connected feeder impedance is equalized by regulating the addition of equivalent impedance to each DG inverter. Proposed control technique offers an independent implementation without any pre-knowledge of the feeder impedance. Hence, the implementation of the control scheme is a straightforward and computational burden is also reduced. Simulation results show the effectiveness of the control scheme. 
Load shifting impact on generating adequacy assessment during peak period Alsaedi, Malik Abdulrazzaq; Jabir, Hussein Jumma; Albaker, Baraa Munqith
Indonesian Journal of Electrical Engineering and Computer Science Vol 25, No 3: March 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v25.i3.pp1217-1226

Abstract

The load shifting technique is widely implemented in electrical power generation due to its considerable impact on system reliability. The evaluation of load shifting benefits towards the adequacy of generation systems requires an accurate assessment. If the generation unit’s capacity is insufficient to meet the system load, then assistance is required from alternative sources. Load shifting, as a primary demand-side management technique, is used efficiently in electrical power networks given that the energy clipped/curtailed owing to load curtailment and peak clipping can be recovered during the off-peak period. The reliability of a generic framework for the prospective integration of a load shifting technique, with preventative and corrective actions as alternatives to peaking units, is investigated in this study. The optimal rate of load shifting in terms of expected energy not supplied is also investigated. Results show that preventive load shifting (PLS) can act as peaking units when the total generated capacity is within specific limits. Meanwhile, corrective load shifting can act as a better alternative than PLS and peaking units. To calculate expected energy not supplied, sequential Monte Carlo simulation is utilized. This study is conducted using the IEEE reliability test system.
Fast image watermarking based on signum of cosine matrix Ernawan, Ferda; Adi, Prajanto Wahyu; Liew, Siau-Chuin; Sarwoko, Eko Adi; Winarno, Edy
Indonesian Journal of Electrical Engineering and Computer Science Vol 25, No 3: March 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v25.i3.pp1383-1391

Abstract

In the field of image watermarking, the singular value decomposition has good imperceptibility and robustness, but it has high complexity.  It divides a host image into matrices of U, S, and V. Singular matrix S has been widely used for embedding and extracting watermark, while orthogonal matrices of U and V are used in decomposition and reconstruction. The proposed signum of cosine matrix method is carried out to eliminate the generation of the three matrices at each block and replace it with a signum of cosine matrix. The proposed signum of cosine matrix is performed faster on the decomposition and reconstruction. The image is transformed into a coefficient matrix C using the signum matrix. The C matrix values are closer to the S value of singular value decomposition which can preserve high quality of the watermarked image. The experimental results show that our method is able to produce similar imperceptibility and robustness level of the watermarked image with less computational time.
Towards secure smart cities: design and implementation of smart home digital communication system Nael Al-Shareefi; Sura Adil Abbas; Mohanad S. Alkhazraji; Ammar AbdRaba Sakran
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp271-277

Abstract

Home and building security are major concern in our daily life and digital smart door lock (DSDL) have become an essential part of these systems. In this paper, a secure DSDL which can grant access to home with a fingerprint is designed and implemented. An Arduino Nano microcontroller board, finger print sensor and servo motor have been utilized for lock/unlock door based on finger print. The DSDL is an automatic authenticate and validate the user for secure access. The implemented system aims to develop a cost−effective DSDL based on low−cost components compared to the systems already on the domestic market. The−ease of−use and cost−effectiveness makes the DSDL a strong competitor to the digital security system on the domestic market and outperforms it and suitable for security–based home automation systems.
Model of an intelligent energy harvesting system from microbial fuel cells in wastewater treatment process Ngoc-Thinh Quach; Thieu Quang Quoc Viet; Pham Van Toan; Minh-Trung Dao
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i3.pp1263-1271

Abstract

This paper presents a model of an intelligent energy harvesting system from microbial fuel cells (MFCs) in the wastewater treatment process. The model consists of two direct current (DC/DC) converters connected in a cascade. One DC/DC converter is used to capture energy from MFC and store it in a supercapacitor. The other DC/DC converter is responsible for increasing the low output voltage to a higher voltage level. In the paper, the MFC is modeled by a DC voltage source instead of a real MFC that contains wastewater inside it. The experimental results demonstrate that the model of an intelligent energy harvesting system can increase the low output voltage of MFC up to 3.3 V and achieve intermittent output power at a high level that can use in practice.
Classifying clinically actionable genetic mutations using KNN and SVM Rohit Chivukula; T. Jaya Lakshmi; Sanku Satya Uday; Satti Thanuja Pavani
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 3: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i3.pp1672-1679

Abstract

Cancer is one of the major causes of death in humans. Early diagnosis of genetic mutations that cause cancer tumor growth leads to personalized medicine to the decease and can save the life of majority of patients. With this aim, Kaggle has conducted a competition to classify clinically actionable gene mutations based on clinical evidence and some other features related to gene mutations. The dataset contains 3321 training data points that can be classified into 9 classes. In this work, an attempt is made to classify these data points using K-nearest neighbors (KNN) and linear support vector machines (SVM) in a multi class environment. As the features are categorical, one hot encoding as well as response coding are applied to make them suitable to the classifiers. The prediction performance is evaluated using log loss and KNN has performed better with a log loss value of 1.10 compared to that of SVM 1.24.

Page 633 of 918 | Total Record : 9174

 631   632   633   634   635 

Filter by Year

2012 2026


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