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
 49   50   51   52   53 
Review on Psychological Crowd Model Based on LeBon’s Theory Vahid Behtaji Siahkal Mahalleh; Hazlina Selamat; Fargham Sandhu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 2: June 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

Irrational crowds tend to adapt herd mentality, having group behaviour and high suggestion through interaction. It is important to see how an irrational crowd can be controlled to prevent undesirable crowd attitude. This paper reviews existing models and the controllers to provide a comprehensive study for crowd control. It focuses on a comprehensive analysis of the control of psychological crowd, modelled using LeBon’s theory; which defines the crowd behaviour in terms of crowd attitude. The crowd attitude is defined in terms of suggestibility and prestige and the crowd interaction is defined in terms of the interaction of prestige and suggestibility, which is naturally unstable. A controller is required to achieve stability. In this paper several control approaches are described and the best control approach is highlighted. The results conclude, the best control approach is using multiple control agents, since the control effort is reduced and the stabilizing time is improved.
Influence Types of Startup on Hydrothermal Scheduling Ignatius Riyadi Mardiyanto; Hermagasantos Zein; Adi Soeprijanto
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 1: February 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

The energy costs of a power plant consist of startup cost and cost of power usage. In contrast to the existing literature, this study introduces at startup cost based on the duration of thermal power plant downtime. The approach of startup cost function in this research is done by using startup type. Startup of a steam power plant depends on its condition. Generally, there are three types of startup the power plant when the turbine temperature is still very high, i.e. hot start, very hot start and very-very hot start. This paper uses multistage optimization to solve the problem of hydrothermal scheduling with including the startup type cost in the objective function. The simulation results showed operating cost savings when the objective function for optimization also consider the cost based on startup type i.e. when compared with the optimization result which the objective function does not take the cost of startup type.
Numerical Method for Evaluating E-Cash Security Dany Eka Saputra; Sarwono Sutikno; Suhono Harso Supangkat
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 6: December 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

Security evaluations of electronic cash (e-cash) schemes usually produce an abstract result in the form of a logical proof. This paper proposes a new method of security evaluation that produces a quantitative result. The evaluation is done by analyzing the protocol in the scheme using the Markov chain technique. This method calculates the probability of an attack that could be executed perfectly in the scheme’s protocol. As proof of the effectiveness of our evaluation method, we evaluated the security of Chaum’s untraceable electronic cash scheme. The result of our evaluation was compared to the evaluation result from the pi-calculus method. Both methods produced comparable results; and thus, both could be used as alternative methods for evaluating e-cash security.
Lightweight IoT middleware for rapid application development A. Karim Mohamed Ibrahim; Rozeha A. Rashid; A. Hadi Fikri A. Hamid; M. Adib Sarijari; Muhammad Ariff Baharudin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 3: June 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

Sensors connected to the cloud services equipped with data analytics has created a plethora of new type of applications ranging from personal to an industrial level forming to what is known today as Internet of Things (IoT). IoT-based system follows a pattern of data collection, data analytics, automation, and system improvement recommendations. However, most applications would have its own unique requirements in terms of the type of the smart devices, communication technologies as well as its application provisioning service. In order to enable an IoT-based system, various services are commercially available that provide services such as backend-as-a-service (BaaS) and software-as-a-service (SaaS) hosted in the cloud. This, in turn, raises the issues of security and privacy. However there is no plug-and-play IoT middleware framework that could be deployed out of the box for on-premise server. This paper aims at providing a lightweight IoT middleware that can be used to enable IoT applications owned by the individuals or organizations that effectively securing the data on-premise or in remote server. Specifically, the middleware with a standardized application programming interface (API) that could adapt to the application requirements through high level abstraction and interacts with the application service provider is proposed. Each API endpoint would be secured using Access Control List (ACL) and easily integratable with any other modules to ensure the scalability of the system as well as easing system deployment. In addition, this middleware could be deployed in a distributed manner and coordinate among themselves to fulfil the application requirements. A middleware is presented in this paper with GET and POST requests that are lightweight in size with a footprint of less than 1 KB and a round trip time of less than 1 second to facilitate rapid application development by individuals or organizations for securing IoT resources.
Classifying confidential data using SVM for efficient cloud query processing Huda Kadhim Tayyeh; Ahmed Sabah Ahmed Al-Jumaili
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 6: December 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

Nowadays, organizations are widely using a cloud database engine from the cloud service providers. Privacy still is the main concern for these organizations where every organization is strictly looking forward more secure environment for their own data. Several studies have proposed different types of encryption methods to protect the data over the cloud. However, the daily transactions represented by queries for such databases makes encryption is inefficient solution. Therefore, recent studies presented a mechanism for classifying the data prior to migrate into the cloud. This would reduce the need of encryption which enhances the efficiency. Yet, most of the classification methods used in the literature were based on string-based matching approach. Such approach suffers of the exact match of terms where the partial matching would not be considered. This paper aims to take the advantage of N-gram representation along with Support Vector Machine classification. A real-time data will used in the experiment. After conducting the classification, the Advanced Encryption Standard algorithm will be used to encrypt the confidential data. Results showed that the proposed method outperformed the baseline encryption method. This emphasizes the usefulness of using the machine learning techniques for the process of classifying the data based on confidentiality.
Encrypting an audio file based on integer wavelet transform and hand geometry Zeena N. Al-Kateeb; Saja J. Mohammed
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.14216

Abstract

A new algorithm suggested for audio file encryption and decryption utilizing integer wavelet transform to take advantage of the property for adaptive context-based lossless audio coding. In addition, biometrics are used to give a significant level of classification and unwavering quality because the procedure has numerous qualities and points of interest. The offered algorithm utilized many properties of hand geometry estimations as keys to encode and decode the audio file. Many tests were carried out on a set of audio files and quality metrics such as mean square error and correlations were calculated which in turn confirmed the efficiency and quality of the work.
A hybrid naïve Bayes based on similarity measure to optimize the mixed-data classification Fatima El Barakaz; Omar Boutkhoum; Abdelmajid El Moutaouakkil
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.18024

Abstract

In this paper, a hybrid method has been introduced to improve the classification performance of naïve Bayes (NB) for the mixed dataset and multi-class problems. This proposed method relies on a similarity measure which is applied to portions that are not correctly classified by NB. Since the data contains a multi-valued short text with rare words that limit the NB performance, we have employed an adapted selective classifier based on similarities (CSBS) classifier to exceed the NB limitations and included the rare words in the computation. This action has been achieved by transforming the formula from the product of the probabilities of the categorical variable to its sum weighted by numerical variable. The proposed algorithm has been experimented on card payment transaction data that contains the label of transactions: the multi-valued short text and the transaction amount. Based on K-fold cross validation, the evaluation results confirm that the proposed method achieved better results in terms of precision, recall, and F-score compared to NB and CSBS classifiers separately. Besides, the fact of converting a product form to a sum gives more chance to rare words to optimize the text classification, which is another advantage of the proposed method.
PROTOTIPE SISTEM KEAMANAN PINTU RUANGAN MENGGUNAKAN BARCODE PASSWORD DAN PIN PASSWORD Imam Riadi; Suprihatin Suprihatin; Ervin Setyobudi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 5, No 3: December 2007
Publisher : Universitas Ahmad Dahlan

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

Abstract

  Perkembangan teknologi saat ini sangatlah pesat, salah satunya adalah dibidang keamanan yaitu penggunaan Barcode Passoword dan PIN Password. Penelitian ini bertujuan untuk membuat sebuah Prototipe Sistem Keamanan Pintu Ruangan Menggunakan Barcode Password dan PIN Password. Metode yang digunakan untuk membuka dan menutup pintu adalah metode penyesuaian label barcode yang terdapat pada Kartu ID dan PIN dengan data yang terdapat pada database. Sistem Keamanan Pintu Ruangan berkerja apabila label barcode yang discan dan PIN yang dimasukkan sesuai dengan data yang terdapat pada database, sehingga pintu dapat terbuka otomatis. Hasil penelitian ini adalah Prototipe Sistem Keamanan Pintu Ruangan menggunakan barcode password dan PIN Password, Output yang dihasilkan berupa pintu dapat terbuka dan tertutup secara otomatis pada saat label barcode yang terdapat pada Kartu ID discan dan PIN yang dimasukkan sesuai dengan data yang terdapat dalam database.
Maximization Network Throughput based on Maximal Flow for Single-Source Two-Destinations Multicast Huanlin Liu; Ruiyan Li; Liang Qin; 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.102

Abstract

For guaranteeing all multicast destination nodes receiving the source information with their maximal flow respectively and obtaining the network maximal throughput, a heuristic algorithm based on network coding, Maximal Flow for Single-source Two-destinations Multicast (MFSTM) is proposed to maximize the network throughput. By calculating the each destination’s maximal flow, the number of link-disjoint paths which equals to destination’s maximal flow, are searched for each destination to construct the network coding graph. A heuristic algorithm based on network coding is designed to delete the redundant link in the network coding graph and guarantee the network throughput maximization. Comparing the traditional maximal multicast stream algorithm based on network coding, the simulation results show that the MFSTM algorithm makes two destinations receive the information at the speed of their maximal flow respectively, and decode the source node information at each destination node successfully.
Simple, Easy-use and Low-cost Software for Design of Single and Cascaded Microring Resonators Using Semi-numerical Method Budi Mulyanti; Lilik Hasanah; Tommi Hariyadi; Arjuni B Pantjawati; Heru Yuwono; P. Susthita Menon; Sahbudin Shaari
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 3: September 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Development of a simple, easy and low-cost software for designing of waveguide-coupled single and cascaded microring resonator (MRRs) using semi-numerical calculation based on transfer matrix method (TMM), is presented in this paper. The software uses a device model which is embedded on the high index contrast (HIC) structure of silicon-on-insulator (SOI) with monomodal cavity for TE-mode polarizations, operating around 1550 nm optical wavelength. The main aim of the software is to estimate the microring resonator performance parameters, such as free spectral range (FSR) and quality factor (Q-factor). The software is very simple and easy to use. With a standard laptop computer, it only takes few seconds to obtain transmission response, FSR and Q-factor of single MRR for varied waveguides separation distance and ring radius. The results were then verified using simulation method based on finite integration technique using 3D electromagnetic simulator, which need a high memory and processor of computer and take days to execute the simulation. We found only small discrepancy, which in averages are about 4.25% and 10.80% for FSR and Q-factor, respectively. In general, the results obtained from this software are closer to 3D electromagnetic simulation results.

Page 51 of 262 | Total Record : 2614

 49   50   51   52   53 

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