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 68 Documents
 3   4   5   6   7 
Search results for , issue "Vol 20, No 1: October 2020" : 68 Documents clear
Sensitivity analysis based artificial neural network approach for global solar radiation prediction in India Rajasekaran Meenal; A. Immanuel Selvakumar; Prawin Angel Michael; Ekambaram Rajasekaran
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp31-38

Abstract

The objective of this paper is to build an artificial neural network model to predict global solar radiation (GSR) with improved accuracy using less number of best input parameters selected using sensitivity analysis. In this work, the input parameters used for training the artificial neural network (ANN) models are bright sunshine duration, maximum and minimum temperature, day length, months, extra terrestrial radiation (H0), relative humidity and geographical parameters of the locations namely the latitude and longitude. Sensitivity analysis is used to discover how the output data are influenced by the changeability of the input data.Three ANN models namely T-ANN, S-ANN and TS-ANN are proposed with most suitable input parameters selected using sensitivity analysis. The principle of this feature selection using sensitivity analysis is to improve the prediction accuracy of solar radiation models with less number of inputs. The proposed ANN model is also tested under noisy data and proved that ANN is able to perform reasonably good in GSR prediction on practical applications where the data is affected by noise caused by errors on measuring, fault of data acquisition system, recording problems, and so on.
An overview of traffic congestion detection and classification techniques in VANET Nurshahrily Idura Ramli; Mohd Izani Mohamed Rawi
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp437-444

Abstract

Vehicular traffic congestion has been and still is a major problem for many countries and knowledge about the traffic condition is important in order to schedule, plan and avoid traffic congestion. With recent development in technology, various efforts and methods are proposed in mitigating traffic congestion. Vehicular Ad-hoc NETwork (VANET) is very much in the hype in addressing this issue due to its capabilities and adaptation to scalability, highly dynamic topology as well as cooperative communication. A popular focus is in detecting and classisying traffic congestion which presents various techniques and methodologies. This paper presents an overview of traffic congestion detection and classification methods of various related techniques in VANET, organized from the research perspective. Qualitative analysis is presented to classify these strategies in its system architecture, detection and classification methods, as well as its simulated mobility environment and simulation tools used. The analysis is useful in understanding all the techniques and methods applied in resolving this issue in the research domain. 
Improving data quality using a deep learning network Chulhyun Hwang; Kyouhwan Lee; Hoekyung Jung
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp306-312

Abstract

IoT data is collected in real time and is treated as highly reliable data because of its high precision. However, it often exhibits incomplete values for reasons such as sensor aging and failure, poor operating environment, and communication problems. The characteristics of IoT data transmitted with high precision and time series are suitable to use LSTM, which is one kind of RNN. In this paper, when applying LSTM to data quality improvement in IoT environment where data are collected simultaneously from several sensors, it is suggested that it is effective to construct LSTM individually for each sensor accuracy.
Optimal short-term hydro-thermal scheduling using multi-function global particle swarm optimization Surender Reddy Salkuti
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp537-544

Abstract

An optimal short-term hydro-thermal scheduling (ST-HTS) problem is solved in this paper using the multi-function global particle swarm optimization (MF-GPSO). A multi-reservoir cascaded hydro-electric system with a non-linear relationship between water discharge rate, power generation and net head is considered in this paper. The ST-HTS problem determines the optimal power generation of hydro and thermal generators which is aimed to minimize total fuel cost of thermal power plants during a determined time period. Effects of valve point loading and prohibited operating zones in the fuel cost function of the thermal power plants is examined. Power balance, reservoir volume, water balance and operation constraints of hydro and thermal plants are considered. The effectiveness and feasibility of MF-GPSO algorithm is examined on a standard test system, and the simulation results are compared with other algorithms presented in the literature. The results show that the MF-GPSO algorithm appears to be the best in terms of convergence speed and optimal cost compared with other techniques reported in the literature.
Deep image mining for convolution neural network Dhamea A. Jasm; Murtadha M. Hamad; Azmi Tawfek Hussein Alrawi
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp347-352

Abstract

Image mining is the method of searching and discovering valuable information and knowledge from a huge image dataset. Image mining is based on data mining, digital image processing, machine learning, image retrieval, and artificial intelligence. Image mining handled with the hidden information extraction, an association of image data and additional pattern which are not clearly visible in the image. Choosing the proper objects or the feature of the image to be suitable for image mining process is the main challenge would face the programmer. The process includes fine out the most efficient routes at a shorter time and saving the users effort. The main objective of this paper is to design and implement the image classification system with a higher performance, where a CIFAR-10 data set is used to train and testing classification models using CNN. A convolutional neural network is trustworthy, and it could lead to high-quality results. The high accuracy of 98% has been obtained using deep convolutional neural network (DCNN).
Impact of engineering parameters on performance of relay-assisted network Issam Maaz; Jean-Marc Conrat; Jean-Christophe Cousin; Samer Alabed
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp248-255

Abstract

This paper compares the performance of a relay assisted network to the performance given by a classical macrocell network without the presence of relay node schemes. The capacity enhancement provided by a relaying system as a function of the relay antenna height and the propagation environment surrounding the relay nodes is analyzed and discussed in details. The analysis in this work is based on the theoretical Shannon capacity where both measured/experimental path loss and calibrated path loss models are taken into consideration. In this work, we assume a decode and forward scheme, a full-duplex relaying protocol and an optimized relay location is investigated. A 30 % of improvement in the macrocell capacity is achieved with the usage of relaying scenario compared to a classical macrocell network. Furthermore, increasing the relay antenna height from 4 meters to 12 meters can significantly increase the relay capacity to more than 20 % in suburban and moderate urban environments.
Neutral expression synthesis using kernel active shape model Marcella Peter; Jacey-Lynn Minoi; Suriani Ab Rahman
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp150-157

Abstract

This paper presents a modified kernel-based Active Shape Model for neutralizing and synthesizing facial expressions. In recent decades, facial identity and emotional studies have gained interest from researchers, especially in the works of integrating human emotions and machine learning to improve the current lifestyle. It is known that facial expressions are often associated with face recognition systems with poor recognition rate. In this research, a method of a modified kernel-based active shape model based on statistical-based approach is introduced to synthesize neutral (neutralize) expressions from expressional faces, with the aim to improve the face recognition rate. An experimental study was conducted using 3D geometric facial datasets to evaluate the proposed modified method. The experimental results have shown a significant improvement on the recognition rates.
Optimal power scheduling for economic dispatch using moth flame optimizer N. A. M. Kamari; M. A. Zulkifley; N. F. Ramli; I. Musirin
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp379-384

Abstract

This paper proposes the optimal generator allocation to solve economic dispatch (ED) problem in power system using moth flame optimizer (MFO). With this approach, the optimum power for each unit generating in the system will be searched based on the power constraints per unit and the amount of power demand. The objective function of this study is to minimize the total cost of generation. The amount of power loss is measured to determine the effectiveness of the proposed technique. The performance of the MFO technique is also compared to the evolutionary programming (EP) and particle swarm optimization (PSO) methods. Five- and thirty-bus power system networks are selected as test systems and simulated using MATLAB. Based on simulation results, MFO provides better results in regulating the optimum power generation with minimum generation cost and power loss, compared to EP and PSO.
Hybrid order characteristics in car-following behavior Chunling Tu; Shengzhi Du
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp158-166

Abstract

This paper addresses the discovery of an interesting property in car-following processes, which was not reported in the existing literatures. A hybrid order behavior is supported by both experimental data and theoretical simulations. To demonstrate this behavior, the first order and the second order car-following behaviors are defined. Then, by comparing the first and the second order car-following behaviors in the existing analystic models and the real traffic context, this paper finds that a significant amount of the second order car-following processes in real traffic context do not match the existing models and structural mismatches are observed. The popularity and significance of such cases suggest the existence of unmodelled dynamics in the existing methods, that is, the car following behavior should be determined by more factors than the immediate proceeding vehicle. Therefore, the existing car-following models must be improved to accommodate these factors. This forms one of the main values of this paper. This paper then defines the hybrid order car-following behavior and prompts to associate this behavior with the concerned unmodelled dynamics (mismatches between the actual traffic data and the simulation from models). The neural network is employed to model such dynamics. The idea of the proposed hybrid order behavior matches the fact that the car-following behavior is determined by multiple vehicles driving in front of the subject car instead of only the immediate proceeding one. This is valuable because it provides guidance on the improvement of existing car-following models. The neural network model validates that the consideration of multiple vehicles improves the accuracy of car-following modelling.
Design and implementation of pipelined and parallel AES encryption systems using FPGA Mohamed Nabil; Ashraf A. M. Khalaf; Sara M. Hassan
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp287-299

Abstract

The information security is one of the most important issues in the design of any communication network.One of the most common encryption algorithms is the advanced encryption standard (AES).The main problem facing the AES algorithm is the high time consumption due to the large number of rounds used for performing the encryption operation. The more time the encryption system consumes to encrypt the data, the more chances the hackers have to break the system.This paper presents two effective algorithms that can be used to solve the mentioned problem and to achieve an effective processing time reduction using pipelined and parallel techniques to perform the encryption steps. These algorithms are based on using certain techniques to make the system able to encrypt many different states (the data will be encrypted) in the same time with no necessity to wait for the previous encryption operation to be completed. These two algorithms are very effective especially for big data size. This paper describes in detail the AES encryption system algorithm and a detailed explanation for the proposed algorithms. Moreover, the research shows the implementation of the three algorithms: the traditional, the pipelined, and the parallel algorithms, and finally a comparison between them.

Page 5 of 7 | Total Record : 68

 3   4   5   6   7 

Filter by Year

2020 2020


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