cover
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
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 64 Documents
Search results for , issue "Vol 27, No 3: September 2022" : 64 Documents clear
Development of a mobile expert system for the diagnosis on motorcycle damage using forward chaining algorithm Rizqi Fitri Naryanto; Mera Kartika Delimayanti; Kriswanto Kriswanto; Ari Dwi Nur Indriawan Musyono; Imam Sukoco; Mohamad Naufal Aditya
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1601-1609

Abstract

Indonesia is an ASEAN country with the most motorcycle users, where one-third of its population own motorcycles. The automatic motorcycle is the most widely used type due to its agility and fuel-efficient abilities. Sudden motorcycle damage could hamper the users' activities. However, most of these users do not know the reason for the damage. This paper presents the development of expert system for diagnosing the damage of motorcycle using forward chaining method. This system was implemented in mobile application. Through a mobile application, a solution for these users can be obtained. This application immediately discovers the damaged location and repair process. Furthermore, it acts as the first solution before motorcycle repair is carried out in a shop. In this study, the forward chaining method was implemented. It is based on a pattern-matching algorithm whose primary objective is to match facts (input data) with appropriate rules from the rule base. Various test results showed that the diagnostic application used for automatic motorcycle damages 100% worked.
Chaotic map technique for enhancement security for android mobile system based on image encryption Kawther Thabt Saleh; Nisreen Abd Alhadi Jabr; Iman Hussein Al-Qinani
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1698-1703

Abstract

Network security continues to be the priority of many organizations. To ensure the protection of their data, they pay great attention to Encryption systems. Moreover, because of the enormous developments in networks of connection particularly the internet which has used by several people to share a variety of data kinds. The security of data has been a significant issue. As a result, there is a significant focus in using methods of decryption and encryption. Numerous encryption techniques have become advanced to preserve data protection, chaotic encryption systems are one of these methods widely used in recent years, where several techniques were proposed to use a chaotic map for encrypt images for the reason that of their characteristics e.g., random action unpredictability and initial conditions sensitivity. In this paper, proof authentication of sent information is used chaotic encryption algorithm to provide cipher text and hidden in image then send to another user. This approach is applied in cellular operating system environment (android). Thus, the sending and receiving of text will be safe and secure. The proposed approach is tested on different types of mobile. The proposed system gives good results.
Enhancement and modification of automatic speaker verification by utilizing hidden Markov model Imad Burhan Kadhim; Ali Najdet Nasret; Zuhair Shakor Mahmood
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1397-1403

Abstract

The purpose of this study is to discuss the design and implementation of autonomous surface vehicle (ASV) systems. There’s a lot riding on the advancement and improvement of ASV applications, especially given the benefits they provide over other biometric approaches. Modern speaker recognition systems rely on statistical models like hidden Markov model (HMM), support vector machine (SVM), artificial neural networks (ANN), generalized method of moments (GMM), and combined models to identify speakers. Using a French dataset, this study investigates the effectiveness of prompted te xt speaker verification. At a context-free, single mixed mono phony level, this study has been constructing a continuous speech system based on HMM. After that, suitable voice data is used to build the client and world models. In order to verify speakers, the text-dependent speaker ver-ification system uses sentence HMM that have been concatenated for the key text. Normalized log-likelihood is determined from client model forced by Viterbi algorithm and world model, in the verification step as the difference between the log-likelihood. At long last, a method for figuring out the verification results is revealed.
Modification of the new conjugate gradient algorithm to solve nonlinear fuzzy equations Zeyad M. Abdullah; Hisham M. Khudhur; Amera Khairulla Ahmed
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1525-1532

Abstract

The conjugate gradient approach is a powerful tool that is used in a variety of areas to solve problems involving large-scale reduction. In this paper, we propose a new parameter in nonlinear conjugate gradient algorithms to solve nonlinear fuzzy equations based on Polak and Ribiere (PRP) method, where we prove the descent and global convergence properties of the proposed algorithm. In terms of numerical results, the new method has been compared with the methods of Fletcher (CD), Fletcher and Reeves (FR), and Polak and Ribiere (PRP). The proposed algorithm has outperformed the rest of the algorithms in the number of iterations and in finding the best value for the function and the best value for the variables.
Injected power control for grid-connected converter based on particle swarm optimization Safa Sfoog Oleiwi; Abdulrahim Thiab Humod; Fadhil Abbas Hasan
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1199-1211

Abstract

Inductance–capacitance–inductance (LCL) filters are very attractive candidates for renewable energy system applications due to their high efficiency, high harmonic reduction, small bulk, and improved harmonic distortion (THD). These papers take advantage of the capabilities of renewable energy sources and inject them into the network by using an inverter when it enters work at high loads at certain times. Therefore, it is necessary to control power with certain controllers. The proportional-integral controller (PI) is used; conventional methods for tuning the controller parameters cannot give satisfactory performance due to the high instability of the closed-loop system. This paper presents the particle swarm optimization (PSO) method for tuning the controller's parameters to achieve optimum performance associated with sufficient stability margin. The mathematical models for the LCL filter and the frequency response were investigated by using the bode-plot. The proposed approach shows effective results for both power control and harmonic reduction. The proposed PI-PSO controller gives overshoot (1.08%), settling time (0.03 sec), rise time (0.00035 sec) and improved THD from 10.29% to 1.67% with compared to using the trial and error method, which gives (1.035%), (0.015) and (0.003) and THD from 10.23% to 1.575%, respectively.
Enhancement of the lighting quality for white light-emitting diodes with CaSc2O4:Ce3+ phosphor Phuc Dang Huu; Phung Ton That; Phan Xuan Le; Nguyen Le Thai
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1282-1289

Abstract

For the task of realizing greater progress for the light output in white light-emitting diodes (WLEDs), this study focuses on the luminescence temperature subordination feature of CaSc2O4:Ce3+ phosphor (abbreviated to CaS for this study). Some other aspects of the phosphor were also included in this piece of paper: Huang-Rhys coupling factor, Stokes shift, triggering power, abatement temperature and especially, abatement behavior in CaSc2O4:Ce3+. Creating the bluish-green LEDs by the combination of blue InGaN chip and CaSc2O4:Ce3+ is the primary purpose. CaSc2O4:Ce3+ appears to be a decent green phosphor that can be used in WLEDs made of blue InGaN chip. Production tasks may be based on our investigation for the task of making desirable WLED devices that meet the production demands.
Adaptive weight grey wolf algorithm application on path planning in unknown environments Mustafa Salah Abed; Omar Farouq Lutfy; Qusay Fadhel Al-Doori
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1375-1387

Abstract

Autonomous mobile robots developed using metaheuristic algorithms are increasingly becoming a hot topic in control and computer sciences. Specifically, finding the shortest route to the goal and avoiding hurdles are current subjects of autonomous mobile robots. The Modified Grey Wolf Optimization (MGWO) is demonstrated in this work using two approaches: first, the Adaptive Adjustment Approach of the Control Parameters, and second, the Adaptive Variable Weights method. Those two methods are utilized for updating the wolf position, accelerate convergence, and cut down on time. The proposed online optimization approach is used in three different environments including an environment with unknown static obstacles, dynamic obstacles, and an environment with a dynamic target. The online optimization method is performed using two phases which are the sensors reading phase and the path calculation phase. The proposed approach can solve a local minima problem in the static obstacles. A comparison study result between the proposed method and two other algorithms revealed that the proposed algorithm performed better in avoiding obstacles, which include the situation with the local minima. Finally, when put to comparison with Hybrid Fuzzy-Wind Driven Optimization and Adaptive Particle Swarm Optimization the average improvement rates in route length are 2.86% and 4.70391%, respectively.
Design a MIMO printed dipole antenna for 5G sub-band applications Haider Saad Najim; Mahmood Farhan Mosleh; Raed A. Abd-Alhameed
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1649-1660

Abstract

In this paper, a planar multiple input, multiple output (MIMO) dipole antenna for a future sub-6 GHz 5G application is proposed. The planar MIMO structure consists of 4 antenna elements with an overall size of 150×82×1 mm3. The single antenna element is characterized by a size of 32.5×33.7×1 mm3 printed on an FR-4 dielectric substrate with εr=4.4 and tanδ=0.02. The suggested antenna structure exhibits good impedance bandwidth equal to 3.24 GHz starting from 3.3 to 6.6 GHz with an S11 value of less than -10 dB (S11≤-10 dB) with antenna gain varying from 5.2 up to 7.05 dB in the entire band, which covers all the sub-6 GHz frequency band of the 5G application. Good isolation is achieved between the MIMO elements due to low surface waves inside the MIMO antenna substrate. The radiation of the MIMO antenna structure can be manipulated and many beam-types can be achieved as desired. The high-frequency structure simulator (HFSS) software package is used to design and simulate the proposed structure, while the CST MWS is used to validate the results.
An investigation of even ordered magic squares (4, 6, and 8): characteristic polynomials, eigenvalues, and encryption Saleem Al-Ashhab; Majdi Al-qdah
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1479-1489

Abstract

In this paper, we discuss and mathematically compute the eigenvalues and the characteristic polynomials of special even square matrices of orders 4x4 and 8x8. Also, we introduce two 8th order compound magic squares. The computed values are verified using Maple software. First, for the 4th order square matrix, the characteristic polynomial was derived to be: λ(λ-2s)( λ²+4Θ) with the eigenvalues: 0,2 s, and two other conjugates. In further analysis, we performed numerical classification of the squares for the matrices of order 4. Second, for the 8th order magic square, the characteristic polynomial was obtained in the form: λ3(λ-4s)(λ4+Ωλ2+θ) where Ω,Θ are constants; the eigenvalues are 0,4 s, ∓√λ1, ∓√λ2; where λ1, λ2 are the roots of the quadratic equation: λ2+Ωλ+Θ=0. Third, for the franklin square, we obtained the eigenvalues 0,4 s, and the roots of the equation: λ2+aλ+b. Finally, we suggested a hybrid image encryption technique based on Franklin magic square matrices and improved substitution technique. The proposed a grayscale image encryption/ decryption algorithm uses circular rotation of bits and Franklin magic squares’ properties in conjunction with substitution techniques to obtain a very secure algorithm against attacks.
Puzzle optimization algorithm with capsule networks based Telugu character recognition model Josyula Siva Phaniram; Mukkamalla Babu Reddy
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 3: September 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i3.pp1681-1688

Abstract

Recently, Telugu character recognition (TCR) becomes a hot research topic because of drastic increase in technological advancements such as multimedia, and smartphones. Though numerous works have been concentrated on offline TCR models, it is still needed to develop automated and intelligent online TCR models. This paper presents a novel puzzle optimization algorithm with capsule networks-based Telugu character recognition (POACN-TCR) model. The presented POACN-TCR model intends to effectively identify and recognize distinct Telugu characters online. To accomplish this, the POACN-TCR model primarily undergoes pre-processing in different ways such as normalization, smoothing, and interpolation. In addition, the POACN-TCR model designs an effective capsule network (CapsNet) model to generate feature vectors and hyperparameter optimization takes place using puzzle optimization algorithm (POA). Finally, the C4.5 decision tree classifier is utilized for the effectual recognition of Telugu characters. The utilization of POA for hyperparameter optimization of the CapsNet model helps in achieving improved recognition performance. For ensuring the enhanced outcomes of the POACN-TCR model, a wide-ranging experimental analysis is performed and the outcomes pointed out the betterment of the POACN-TCR model on the recent approaches.

Filter by Year

2022 2022


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