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 2,614 Documents
 15   16   17   18   19 
Topology Architecture and Routing Algorithms of Octagon-Connected Torus Interconnection Network Youyao Liu; Lidong Xing; Xin Zhou
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 1: March 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Two important issues in the design of interconnection networks for massively parallel computers are scalability and small diameter. A new interconnection network topology, called octagon-connected torus (OCT), is proposed. The OCT network combines the small diameter of octagon topology and the scalability of torus topology. The OCT network has better properties, such as small diameter, regular, symmetry and the scalability. The nodes of the OCT network adopt the Johnson coding scheme which can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the OCT network, and it is based on the Johnson coding scheme. A detailed analysis shows that the OCT network is a better interconnection network in the properties of topology and the performance of communication.
An Improved Artificial Bee Colony Algorithm for Staged Search Shoulin Yin; Jie Liu; Lin Teng
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 3: September 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Artificial Bee Colony(ABC) or its improved algorithms used in solving high dimensional complex function optimization issues has some disadvantages, such as lower convergence, lower solution precision, lots of control parameters of improved algorithms, easy to fall into a local optimum solution. In this letter, we propose an improved ABC of staged search. This new algorithm designs staged employed bee search strategy which makes that employed bee has different search characters in different stages. That reduces probability of falling into local extreme value. It defines the escape radius which can guide precocious individual to jump local extreme value and avoid the blindness of flight behavior. Meanwhile, we adopt initialization strategy combining uniform distribution and backward learning to prompt initial solution with uniform distribution and better quality. Finally, we make simulation experiments for eight typical high dimensional complex functions. Results show that the improved algorithm has a higher solution precision and faster convergence rate which is more suitable for solving high dimensional complex functions.
Estimation of Optimum Number of Poles for Random Signal by Yule-Walker Method Ahmed Al Amin; Md. Shoriful Islam; K.M. Abdul Al Woadud; Md. Jahirul Islam; Md. Imrul Kayes
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 3: September 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

The Yule-Walker method is an effective method to estimate the system response or spectrum for random signal. Hence most of the noise and spurious signals are random in nature, so it is very convenient to estimate their spectrum by Yule-Walker method successfully. The Yule-Walker method is an autoregressive process to estimate the poles and errors also based on the number of poles for Wide Sense Stationary (WSS) process as well. Moreover the value of zero will be correspondingly calculated based on the poles in case of all poles model. The main concern of this paper is to analyze the Yule-Walker method and estimate the poles and zero along with the error based on the number of poles for a random signal. Moreover analyze the results to find out the optimum number of poles for least possible error.
Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localization Schemes in Wireless Sensor Networks Doan Perdana; Adi Nugroho; Favian Dewanta
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 3: June 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed randomly. The result from sensing becomes meaningless if it is not known from where the originating node is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The localization scheme consists of distance estimation and position computing. Thus, this research used connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral algorithm for computing the position. Besides that, distance estimation using the connectivity between nodes is not needed for the additional hardware ranging as required by a range-based localization scheme. In this research compared the localization algorithm based on range free localization, which are DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous algorithm have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and energy consumption. On node density variations, dv-hop algorithm gained a localization error that is 26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained 14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm gained a localization error that is50.282% lower than amorphous. However, for energy consumption parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm.
Temperature Monitoring and Forecast System in Remote Areas with 4.0G LTE Mobile Technologies Kevin Alexandre Riaño Vargas; Octavio José Salcedo Parra; Miguel J. Espitia R.
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 5: October 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

The need to monitor areas of high risk in terms of temperature indexes has included two important elements for its compliance: monitoring and forecast of records in an environment. Performing this procedure manually is inefficient as it provides a flat perspective and can’t predict the state of the environment with rigor. Software systems are contemporary elements in constant refinement, which satisfy emerging needs of a context, so that, in relation to monitoring and forecast an environment, it allows a sophisticated automation of the process, and that tends to lead to a better supervision of the risks in the environment. This article presents a proposal for the supervision of high-risk areas, through temperature registers, manageable through the design of a software system with the implementation of mobile 4.0G LTE technologies, aimed at efficiency and effectiveness in the notification of environmental status. Finally, I conclude with a remote temperature monitoring and forecast system, using mobile technologies, with a fuzzy logic prediction system with a quadratic error not greater than 2.6%, that is, on a fuzzy algebra system whose Numerical calculation does not exceed this error value in comparison with actual values; At the same time that the future works are presented from the approach of the research that is postulated, according to the emergence of new perspectives related to this developing software system.
Discrete liquid level fiber sensor Muhammad Yusof Mohd Noor; Ahmad Sharmi Abdullah; Asrul Izam Azmi; Mohd Haniff Ibrahim; Mohd Rashidi Salim; Norazan Kassim
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 4: August 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

A novel simple fiber sensor to sense liquid level is presented. The operation principle is based on the relative Fresnel reflective intensity. The sensor consists of a fiber splitter with the configuration of one input to multiple fiber outputs, i.e. 1×4, 1×8 and 1×12 arrangements that act as a discrete liquid level. A broadband source (BBS) is used as the light source supply. The total reflected power intensity is measured using a power meter. Experimental results show that the power intensity decreases as the level of liquid is increased. The sensor has a simple configuration, low cost, and it can be customized for a wide height measurement range spanning from a few centimeters up to a hundred meters.
Integrity verification for an optimized cloud architecture Ahmed, Iqbal; Alam, Fahim Irfan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 1: February 2020
Publisher : Universitas Ahmad Dahlan

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

Abstract

Cloud computing has significantly benefited todays environment of IT industry through its mobility, sustainability, security, cost savings and several other important features. The risk of data loss on cloud in case of dealing with hardware and software is relatively small. However, the issue of data security becomes imminent when we are storing personal data on the cloud which is not transparent to users. In this paper, we introduce a new entity in terms of a virtual machine that provides services and assurance beyond service level agreement (SLA). In the proposed model, a role of data handling and security is assured with association of third party auditor (TPA) by the virtual machine. We further demonstrate the applied technique for encryption, decryption and integrity verification modules. We also upgrade the entropy of the advanced encryption standard (AES) with a variant of secret sharing scheme in the environment of cloud simulator.
Fair and trustworthy: Lock-free enhanced tendermint blockchain algorithm Basem Assiri; Wazir Zada Khan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 4: August 2020
Publisher : Universitas Ahmad Dahlan

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

Abstract

Blockchain Technology is exclusively used to make online transactions secure by maintaining a distributed and decentralized ledger of records across multiple computers. Tendermint is a general-purpose blockchain engine that is composed of two parts; Tendermint Core and the blockchain application interface. The application interface makes Tendermint suitable for a wide range of applications. In this paper, we analyze and improve Practical Byzantine Fault Tolerant (PBFT), a consensus-based Tendermint blockchain algorithm. In order to avoid negative issues of locks, we first propose a lock-free algorithm for blockchain in which the proposal and voting phases are concurrent whereas the commit phase is sequential. This consideration in the algorithm allows parallelism. Secondly, a new methodology is used to decide the size of the voter set which is a subset of blockchain nodes, further investigating the block sensitivity and trustworthiness of nodes. Thirdly, to fairly select the voter set nodes, we employ the random walk algorithm. Fourthly, we imply the wait-freedom property by using a timeout due to which all blocks are eventually committed or aborted. In addition, we have discussed voting conflicts and consensuses issues that are used as a correctness property, and provide some supportive techniques.
The convolutional neural networks for Amazigh speech recognition system Meryam Telmem; Youssef Ghanou
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 2: April 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, we present an approach based on convolutional neural networks to build an automatic speech recognition system for the Amazigh language. This system is built with TensorFlow and uses mel frequency cepstral coefficient (MFCC) to extract features. In order to test the effect of the speaker's gender and age on the accuracy of the model, the system was trained and tested on several datasets. The first experiment the dataset consists of 9240 audio files. The second experiment the dataset consists of 9240 audio files distributed between females and males’ speakers. The last experiment 3 the dataset consists of 13860 audio files distributed between age 9-15, age 16-30, and age 30+. The result shows that the model trained on a dataset of adult speaker’s age +30 categories generates the best accuracy with 93.9%.
Enhancement of Iris Recognition System Based on Phase Only Correlation Fitri Arnia; Nuriza Pramita
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 9, No 2: August 2011
Publisher : Universitas Ahmad Dahlan

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

Abstract

Iris recognition system is one of biometric based recognition/identification systems. Numerous techniques have been implemented to achieve a good recognition rate, including the ones based on Phase Only Correlation (POC). Significant and higher correlation peaks suggest that the system recognizes iris images of the same subject (person), while lower and unsignificant peaks correspond to recognition of those of difference subjects. Current POC methods have not investigated minimum iris point that can be used to achieve higher correlation peaks. This paper proposed a method that used only one-fourth of full normalized iris size to achieve higher (or at least the same) recognition rate. Simulation on CASIA version 1.0 iris image database showed that averaged recognition rate of the proposed method achieved 67%, higher than that of using one-half (56%) and full (53%) iris point. Furthermore, all (100%) POC peak values of the proposed method was higher than that of the method with full iris points.     

Page 17 of 262 | Total Record : 2614

 15   16   17   18   19 

Filter by Year

2004 2022


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