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 103 Documents
 1   2   3   4   5 
Search results for , issue "Vol 12, No 3: March 2014" : 103 Documents clear
An Improved Prediction Approach on Solar Irradiance of Photovoltaic Power Station Haiying Dong; Lei Yang; Shengrui Zhang; Yuan Li
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Solar irradiance is the main factor which influences the photovoltaic output power. In order to predict the photovoltaic output power accurately, the prediction accuracy of irradiance should be improved. In terms of unsatisfactory prediction accuracy of irradiance of traditional photovoltaic power station, this paper presents an approach to predict solar irradiance of photovoltaic power station based on wavelet decomposition and extreme learning machine. In this method, the historical solar irradiance data is divided through the wavelet decomposition of three layers. Then the prediction models of irradiance are built based on the extreme learning machine. Finally, the solar irradiance is predicted with 15 minutes’ resolution one day ahead. With the decomposed components and the relative meteorological data as the input and the irradiance forecast data after wavelet reconstruction as the output. The simulation result coming from the actual measured data of a photovoltaic power station in Gansu province indicates that the proposed model is of higher accuracy in comparison with the traditional ones. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4017
Hierarchical Markov Decision Based Path Planning for Palletizing Robot Jiufu Liu; Zhengqian Wang; Zhe Chen; Zhong Yang; Zhisheng Wang; Chunsheng Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

On account of the complex application environment and the large number of uncertain conditions for the palletizing robot, we do path-planning for the multiple joints robot by the algorithm based on Hierarchical Markov Decision Process. First, according to the actual working environment, we set the range of the robot’s motion and select the conventional movement combination as the basic set of the robot’s behaviors. We can get the possible reward of various situations. We divide the state space in accordance with the location information of the obstacle space into a small number of state clusters, sub-level step by step to determine the precise trajectory of palletizing robots. We simulate 3D robot motion trajectory, including barrier-free and spherical obstacle conditions. Finally, experimental verification is carried out, the algorithm has been proved to control the compatible movements of each joint effectively and keep the error within the allowed range. The experiment results meet the requirement well. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.3851 
Efficient Computer Intrusion Detection Method based on Artificial Bee Colony Optimized Kernel Extreme Learning Machine Zhigang Zhang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With continuous development of computer networks, network attacks threat the information security of people’s daily life. For the protection against network intrusion behaviors, it is imperative to search efficient measurements to maintaining network security. Literature review indicates that taking the advantages of neural network, the network intrusion can be efficiently detected and the kernel extreme learning machine (KELM) can provide quick and accurate intrusion detection ability. The only parameter need be determined in KELM is the neuron number of hidden layer. Suitable neuron number will accelerate the training procedure. However, little work has been done to address the optimization of KELM. To address this issue, this paper proposed an effective method that uses the artificial bee colony (ABC) to optimize the KELM. With proper hidden layer neuron number, KELM could enhance the accuracy and speed of the intrusion detection. To verify the proposed method, experimental tests have been implemented in this work. The test result demonstrates that the proposed ABC-KELM can detect the network intrusion efficiently and its performance is superior to unoptimized KELM method. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4400
Design and Application of Iterative Monte Carlo Localization for Mobile Wireless Sensor Networks Based on MCL Junsheng Wu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In recent years, wireless sensor network had been more and more widely used in our daily life, and with the propose of monte carlo localization (MCL) algorithm, node localization of the mobile wireless sensor network had been solved effectively. But it needed to have a large number of samples if it used the monte carlo localization algorithm to obtain a high positioning accuracy. This paper proposed a new improved algorithm (iterative monte carlo localization algorithm) based on the monte carlo localization algorithm. In iterative monte carlo localization (IMCL) algorithm, each anchor node location information was forwarded by its neighbor nodes only once and preserved by the receiving node in each period. Then the next period, merge it and the sent/forwarding information into a packet and forward. Make sure that points have more observations for estimating previous location sets. IMCL, meanwhile, also can make full use of observation to filter out some samples that were far from the real position of node, so as to improve the accuracy of node localization. We finally confirmed by experiment: IMCL algorithm had higher positioning accuracy compared with other algorithm. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4512
A Dynamic Multi-nest Ant Colony Algorithm for Aircraft Landing Problem Feng Xiao-rong; Feng Xing-jie; Liu Dong
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Aircraft landing problem is an NP-hard problem. The article presents a static method for measure of the distance between flights, defines the distance as the pheromone of flights and analyzed experimentally firstly. Then proposes a dynamic multi-nest ant colony optimization algorithm for solving this problem, by dynamically calculates the pheromone between flights. The experimental results show that the algorithm has better global search ability and relatively fast convergence rate and compared with traditional first come first serve, genetic algorithm and particle swarm algorithm, this method can quickly give the better flight approach and landing order to help controllers make efficient aircraft scheduling policy and reduce flight delays. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4487 
A Strong RFID Mutual Authentication Protocol Based on a Lightweight Public-key Cryptosystem Zhicai Shi; Yongxiang Xia; Chaogang Yu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

RFID is a key technology that can be used to create the ubiquitous society. However, this technology may suffer from some serious threats such as privacy disclosure. In order to solve these secure problems we propose a strong mutual authentication protocol based on a lightweight public-key cryptosystem: NTRU. The protocol assures the confidentiality of the RFID system by encrypting the messages communicated between tags and readers and the freshness of the messages by using pseudorandom number generator. Otherwise, the protocol can also prevent replay attack, tracing, and eavesdropping effectively. This authentication protocol uses less computing and memory resources, and it is very suitable to some low-cost RFID systems. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4517
Control Strategy of Cascade STATCOM based on Internal Model Theory Zhenglong Xia; Liping Shi; Li Qianqian
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Internal model control (IMC) method enables the system to be of good dynamic and steady performance, which is simple, and is easy to be implemented. In allusion to the cascade STATCOM feature of high order, instability, multi-variable, non-linearity and tight coupling, the mathematical model of cascade STATCOM in d-q-0 coordinates was deduced. Decoupling model of cascade STATCOM was given by Internal Model Control principle, computer simulation and experiment results were also given. Results show that with IMC, 3-phase currents control method of cascade STATCOM has good tracking performance and control precision both in a-b-c coordinates and in d-q-0 coordinates, and also achieves excellent current compensation results. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4452
Modeling Driver Behavior in a road network with route choice based on real time traffic information Gao Feng
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Intelligent Transportation Systems (ITS) applications require a thorough understanding of drivers' route choice behavior in a complex network under real-time information. The purpose of this paper is to describe and model driver route choice behavior in a road network based on real time traffic information at the disaggregate individual level and from a psychological decision-making process perspective. The framework of routing choice and driver dynamic route choice behavior model that uses concepts from Decision Field Theory (DFT) and Bayesian belief network (BBN) is proposed. A real-time planning algorithm for route choice processes is discussed in great detail. Using this algorithm, a driver develops his route dynamically until he reaches his destination. The simulation results show that the combination of DFT and BBN can effectively describe the driver's travel dynamics behavior. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4466  
Improved K-means Clustering Algorithm based on Genetic Algorithm Zhaoxia Tang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Through comparison and analysis of clustering algorithms, this paper presents an improved K-means clustering algorithm. Using genetic algorithm to select the initial cluster centers, using Z-score to standardize data, and take a new method to evaluate cluster centers, all this reduce the affect of isolated points, and improve the accuracy of clustering. Experiments show that the algorithm to find the initial cluster centers is the same location, objective function value is smaller, the clustering effect is better and more stable when it has the outlier data, and it applies not only to simple data sets, but also to more complicated data sets. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4262
Study of the Principles and Models in Web Performance Optimization Wang Xin
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With the development of Web, the optimized question is becoming more and more prominent, so the Web performance optimization is inevitable. The important principle of Web Performance Optimization is understanding, and recognizing that gain must lose, the repayment is decreasing progressively, and return is diminishing at the same time, the optimized goal is the overall performance, and start from the highest level to optimize will obtain the biggest. Models of improving Web performance are as follows: sharing costs, high-speed caching, parallel processing, profiles, and using known information. To optimize the performance of Web database is also critical, such as to analyze and research from the cache, statements, tables, connection pooling, query, index, and several other aspects. Based on this study, given the crucial Web performance optimization recommendations, which will improve the performance of Web usage, accelerate the efficient use of Internet has an important significance. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4660

Page 1 of 11 | Total Record : 103

 1   2   3   4   5 

Filter by Year

2014 2014


Reset
Filter By Issues
All Issue 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