cover
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)
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
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)
Articles 2,614 Documents
Stereo vision-based obstacle avoidance module on 3D point cloud data Eko Purbo Wahyono; Endah Suryawati Ningrum; Raden Sanggar Dewanto; Dadet Pramadihanto
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 3: June 2020
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper deals in building a 3D vision-based obstacle avoidance and navigation. In order for an autonomous system to work in real life condition, a capability of gaining surrounding environment data, interpret the data and take appropriate action is needed. One of the required capability in this matter for an autonomous system is a capability to navigate cluttered, unorganized environment and avoiding collision with any present obstacle, defined as any data with vertical orientation and able to take decision when environment update exist. Proposed in this work are two-step strategy of extracting the obstacle position and orientation from point cloud data using plane based segmentation and the resultant segmentation are mapped based on obstacle point position relative to camera using occupancy grid map to acquire obstacle cluster position and recorded the occupancy grid map for future use and global navigation, obstacle position gained in grid map is used to plan the navigation path towards target goal without going through obstacle position and modify the navigation path to avoid collision when environment update is present or platform movement is not aligned with navigation path based on timed elastic band method.
Interactive website on information dissemination Peter O. Sadiku; Roseline Oluwaseun Ogundokun; Opeyemi Eyitayo Ogundokun; Asamu Aderonke Adebayo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 1: February 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

A school is an educational institution for imparting knowledge to children. In an age where information acquisition about a school is assuming astronomical heights, the need for cost-effective and efficient information transmission methods cannot be overemphasized; hence the use of the website of a school to disseminate information is advised. This study examines the process of disseminating information on a school website using a college in the Northcentral of the six-geopolitical zone in Nigeria as a case study. A prior study of manually or locally dissemination of information in a school was carried out and its limitations are highlighted. A website that is able to handle processes like admission, comment, and newsletter has been analyzed and developed using hyper-text language, cascading style sheet, hypertext preprocessor. The study results in solving the information dissemination problem in the college with the development of an educational interactive website.
Cost Allocation of Transmission Losses in Electric Market Mechanism Hermagasantos Zein; Erwin Dermawan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 10, No 2: June 2012
Publisher : Universitas Ahmad Dahlan

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

Abstract

 This paper proposes a new method to calculate cost allocation of transmission losses based on a certain price of energy. A mathematic model is developed by manipulating of the network equation to separate losses. This model uses complex power injection and, does not use approximations and assumptions in determining the cost allocation of losses. The calculation begins from the results of load flow calculation and it is continued to calculate power distribution from a generator to every load and line. Finally, the separating of losses and cost allocation of losses are calculated. The proposed method is easy to be understood and applied. An illustration results on IEEE 14-bus system show that the method is consistent with expectancies and slightly different from several referenced methods. 
Chord-based Resource Identifier-to-Locator Mapping and Searching for the Future Internet Huanlin Liu; Hongyue Dai; Shuaiyong Wu; Sheng Huang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 3: September 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

A great many problems, such as scalability, mapping data searching, high frequency update of mapping data, arise in the future network resource mapping system for its vast data processing need. Future Network Chord (FN Chord), an algorithm based on Chord and aims at solving the resources identity mapping and searching problem, is put forward by taking advantage of the qualities of scalability, rapid searching speed, high searching efficiency and flexible naming of chord in order to solve this problem. What’s more, an extra interest node index table for FN Chord is designed to record the hotspot resource mapping location in the paper. So, the resource searching strategy, which is named as Interest Index Table Future Network Chord (IIT-FN Chord) is proposed to search the resource in the paper. The entropy weight method is used to calculate the node interest level according the interest nodes’ resource item online time and visited times and to renew the interest index table. Moreover, probability replacement method is proposed to replace the outdated item on interest index table with new item. Simulation results show that the algorithm can decrease the average searching latency, average searching hops and thus increases the searching efficiency for the resource searching.
PERBANDINGAN ANTARA ALGORITMA DEKOMPOSISI STANDAR HAAR DAN ALGORITMA DEKOMPOSISI STANDAR RIYAD UNTUK PEMAMPATAN DATA CITRA Riyad Mubarak Abdullah
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 2, No 1: April 2004
Publisher : Universitas Ahmad Dahlan

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

Abstract

Dalam naskah ini ditampilkan perbandingan antara dua algoritma dekomposisi standar yang digunakan untuk pemampatan data citra. Dua algoritma dekomposisi standar yang dimaksud adalah yang dimiliki Haar dan Riyad. Dalam naskah ini, diperkenalkan suatu algoritma baru yang akan digunakan untuk memampatkan data citra. Algoritma ini pada hakikatnya adalah modifikasi atas algoritma dekomposisi standar yang dibuat oleh Haar. Algoritma dekomposisi standar Haar memiliki kelemahan yang hanya dapat digunakan untuk citra-citra yang berukuran 2n (dengan n = 1,2,3,…), yang berarti citra-citra tersebut harus berukuran genap. Algoritma baru yang disebut dengan dkriyad2002 (singkatan untuk dekomposisi standar Riyad tahun 2002) dapat mengatasi kelemahan tersebut. Algoritma baru ini dapat digunakan untuk citra berukuran genap dan gasal. Dari hasil uji coba didapatkan bahwa algoritma baru ini dalam prosesnya lebih hemat flops (floating point operations), sehingga waktu proses dekomposisinya menjadi lebih singkat.
A New Semi-supervised Clustering Algorithm Based on Variational Bayesian and Its Application 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.3805

Abstract

Biclustering algorithm is proposed for discovering matrix with biological significance in gene expression data matrix and it is used widely in machine learning which can cluster the row and column of matrix. In order to further improve the performance of biclustering algorithm, this paper proposes a semi-supervised clustering algorithm based on variational Bayesian. Firstly, it introduces supplementary information of row and column for biclustering process and represents corresponding joint distribution probability model. In addition, it estimates the parameter of joint distribution probability model based on variational Bayesian learning method. Finally, it estimates the performance of proposed algorithm through synthesized data and real gene expression data set. Experiments show that normalized mutual information of this paper’s new method is better than relevant biclustering algorithms for biclustering analysis.
Improving DNA Barcode-based Fish Identification System on Imbalanced Data using SMOTE Wisnu Ananta Kusuma; Nurdevi Noviana; Lailan Sahrina Hasibuan; Mala Nurilmala
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.5011

Abstract

Problem in imbalanced data is very common in classification or identification. The problem is raised when the number of instances of one class far exceeds the other. In the previous research, our DNA barcode-based Identification System of Tuna and Mackerel was developed in imbalanced dataset. The number of samples of Tuna and Mackerel were much more than those of other fish samples. Therefore, the accuracy of the classification model was probably still in bias. This research aimed at employing Synthetic Minority Oversampling Technique (SMOTE) to yield balanced dataset. We used k-mers frequencies from DNA barcode sequences as features and Support Vector Machine (SVM) as classification method. In this research we used trinucleotide (3-mers) and tetranucleotide (4-mers). The training dataset was taken from Barcode of Life Database (BOLD). For evaluating the model, we compared the accuracy of model using SMOTE and without SMOTE in order to classify DNA barcode sequences which is taken from Department of Aquatic Product Technology, Bogor Agricultural University. The results showed that the accuracy of the model in the species level using SMOTE was 7% and 13% higher than those of non-SMOTE for trinucleotide (3-mers) and tetranucleotide (4-mers), respectively. It is expected that the use of SMOTE, as one of data balancing technique, could increase the accuracy of DNA barcode based fish classification system, particularly in the species level which is difficult to be identified.
Weighted Ensemble Classifier for Plant Leaf Identification R. Putri Ayu Pramesti; Yeni Herdiyeni; Anto Satriyo Nugroho
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.7615

Abstract

Plant leaf identification using image can be constructed by ensemble classifier. Ensemble classifier executes classification of various features independently. This experiment utilized texture feature and geometry feature of plant leaf to find out which features are more powerful. Each classifier trained by specific feature produced different accuracy rate. To integrate ensemble classifier the results of the classification were weighted, so as the score obtained from better features contributed greater to the final results. Weighted classification results were combined to get the final result. The proposed method was evaluated using dataset comprises of 156 variety of plants with 4559 images. Weighting and combining classifier used in this study were Weighted Majority Vote (WMV) and Naïve Bayes Combination. Both of those method result showed better accuracy than using single classifier. The average accuracy of single classifier was 61.2% for geometry classifier and 70.3% for texture classifier, while WMV method was 77.8% and Naïve Bayes Combination was 94.6%. The calculation of classifier’s weight by using WMV method produces a weight value of 0.54 for texture feature classifier and 0.46 for geometry feature classifier.
Effects of the Computer Mediated Communication Interaction on Vocabulary Improvement Siamak Mirzaei; Ashkan Farrokh Hayati
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.10195

Abstract

This study examined the effect of CMC interaction on Iranian EFL learners’ vocabulary improvement. The study was carried out on the basis of a comparative design and tried to compare CMC with face to-face interactions in the Iranian EFL learners in order to see whether the learners’ lexical knowledge improved by the CMC interaction. Participants of the study were advanced learners studying in a language institute. The Oxford placement test was used to determine the Iranian EFL learners’ proficiency level and ensure a homogeneous sample. Then, the participants were randomly assigned to one control group (face-to-face interaction) and one experimental group (CMC interaction) in order to compare the effect of CMC on the learners’ vocabulary improvement. The learners took a pre-test to select 12 target lexical items, treatment activity to perform information-gap task, and two immediate and delayed post-tests for assessing the acquisition of new lexical items. Yahoo Messenger was used to provide the chat communication. The research provided evidence that there was a significant relationship between the use of CMC interaction and face-to-face interaction with regard to improvement in the learners’ vocabulary learning. The result indicated that the learners’ vocabulary learning improved more in CMC interaction in comparison to face-to-face interaction. In addition, there was a significant difference in negotiating the meaning of new lexical items through CMC interaction in comparison to face-to-face interaction. Moreover, the results indicated that in terms of signal, the CMC interaction outperformed face-to-face group.
A novel elementary spatial expanding scheme form on SISR method with modifying Geman&McClure function Darun Kesrarat; Kornkamol Thakulsukanant; Vorapoj Patanavijit
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 5: October 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

Because of the feasible and impressive fallout, the classical Super-Resolution Reconstruction (SRR) is the contemporary algorithm for improving spatial information and reducing noise and SISR (Single-Image Super-Resolution) method, which is form on the classical SRR, is solely developed for improving spatial information. Disastrously, deficiency of the classical SISR method is conceptually computed from three specifications (b, h, k) and the simulating calculation of the optimized specifications for interpolating the better and higher spatial information images with highest PSNR is so burdersome. For figuring out this issue, the Geman&Mcclure function is proposed to replace with the ordinary SISR function because this function is conceptually computed from only one specification (T), contrary to three specifications similar to classical SISR method hence this analytic article focuses to offer a novel elementary spatial expanding scheme form on SISR method with modifying Geman&Mcclure function. Therefore, the fallout of a proposed spatial expanding scheme approximately matches to classical SISR method. From these reason, a novel elementary spatial expanding scheme is easily implemented for real works.

Filter by Year

2004 2022


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