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 9,199 Documents
Modified MVR-CORDIC Algorithm and it’s Application in Attitude Measurement Jiang Haitao; Shang Xiaoxing
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: March 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Aiming at attitude measurement with 51 MCU, The speed and efficiency of basic MVR-CORDIC (Modified Vector Rotational-Coordinate Rotation Digital Computer) are lower, we lists the steps used to measure the heading in rotate mode. Considered the features of the 51-MCU and the MVR-CORDIC algorithm, some new schemes about iteration number and searching algorithm are presented to improve the speed. this modified algorithm is tested and compared in 51-MCU, the experiment result shows that adaptive iteration makes iteration times to 67 percents of the general numbers and the modified searching algorithm reduces 57 percents of the normal iteration time. The experimental results show that the Angle indicator system has high resolution; accuracy of pitch Angle within the ±0.4°; the accuracy of roll within the ±0.4° when pitch angle is not more than 80°, which meet the measuring system accuracy. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2180 
Image Resolution Enhancement Using Transform Syed Nazeeburrehman; Mohameed Ali Hussain
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 2: February 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i2.pp354-356

Abstract

In this project, interruption based image resolution enhancement technique using Discrete Wavelet Transform (DWT) with high-frequency sub bands obtained is proposed. Input images are decomposed by using DWT in this proposed enhancement technique. Inverse DWT is used to generate a new resolution enhanced image from the interpolation of high-frequency sub band images and the input low-resolution image. Intermediate stage has been proposed for estimating the high frequency sub bands to achieve a sharper image. It has been tested on benchmark images from public database. Peak Signal-To-Noise Ratio (PSNR) and visual results show the dominance of the proposed technique over the predictable and state-of-art image resolution enhancement techniques.
A new class of BFGS updating formula based on the new quasi-newton equation Basim Abbas Hassan; Hussein K. Khalo
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 3: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i3.pp945-953

Abstract

Quasi-Newton methods” are amongst the mainly useful and competent iterative process for solving unrestrained minimization functions. In this paper we derive a new quasi-Newton equation with on the Hessian estimate updates and alterations intended at developing their performance. The “Numerical results” illustrate that the proposed technique useful for the known test functions.
Artificial neural network model and fuzzy logic control of dissolved oxygen in a bioreactor Nor Hana Mamat; Samsul Bahari Mohd Noor; Laxshan A/L Ramar; Azura Che Soh; Farah Saleena Taip; Ahmad Hazri Ab. Rashid
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 3: March 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i3.pp1289-1297

Abstract

In a fermentation process, dissolved oxygen is the one of the key process variables that needs to be controlled because of the effect they have on the product quality. In a penicillin production, dissolved oxygen concentration influenced biomass concentration. In this paper, multilayer perceptron neural network (MLP) and Radial Basis Function (RBF) neural network is used in modeling penicillin fermentation process. Process data from an industrial scale fed-batch bioreactor is used in developing the models with dissolved oxygen and penicillin concentration as the outputs. RBF neural network model gives better accuracy than MLP neural network. The model is further used in fuzzy logic controller design to simulate control of dissolved oxygen by manipulation of aeration rate.  Simulation result shows that the fuzzy logic controller can control the dissolved oxygen based on the given profile.
Semantic Representation of Complex Resource Requests for Service-oriented Architecture Xing Wang; Changwang Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: January 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Many open distributed systems across Internet such as those in grid computing and e-Commerce involve the requesting, allocation and maintenance of sorts of resources. The discovery of large amount of resources in different sites is an important issue for the design of these systems. The booming semantic Web technology provides a suitable infrastructure for the publishing, requesting and matchmaking of resources. This paper presents a generic representation for quantified resource requesting with Semantic Web. It allows the representation of complex resource descriptions such as containment hierarchies and disjoint constraints between them. A model-theoretic semantics for matchmaking with countable resources is given for this representation. A constraint-based technique for the matchmaking check with such representation is designed DOI : http://dx.doi.org/10.11591/telkomnika.v12i1.3350
Path Planning for Coalmine Rescue Robot Based on Hybrid Adaptive Artificial Fish Swarm Algorithm Yao Zheng-Hua; Ren Zi-Hui; Zhu Xian-Hua; Li Shi-Chun
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 10: October 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i10.pp7223-7232

Abstract

For the problem with imprecise optimal solution and reduced convergence efficiency of basic artificial fish swarm algorithm (BAFSA) in the late, the adaptive enhanced prey behavior of artificial fish and the segmented adaptive strategy of artificial fish’s view and step were designed. The hybrid adaptive artificial fish swarm algorithm (HAAFSA) was structured by the adaptive enhanced prey behavior and the segmented adaptive strategy of artificial fish’s view and step, which has been verified on research. According to the characteristics of the coalmine rescue environment, the path planning environment model was established in two-dimensional plane and the optimization constraints conditions were disposed by detecting the distance between path sections and barriers. The HAAFSA was applied to coalmine rescue robot path planning. Simulation results showed that the HAAFSA could improve the performance of the optimal path.
Online Prediction of Transient Instability by Wide Area Measurement System Farhad Namdari; Maryam Nourizadeh; Mahmoodreza Shakarami
Indonesian Journal of Electrical Engineering and Computer Science Vol 1, No 1: January 2016
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In this paper an online accurate prediction method is proposed to enhance the speed of Transactionient stability assessment. This method is the measurement basis technique resulted from wide area measurement systems (WAMS). In the proposed method, the generators with same dynamic behavior, referred as to coherent generators, are clustered as a same group and they can be considered as an equivalent bus. So the system will be reduced into a small scale system. The admittance matrix parameters of the reduced system can be identified with the least square algorithm. Then the trajectory prediction is performed by real-time simulations. Obtained results from simulations on New England test system show the high noticeable efficiency for performance of the proposed method, capable in predicting of the disturbed trajectory under existence of unknown parameters in grid structure.. 
Ontology Matching using BabelNet Dictionary and Word Sense Disambiguation Algorithms Mohamed Biniz; Rachid el Ayachi; Mohamed Fakir
Indonesian Journal of Electrical Engineering and Computer Science Vol 5, No 1: January 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v5.i1.pp196-205

Abstract

Ontology matching is a discipline that means two things: first, the process of discovering correspondences between two different ontologies, and second is the result of this process, that is to say the expression of correspondences. This discipline is a crucial task to solve problems merging and evolving of heterogeneous ontologies in applications of the Semantic Web. This domain imposes several challenges, among them, the selection of appropriate similarity measures to discover the correspondences. In this article, we are interested to study algorithms that calculate the semantic similarity by using Adapted Lesk algorithm, Wu & Palmer Algorithm, Resnik Algorithm, Leacock and Chodorow Algorithm, and similarity flooding between two ontologies and BabelNet as reference ontology, we implement them, and compared experimentally. Overall, the most effective methods are Wu & Palmer and Adapted Lesk, which is widely used for Word Sense Disambiguation (WSD) in the field of Automatic Natural Language Processing (NLP).
An Efficient Approach to Detecting Missing Tags in RFID Data Stream Nur’Aifaa Zainudin; Hairulnizam Mahdin; Deden Witarsyah; Mokhairi Makhtar; Mohd Izuan Hafez Ninggal; Zirawani Baharum
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: September 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v11.i3.pp1204-1213

Abstract

RFID technology is a Radio frequency identification system that provides a reader reading the data item from its tag. Nowadays, RFID system has rapidly become more common in our life because of its autonomous advantages compared to the traditional barcode. It can detect hundreds of tagged items automatically at a time. However, in RFID, missing tag detection can occur due to signal collisions and interferences. It will cause the system to report incorrect tag’s count due to an incorrect number of tags being detected. The consequences of this problem can be enormous to business, as it will cause incorrect business decisions to be made. Thus, a Missing Tag Detection Algorithm (MTDA) is proposed to solve the missing tag detection problem. There are many other existing approaches has been proposed including Window Sub-range Transition Detection (WSTD), Efficient Missing-Tag Detection Protocol (EMD) and Multi-hashing based Missing Tag Identification (MMTI) protocol. The result from experiments shows that our proposed approach performs better than the other in terms of execution time and reliability.
Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems Aadel M. Alatwi; Ahmed Nabih Zaki Rashed; Ahmed M. El-Eraki; Iraj Sadegh Amiri
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 2: August 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i2.pp847-854

Abstract

This study has clarified the best candidate routing algorithms integrated with minimum processing times and low blocking probabilities for modern parallel computing systems. Different methods were employed, such as the fast window method (FWM), fast bitwise window method (FBWM), and fast improved window method (FIWM), to upgrade the processing time and reduce the network delay time. In addition, different algorithms were studied such as the fast window ascending, the fast window descending, the fast window sequential algorithm, and the fast window sequential down algorithms; these were studied to show the numerical results of the networks’ blocking probabilities, processing times, and delay times.

Filter by Year

2012 2026


Filter By Issues
All Issue Vol 41, No 3: March 2026 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