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 90 Documents
 5   6   7   8   9 
Search results for , issue "Vol 11, No 9: September 2013" : 90 Documents clear
Some Results of Bondage Number of (n,k)-Star Graphs Yunchao Wei; Hongxian Zhu; Junli Han
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

In the computer network, bondage number is one of the most important parameters to measure the control theory of the computer network, denoted by b(G) for a network graph G. But predecessors have proved that computing them are very hard. So computing b(G) of some particular known gr-aphs is extremely valuable. In this paper, we determine b(Sn,2) and the precise lowerbound of b(G) of (n,k)-star graphs, denoted by Sn,k followed by some relative conclusions of n-star, denoted by Sn as the isomorphism of Sn,n-1. In addition, our method giving dominating set of Sn,k is easily understood, which presented a broadcast algorithm to determine dominating set of Sn,k. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3285  
Characters Feature Extraction Based on Neat Oracle Bone Rubbings Lei Guo
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

In order to recognize characters on the neat oracle bone rubbings, a new mesh point feature extraction algorithm was put forward in this paper by researching and improving of the existing coarse mesh feature extraction algorithm and the point feature extraction algorithm. Some improvements of this algorithm were as followings: point feature was introduced into the coarse mesh feature, the absolute address was converted to relative address, and point features have been changed grid and position relationship integrating into the feature vector. The recognition effect has been improved greatly using this algorithm to recognize oracle characters on the neat bone rubbings. At the same time, it could supply some help to recognize words of the neat handwriting instruments. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3302
The Application of BP Neural Network In Oil-Field Pei-Ying ZHANG; Meng-Meng ZHAO
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

Aiming at the situation that many techniques of production performance analysis acquire lots of data and are expensive considering the computational and human resources, and their applications are limited, this paper puts forward a new method to analyze the production performance of oil-field based on the BP neural network. It builds a dataset with some available measured data such as well logs and production history, then, builds a field-wide production model by neural network technique, a model will be used to predict. The technique is verified, which shows that the predicted results are consistent with the maximum error of rate of oil production lower than 7% and maximum error of rate of water production lower than 5%, having certain application and research value. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3280
A Framework of Concurrent Mechanism Based on Java Multithread Wuxue Jiang; Qi Li; Zhiming Wang; Jianfeng Luo
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 continuously increased demand for paralleling multitask in domains such as grid computing and cloud computing has significantly promoted research on concurrent mechanism and concurrent programming. The Java programming language supports multithread mechanism for developing paralleling programs, however, it is difficult to apply Java concurrent primitives to specific problems. Thus, for the development of high reliable and qualitative Java concurrent programs, this paper analyses Java multithread mechanism and it’s realization, studies the concurrent mechanism based on Java synchronization and interactive communication mechanism , compares the concurrent structure based on operating system and based on Java multithread, sums up some concurrent programming rules and strategies to prevent deadlock. A frame instance based on entire synchronization is presented, which can help to develop concurrent programs quickly. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3296
Bionic Intelligent Optimization Algorithm Based on MMAS and Fish-Swarm Algorithm Jingjing Yang; Benzhen Guo; Jixiang Gou; Xiao Zhang
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

With large number of ants, the ant colony algorithm would always take a long time or is rather difficult to find the optimal path from complex chapter path, further more, there exists a contradiction between stagnation, accelerated convergence and precocity. In this paper, we propose a new bionic optimization algorithm. The main idea of the algorithm is to introduce the horizons concept in the MMAS fish swarm algorithm, so it would take shorter time to find the optimal path with numerous ants, and the introduction of the concept of fish swarm algorithm congestion level would enable the ant colony find the path of global optimization with a strong crowding limit which avoids the emergence of local extreme and improves the accuracy and efficiency of the algorithm. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.2952
The monochrome LCD Driver Design and Implementation Based on Framebuffer Li Zhi-hui; Xian Jinlong
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

Recently, the LCD applications have developed very rapidly, especially the application of the monochrome LCD in certain areas. This paper, on hardware, introduced the connection between monochrome LCD HEM160160-07C2 and ARM9-based AT91SAM9261; on software, respectively introduced monochrome LCD driver implementation based on GPIO and based on Framebuffer. By the two mode analysis, the mode based on Framebuffer is better, ultimately has been validated in the project experiment. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.2868 
Study on Control Strategy of Electro-Hydraulic Servo Loading System Ju Tian
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

Since extraneous torque is the key factor to affect the accuracy of electro-hydraulic servo loading system, the forming mechanism of extraneous torque was discussed in this work. And then several design methods of loading system controller based on modern control theory were introduced, such as internal model control, Cerebella model articulation control and adaptive backstepping control. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3246
Robustness of Improving Active Maglev Motorized Spindle Equilibrium Position Zhang Yanhong; Zhao Dean; Zhang Jiansheng; Zheng Zhongqiao; Zou Yiqin; Zhang Yongchun
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 equilibrium position of active maglev motorized spindle had great influence on the industrial processing accuracy, in order to improve the performance of active maglev motorized spindle and processing accuracy, a new control method and control device of active maglev was put forward based on H∞ mixed sensitivity. Firstly, a mathematical model was established among the electromagnetic force on the rotor, control current and position displacement of the rotor center. Secondly, the H∞ mixed sensitivity control method was used, the selection method of weighting function was discussed and H∞robust controller was designed, the experimental results showed that for active maglev motorized spindle, the designed controller had better static and dynamic performance, position precision, so that the robustness of the motorized spindle equilibrium position was further improved, which met the requirement of high precision industrial process. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3263
Improved a Priori SNR Estimation for Speech Enhancement Incorporating Speech Distortion Component Shifeng Ou; Chao Geng; Ying Gao
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 well known decision-directed (DD) approach drastically limits the level of musical noise, but the estimated a priori SNR matches the previous frame rather than the current one. Plapous introduced a novel method called two-step noise reduction (TSNR) technique to refine the a priori SNR estimation of the DD approach. However, the performance of this method depends on the accurateness of the estimated speech in its second step. In this paper, we propose an improved approach for the a priori SNR estimation in DCT domain with two steps like the TSNR method. While in the second step, considering the two state components of the estimation error between speech signal and its estimation, the speech distortion component and residual noise component, we make the estimated speech subtracted by its speech distortion as a refined estimation for the clean speech signal. Because the speech distortion component is offset, the estimated a priori SNR is more accurate. A number of objective tests results show the improved performance of the proposed approach. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3291 
Rough Sets Algorithm and Its Application in Fault Diagnosis Huiling Liu; Hongxia Pan; Aiyu Wang
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

Gearbox is one of the most complicate rotary mechanical apparatus, the fault signal shows non-linear and non-stationary, and how to recognize the faults effectively is a key issue. A novel method based on wavelet packet transform and rough sets theory was presented for fault diagnosis of gearbox. First, the vibration signals were decomposed into eight bands from low frequency to high frequency by wavelet packet transform, energy characteristics were extracted as the condition attributes. Second, an improved NaiveScaler algorithm was put forward to discrete continuous attributes in the case of assuring classification ability. A new reduction algorithm based on condition equivalence classifications was proposed to delete the redundant features, which could improve the reduction efficiency. Lastly the decision rules were drawn and utilized to test the samples. The results show that the method could obtain more sensitive fault characteristic parameters and have better classification ability accordingly. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3308 

Page 7 of 9 | Total Record : 90

 5   6   7   8   9 

Filter by Year

2013 2013


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