Achmad Kistijantoro

Achmad Kistijantoro

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 March 2018
Verified
Conference Paper
Open access
SWShu Wang
Shu Wang
CLChi Li
Chi Li
HHHenry Hoffmann
Henry Hoffmann
SLShan Lu
Shan Lu
WSWilliam Sentosa
William Sentosa
AKAchmad Kistijantoro
Achmad Kistijantoro

1 September 2018
Verified
Conference Paper
Closed access
YPYulius Denny Prabowo
Yulius Denny Prabowo
HWHarco Leslie Hendric Spits Warnars
Harco Leslie Hendric Spits Warnars
WBWidodo Budiharto
Widodo Budiharto
AKAchmad Kistijantoro
Achmad Kistijantoro
YHYaya Heryadi
Yaya Heryadi
LULukas
Lukas
This study aims to implement and compare the Long Short Term Memory (LSTM) and Simple Recurrent Neural Networks (RNN) algorithm in the case of chatbot using Bahasa Indonesia data. The chatbot model used is a cahatbot model across business/service fields. The training data used in this research are the data on customer service talks with its customers in several business fields or services. To compare the models generated from the LSTM algorithm and Simple RNN algorithm, two tests were carried out, the first test is testing the chat output manually which was done directly by humans and the second test are comparing the LSTM algorithm and Simple RNN algorithms using the same training data and test data. From the experimental results, it was found that the chat output generated by the LSTM algorithm relatively can answer most of the tests correctly rather than Simple RNN algorithm. From the experiment, it was also found that the learning process in the LSTM algorithm takes longer than the learning process on the Simple RNN algorithm.

19 March 2018 in ACM SIGPLAN Notices
Verified
Journal Article
Open access
SWShu Wang
Shu Wang
CLChi Li
Chi Li
HHHenry Hoffmann
Henry Hoffmann
SLShan Lu
Shan Lu
WSWilliam Sentosa
William Sentosa
AKAchmad Kistijantoro
Achmad Kistijantoro
Modern software systems are often equipped with hundreds to thousands of configurations, many of which greatly affect performance. Unfortunately, properly setting these configurations is challenging for developers due to the complex and dynamic nature of system workload and environment. In this paper, we first conduct an empirical study to understand performance-sensitive configurations and the challenges of setting them in the real-world. Guided by our study, we design a systematic and general control-theoretic framework, SmartConf, to automatically set and dynamically adjust performance-sensitive configurations to meet required operating constraints while optimizing other performance metrics. Evaluation shows that SmartConf is effective in solving real-world configuration problems, often providing better performance than even the best static configuration developers can choose under existing configuration systems.

1 August 2015
Verified
Conference Paper
Closed access
ISIskandar Setiadi
Iskandar Setiadi
AKAchmad Kistijantoro
Achmad Kistijantoro
AMAtsuko Miyaji
Atsuko Miyaji
Since the last decade, the growth of computing power and parallel computing has resulted in significant needs of efficient cryptosystem. Elliptic Curve Cryptography (ECC) offers faster computation and stronger security over other asymmetric cryptosystems such as RSA. ECC can be used for several cryptography activities: secret key sharing, message encryption, and digital signature. This paper gives step-by-step tutorial to transform ECC over prime field GF(p) from mathematical concept to the software implementation. This paper also gives several alternatives and tradeoffs between different coordinate systems in the computational process. The implementation result is quite interesting since several computational costs have been optimized in latest instruction sets. For the study case, we provides the implementation result in C language with GNU GMP library on Intel i3 CPU M350 2.27GHz (1 Core, 2 GB RAM, 32-bit architecture).

23 May 2008 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
AKAchmad Kistijantoro
Achmad Kistijantoro
GMGraham Morgan
Graham Morgan
SSSantosh K. Shrivastava
Santosh K. Shrivastava
MLMark C. Little
Mark C. Little
Three-tier middleware architecture is commonly used for hosting enterprise-distributed applications. Typically, the application is decomposed into three layers: front end, middle tier, and back end. Front end ("Web server") is responsible for handling user interactions and acts as a client of the middle tier, while back end provides storage facilities for applications. Middle tier ("application server") is usually the place where all computations are performed. One of the benefits of this architecture is that it allows flexible management of a cluster of computers for performance and scalability; further, availability measures, such as replication, can be introduced in each tier in an application-specific manner. However, incorporation of availability measures in a multitier system poses challenging system design problems of integrating open, nonproprietary solutions to transparent failover, exactly once execution of client requests, nonblocking transaction processing, and an ability to work with clusters. This paper describes how replication for availability can be incorporated within the middle and back-end tiers, meeting all these challenges. This paper develops an approach that requires enhancements to the middle tier only for supporting replication of both the middleware back-end tiers. The design, implementation, and performance evaluation of such a middle-tier-based replication scheme for multidatabase transactions on a widely deployed open source application server (JBoss) are presented.

1 October 2016
Verified
Conference Paper
Closed access
EZEfendi Zaenudin
Efendi Zaenudin
AKAchmad Kistijantoro
Achmad Kistijantoro
SPEA2 (Strength Pareto Evolutionary Algorithm 2) is an evolutionary algorithm based on population, which is solutions to resolve Multi-objective Optimization Problems (MOPs). It has selection process that to select from dataset or objective problem benchmarking such as DTLZ. Our aim is to improve SPEA2 performance to process a population using parallelism in GPU. By optimization fitness and distance calculations using transposed data to process in CUDA platform. The result shows that speed up increase approximately 1.5 times.