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 64 Documents
 1   2   3   4   5 
Search results for , issue "Vol 15, No 1: March 2017" : 64 Documents clear
Reduced Software Complexity for E-Government Applications with ZEF Framework Ahmad Nurul Fajar; Imam Marzuki Shofi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

The situation of dynamic change is unpredictable and always growth increasingly. It also can happen anytime and anywhere. The one kind which is always changing is the government policy.This condition is suggested take the impact for software for information system. It will cause replacement, modification, and enhancement of software for information system. There is some commonality and variability of software features in Indonesian Government. Hence, to manage it, we present enhancement of Zuma’s E-Government Framework (ZEF) for reduce software complexity.We enhance ZEF Framework using  SPLE and GORE approach in order to improve traditional software development.It can reduce, if the changing continuously happen.The measurement of  software complexity relate to functionality of system.It can describe with function point, because function point can describe logical software complexity also. The preliminary result of this study can reduce efficiency of software complexity such as information processing size, technical complexity adjustment factors and function points in e-government applications.
Privacy and Personal Data Protection in Electronic Voting: Factors and Measures Muharman Lubis; Mira Kartiwi; Sonny Zulhuda
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

In general, electronic voting as the technology advancement offers the opportunities to reduce the time and budget of implementation which present the greater advantages than traditional approach. It seeks establish the privacy framework in the context of electronic voting that aligns with the mutual comprehension of relevant factors and measures. The result found that privacy concern and perceived benefit have influenced personal data protection significantly. The success and failure of electronic voting implementation depend on the fulfilment of the voter needs on privacy and personal data protection. 
B-BabelNet: Business-Specific Lexical Database for Improving Semantic Analysis of Business Process Models Endang Wahyu Pamungkas; Riyanarto Sarno; Abdul Munif
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

Similarity calculation between business process models has an important role in managing repository of business process model. One of its uses is to facilitate the searching process of models in the repository. Business process similarity is closely related to semantic string similarity. Semantic string similarity is usually performed by utilizing a lexical database such as WordNet to find the semantic meaning of the word. The activity name of the business process uses terms that specifically related to the business field. However, most of the terms in business domain are not available in WordNet. This case would decrease the semantic analysis quality of business process model. Therefore, this study would try to improve semantic analysis of business process model. We present a new lexical database called B-BabelNet. B-BabelNet is a lexical database built by using the same method in BabelNet. We attempt to map the Wikipedia page to WordNet database but only focus on the word related to the domain of business. Also, to enrich the vocabulary in the business domain, we also use terms in the business-specific online dictionary (businessdictionary.com). We utilize this database to do word sense disambiguation process on business process model activity’s terms. The result from this study shows that the database can increase the accuracy of the word sense disambiguation process especially in particular terms related to the business and industrial domains.
Energy-efficient Compressive Data Gathering Utilizing Virtual Multi-input Multi-output Fang Jiang; Yanjun Hu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

Data gathering is an attractive operation for obtaining information in wireless sensor networks (WSNs). But one of important challenges is to minimize energy consumption of networks. In this paper, an integration of distributed compressive sensing (CS) and virtual multi-input multi-output (vMIMO) in WSNs is proposed to significantly decrease the data gathering cost. The scheme first constructs a distributed data compression model based on low density parity check-like (LDPC-like) codes. Then a cluster-based dynamic virtual MIMO transmission protocol is proposed. The number of clusters, number of cooperative nodes and the constellation size are determined by a new established optimization model under the restrictions of compression model. Finally, simulation results show that the scheme can reduce the data gathering cost and prolong the sensor network’s lifetime in a reliable guarantee of sensory data recovery quality.
Recognition Technology for Four Arithmetic Operations Wang Meng; Bian Guangrong; Zheng Kai; He Ninghui; Zhang Yanlei
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

Numeral recognition is an important research direction in field of pattern recognition, and it has broad application prospects. Aiming at four arithmetic operations of general printed formats, this article adopts a multiple hybrid recognition method and is applied to automatically calculating. This method mainly uses BP neural network and template matching method to distinguish the numerals and operators, in order to increase the operation speed and recognition accuracy. Sample images of four arithmetic operations are extracted from printed books, and they are used for testing the performance of proposed recognition method. The experiments show that the method provides correct recognition rate of 96% and correct calculation rate of 89%.
Multiple Regression to Analyse Social Graph of Brand Awareness Yahya Peranginangin; Andry Alamsyah
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

Social Network Analysis (SNA) has become a common tool to conduct social and business research. In marketing SNA is used to measure word of mouth of a marketing campaign. For an example, a good marketing campaign should create intensive conversation between users in social media. In this paper we use SNA metrics to find out if we can predict brand awareness. We crawl conversation data from Twitter to form seven graph of seven brand in Indonesia. We use multiple regression method, an extension of linear regression, to analyse network properties to get insight on how network structure affect brand awareness of a product. Even though this research is still in early stage, but we manage to discover that a good network structure in knowledge dissemination case (such as word of mouth) eventually differ with the one in brand awareness.
Direct Torque Control: Stator Flux Regulation Improvement at Low Speed Nik Rumzi Nik Idris
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

A simple method to improve stator flux regulation of a direct torque control (DTC) of induction motor drive is presented. By using this method, the simple control structure of DTC is retained and no modification to the voltage vectors look-up table is required. To implement this technique, the index to the look-up table is modified so that the reverse voltage vectors are selected (instead of zero-voltage vectors) whenever the stator flux regulation fails. To study the viability and the effectiveness of this simple method in improving the flux regulation at low speed, experiments are conducted to a ¼ hp induction motor with DTC technique. The control algorithm is implemented using a DS1104 controller board with Xilinx FPGA. 
Energy Efficient Routing Protocols for Underwater Wireless Sensor Networks: A Review Mukhtiar Ahmed; Mazleena Salleh; M. Ibrahim Channa; Mohd Foad Rohani
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

The Underwater Sensor Network (UWSN) is main interesting area due to its most valuable applications like: disaster preventions, distributed tactical surveillance, undersea exploration, seismic monitoring, environmental monitoring and many more. The design of energy efficient routing protocol is a challenging issue because in underwater environment the batteries of the sensor nodes cannot be recharged easily. Majority of the researchers have adapted the terrestrial WSN methodologies to overcome this problem but in underwater environment the terrestrial WSN approach is not feasible due to the acoustic signaling and water current. This research paper focuses the key limitation of the energy efficient routing protocols. The simulation results with comparative analysis for energy efficient routing protocols are also presented in this research article; which helps the researchers to find the further research gap in the field of energy efficient routing protocols.
Local Model Checking Algorithm Based on Mu-calculus with Partial Orders Hua Jiang; Qianli Li; Rongde Lin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

The propositionalμ-calculus can be divided into two categories, global model checking algorithm and local model checking algorithm. Both of them aim at reducing time complexity and space complexity effectively. This paper analyzes the computing process of alternating fixpoint nested in detail and designs an efficient local model checking algorithm based on the propositional μ-calculus by a group of partial ordered relation, and its time complexity is O(d2(dn)d/2+2) (d is the depth of fixpoint nesting,  is the maximum of number of nodes), space complexity is O(d(dn)d/2). As far as we know, up till now, the best local model checking algorithm whose index of time complexity is d. In this paper, the index for time complexity of this algorithm is reduced from d to d/2. It is more efficient than algorithms of previous research.
A Fast Localization of Multiple Harmonic Sources for Rectifier Loads by Utilizing Periodogram M. Hatta Jopri; A. Rahim Abdullah; Mustafa Manap; M. Rahimi Yusoff; Tole Sutikno
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper introduces a fast method to localize the multiple harmonic sources (MHS) for rectifier based loads in power distribution system by utilizing periodogram technique with a single-point measurement approach at the point of common coupling (PCC). The periodogram is a fast and accurate technique for analyzing and distinguishing MHS location in power system. Matlab simulation is carried out several unique cases on IEEE test feeder cases due to validate the proposed method. The identification of MHS location is based on the significant relationship of spectral impedance which are fundamental impedance (Z1) and harmonic impedance (Zh) that's extracted from an impedance power spectrum. It is verified that the proposed method is fast, accurate, and cost efficient in localizing MHS. In addition, this method also contributes 100% correct identification of MHS location.

Page 1 of 7 | Total Record : 64

 1   2   3   4   5 

Filter by Year

2017 2017


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