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 51 Documents
 2   3   4   5   6 
Search results for , issue "Vol 14, No 4: December 2016" : 51 Documents clear
Factors Influencing User’s Adoption of Conversational Recommender System Based on Product Functional Requirements Z.K. Abdurahman Baizal; Dwi H Widyantoro; Nur Ulfa Maulidevi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Conversational recommender system (CRS) helps customers get products fitted their needs by repeated interaction mechanisms. When customers want to buy products having many and high tech features (e.g., cars, smartphones, notebook, etc.), most users are not familiar with product technical features. The more natural way to elicit customers’ needs is by asking what they really want to use with the product they want (we call as product functional requirements). In this paper, we analyze four factors, e.g., perceived usefulness, perceived ease of use, trust and perceived enjoyment  associated to user’s intention to adopt the interaction model (in CRS) based on product functional requirements. Result of experiment using technology acceptance model (TAM) indicates that, for users who aren’t familiar with technical features, perceives usefulness is a main factor influencing users’ adoption. Meanwhile, perceived enjoyment plays a role on user’s intention to adopt this interaction model, for users who are familiar with technical features of product.
DCR: Double Component Ranking for Building Reliable Cloud Applications Lixing Xue; Zhan Zhang; Decheng Zuo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Since cloud applications are usually large-scale, it is too expensive to enhance the reliability of all components for building highly reliable cloud applications. Therefore, we need to identify significant components which have great impact on the system reliability. FTCloud, an existing approach, ranks the components only considering the impact of component internal failures and ignoring error propagation. However, error propagation is also an important factor on the system reliability. To attack the problem, we propose an improved component ranking framework, named DCR, to identify significant components in cloud applications. DCR employs two individual algorithms to rank the components twice and determines a set of the most significant components based on the two ranking results. In addition, DCR does not require information of component invocation frequencies. Extensive experiments are provided to evaluate DCR and compare it with FTCloud. The experimental results show that DCR outperforms FTCloud in almost all cases.
The Optimal High Performance Computing Infrastructure for Solving High Complexity Problem Yuliant Sibaroni; Fitriyani Fitriyani; Fhira Nhita
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

The high complexity of the problems today requires increasingly powerful hardware performance. Corresponding economic laws, the more reliable the performance of the hardware, it will be comparable to the higher price. Associated with the high-performance computing (HPC) infrastructures, there are three hardware architecture that can be used, i.e. Computer Cluster, Graphical Processing Unit (GPU), and Super Computer. The goal of this research is to determine the most optimal of HPC infrastructure to solve high complexity problem. For this reason, we chose Travelling Salesman Problem (TSP) as a case study and Genetic Algorithm as a method to solve TSP. Travelling Salesman Problem is belong often the case in real life and has a high computational complexity. While the Genetic Algorithm (GA) is belong a reliable algorithm to solve complex cases, but has the disadvantage that the time complexity level is very high. In some research related to HPC infrastructure comparison, the performance of multi-core CPU single node for data computation has not been done. Whereas the current development trend leads to the development of PCs with higher specifications like this. Based on the experiments results, we conclude that the use of GA is very effective to solve TSP. the use of multi-core single-node in parallel for solving high complexity problems as far as this is still better than the two other infrastructure but slightly below compare to multi-core single-node serially, while GPU deliver the worst performance compared to others infrastructure. The utilization of a super computer PC for data computation is still quite promising considering the ease of implementation, while the GPU utilization for the purposes of data computing is profitable if we only utilize GPU to support CPU for data computing.
Heterogeneous Information Knowledge Construction Based on Ontology Jianhou Gan; Gang Xie; Yongzheng Yan; Wanquan Liu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Describing and representing multi-source and heterogeneous knowledge is a popular research topic in recent years. After investigating knowledge forming process based on multi-source heterogeneous information resources, we present a new approach in which different information resources are put into a mutual RDF(S) data model, and semantic reasoning of RDF(S) is conducted. Moreover, a knowledge base construction framework for multi-source heterogeneous information source with combination of Ontology knowledge model is put forward, and an algorithm of knowledge base construction is also proposed, in which the core issues are knowledge inclusion and updating. Then the time complexity of our algorithm is analyzed. Finally, in order to solve the heterogeneous, and uneven horizontal of geographical distribution of ethnic minority information resources in Yunnan Province, we use the proposed method to construct a domain knowledge base for ethnic minority information resources, and use this model to evaluate the efficiency for the knowledge inclusion algorithm in responding time and indexing responding time for different data resources in our experiments.
Iteration Methods for Linear Systems with Positive Definite Matrix Longquan Yong; Shouheng Tuo; Jiarong Shi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Two classical first order iteration methods, Richardson iteration and HSS iteration for linear systems with positive definite matrix, are demonstrated. Theoretical analyses and computational results show that the HSS iteration has the advantages of fast convergence speed, high computation efficiency, and without requirement of symmetry.
Implementation and Analysis of Reversible logic Based Arithmetic Logic Unit Shaveta Thakral; Dipali Bansal; S.K. Chakarvarti
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

There is a tremendous growth in fabrication from small scale integration (SSI) to giant scale integration (GSI). It however raises a question of sustainability of Moore's law due to almost intolerable levels of power consumption. Researchers have invented a lot of methods to reduce power consumption and recent technologies are switching to reversible logic. Reversible logic has various applications in fields of computer graphics, optical information processing, quantum computing, DNA computing, ultra low power CMOS design and communication. Arithmetic Logic Unit (ALU) is considered to be the basic building block of a CPU in the computing environment and portability in computing system highly demands reversible logic based ALU. Modern processors usually have a word length of 32 or 64 bits. Divide and conquer approach principle cascades n number of 1 bit ALU to implement n bit ALU. Several researchers have proposed 1-bit ALU design using various reversible logic gates. This paper aims at categorizing various ways of implementation in VHDL using Xilinx ISE design suit 14.2 tool and comparative analysis of existing 1 bit ALU designs in terms of optimization metrics like power consumption, number of gates, number of constant inputs, number of garbage outputs and quantum cost. ALU realized using carry save adder block is found to be most optimum design in terms of gate count and quantum cost.
Multichannel Data Aquisition System for Monitoring Supercapacitor Module And Cells Nirwan Syarif; Assaidah Assaidah
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper is under in-depth investigation due to suspicion of possible plagiarism on a high similarity indexThe monitoring system is needed to observe changes in the voltage of supercapacitor module and cells so that their performance can be assessed. A multichannel data acquisition system was needed to implement because a module of supercapacitor consists of several individual cells. The system can be implemented in a computer program using data acquisition board and computer programming. The computer program acts as computer and user interface was created by using Labview symbolic programming software, while the data acquisition board was Labjack. The test showed that the monitoring system can receive eight channel of input signal (voltage) of the module and cells simultaneously. The voltage of the module which has a wider range, 0-20 volts, rather than the normal input, 0 to 2.44 volts, can be overcome by adding a voltage divider circuit.
Email Classification Using Adaptive Ontologies Learning Suma T; Kumara Swamy Y S
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Email is a way of communication for the today’s internet world, private and government sector or public sector all are used email for communication with their clients. They can freely send number of mail to their client without disturbing them. Now a day email communication is also a way of advertising, some mail is also spam, lots of social mails are there. Categorization and handling lots of email is an important task for the researches, as they all are working in this field by using the Natural language processing and ontology extraction process. User get frustrated for handling lots of mails and reading those for finding there is any important mail, sometime user delete lots of mail without reading and in that case may be some important mail which contain the important information may be about meeting, seminar etc. is also deleted. For avoiding these scenarios here auto updation of schedule calendar procedure is proposed by the author. Concept extraction and clustering of concept is done based on fuzzy logic, similar mail pattern is grouped in a same cluster if similarity is less than threshold value a new cluster is defined for that. From the extracted concept author establish the relationship between them and generate the result. Computation overhead is also calculated for different set of mails and finds that it takes very less time in computing large email data set.
Supervised Entity Tagger for Indonesian Labor Strike Tweets using Oversampling Technique and Low Resource Features Ayu Purwarianti; Lisa Madlberger; Mochammad Ibrahim
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

We propose an entity tagger for Indonesian tweets sent during labor strike events using supervised learning methods. The aim of the tagger is to extract the date, location and the person/organization involved in the strike. We use SMOTE (Synthetic Minority Oversampling Technique) as an oversampling technique and conducted several experiments using Twitter data to evaluate different settings with varying machine learning algorithms and training data sizes. In order to test the low resource features, we also conducted experiments for the system without employing the word list feature and the word normalization. Our results indicated that different treatment of different types of machine learning algorithms with low resource features can lead to a good accuracy score. Here, we tried Naïve Bayes, C4.5, Random Forest and SMO (Sequential Minimal Optimization) algorithms using Weka as the machine learning tools. For the Naïve Bayes, due to the data distribution based of the class probability, the best accuracy was achieved by removing data duplication. For C4.5 and Random Forest, SMOTE gave higher accuracy result compared to the original data and the data with data duplication removal. For SMO, there is no significant difference among various sizes of training data.
Rectangular Patch Antenna Array for Radar Application Yudi Yuliyus Maulana; Yuyu Wahyu; Folin Oktafiani; Yussi Perdana Saputra; Arie Setiawan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper deals with the characterization of Rectangular Patch Antenna Arrays numerically and experimentally. This antenna is designed to work around frequency of 9.4GHz for radar applications. In the design process, the Computer Simulation Technology (CST) simulator software is utilized to determine the value of the antenna parameters such as gain, radiation pattern, and voltage standing wave ratio (VSWR). The Rectangular Patch Antenna Arrays realized by using the 1x16 patch antenna array, while the patch antenna is implemented using microstrip lines. The Duroid/RT5880 substrate with a dielectric constant of 2.2 and a thickness of 1.57mm applied for implementation. The characterization results show that the VSWR of realized antenna is 1.052, and the gain is 15,26dB which is 1.4dB lower than the design result, while the radiation pattern is unidirectional and elliptical polarization.

Page 5 of 6 | Total Record : 51

 2   3   4   5   6 

Filter by Year

2016 2016


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