Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

0.61

P-Index

This Author published in this journals

All Journal International Journal of Electrical and Computer Engineering Jurnal Informatika Proceedings of KNASTIK TELKOMNIKA (Telecommunication Computing Electronics and Control) JUTI: Jurnal Ilmiah Teknologi Informasi Journal of Mathematical and Fundamental Sciences Journal of Engineering and Technological Sciences Journal of ICT Research and Applications Proceeding of the Electrical Engineering Computer Science and Informatics Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) IT JOURNAL RESEARCH AND DEVELOPMENT Jambura Journal of Informatics

Benhard Sitohang

Institut Teknologi Bandung

Author-ID : 382764

Astronomy Chemistry Computer Science & IT Control & Systems Engineering Dentistry Earth & Planetary Sciences Education Electrical & Electronics Engineering Engineering Library & Information Science Mathematics Physics

Published : 24 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3

Algorithms of Clustering and Classifying Batik Images Based on Color, Contrast and Motif Moertini, Veronica S.; Sitohang, Benhard
Journal of Engineering and Technological Sciences Vol 37, No 2 (2005)
Publisher : ITB Journal Publisher, LPPM ITB

An interactive system could be provided for batik customers with the aim of helping them in selecting the right batiks. The system should manage a collection of batik images along with other information such as fashion color type, the contrast degree, and motif. This research aims to find methods of clustering and classifying batik images based on fashion color, contrast and motif. A color clustering algorithm using HSV color system is proposed. Two algorithms for contrast clustering, both utilize wavelet, are proposed. Six algorithms for clustering and classifying batik images based on group of motifs, employing shape- and texture-based techniques, are explored and proposed. Wavelet is used in image pre-processing, Canny detector is used to detect image edges. Experiments are conducted to evaluate the performance of the algorithms. The result of experiments shows that fashion color and contrast clustering algorithms perform quite well. Three of motif based clustering and classification algorithms perform fairly well, further work is needed to increase the accuracy and to refine the classification into detailed motif.

EXPLORING A BETTER SEARCHBASED IMPLEMENTATION ON SECONDORDER MUTANT GENERATION Tuloli, Mohamad Syafri; Sitohang, Benhard; Hendradjaya, Bayu
Jambura Journal of Informatics VOLUME 1 NOMOR 1, APRIL 2019
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (545.479 KB)

Pengujian perangkat lunak adalah bagian dari proses pengembangan perangkat lunak, dengan tujuan utama untuk mengurangi/menghilangkan kesalahan pada perangkat lunak, hal ini umumnya dilakukan dengan menjalankan kasus-uji. Salah satu teknik untuk mengkur dan meningkatkan kualitas dari kasus uji adalah pengujian mutasi, tetapi walaupun sudah terbukti keefektifannya, teknik ini masih memiliki suatu kendala besar, yaitu tidak praktis untuk digunakan karena melibatkan pembangkitan dan eksekusi dari jumlah mutan yang besar. Belakangan ini penggunaan optimisasi berbasis-pencarian pada permasalahan pengujian perangkat lunak sedang popular. Pada penelitian ini, dilakukan eksplorasi penggunaan optimasi berbasis-pencarian pada pembangkitan mutan (variasi dari program), dengan tujuan untuk menghasilkan mutan yang tidak dapat dideteksi oleh kasus-uji, karena mutan jenis ini memiliki dapat kekurangan dari kasus-uji. Metode usulan dibandingkan dengan algoritma pembangkitan second-order mutant yang umum digunakan, dan juga dibandingkan dengan pendekatan berbasispencarian lainnya. Hasil menunjukkan bahwa metode usulan dapat membangkitkan lebih banyak mutantidak-terdeteksi (undetected-mutant) daripada dengan metode pembangitan mutan yang umum. Metode usulan memiliki performansi yang lebih rendah daripada metode pembangkitan berbasis-pencarian benchmark, tetapi performansinya dapat ditingkatkan dengan melakukan perubahan pada representasi solusi, dan dengan adopsi parameter optimasi yang digunakan oleh metode pembanding.

PQL: KONVERSI SINTAKS SQL MENJADI SINTAKS PQL Sitohang, Benhard; Widagdo, Tricya Esterina
Jurnal Informatika Vol 8, No 2 (2007): NOVEMBER 2007
Publisher : Institute of Research and Community Outreach - Petra Christian University

The aim of our research presented was to evaluate the semantic coverability of PQL (Public Query Language) as a query language, compared to SQL (Structured Query Language). Our approach in doing the evaluation was to develop conversion rules from SQL to PQL statements, by using relational expressions as the intermediate language. The SQL syntaxes were grouped into four categories, based on the number of relations used in the queries and whether the queries were nested or not. Based on the conversions results, it can be concluded that all of SQL statements that include one or more relations with natural join operations - with or without nested sub queries - can be converted into PQL statements. Abstract in Bahasa Indonesia : Evaluasi cakupan semantik PQL (Public Query Language) sebagai satu query, dibandingkan dengan SQL, merupakan kajian utama pada penelitian tentang konversi yang dijelaskan pada makalah ini. Pendekatan dalam evaluasi tersebut, dilakukan dengan mengembangkan dan uji-coba konversi dari SQL menjadi PQL, dengan menggunakan operator relasi sebagai media konversi. Dari pengembangan konversi ini telah dapat mengelompokkan, bahwa semua sintaks SQL yang didasarkan pada natural join dan melibatkan 1 atau beberapa relasi, dapat dikonversi menjadi sintaks PQL, baik query yang bersarang (nested) maupun tidak bersarang. Kata kunci: Public Query Language (PQL), Structured Query Language (SQL), model relasi, operator relasi.

TPDA2 ALGORITHM FOR LEARNING BN STRUCTURE FROM MISSING VALUE AND OUTLIERS IN DATA MINING Sitohang, Benhard; Saptawati, G.A. Putri
Jurnal Informatika Vol 7, No 2 (2006): NOVEMBER 2006
Publisher : Institute of Research and Community Outreach - Petra Christian University

Three-Phase Dependency Analysis (TPDA) algorithm was proved as most efficient algorithm (which requires at most O(N4) Conditional Independence (CI) tests). By integrating TPDA with "node topological sort algorithm", it can be used to learn Bayesian Network (BN) structure from missing value (named as TPDA1 algorithm). And then, outlier can be reduced by applying an "outlier detection & removal algorithm" as pre-processing for TPDA1. TPDA2 algorithm proposed consists of those ideas, outlier detection & removal, TPDA, and node topological sort node.

PENCARIAN BERBASIS KONTEN: STUDI KASUS SISTEM IDENTIFIKASI OTOMATIS SIDIK JARI Indrawan, Gede; Heryanto, Hery; Sitohang, Benhard
Proceedings of KNASTIK 2010
Publisher : Duta Wacana Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar

Pencarian berbasis konten non-alfanumerik (tanpa menggunakan meta data atau atribut atau tag tambahan pada data original) dilakukan pada contoh kasus sistem identifikasi otomatis sidik jari. Sistem identifikasi otomatis sidik jari merupakan sistem yang menghilangkan atau meminimalkan peran ahli dalam identifikasi seseorang berdasarkan masukan data biometrik, yaitu citra sidik jari. Studi kasus berbasis pada proyek open source dan berdasarkan pola MVC, dimulai dari desain Model (bagian back-end, meliputi desain struktur data di basis data), Controller (berbagai algoritma yang digunakan dalam pra pemrosesan dan pemrosesan citra sidik jari, ekstraksi fitur citra sidik jari, pembentukan template hasil ekstraksi fitur untuk disimpan di basis data, pencarian dan pencocokan template masukan terhadap template yang tersimpan di basis data), dan View (antar muka masukan dan keluaran). Paper ini menititikberatkan studi kasus pada pemrosesan sistem sederhana yang memberikan dasar pemahaman dalam implementasi sistem nyata yang merupakan suatu sistem identifikasi otomatis sidik jari skala besar dengan akurasi dan kecepatan sebagai parameter utama.

Organization Goal-Oriented Requirements Elicitation Process to Enhance Information System Fransiskus Adikara; Bayu Hendradjaya; Benhard Sitohang
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

This paper introduces and proposes an approach in goal-oriented requirements elicitation process that using Key Performance Indicators (KPIs), in information system enhancement process. KPIs can be used to control and reduce user requirements problems caused by personal interests of users in requirements elicitation process. An information system enhancement project for a distribution company has been used as a case study to demonstrate this approach. The case study shows that the requirements can be elicited from the organization goals and current information system condition rather than from user requirements. This approach also showed that KPIs have been able to control some user requirements that have difference point of view with high level stakeholder requirements. Compared with the previous research, IT goals and KPIs are more easily identified in the enhancement process rather than through development of a brand new information system.

Classification with Single Constraint Progressive Mining of Sequential Patterns Regina Yulia Yasmin; Putri Saptawati; Benhard Sitohang
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 4: August 2017
Publisher : Institute of Advanced Engineering and Science

Classification based on sequential pattern data has become an important topic to explore. One of research has been carried was the Classify-By-Sequence, CBS. CBS classified data based on sequential patterns obtained from AprioriLike sequential pattern mining. Sequential patterns obtained were called CSP, Classifiable Sequential Patterns. CSP was used as classifier rules or features for the classification task. CBS used AprioriLike algorithm to search for sequential patterns. However, AprioriLike algorithm took a long time to search for them. Moreover, not all sequential patterns were important for the user. In order to get the right and meaningful features for classification, user uses a constraint in sequential pattern mining. Constraint is also expected to reduce the number of sequential patterns that are short and less meaningful to the user. Therefore, we developed CBS_CLASS* with Single Constraint Progressive Mining of Sequential Patterns or Single Constraint PISA or PISA*. CBS_Class* with PISA* was proven to classify data in faster time since it only processed lesser number of sequential patterns but still conform to user’s need. The experiment result showed that compared to CBS_CLASS, CBS_Class* reduced the classification execution time by 89.8%. Moreover, the accuracy of the classification process can still be maintained.

Coevolution of Second-order-mutant Mohamad Syafri Tuloli; Benhard Sitohang; Bayu Hendradjaya
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 5: October 2018
Publisher : Institute of Advanced Engineering and Science

One of the obstacles that hinder the usage of mutation testing is its impracticality, two main contributors of this are a large number of mutants and a large number of test cases involves in the process. Researcher usually tries to address this problem by optimizing the mutants and the test case separately. In this research, we try to tackle both of optimizing mutant and optimizing test-case simultaneously using a coevolution optimization method. The coevolution optimization method is chosen for the mutation testing problem because the method works by optimizing multiple collections (population) of a solution. This research found that coevolution is better suited for multi-problem optimization than other single population methods (i.e. Genetic Algorithm), we also propose new indicator to determine the optimal coevolution cycle. The experiment is done to the artificial case, laboratory, and also a real case.

A New Strategy of Direct Access for Speaker Identification System Based on Classification Hery Heryanto; Saiful Akbar; Benhard Sitohang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

In this paper, we present a new direct access strategy for speaker identification system. DAMClass is a method for direct access strategy that speeds up the identification process without decreasing the identification rate drastically. This proposed method uses speaker classification strategy based on human voice’s original characteristics, such as pitch, flatness, brightness, and roll off. DAMClass decomposes available dataset into smaller sub-datasets in the form of classes or buckets based on the similarity of speaker’s original characteristics. DAMClass builds speaker dataset index based on range-based indexing of direct access facility and uses Nearest Neighbor Search, Range-Based Searching, and Multiclass-SVM Mapping as its access method. Experiments show that the direct access strategy with Multiclass-SVM algorithm outperforms the indexing accuracy of Range-Based Indexing and Nearest Neighbor for one to nine percent. DAMClass is shown to speed up the identification process 16 times faster than sequential access method with 91.05% indexing accuracy.

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

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.

Co-Authors Adikara, Fransiskus Ahmad Dahlan Ahmada, Marsa Akbar, Saiful Amal, Irfan Bayu Hendradjaya Bayu Hendradjaya Dwi H. Widyantoro Fazat Nur Azizah G. A. Putri Saptawati G.A. Putri Saptawati Gede Indrawan Guido P. Bakema Gusti Ayu Putri Saptawati Hendradjaya, Bayu Hery Heryanto I Nyoman Prama Pradnyana Inne Gartina Husein Jasman Pardede Masayu Leylia Khodra Mohamad Syafri Tuloli mohammad syafri tuloli Nasy`an Taufiq Al Ghifari Nasy`an Taufiq Al Ghifari Oerip S. Santosa Oerip S. Santoso Prameswari, Anindya Putri Saptawati Putri Saptawati Regina Yulia Yasmin Regina Yulia Yasmin Shelvie Nidya Neyman Sudarso Kaderi Wiryono Suhono H. Supangkat Tjahjanto, Tjahjanto Tricya Esterina Widagdo Veronica S. Moertini Veronica S. Moertini Veronica S. Moertini Yunastrian, Kurniandha

Title

Found 24 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 24 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 24 Documents
Search