Benhard Sitohang
Institut Teknologi Bandung

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

Found 3 Documents
Search
Journal : TELKOMNIKA (Telecommunication Computing Electronics and Control)

Simulation and Implementation Model of Productivity Measurement Internet Bandwidth Usage Tjahjanto Tjahjanto; Benhard Sitohang; Sudarso Kaderi Wiryono
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.1544

Abstract

The Internet is used by a very large number of users, from the ordinary  user community, through special users, like people with high intellectual level. The growth in the number of users is increasing very fast. Internet has also been used by multi-sector businesses with multi profession. It makes information the internet usage something very strategic, one of which information productivity internet bandwidth usage. This paper describes a model implementation and simulation of productivity measurement internet bandwidth usage, which describes all possible measurement values obtained, and is a continuation of previous research, which is the basic concept of productivity in the use of internet bandwidth and how to measure it, so that the measuring results can be used as a guide in determine the direction of policy and the provision of productive Internet bandwidth usage.
Progressive Mining of Sequential Patterns Based on Single Constraint Regina Yulia Yasmin; Putri Saptawati; Benhard Sitohang
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.5098

Abstract

Data that were appeared in the order of time and stored in a sequence database can be processed to obtain sequential patterns. Sequential pattern mining is the process to obtain sequential patterns from database. However, large amount of data with a variety of data type and rapid data growth raise the scalability issue in data mining process. On the other hand, user needs to analyze data based on specific organizational needs. Therefore, constraint is used to impose limitation in the mining process. Constraint in sequential pattern mining can reduce the short and trivial sequential patterns so that the sequential patterns satisfy user needs. Progressive mining of sequential patterns, PISA, based on single constraint utilizes Period of Interest (POI) as predefined time frame set by user in progressive sequential tree. Single constraint checking in PISA utilizes the concept of anti monotonic or monotonic constraint. Therefore, the number of sequential patterns will decrease, the total execution time of mining process will decrease and as a result, the system scalability will be achieved.
A New Copyright Protection for Vector Map using FFT-based Watermarking Shelvie Nidya Neyman; I Nyoman Prama Pradnyana; Benhard Sitohang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 2: June 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This study proposed a new approach of copyright protection for vector map using robust watermarking on FFT algorithm. A copyright marker inserted in vector map as the watermark. In addition to data origin authentication capabilities watermark, RSA cryptographic algorithm is used when generating the watermark. Quality measurement of the results was based on the three characteristics of digital watermarking: (1) invisibility using RMSE calculations, (2) fidelity with the farthest distance and (3) NC calculation and gemotrical level of robustness against attacks. Result of experiments showed that the approach used in this study succeeded in inserting copyright as watermark on vector maps. Invisibility test showed good results, demonstrated by RMSE close to zero. Fidelity of the watermarked map was also maintained. Level of watermark robustness against geometric attacks on vector map results has been maintained within the limits that these attacks do not affect the watermark bit value directly.