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
Cloud based secured framework for implementation of online voting system K S Gururaj; Dr K Thippeswamy
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 1: July 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i1.pp328-335

Abstract

Accessing and Utilization of data and information from remote location is one of the major requirements of present world. Due to the increase in the requirement of the data access from remote locations, challenges in the enhancement of technology based systems also have increased proportionately. Technology based solution for accessibility of remote data with available infrastructure is the need of the hour. Implementation of technology based solutions for the challenges may be expensive due to the current technical limitations. In this paper, we have attempted to design a secured cloud based framework for Online Voting System and analyzed its performance based on the three cryptographic algorithms namely Blowfish, AES and RSA.
KAMAN Protocol for Preventing Virtual Side Channel Attacks in Cloud Environment Hardeep Kaur; Manjit Kaur
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 1: July 2015
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Now’s a day cloud computing is widely accepted all around the world used for public utilities and on demand computing services. It provides lots of benefits like storage, easy access to system anytime, broad network access, resource pooling etc. Various attacks can be performed by attackers or intruder due to its large emergence. In these days security and privacy of user’s data is main concern. An attacker can access and analyse the data of users by penetrating in the cloud by different approaches. An unintelligent cloud service provider or cloud resource management can significantly increases the leakage of the information of the users.  In this paper virtual side channel attack is described where attacker hijack all the credential of authorized user and access his data. A proposed solution is provided to isolate the attack. DOI:  http://dx.doi.org/10.11591/telkomnika.v15i1.8088 
Bearing Fault Diagnosis Based on Laplace Wavelet Transform Hui Li; Yingjie Yin
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 8: December 2012
Publisher : Institute of Advanced Engineering and Science

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

Abstract

The roller bearing characteristic frequencies contain very little energy, and are usually overwhelmed by noise and higher levels of structural vibrations. Therefore, envelope spectrum analysis is widely used to detection bearing localized fault. In order to overcome the shortcomings in the traditional envelope analysis in which manually specifying a resonant frequency band is required, a new approach based on the fusion of the Laplace wavelet transform and envelope spectrum is proposed for detection and diagnosis defects in roller element bearings. The basic principle is introduced in detail. Laplace wavelet transform is self-adaptive to non-stationary and non-linear signal. The methodology developed in this paper decomposes the original times series data in intrinsic oscillation modes, using the Laplace wavelet transform. Then the envelope spectrum is applied to the selected daughter wavelet that stands for the bearing faults. The experimental results show that Laplace wavelet can extract the impulse response from strong noise signals and can effectively diagnose the faults of bearing. DOI: http://dx.doi.org/10.11591/telkomnika.v10i8.1653
Research on the Public Transport Network Based on Complex Network Dan Wang; Beilei Li; Jiayang Li; Changtong Li; Liyong Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 6: June 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i6.pp4833-4839

Abstract

The public transport infrastructure of a city is one of the most important indicators of its economic growth and development. Here we investigate the statistical properties of the public transport network in Shenyang to explore its various properties based on complex network theory. The statistical properties of the public transport system consist of the degree of a node, the average shortest path length, the clustering coefficient of a node, the average clustering coefficient, and the degree distribution. In contrast with the small world evolution model, we find that the public transport system of Shenyang, a network of public transportation routes connected by bus links, is a small-world network characterized by a Poisson degree distribution. Simulation results show that the public transport network exhibits small world behavior with N=148.
Efficiency Analysis of Scale-free Network Cascading Failures under Different Types of Attacks Yuanni Liu; Hong Tang; Guofeng Zhao; Yunpeng Xiao; Chuan Xu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 10: October 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Cascading failures are common in most of the networks, which can result in a congestion regime with degradation in the network performance. In order to investigate how a small shock can trigger avalanches mechanisms affecting a considerable fraction of the network, lots of failure models have been constructed. In this paper, Based on our AHP network cascading model, we have estimated how the efficiency will be affected when coefficients of K, S, T changed, we  find the fact  that the network efficiency of BA network is determined by its attacked types, and  the efficiency  is largely influenced by the attacked types of K and S, and under the same number of failure node, the efficiency under attacks of types T and I are relatively higher than that of the efficiency under attacks of types S and K , and the importance I is largely determined by the proportion of T, when the node failure number is equal, the higher proportion of T, the  higher efficiency it is  under I type attacks. We also tabled some proposals for reducing the damage that the networks suffered from the cascading failures. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.2968
Supervised data mining approach for predicting student performance Wan Fairos Wan Yaacob; Syerina Azlin Md Nasir; Wan Faizah Wan Yaacob; Norafefah Mohd Sobri
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 3: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i3.pp1584-1592

Abstract

Data mining approach has been successfully implemented in higher education and emerge as an interesting area in educational data mining research. The approach is intended for identification and extraction of new and potentially valuable knowledge from the data. Predictive model developed using supervised data mining approach can derive conclusion on students' academic success. The ability to predict student’s performance can be beneficial for innovation in modern educational systems. The main objective of this paper is to develop predictive models using classification algorithm to predict student’s performance at selected university in Malaysia. The prediction model developed can be used to identify the most important attributes in the data. Several predictive modelling techniques of K-Nearest Neighbor, Naïve Bayes, Decision Tree and Logistic Regression Model models were used to predict student’s performance whether excellent or non-excellent.  Based on accuracy measure, precision, recall and ROC curve, results show that the Naïve Bayes outperform other classification algorithm.  The Naïve Bayes reveals that the most significant factors contributing to prediction of excellent students is when the student scores A+ and A in Multivariate Analysis; A+, A and A- in SAS Programming and A, A- and B+ in ITS 472.
Substation Fault Diagnosis Based on Rough Sets and Grey Relational Analysis Haiying Dong; Xiaonan Li; Zhanhong Wei
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: February 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

As the 750kV substation has the characteristics like incomplete information, uncertain diagnosis result and dual protection configuration, a fault diagnosis method of substation with redundant protection configuration based on rough sets and grey relational analysis is proposed. In this method, the diagnosis decision table which takes advantage of information about wave-recording devices and two protective devices is constructed and simplified, and the minimal reduction can be obtained by using knowledge acquisition method based on rough set; Based on the point, the comparative sequence and reference sequence is established. Through the use of grey relational analysis, the grey relational grade of attributes and failure rate of suspicious fault components is determined in the reduction table, and furthermore obtain a certain diagnosis result. The result shows that the proposed method is effective. DOI : http://dx.doi.org/10.11591/telkomnika.v12i2.3636
A New Approach to Sensor Energy Saving Algorithm Peng Zhu; Fei Jia
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 5: May 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Wireless sensor network energy saving algorithm is a popular topic in recent researches. This paper proposes a new LEACH based energy saving algorithm to prolong the life of wireless sensor network. In this algorithm, sensors are divided into several static clustering. And each sensor takes turns to act as clustering head. Meanwhile, in order to reduce the network communication flow, the algorithm transports as little control signals as possible. Simulation results show that the algorithm proposed by this article is better than traditional fixed energy saving clustering algorithm in prolonging network’s life cycle. DOI: http://dx.doi.org/10.11591/telkomnika.v11i5.2478
A Novel Technique for Vector Control of Single-Phase Induction Motors Based on Rotor Field-Oriented Control Mohammad Jannati; Sajad Abdollahzadeh Anbaran; Nik Rumzi Nik Idris; Mohd Junaidi Abdul Aziz
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 12: December 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i12.pp8104-8113

Abstract

Due to asymmetrical characteristics of single-phase IMs, conventional vector control methods for three-phase IMs cannot be directly applied to single-phase IMs. This study aims to improve performance of the single-phase IMs drive system. Hence, a novel control approach based on Rotor Field-Oriented control (RFOC) was developed for single-phase IMs. For this purpose, transformation matrices are applied to the machine equations. It is shown by applying these transformation matrices to the unbalanced equations of single-phase IM results in set of balanced equations with backward and forward components. Therefore, by some modifications in the conventional RFOC method for three-phase IM, vector control of single-phase IM can be done. The proposed method demonstrates reasonably good speed and torque responses with satisfactory tracking capability. It is shown the effect of using this supposition is reflected on the motor torque and hence speed oscillations. Due to good tracking capability of proposed drive system, this control technique can be a well-suited candidate for application where precise move of IM in required such as cutting, knurling and deformation processes.
Mathematical study of the mean communication distances at lognormal shadow fading and Nakagami fading Souparnika Subhash Jadhav; Nagesh K. N; Ravi Chaurasia
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 2: May 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i2.pp1104-1111

Abstract

Over some few decades, the communication distance and connectivity at wireless sensor network (WSN) has got noticeable attention from the researchers. In general, the communication process in WSN ad-hoc occurs without some wired infrastructure and, the communication process done through a ‘single-hop’ transmission, where the intermediate nodes called as relay nodes are used in long distance communication and the nodes are capable to transmit and receive the data packets. In this paper, we presented a computational analysis of communication distance in WSN in the presence of fading effects such as nakagami-m fading and lognormal fading. An extensive investigation at both nakagami-m fading and lognormal fading is carried out to provide optimize communication in ad-hoc WSN. In addition, individual wireless nodes have the similar range of communication, is assumed to get the precise communication distance and coverage area in a WSN, where it is required to get mean communication distance. In result analysis section, several validation parameters such as transmitted power, attenuation constant and different number of fading factor is considered to provide proper analytical view. 

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