Article Per Year (5 Year)
p-Index From 2020 - 2025
1.719
P-Index
This Author published in this journals
All Journal TELKOMNIKA (Telecommunication Computing Electronics and Control)
Arya Wicaksana
Universitas Multimedia Nusantara
Computer Science & IT

Published : 6 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 6 Documents
Search

 1 
Rule-based lip-syncing algorithm for virtual character in voice chatbot Felicia Priscilla Lovely; Arya Wicaksana
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 5: October 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

Virtual characters changed the way we interact with computers. The underlying key for a believable virtual character is accurate synchronization between the visual (lip movements) and the audio (speech) in real-time. This work develops a 3D model for the virtual character and implements the rule-based lip-syncing algorithm for the virtual character's lip movements. We use the Jacob voice chatbot as the platform for the design and implementation of the virtual character. Thus, audio-driven articulation and manual mapping methods are considered suitable for real-time applications such as Jacob. We evaluate the proposed virtual character using hedonic motivation system adoption model (HMSAM) with 70 users. The HMSAM results for the behavioral intention to use is 91.74%, and the immersion is 72.95%. The average score for all aspects of the HMSAM is 85.50%. The rule-based lip-syncing algorithm accurately synchronizes the lip movements with the Jacob voice chatbot's speech in real-time.
Particle swarm optimization for solving thesis defense timetabling problem Gilbert Christopher; Arya Wicaksana
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 3: June 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

The thesis defense timetabling problem is a fascinating and original NP-hard optimization problem. The problem involves assigning the participants to defense sessions, composing the relevant committees, satisfying the constraints, and optimizing the objectives. This study defines the problem formulation that applies to Universitas Multimedia Nusantara (UMN) and use the particle swarm optimization (PSO) algorithm to solve it. As a demonstration of concept and viability, the proposed method is implemented in a web-based platform using Python and Flask. The implementation is tested and evaluated using real-world instances. The results show that the fastest timetable generation is 0.18 seconds, and the slowest is 21.88 minutes for 25 students and 18 department members, without any violation of the hard constraints. The overall score of the EUCS evaluation for the application is 4.3 out of 6.
Vision: a web service for face recognition using convolutional network Akino Archilles; Arya Wicaksana
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.14790

Abstract

This paper proposes a face recognition module built as a web service. We introduce a novel design and mechanism for face recognition on a web platform and to memorize most recent users for the user. This web service is called Vision and developed using the Flask and TensorFlow deep learning framework. The face recognition process is powered by FaceNet deep convolutional network model. The face recognition process done by Vision could also be utilized for user authentication and user memorization, both done in on a web platform. As a demonstration of concept and viability, in this study, Vision is integrated into a web-based voice chatbot. The testing and evaluation of Vision’s face recognition process show an overall F-score of one for all test scenarios.
Cleveree: an artificially intelligent web service for Jacob voice chatbot Octavany Octavany; Arya Wicaksana
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.14791

Abstract

Jacob is a voice chatbot that use Wit.ai to get the context of the question and give an answer based on that context. However, Jacob has no variation in answer and could not recognize the context well if it has not been learned previously by the Wit.ai. Thus, this paper proposes two features of artificial intelligence (AI) built as a web service: the paraphrase of answers using the Stacked Residual LSTM model and the question summarization using Cosine Similarity with pre-trained Word2Vec and TextRank algorithm. These two features are novel designs that are tailored to Jacob, this AI module is called Cleveree. The evaluation of Cleveree is carried out using the technology acceptance model (TAM) method and interview with Jacob admins. The results show that 79.17% of respondents strongly agree that both features are useful and 72.57% of respondents strongly agree that both features are easy to use.
Web-app realization of Shor’s quantum factoring algorithm and Grover’s quantum search algorithm Arya Wicaksana; Anthony Anthony; Adjie Wahyu Wicaksono
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.14755

Abstract

Quantum algorithms are well-known for their quadratic if not exponential speedup over their classical counterparts. The two widely-known quantum algorithms are Shor’s quantum factoring algorithm and Grover’s quantum search algorithm. Shor’s quantum factoring algorithm could perform integer factorization in O(logN). Grover’s quantum search algorithm could solve the unsorted search problem in O(√N). However, both algorithms are introduced as theoretical concepts in the original papers due to the limitations of quantum technology at that time. In this paper, an improved way is presented to realize the two algorithms into a web application using state-of-the-art quantum technology. The web-app is designed and built considering the uses of a quantum simulator and libraries provided by ProjectQ and Rigetti Forest. The result shows that both algorithms are realizable into web-applications.
Go-Ethereum for electronic voting system using clique as proof-of-authority Basilius Bias Astho Christyono; Moeljono Widjaja; Arya Wicaksana
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 5: October 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

Current advances in information technology have brought about significant changes, including ways to carry out elections using computer technology known as e-voting. Blockchain underlies the popularity of the digital currency Bitcoin and some other digital money, sparking the start of a new era of Internet use, including electronic voting (e-voting) system. In this work, we proposed designing and implementing an evoting system powered by the Ethereum blockchain. We used real-world data from the Indonesian Election Commission (KPU) with 26 candidates and 15,725 voters from the Jelupang sub-district. The testing and evaluation results using three miners in the blockchain show that the system could commit around 23 transactions per second. All 15,725 votes are committed to the blockchain successfully within 12.75 minutes. The total time required for creating all blockchain accounts is 13.4 hours. 
Co-Authors Adjie Wahyu Wicaksono Akino Archilles Anthony Anthony Basilius Bias Astho Christyono Felicia Priscilla Lovely Gilbert Christopher Moeljono Widjaja Octavany Octavany