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 67 Documents
Search results for , issue "Vol 19, No 3: September 2020" : 67 Documents clear
To the theory of electromagnetic radiation by fast moving body Sergey Gladkov
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1267-1274

Abstract

The problem of finding out the connection between the flight speed of a metal object and the length of electromagnetic radiation that accompanies its movement has been solved. The calculations are based on the application of Lienar-Vihert's potential theory. Based on the assumption of the dipole mechanism of radiation, the intensity of electromagnetic radiation was calculated and its distribution by coordinates was found. 
A distributed trust mechanism for malicious behaviors in VANETs Ali Kamil Ahmed; Mohanad Najm Abdulwahed; Behnam Farzaneh
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1147-1155

Abstract

Vehicular ad-hoc networks (VANETs) are one of the most important types of networks which are widely used in recent years. Along with all the benefits of quality of service (QoS) improvements, vulnerability analysis for this type of networks is an important issue. For instance, a gray-hole attack decreases network performance. We proposed a novel solution to help to secure these networks against this vulnerability. The proposed method can detect and prevent the gray-hole attack. Anywhere in the network, each node (vehicle) can distinguish between the gray-hole attack and the failed link. Some topology related information helps us to detect attacks more accurately. Also, the proposed method uses the most reliable path in terms of link failure when there is no malicious node. In this paper, we used the TOPSIS method for choosing the most trusted node for routing intelligently. We validated our proposal using a simulation model in the NS-2 simulator. Simulation results show that the proposed method can prevent Gray-hole attack efficiently with low overhead.
Design and implementation hamming neural network with VHDL Liqaa Saadi Mezher
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1469-1479

Abstract

Hamming Neural Network is type of artificial neural network consist of two types of layers (feed forward layers and recurrent layer). In this paper, two inputs of patterns in bianary number were used. In the first layer, two neurons and pure line function were used. In the second layer, three neurons and positive line function were used. Also applied Hamming Neural networks algorithm in three simulation methods (logical gate method, software program coding method and instant block diagram method). In this work in VHDL software program was used and FPGA hardware used.
Net energy metering scheme based on time of use pricing for residents in Malaysia Abdul Hafiz Bin Razali
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1140-1146

Abstract

The current Malaysia’s net energy metering (NEM) scheme has been updated in 2019 that credits excess generation into the next billing month at retail rate compare to at displaced cost. The new NEM may attract more installation of solar photovoltaic (PV) system among residential customers. However, it is discovered that customers with low monthly electricity consumptions are still not benefited since their electricity cost is lower than the PV generation cost. Implementing time-of-use (TOU) pricing on NEM scheme may overcome the problem as it based on hourly energy usage. This paper compares the annualized energy cost of residential PV system under different TOU prices and NEM scheme. The results show that an optimized TOU prices as suggested in this paper may give financial benefits to all residential customers with PV system, including the one with low monthly consumption.
A computing model for trend analysis in stock data stream classification Abdul Razak; Nirmala C. R
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

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

Abstract

For several decades, many statistical and scientific efforts took place for the better analysis or prediction of stock trading. But still it is open to offer new avenues for the scientists to rethink and discover new inferences by adopting latest technological scenarios. In this regard, this paper is trying to apply classification techniques on stock data stream through feature extraction for the trend analysis. The proposed work is involving k-means for clustering samples into two clusters (the stocks in trend as one cluster and another on as stocks not in trend). The trend analysis is done based on density estimation of the stocks with respect to sectors. A well-known data representation method that is histogram is used to represent the sector which is in trend. This work has been implemented and experimented by considering live NSE (India) data using python and its related tools.
Comparative analysis of sokal’s equations versus load-pull implementation of class E low-pass network Boodhoo Kirish; Farid Zubir; Mohamad Kamal A. Rahim; Shaharil Mohd Shah
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1348-1357

Abstract

In this paper, class E power amplifiers (PA) aimed at frequency bandwidth of 3.4 GHz to 3.6 GHz (LTE 42) and 3.6 GHz to 3.8 GHz (LTE 43) respectively are designed with objective of attaining high efficiency. The viability of Sokal’s equations for present communication systems aimed at GHz are analyzed for high efficiency using HEMT (high-electron-mobility transistor) on Nitronex NPTB00004 as opposed to the Bipolar Junction Transistor used by Sokal in 1975. Load-pull configuration techniques aimed at the drain is implemented at the output matching network (OMN) and benchmarked against Sokal’s equation. At the OMN, to suppress harmonics, band-pass filters are employed for the LTE 42 and 43 respectively. Sokal’s equation shows that the drain must be conjugately matched before his equations are applied at the OMN. The efficiency at 3.4 GHz obtained for Sokal’s circuit is at 67 % and gain of 9.3 dB. More than 65% efficiency is obtained from load-pull network at 3.4 GHz to 3.76 GHz before filter implementation while showing gain above 7.8 dB. After filter addition at OMN, the efficiency is above 65% and gain above 8 dB for dual - band having bandwidth of 3.4389 GHz - 3.542GHz and 3.6569GHz - 3.8GHz.
Automatic control system based on iot data identification Hankil Kim; Jaehyun Park; Hoekyung Jung
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Recently, as the internet of things (IoT) technology has developed, researches are rigorously conducted to construct smart environments such as smart home, smart grid, and industrial IoT. However, currently existing systems consists of a series of events, and even if an existing task is running, unnecessary work still occurs as both works happen simultaneously. In this paper, we propose an automatic work control system to solve this problem. The proposed system transmits the data measured by the sensor to the server and identifies non-real-time tasks such as real-time work which is related to the dangerous situations, ventilation and temperature control. In addition, priority among the tasks is set in a way that existing tasks are stopped when high priority tasks occur. Accordingly, this can reduce the unnecessary waste of power, and the user is able to receive a proactive service.
Performance evaluation of a single mode optical fiber tip sensor for glucose detection Nazirah Mohd Razali; Puteri Nadiah Syamimi Said Ja'afar; Sumiaty Ambran
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1407-1414

Abstract

Glucose must be carefully regulated to ensure its safety and quality. Nowadays, chemists often face difficulty to measure glucose concentrations as the current methods for the analysis are expensive and require complex procedures which have reduced the interest among chemists to use these techniques. This study evaluated the performance of a single mode optical fiber tip sensor for glucose detection. The sensing mechanism mainly depends on the Fresnel’s reflection that occurs at the flat fiber tip region while the sensor performance was evaluated based on its sensitivity and linearity. The sensor was tested in glucose solution at different concentration range; high range (0% - 14%), medium range (0% - 1.4%) and low range (0% - 0.14%). The sensor showed a good performance when sensing the glucose solution at high and medium concentration range with strong linearity of more than 90% and an average sensitivity of 0.0979 dBm/% and 0.1019 dBm/%, respectively. However, the low concentration range showed no significant changes during sensing. Based on the findings obtained in this study, the optical fiber tip sensor has the potential to be utilized for glucose detection and suitable for high and medium concentration range measurement.
Method of the adaptive decoding of self-orthogonal codes in telecommunication Juliy Boiko; Ilya Pyatin; Oleksander Eromenko; Mykhailo Stepanov
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1287-1296

Abstract

The methodology description of the adaptive multi-threshold decoding of self-orthogonal codes in the telecommunication channels of information transfer is shown in this paper. The method of multi-threshold decoder modification is described on the basis of adaptive filtration algorithms. Principles of adaptive algorithms application provide for necessary data transmission validity in the case of the multi-threshold decoding are explored. The graphic charts of multi-threshold decoders noise immunity of self-orthogonal block and convolutional codes are presented. It is determined the coding gain (CG) for multi-threshold decoding schemes. The result of research conducted in the course of the paper is to develop a set of scientifically grounded theoretical positions and practical recommendations and proposals for the development of mechanisms of formalization of description of method of increasing of noise immunity of telecommunication systems transmitting information to the synthesis and improving receiver circuit modulated signals on the theory and practice the use of signal-code constructions (SCC) when deciding maximize system capacity information transmission in the presence of noise.
A novel feature engineering algorithm for air quality datasets Raja Sher Afgun Usmani; Wan Nurul Farah Binti Wan Azmi; Akibu Mahmoud Abdullahi; Ibrahim Abaker Targio Hashem; Thulasyammal Ramiah Pillai
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1444-1451

Abstract

Feature engineering (FE) is one of the most important steps in data science research. FE provides useful features to be used later in the study. Due to climate change, the research focus is moving towards air quality estimation and the impacts of air pollution on health in Malaysia. Malaysia has 66 air quality monitoring (AQM) stations, and the air quality data for research is provided in an excel worksheet format by the Department of Environment, Malaysia. The data generated by the AQM stations is in a raw custom format, and it is virtually impossible to clean and engineer this data manually due to the sheer number of files. Hence, we propose a novel feature engineering algorithm to transform and combine this data into a useable format. The results show that the proposed feature engineering algorithm was able to efficiently extract and combine the hourly and daily values for pollutant and meteorological variables in useful row format. This algorithm will help all the researchers using the data from the AQM station in Malaysia as well as other countries using the same AQM station. The implementation of the feature engineering algorithm is also available to use at GitHub (https://github.com/rajasherafgun/featureengineeringaq) under AFL-3.0 license.

Filter by Year

2020 2020


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