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 102 Documents
 1   2   3   4   5 
Search results for , issue "Vol 12, No 4: April 2014" : 102 Documents clear
0.345 Attenuation Law of Vibration Signals During Caving Xu Li; Tao Gu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

To study on the characteristics of the vibration signals of coal and stone hitting the armor plate during caving, a hybrid algorithm based on first order forward difference and wavelet transform modulus-maxima method is presented which can be used in the longwall top coal face. First, in order to reduce the noise interference, the pre-processing of the vibration signals is done by the first order forward difference method. Second, the wavelet transform modulus-maxima method is used to analyze the resluts of the difference for the post-processing of the data. Finally, attenuation formula is defined in the first-level details (D1). We can learn by the experimental results that the hybrid algorithm provides real-time, high confidence identification of coal and stone by analysis of the first-level details that has approximate 0.345 attenuation law between the wavelet transform modulus-maxima (the maximum coefficient) and the wavelet transform modulus-minima (the minimum coefficient). Because the wavelet transform modulus-maxima’s abscissa and the wavelet transform modulus-minima’s abscissa are adjacent to each other, the concept of Singularity-point Couple(SPC) is defined. Based upon the attenuation law and the defined concept, interference signals can be eliminated, vibration signals can be restored, and some prediction work can be done. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4885
An Improved Medical DR Image Enhancement Method Bi Juntao
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

As a result of noise interference, improper exposure and thick human tissue, detail information of DR image will be buried, including unclear edge and contrast reduction. This paper proposes a medical DR image enhancement processing based on artificial fish-swarm algorithm. According to DR image contour model and DR image boundary, the enhancement processing segment DR image by artificial fish-swarm clustering method, then enhance DR classification image through adding GAG operator. Simulation results show that the method can effectively eliminate noise in DR image, and the detail information of enhanced DR image is clearer than before meanwhile with high effectiveness and robustness. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4305
Performance Evaluation of Dynamic Load Balancing Algorithms Tianshu You; Wenhui Li; Zhiyi Fang; Hongbin Wang; Guannan Qu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Efficient task scheduling mechanism can better meet the users’ QoS requirement, and achieve the load balancing in physical hosts, so the cluster system with high scalability and reliability can effectively improve the information utilization of the system, thereby enhance the overall performance of the Web server cluster system. In order to build a network service system with better scalability and reliability, this paper describes the round-robin scheduling algorithm of LVS cluster system, least-connection scheduling algorithm, weighted least-connection scheduling algorithm and a prior proposed new weighted value assigned scheduling algorithm, dynamic adaptive feedback load balancing strategy. Meanwhile, it takes simulation experiment for the round-robin scheduling algorithm of LVS, least-connection scheduling algorithm, weighted least-connection scheduling algorithm and the new weighted value assigned scheduling algorithm, dynamic adaptive feedback load balancing strategy and take comparative analysis for the experimental data, through the analysis and assessment, effectively point out the advantages and disadvantages of the existing load balancing strategy. It is conducive to better improve the existing equalization algorithm performance deficiencies and propose optimum load balancing strategy DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4731
Research on Design Method Based on Hardware Encryption and Two-way ID Authentication for Security Mobile Hard Disk Huanchun Yang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

The design Method of the " Security Mobile Hard Disk Based on Hardware Encryption and Two-way ID Authentication" adopts the smart card-based technology of two way ID authentication, thus enables higher authentication strength than ordinary password authentication and USB-KEY one way certification; adoption of dedicated hardware encryption chip on encrypting the hard disk data enhances the encryption speed; since this encryption is a hardware level encryption, it is completely transparent to users, and do not rely on the operating system or other applications, with almost no impact on system performance; that the key of the encryption system will be loaded before the system initialization (system boot) prevents malicious code attacks from hard drive, and even when the mobile hard disk was stolen, the thief cannot read out any encrypted data from it  on any other computer as long as the thief has no access to the encryption key. Therefore, this "encrypted mobile hard disk" is more secure with better reading and writing performance, and thus can effectively protect Important and sensitive data on the mobile hard disk. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4995
Adaptive Wallis Filter via Sparse Recognition for Automatic Control Points Extraction Leilei Geng; Deshen Xia; Quansen Sun; Kai Yuan
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With the rapid development of the remote sensing satellite, the size and the resolution of satellite images grow increasingly. The evaluation of remote sensing image quality requires precise information of control points extracted from unevaluated images and reference images. Therefore, we propose an adaptive Wallis filter method based on sparse recognition to increase the number of control points and improve the matching precision. Firstly, feature vectors of images are constructed by computing the image radiation-parameters. Secondly, the classification of sub-region terrain in the image can be determined using sparse recognition. Finally, according to specific type of sub-region terrain, we enhance the regions by the Wallis filter based on corresponding filter parameters and extract control points which would lead to the automatic evaluation for geometric precision. The experiments show that the proposed method can get better results especially in the detail on the images of Resourse-3 satellite, hence can increase the number and improve accuracy of control points. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4781
Application of Genetic Algorithm in Intelligent Examination Paper Composition Yan Yan; Dali Yin
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With the development of computer technology and artificial intelligence, the research into examination paper composition receives more and more concern, and the artificial composition of examination paper based on the genetic algorithm gradually demonstrates its superiority. However, due to the complexity of the restraints of paper composition, it has many shortcomings. This paper focuses on the application of the genetic algorithm in paper composition, and proposes an improved tactic of arithmetic crossing, which enlarges the searching space of algorithm to a considerable extent, avoiding the defects of the slow convergence of the simple genetic algorithm and regional convergence so that the efficiency and quality of paper composition are raised. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4888
Network Traffic Prediction Algorithm based on Improved Chaos Particle Swarm SVM Shuzhen Bai
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Abstract—Because network traffic is complexand the existingprediction models have various limitations, a new network traffic prediction model based on wavelettransform and optimized support vector machine(ChOSVM) is proposed.Firstly, the network traffic is decomposed to the scale coefficients andwavelet coefficients by non-decimated wavelet transform based on suitablewavelet base and decomposition level. Then they are sent individually intodifferent SVM with suitable kernel function for prediction. The parameters ofSVM are selected by chaos particle swarm optimization. Finally predictions arecombined into the final result by wavelet reconstruction. Experiments onnetwork traffic of different time granularity show that compared with othernetwork traffic prediction models, ChOSVM has better performance. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4802
Optimization Design of Cantilever Beam for Cantilever Crane Based on Improved GA Shufang Wu; Tiexiong Su
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Based on in depth study of optimization design methods, according to analyzing the forces of cantilever beam for Cantilever Crane, with the feature that I-beams used in cantilever beam mostly, combining structural optimization technique with discrete variables with GA, an optimization design method of cantilever beam for Cantilever Crane based on improved GA was proposed for the problems of huge material redundancy and high production cost. Mathematical model and fitness function of the structural optimization with discrete variables were built, optimization design of cantilever beam structure was achieved, the efficiency of this optimization design method was validated and the consumption of steel for production was reduced. This method had a certain guiding significance for engineering application. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4807
A Network Intrusion Detection Method Based on Improved ACBM Chen Shan; Diao Hong-Bin
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In order to solve the problem which includes the difficulties of network intrusion detection, redundancy of network intrusion character, difficulties for feature matching, a network intrusion detection method based on improved ACBM algorithm is proposed in this article. The improved ACBM algorithm is used to achieve matching module, which add the filtering function for module improvement. The distribution characteristics of stability and the use of the bifurcated binary tree model is used to complete the feature classification. In the stable feature, the inter-class distance is used as the classification method of support vector machine, which has strong ability of generalization as well as high identification accuracy, and has the application foreground detection. Finally, the superiority of the proposed method is proved through the data in KDDCup99 database. It shows that the proposed network intrusion detection method by experiment, which combines the ACBM algorithm and the classification mechanism, has a better accuracy than LSSVM and SVM, and it is proved that  this method is very suitable for network intrusion detection under complex features environment. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4246
Fuzzy Synthetic Evaluation Model on Cultural Characteristics behind People’s Selection of Subway Ruijie Mu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Taking Zhengzhou urban residents travel means and the city’s traffic conditions as examples, this paper makes in-depth analysis on the Cultural Characteristics behind options of Zhengzhou citizen’s travel means. The paper, after investigating the citizen’s travel intentions, makes both normative and empirical comparisons to different cultural features behind people choosing different urban travel means. Then it drew a conclusion on how different cultural characteristics of urban residents affect their preference to travel means. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4171

Page 3 of 11 | Total Record : 102

 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