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 9,174 Documents
 44   45   46   47   48 
Annealing strategy for an enhance rule pruning technique in ACO-Based rule classification Hayder Naser Khraibet AL-Behadili; Ku Ruhana Ku-Mahamud; Rafid Sagban
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.pp1499-1507

Abstract

Ant colony optimization (ACO) was successfully applied to data mining classification task through ant-mining algorithms. Exploration and exploitation are search strategies that guide the learning process of a classification model and generate a list of rules. Exploitation refers to the process of intensifying the search for neighbors in good regions, whereas exploration aims towards new promising regions during a search process. The existing balance between exploration and exploitation in the rule construction procedure is limited to the roulette wheel selection mechanism, which complicates rule generation. Thus, low-coverage complex rules with irrelevant terms will be generated. This work proposes an enhancement rule pruning procedure for the ACO algorithm that can be used in rule-based classification. This procedure, called the annealing strategy, is an improvement of ant-mining algorithms in the rule construction procedure. Presented as a pre-pruning technique, the annealing strategy deals first with irrelevant terms before creating a complete rule through an annealing schedule. The proposed improvement was tested through benchmarking experiments, and results were compared with those of four of the most related ant-mining algorithms, namely, Ant-Miner, CAnt-Miner, TACO-Miner, and Ant-Miner with hybrid pruner. Results display that our proposed technique achieves better performance in terms of classification accuracy, model size, and computational time. The proposed annealing schedule can be used in other ACO variants for different applications to improve classification accuracy.
A Study of a New Intelligent Key System for Substation Dan Chen; Yefei Yue; Hongfen Jiang; Xiaorong Zhao; Liyuan Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 7: July 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i7.pp5629-5635

Abstract

Aiming at the demand of production management of power system, a new intelligent key system applied to substation is created and established. Based on the operating mode of the system, the paper puts forward the design of intelligent key based on RFID technology. It expounds the hardware of the system, which adopts advanced ARM technology to develop an intelligent key system, combined with RF signal recognition technology, OLED display, data storage, keyboard input and other functions, in order to meet the functional requirements for intelligence. Its software uses the embedded μC/OS-Ⅱto achieve the signal reception of the new intelligent key system. After tested, the key works well. The system is characterized by more portability, large storage capacity, more functions, friendly interface and other noticeable features.
Fuzzy Dynamic Scheduling of Multi-loop NCS Fang He; Jiajia Pang; Qiang Wang; Zhijie Zhang
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

There are more problems of network data transmission in multi-loop NCS than in single loop NCS. It maybe lead to that one or more of closed-loop systems become unstable in multi-loop NCS. In order to solve this problem, a novel algorithm of fuzzy dynamic scheduling for multi-loop NCS is put forward in this paper. Firstly, the requirement of the sampling period of NCS is discussed. The necessity of dynamic scheduling for multi-loop NCS is analyzed. And then, the algorithm of fuzzy dynamic scheduling for multi-loop NCS is proposed. The idea is described form three parts.The principle of fuzzy dynamic scheduling is analyzed. The fuzzy controller is designed. The fuzzy dynamic scheduler is constructed. Finally, the simulation model of a multi-loop NCS with fuzzy dynamic scheduler is set up using TrueTime software. The relevant analysis of simulation is given. The result of study can prove that the performance of each closed control loop based on the same network platform is improved by adding fuzzy dynamic scheduler in the multi-loop NCS. DOI: http://dx.doi.org/10.11591/telkomnika.v11i5.2453
A MIMO H-shape Dielectric Resonator Antenna for 4G Applications S. Salihah; M. H. Jamaluddin; R. Selvaraju; M. N. Hafiz
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 2: May 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v10.i2.pp648-653

Abstract

In this article, a Multiple-Input-Multiple-Output (MIMO) H-shape Dielectric Resonator Antenna (DRA) is designed and simulated at 2.6 GHz for 4G applications. The proposed structure consists of H-shape DRA ( =10) which is mounted on FR4 substrate ( =4.6), and feed by two different feeding mechanisms. First, microstrip with slot coupling as Port 1. Second, coaxial probe as Port 2. The electrical properties of the proposed MIMO H-shape DRA in term of return loss, bandwidth and gain are completely obtained by using CST Microwave Studio Suite Software. The simulated results demonstrated a return loss more than 20 dB, an impedance bandwidth of 26 % (2.2 – 2.9 GHz), and gain of 6.11 dBi at Port 1. Then, a return loss more than 20 dB, an impedance bandwidth of 13 % (2.2 – 2.7 GHz), and gain of 6.63 dBi at Port 2. Both ports indicated impedance bandwidth more than 10 %, return loss lower than 20 dB, and gain more than 10 dBi at 2.6 GHz. The simulated electrical properties of the proposed design show a good potential for LTE applications.
Performance Evaluation of Heterogeneous Network Based on RED and WRED Wisam Mahmood Lafta; Saba Qasim Jabbar; Guangzhi Ma
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 3: September 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i3.pp540-545

Abstract

The developing of wireless networks becomes a very important issue nowadays, since it is considered as an easy-using tool without building new infrastructure to cover a wide working area. Applying TCP protocols with the application demands are implemented this work by considering heterogeneous environment of wireless networks connecting with wired networks. The TCP congestion is critical problem is faced heterogeneous environments, this problem is appeared through sending and receiving huge data from wireless networks to wired networks and vice versa. This work is proposed a new approach of using active queue management (AQM) technique with random early detection (RED) and weight random early detection (WRED) strategies to avoid the expected congestion between the heterogeneous environments. Our simulation results show that the quality of service (QoS) is improved by reducing the queue delay and buffer usage, and by increasing the average throughput and utilizationof the system. The simulation is carried out by using OPNET software to test the proposed models for different scenarios.
Tifinagh Characters Recognition Using Simple Geometric Shapes M. Boutaounte; Y. Ouadid
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 1: July 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i1.pp235-239

Abstract

In this paper we present method of features extraction based on decomposition of the characters into several simple geometric shapes (segment, arc) by detecting the branch points and end points, as it explained follow a new methods are using to treated the obtained information in order to decide if the characters need to add more key points also in this step we extracte the type of the shapes (segment or arc) and the orientation. The next step of characters recognition different methods are used such as neural network (NN), K-mean and support vector machine (SVM) classifier. The results shown in this paper are obtained using the IRCAM database.
Zigbee Technology in Intelligent Electric Leakage Protection System Applied Research Deng Lei-lei; Zhang Xian
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 8: August 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Aiming at inconvenient wiring and low flexibility of current wired sensor network,An implementation method for real-time monitoring system based on ZigBee wireless network is proposed in this paper. in view of existing selective earth leakage protection device of low sensitivity, poor reliability problems, proposed one kind based on the zero sequence current feature selectionSelective leakage protection and line selection method; analysis of power supply system leakage fault branch of zero-sequence current logical relations, introduced based on the zero sequence current featuresVolume selective leakage protection principle and the realization method of fault line selection.As a Zigbee wireless sensor technology, Its application to the grid. Analyze leakage protection system in relation to the past system of superior performance and favorable conditions, And its features and system design of a simple program to explain the analysis and application of specific measures. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3027 
Study on the Cutting Prediction of Supercritical Material Hongtao Chen; Pan Fu; Xiaohui Li
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 9: September 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

The technology of the artificial neural network (ANN) was applied in the research of supercritical material cutting. Two-dimensional Gaussian surfaces of the three cutting elements and workpiece surface hardness had been established fitting through JMP software. Base on the orthogonal milling experiments, the rules of cutting forces variation were forecasted, as well as the effect to the hardness on workpiece surface. The cutting parameters selected according to the process were built, providing an important basis for the optimization of machining conditions. The prediction results were in good agreement with the experimental results. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3265  
An enhanced hybrid genetic algorithm for solving traveling salesman problem Zeravan Arif Ali; Subhi Ahmed Rasheed; Nabeel No’man Ali
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.pp1035-1039

Abstract

Robust known the exceedingly famed NP-hard problem in combinatorial optimization is the Traveling Salesman Problem (TSP), promoting the skillful algorithms to get the solution of TSP have been the burden for several scholars. For inquiring global optimal solution, the presented algorithm hybridizes genetic and local search algorithm to take out the uplifted quality results. The genetic algorithm gives the best individual of population by enhancing both cross over and mutation operators while local search gives the best local solutions by testing all neighbor solution. By comparing with the conventional genetic algorithm, the numerical outcomes acts that the presented algorithm is more adequate to attain optimal or very near to it. Problems arrested from the TSP library strongly trial the algorithm and shows that the proposed algorithm can reap outcomes within reach optimal. For more details, please download TEMPLATE HELP FILE from the website.
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

Page 46 of 918 | Total Record : 9174

 44   45   46   47   48 

Filter by Year

2012 2026


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