cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Nizirwan Anwar
Contact Email
nizirwan.anwar@esaunggul.ac.id
Phone
-
Journal Mail Official
telkomnika@ee.uad.ac.id
Editorial Address
Ahmad Yani st. (Southern Ring Road), Tamanan, Banguntapan, Bantul, Yogyakarta 55191, Indonesia
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Published by Universitas Ahmad Dahlan
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
Computer Science & IT
Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of submissions that TELKOMNIKA has received during the last few months the duration of the review process can be up to 14 weeks. Communication Engineering, Computer Network and System Engineering, Computer Science and Information System, Machine Learning, AI and Soft Computing, Signal, Image and Video Processing, Electronics Engineering, Electrical Power Engineering, Power Electronics and Drives, Instrumentation and Control Engineering, Internet of Things (IoT)
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 29 Documents
 1   2   3 
Search results for , issue "Vol 11, No 3: September 2013" : 29 Documents clear
The Research of Granular Computing Applied in Image Mosaic Xiuping Zhang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.1136

Abstract

Based on the existing image mosaic technology, this paper introduces the granular computing and obtains a simplified new algorithm. The image mosaic executed by this algorithm at first establishes correlation model on the basis of granular computing theory, and obtains edge map of each image needing mosaic. The new calculation method is used to calculate gradient of in different columns of edge map, to obtain the feature point coordinates with the maximum gradient; meanwhile, all feature points of two images are matched with each other, to acquire the best matching point. In addition, the error-correcting mechanism is introduced in the matching process, which is used to delete feature points with matching error. The correlation calculation is carried out for the matching pixels acquired by the above processing, to get the feature transformational matrix of the two images. According to the matrix, two separated image maps map into the same plane. The slow transitional mosaic method is applied in the aspect of image addition plus overlap removal, so that images have no bulgy boundary after mosaics. The whole image mosaic process shows that the given granular computing algorithm is superior to the traditional one both in the number of processed images and the number of processing, and the mosaic image gained has high quality.
Controlling Chaos and Voltage Collapse using Layered Recurrent Network-based PID-SVC in Power Systems I Made Ginarsa; Agung Budi Muljono; I Made Ari Nrartha
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.948

Abstract

Chaos and voltage collapse occurred in critical power systems due to disturbing of energy. PID-SVC layered reccurrent neural network-based (LRN-based PID-SVC) was proposed to solve these problems. The PID is used to control chaos and voltage collapse. Meanwhile, an SVC LRN-based is used to maintan the load voltage. By using the proposed controller, chaos and voltage collapse are able to suppress and maintain the load voltage around the setting value. When the maximum load isforced to load bus, the reactive power supplied by SVC, SVC additional voltage and load voltage are at the values of j0.1127, 4.0095´10-3 and 0.980010 pu, respectively. Furthemore, the proposed controller gives better response than PI-SVC controller. 
Isolated Sign Language Characters Recognition Paulus Insap Santosa
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.1142

Abstract

 People with normal senses use spoken language to communicate with others. This method cannot be used by those with hearing and speech impaired. These two groups of people will have difficulty when they try to communicate to each other using their own language. Sign language is not easy to learn, as there are various sign languages, and not many tutors are available. This study focuses on the character recognition based on manual alphabet. In general, the characters are divided into letters and numbers. Letters were divided into several groups according to their gestures. Characters recognition was done by comparing the photograph of a character with a gesture dictionary that has been previously developed. The gesture dictionary was created using the normalized Euclidian distance. Character recognition was performed by using the nearest neighbor method and sum of absolute error. Overall, the level of accuracy of the proposed method was 96.36%.
Adaptive Neural Network Robust Control for Space Robot with Uncertainty Zhang Wenhui; Fang Yamin; Ye Xiaoping Ye Xiaoping
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.1130

Abstract

The trajectory tracking problems of a class of space robot manipulators with parameters and non-parameters uncertainty are considered. An adaptive robust control algorithm based on neural network is proposed by the paper. Neutral network is used to adaptive learn and compensate the unknown system for parameters uncertainties, the weight adaptive laws are designed by the paper, System stability base on Lyapunov theory is analysised to ensure the convergence of the algorithm. Non-parameters uncertainties are estimated and compensated by robust controller. It is proven that the designed controller can guarantee the asymptotic convergence of tracking error. The controller could guarantee good robust and the stability of closed-loop system. The simulation results show that the presented method is effective.
Adaptive Neural Network Robust Control for Space Robot with Uncertainty Zhang Wenhui; Fang Yamin; Ye Xiaoping Ye Xiaoping
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.985

Abstract

The trajectory tracking problems of a class of space robot manipulators with parameters and non-parameters uncertainty are considered. An adaptive robust control algorithm based on neural network is proposed by the paper. Neutral network is used to adaptive learn and compensate the unknown system for parameters uncertainties, the weight adaptive laws are designed by the paper, System stability base on Lyapunov theory is analysised to ensure the convergence of the algorithm. Non-parameters uncertainties are estimated and compensated by robust controller. It is proven that the designed controller can guarantee the asymptotic convergence of tracking error. The controller could guarantee good robust and the stability of closed-loop system. The simulation results show that the presented method is effective.
Utilization of Near Field Communication Technology for Loyalty Management Ferina Ferdianti; Yusuf Triyuswoyo; Dewi Agushinta R.
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.1147

Abstract

Near Field Communication (NFC) is one of wireless technology developed at this time. We can use a mobile phone to do many transactions with NFC. Mobile developments have created to provide convenience for users in all aspects. However, at this time the function of NFC just limited for payment and micropayment. Beside it, there are assets that support to increase sales with attention of loyality management system. In this system, discounts or prizes are given based on data mining for every transaction customers. This loyalty management has three concepts. Those are Frequency, Recency and Quantity (FRQ). The goals are minimizing the cost, making purchase process faster, and managing data obtained through the NFC technology more simple. The result of this paper is the procedure to use data mining of NFC for loyalty management and designing system using Unified Modeling Language approach.
The Construction and Performance of a Novel Intergroup Complementary Code Wenzhun Huang; Shanwen Zhang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.1137

Abstract

 On the basis of the analyses for intergroup complementary (IGC) code and zero correlation zone complementary code, a novel IGC code has been proposed to adapt M-ary orthogonal code spreading spectrum system or quasi-synchronous CDMA system. The definition and construction methods of the new IGC codes are presented and an applied example is given in this paper. Theoretical research and simulation results show that the main advantages of the novel IGC code are as following: The code sets of the novel IGC code is more than IGC code under the same code length. The zero correlation zone length is longer than the intergroup IGC code, but shorter than the intergroup IGC code. Under the same code length, the auto-correlation performance of the novel IGC code is better than that of the IGC code, and both are of similar cross-correlation performance.
Reduce NOx Emissions by Adsorber-Reduction Catalyst on Lean Burn Engine Dongpeng Yue; Qing Chang; Lei Liu; Wen Zhang; Shaoshu Chen; Zhijun Li Zhijun Li
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.978

Abstract

 The effect of a new catalyst system composed of traditional three way catalyst converter and adsorber-reduction catalysis converter on the emission characteristics and BSFC (Breake Specific Fuel Consumption- BSFC)of a lean burn gasoline engine operated were investigated in this paper under different schemes of catalyst converter arrangement and different speeds and loads. The results show that the position of Three Way Catalyst is before the NOx adsorber Catalyst was the best scheme of catalyst converter arrangement. Which has the highest converter efficiency of reduction NOx emission in lean burn gasoline engine. The effects of speed on the exhaust emission and BSFC were also related to the ratio of lean burn time to rich burn time and the absolute value of both time of the adsorber-reduction catalyst converter. The load of the engine was the main influential factor to the exhaust emission characteristics and BSFC of lean burn gasoline engine, and the more load of the engine was, the more NOx emission, the less NOx conversion rate (CNOx) and the better BSFC were.
Computer Network Reliability Optimization Calculation Based on Genetic Algorithm Jiangtao Yu Jiangtao Yu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 11, No 3: September 2013
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v11i3.1145

Abstract

How to effectively reduce the network node link cost by improving the reliability of computer network transmission system is one of the important targets of computer network reliability optimization calculation. Therefore, in the computer network reliability optimization calculation, it is necessary to integrate the computer network link medium cost, network reliability optimization mathematical model and other factors. This paper describes genetic algorithm and its implementation process, as well as the application of genetic algorithm to the network link cost and network reliability optimization calculation. In addition, it is indicated from the simulation results that genetic algorithm can effectively solve the reliability optimization calculation problem which is difficult to solve by the traditional algorithm of network, so as to speed up the calculation speed of computer network and optimize the network calculation result.

Page 3 of 3 | Total Record : 29

 1   2   3 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol 20, No 3: June 2022 Vol 20, No 2: April 2022 Vol 20, No 1: February 2022 Vol 19, No 6: December 2021 Vol 19, No 5: October 2021 Vol 19, No 4: August 2021 Vol 19, No 3: June 2021 Vol 19, No 2: April 2021 Vol 19, No 1: February 2021 Vol 18, No 6: December 2020 Vol 18, No 5: October 2020 Vol 18, No 4: August 2020 Vol 18, No 3: June 2020 Vol 18, No 2: April 2020 Vol 18, No 1: February 2020 Vol 17, No 6: December 2019 Vol 17, No 5: October 2019 Vol 17, No 4: August 2019 Vol 17, No 3: June 2019 Vol 17, No 2: April 2019 Vol 17, No 1: February 2019 Vol 16, No 6: December 2018 Vol 16, No 5: October 2018 Vol 16, No 4: August 2018 Vol 16, No 3: June 2018 Vol 16, No 2: April 2018 Vol 16, No 1: February 2018 Vol 15, No 4: December 2017 Vol 15, No 3: September 2017 Vol 15, No 2: June 2017 Vol 15, No 1: March 2017 Vol 14, No 4: December 2016 Vol 14, No 3: September 2016 Vol 14, No 2: June 2016 Vol 14, No 1: March 2016 Vol 13, No 4: December 2015 Vol 13, No 3: September 2015 Vol 13, No 2: June 2015 Vol 13, No 1: March 2015 Vol 12, No 4: December 2014 Vol 12, No 3: September 2014 Vol 12, No 2: June 2014 Vol 12, No 1: March 2014 Vol 11, No 4: December 2013 Vol 11, No 3: September 2013 Vol 11, No 2: June 2013 Vol 11, No 1: March 2013 Vol 10, No 4: December 2012 Vol 10, No 3: September 2012 Vol 10, No 2: June 2012 Vol 10, No 1: March 2012 Vol 9, No 3: December 2011 Vol 9, No 2: August 2011 Vol 9, No 1: April 2011 Vol 8, No 3: December 2010 Vol 8, No 2: August 2010 Vol 8, No 1: April 2010 Vol 7, No 3: December 2009 Vol 7, No 2: August 2009 Vol 7, No 1: April 2009 Vol 6, No 3: December 2008 Vol 6, No 2: August 2008 Vol 6, No 1: April 2008 Vol 5, No 3: December 2007 Vol 5, No 2: August 2007 Vol 5, No 1: April 2007 Vol 4, No 3: December 2006 Vol 4, No 2: August 2006 Vol 4, No 1: April 2006 Vol 3, No 3: December 2005 Vol 3, No 2: August 2005 Vol 3, No 1: April 2005 Vol 2, No 1: April 2004 More Issue