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 70 Documents
Search results for , issue "Vol 21, No 1: January 2021" : 70 Documents clear
Optimal PID controller design using artificial bee colony algorithm for robot arm Ghassan A. Sultan; Muhammed K. Jarjes
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.pp84-91

Abstract

Proportional integral derivation (PID) controller is used in this paper for optimal design, and tuning by zeigler and nichol (ZN) with artificial bee colony algorithm. The best parameter were found using these algorithms for best performance of a robot arm. The advantage of using ABC were highlighted. The controller using the new algorithm was tested for valid control process. Different colony size has been performed for tuning process, settling time, from time domain performance, rise time, overshot, and steady state error with ABC tuning give better dynamic performance than controller using the (ZN).
Live to learn: learning rules-based artificial neural network Aseel Shakir I. Hilaiwah; Hanan Abed Alwally Abed Allah; Basim Akhudir Abbas; Tole Sutikno
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.pp558-565

Abstract

An extensive review of the artificial neural network (ANN) is presented in this paper. Previous studies review the artificial neural network (ANN) based on the approaches (algorithms) used or based on the types of the artificial neural network (ANN). The presented paper reviews the ANN based on the goal of the ANN (methods, and layers), which become the main objective of this paper. As a famous artificial intelligent model, ANN mimics the human nervous system in handling the information transmited by different nodes (also known as neurons) in this model. These nodes are stacked in layers and work collectively to bring about solution to complex problems. Numerous structures exist for ANN and each of these structures is designed to addressa a specific task. Basically, the ANN architecture is comprised of 3 different layers wherein the first layer rpresents the input layer that consist of several input nodes that represent the input parameterfor the model. The hidden layer is te second layer and consists of a hidden layer of neurons. The neurons in this layer are directly connected to the neurons in the output layer. The third layer is the output layer which is the models’ response layer. The output layer neurons have the activation functions for the calculation of the ANN final output. The connection between the nodes in the ANN model is mediated by synaptic weights. This paper is a comprehensive study of ANN models and their layers.
Spatial optical transmitter based on on/off keying line coding modulation scheme for optimum performance of telecommunication systems Hazem M. El-Hageen; Aadel M. Alatwi; Ahmed Nabih Zaki Rashed
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.pp305-312

Abstract

This study has presented a spatial optical transmitter based on on off keying line coding modulation scheme for the optimum performance of telecommunication systems. The encircled flux versus fiber core radius, the 3D graph for fiber mode versus core radius, and the signal power level in dBm versus wavelength through coarse wavelength division multiplexing with a fiber length of 20 km are presented and discussed in detail. The total power measured in W and dBm as well as the signal power amplitude level obtained through the infinite impulse response (IIR) filter based on both Z domain and pole/zero coefficient filter types are illustrated clearly. Signal gain, noise figure, maximum Q factor, and received power are also clarified against bit rates for various modulation line coding schemes.
A novel branch current flow-based construction of microgrids Kavitha Sivakumar; Jayashree R; Karthikeyan Danasagaran
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.pp28-36

Abstract

An efficient procedure for defining the boundaries of microgrids in smart distribution systems during distributed generation expansion planning becomes an important consideration in constructing smart grids. A novel approach named "Modified Reverse Current Flow Method" is proposed in this paper to split a large radial distribution system into a required number of self-adequate microgrids. This cluster of microgrids will be capable of utilizing maximum power output of the distributed renewable energy generators and will act as highly reliable zones, during both islanded and grid-connected modes. This method is based on the trend reversal of the flow of current in the various parts of the circuit. This paper uses the practical machine operating curves of the distributed generators to calculate their reactive power output. For the considered distribution system, the proposed method is applied to find the optimal point of operation and the boundaries of microgrids. To bring out the superiority of this novel method, the improvement in reliability indices and economic savings of this method are compared with the results obtained using a similar method available in the literature. This method has several notable merits, namely, increased accuracy in the calculation of annual energy losses and the voltage profile. 
Security schemes based on conditional privacy-preserving vehicular ad hoc networks Mahmood A. Al-shareeda; Mohammed Anbar; Murtadha A. Alazzawi; Selvakumar Manickam; Iznan H. Hasbullah
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.pp479-488

Abstract

Recently, vehicular ad hoc networks (VANETs) have been garnering significant inter-est from the people involved in transportation field. Nowadays automotive manufactur-ers have already supplying vehicles with multitude of road sensors that provides many useful characteristics. VANET communication not only offers the drivers and passen-gers with the various safety related services but also provides a wide range of valuable applications. However, the inherent openness of the wireless communication medium used by VANETs exposes vehicles to various security and privacy issues. Researchers have proposed many security schemes to solve the issues mentioned above for the widespread deployment of VANETs. However, these schemes failed to fulfill all as-pects of security and privacy requirements. Besides, these schemes have not provided the performance parameters such as computation and communication costs. The pri-mary emphasis of this paper is on the taxonomy of security schemes based conditional privacy-preserving with respect to strengths and limitations. Besides, a comparison be-tween these schemes related to the model of security and privacy requirements, attacks, and performance parameters is provided. Finally, this paper critically reviews the re-lated works by taking into consideration the design and development of all VANETs security and privacy schemes, this paper could serve as a guide and reference.
Data mining approach to analyzing intrusion detection of wireless sensor network Md Alauddin Rezvi; Sidratul Moontaha; Khadija Akter Trisha; Shamse Tasnim Cynthia; Shamim Ripon
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.pp516-523

Abstract

Wireless sensor network (WSN) is a collection of wireless sensor nodes which are distributed in nature and a base station where the dispersed nodes are used to monitor and the physical conditions of the environment is recorded and then these data are organized into the base. Its application has been reached out from critical military application such as battlefield surveillance to traffic, health, industrial areas, intruder detection, security and surveillance. Due to various features in WSN it is very prone to various types external attacks. Preventing such attacks, intrusion detection system (IDS) is very important so that attacker cannot steal or manipulate data. Data mining is a technique that can help to discover patterns in large dataset. This paper proposed a data mining technique for different types of classification algorithms to detect denial of service (DoS) attacks which is of four types. They are Grayhole, Blackhole, Flooding and TDMA. A number of data mining techniques, such as KNN, Naïve Bayes, Logistic Regression, support vector machine (SVM) and ANN algorithms are applied on the dataset and analyze their performance in detecting the attacks. The analysis reveals the applicability of these algorithms for detecting and predicting such attacks and can be recommended for network specialist and analysts. 
Corpus-based technique for improving Arabic OCR system Ahmed Hussain Aliwy; Basheer Al-Sadawi
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.pp233-241

Abstract

An optical character recognition (OCR) refers to a process of converting the text document images into editable and searchable text. OCR process poses several challenges in particular in the Arabic language due to it has caused a high percentage of errors. In this paper, a method, to improve the outputs of the Arabic Optical character recognition (AOCR) Systems is suggested based on a statistical language model built from the available huge corpora. This method includes detecting and correcting non-word and real words error according to the context of the word in the sentence. The results show that the percentage of improvement in the results is up to (98%) as a new accuracy for AOCR output. 
Validation of android-based mobile application for retrieving network signal level Kehinde A. Adeniji; Nazmat T. Surajudeen-Bakinde; Olusegun O. Omitola; Adedayo Ajibade
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.pp296-304

Abstract

In recent years, the evolvement of mobile devices which perform sophisticated functions have been on the rise. Mobile applications which solved engineering challenges are now available due to the high computational capabilities, large random access memory and storage location of the mobile devices. An Android application called signal detect, which measures network signal strength value from 2G-4G received on an android mobile device has been developed using android app development environment called Android studio. Validation becomes necessary because different readings were obtained on smartphones with different specifications. Two validation techniques were used to validate the data obtained. To know the efficiency of the application; a field strength meter was used to compare the readings received on the mobile device with the meter. It was observed that there is a time lag on the received values of the mobile device to the field strength meter. Therefore, a moving average technique was used to correlate the two data which increased the correlation coefficient to about 0.85.
Performance investigations of internet protocol versions for mobile Ad-hoc network based on qualnet simulator Jaber H. Majeed; Najmah Abed Habeeb; Waleed Khalid Al-Azzawi
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.pp497-504

Abstract

A mobile ad hoc network (MANET) can be seen as a mobile nodes collection having no support of fixed infrastructure and therefore its communication is totally dependent on the network's nodes. As a result of the mobility of nodes, rapid and unpredictable changes occur within the mobile ad hoc network (MANET) arrangements. Therefore, this makes the analysis of routing protocols very crucial so as to enhance efficient communication between the wireless nodes. IPv4 and IpV6 within the MANET is another issue of concern. IPv4 which has been traditionally used for ages and IPv6; predicted to be the forthcoming network architecture model is investigated because of its protection which has been improved as well as its enormous address space provision. The analysis on Ad Hoc On Demand Vector and Dynamic Manet On Demand routing protocols are performed using Qualnet simulator under the IPv4 and IPv6 standards. A thorough evaluation of the usability and functionality of the simulator software is carried out. The metrics for performance are; Throughput, End-to-End Delay and Average jitter. Afterwards, analyses and summary of the results is conducted and summarized in order to make available an assessment of their performances.
Fuzzy encoding with hybrid pooling for visual dictionary in food recognition Mohd Norhisham Razali; Noridayu Manshor; Alfian Abdul Halin; Norwati Mustapha; Razali Yaakob
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.pp179-195

Abstract

Tremendous number of f food images in the social media services can be exploited by using food recognition for healthcare benefits and food industry marketing. The main challenges in food recognition are the large variability of food appearance that often generates a highly diverse and ambiguous descriptions of local feature. Ironically, the ambiguous descriptions of local feature have triggered information loss in visual dictionary constructions from the hard assignment practices. The current method based on hard assignment and Fisher vector approach to construct visual dictionary have unexpectedly cause errors from the uncertainty problem during visual word assignation. This research proposes a method of combination in soft assignment technique by using fuzzy encoding approach and maximum pooling technique to aggregate the features to produce a highly discriminative and robust visual dictionary across various local features and machine learning classifiers. The local features by using MSER detector with SURF descriptor was encoded by using fuzzy encoding approach. Support vector machine (SVM) with linear kernel was employed to evaluate the effect of fuzzy encoding. The results of the experiments have demonstrated a noteworthy classification performance of fuzzy encoding approach compared to the traditional approach based on hard assignment and Fisher vector technique. The effects of uncertainty and plausibility were minimized along with more discriminative and compact visual dictionary representation.

Filter by Year

2021 2021


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