Article Per Year (5 Year)
p-Index From 2020 - 2025
0.751
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Jurnal Teknoin Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Jurnal Ilmu Komputer dan Informasi Mechatronics, Electrical Power, and Vehicular Technology Swara Bhumi TELKOMNIKA (Telecommunication Computing Electronics and Control) Pendidikan Geografi Journal of Engineering and Technological Sciences Journal of ICT Research and Applications International Journal of Advances in Intelligent Informatics TEKTRIKA - Jurnal Penelitian dan Pengembangan Telekomunikasi, Kendali, Komputer, Elektrik, dan Elektronika Metafora: Education, Social Sciences and Humanities Journal Indonesian Journal of Electrical Engineering and Computer Science Jurnal Nasional Teknik Elektro dan Teknologi Informasi Jurnal Rekayasa elektrika
KUSPRIYANTO
Institut Teknologi Bandung
Humanities Computer Science & IT Control & Systems Engineering Earth & Planetary Sciences Education Electrical & Electronics Engineering Energy Engineering Mechanical Engineering Social Sciences

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

Found 48 Documents
Search

 1   2   3   4   5 
ALGORITMA ROUTING DI LINGKUNGAN JARINGAN GRID MENGGUNAKAN TEORI GRAF Irfan Darmawan; Kuspriyanto *; Yoga Priyana; Ian Yosep M.E
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2010
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Grid Computing adalah infrastruktur komputasi yang menyediakan akses berskala besar terhadap sumber dayakomputasi yang tersebar secara geografis namun saling terhubung menjadi satu kesatuan fasilitas. Sumber dayaini termasuk antara lain supercomputer, sistem penyimpanan, sumber-sumber data, dan instrument- instrument.Jaringan grid adalah suatu kumpulan resource (mesin, CPU, memori) yang saling berkomunikasi satu sama laindengan menggunakan cara-cara (protokol) tertentu. Jaringan komputer dapat dimodelkan denganmenggunakan graf. Makalah ini khusus membahas pemodelan keterhubungan antar resource dan algoritmarouting yang digunakan, pada suatu jaringan komputer, dengan memanfaatkan teori graf. Pada bagian awaldijabarkan secara ringkas beberapa definisi terkait dengan teori graf. Bagian selanjutnya adalah pembahasanbeberapa algoritma routing pada suatu jaringan komputer. Algoritma routing yang dibahas adalah algoritmaBreadth-First, algoritma Dijkstra dan algoritma Bellman-Ford. Untuk mendapatkan kelebihan dan kekurangandari setiap algoritma routing dilakukan dengan cara menganalisis kompleksitas pada setiap algoritma tersebut.Kata kunci: graf, jaringan grid, router, algoritma routing, BreadFirst, Dijkstra, BellmanFor
PENGARUH PART-OF-SPEECH PADA MESIN PENERJEMAH BAHASA INGGRIS-INDONESIA BERBASIS FACTORED TRANSLATION MODEL Herry Sujaini; Kuspriyanto .; Arry Akhmad Arman; Ayu Purwarianti
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2012
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Tata Bahasa Indonesia memiliki banyak perbedaan dibandingkan dengan Bahasa Inggris. Fakta ini berakibatburuk pada kinerja Mesin Penerjemah Statistik (MPS) Inggris-Indonesia yang berbasis frase. Model MPSmemiliki keterbatasan pada pemetaan frase atau blok dari sumber ke bahasa target tanpa penggunaan informasilinguistik. Menambahkan fitur linguistik, seperti part-of-speech (PoS) dapat berdampak pada kualitasterjemahan. Dalam tulisan ini, penggunaan penandaan PoS dimasukkan sebagai fitur linguistik dalam modelpenerjemah faktor (MPF) menggunakan sistem MPS Moses dan menggunakan BLEU sebagai alat evaluasi.Dari hasil penelitian, penggunaan PoS memiliki dampak terhadap meningkatnya kualitas terjemahan untukbahasa Inggris-Indonesia, hal tersebut terlihat dari hasil eksperimen bahwa dengan menambahkan fitur PoS,akurasi mesin penerjemah meningkat sebesar 2%.
PERANCANGAN KANAL KOMUNIKASI PADA TRANSACTION LEVEL MODELING DALAM PERANCANGAN EMBEDDED SYSTEM Maman Abdurohman; Kuspriyanto .; Sarwono Sutikno; Arif Sasongko
Jurnal Ilmu Komputer dan Informasi Vol 3, No 1 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (752.625 KB) | DOI: 10.21609/jiki.v3i1.140

Abstract

Pada embedded system terdapat dua bagian penting yaitu komponen komputasi (register) dan komponen komunikasi. Komponen komunikasi menjadi perhatian penting pada mekanisme pemodelan level transaksi (Transaction Level Modeling, TLM). Kanal komunikasi adalah komponen untuk transaksi antar register. Fokus pembahasan TLM adalah perancangan kanal yang dapat mengakomodasi untuk peningkatan level transaksi. Kanal (channel) adalah implementasi bus untuk komunikasi antar komponen pada embedded system. Hal ini adalah kunci penting untuk mencapai impelementasi TLM untuk meningkatkan efisiensi pemodelan. Pada paper ini diusulkan beberapa definisi rancangan kanal sebagai implementasi TLM untuk perancangan embedded system. Hasilnya menunjukan bahwa rancangan kanal dapat berjalan sebagai bus untuk transaksi pada TLM. Paper ini menggunakan SystemC sebagai bahasa pemodelan. On embedded systems, there are two important parts: computational components (registers) and communication components. Communication component becomes an important attention on the mechanism of transaction level modeling (TLM). Communication channel is a component for transactions between registers. The focus of TLM is the design of the channel that could accommodate for the increased level of transactions. Channel is the implementation of the bus for communication between components in embedded systems. This is an important key to achieve the implementation of TLM to improve the efficiency of modeling. This paper proposed a definition of the channel design as the implementation of TLM for embedded systems design. The result shows that the design of the channel can run as a bus for transactions on the TLM. This paper uses SystemC as modeling language.
PERANCANGAN ATURAN TRANSFORMASI UML – SYSTEMC DALAM PERANCANGAN EMBEDDED SYSTEM Maman Abdurohman; Kuspriyanto .; Sarwono Sutikno; Arif Sasongko
Jurnal Ilmu Komputer dan Informasi Vol 3, No 2 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1153.664 KB) | DOI: 10.21609/jiki.v3i2.146

Abstract

Pemodelan adalah salah satu proses awal dalam pengembangan suatu aplikasi atau produk. Tahap ini dilakukan untuk meminimalkan kesalahan pada produk akhir. Salah satu metode pemodelan berorientasi objek yang banyak digunakan adalah pemodelan UML (Unified Modeling Language). Dalam UML suatu sistem dipandang sebagai kumpulan objek yang memiliki atribut dan method. SystemC adalah bahasa perancangan perangkat keras yang berbasis C++. SystemC merupakan sebuah library yang mendefinisikan tipe-tipe komponen perangkat keras. Dalam pemodelan bersama perangkat keras dan perangkat lunak, UML dan SystemC memiliki kemampuan yang sama. Pada paper ini dilakukan analisis proses transformasi dari pemodelan berorientasi objek dengan UML dan implementasi dengan menggunakan SystemC. Hasil penelitian menunjukan bahwa proses transformasi UML-SystemC dapat dilakukan karena keduanya memiliki nature yang sama sebagai lingkungan yang dapat merancang bersama hardware dan software. Perangkat yang digunakan untuk penelitian ini adalah Rational Rose dan SystemC. Modeling is one of the first process in the development of an application or product. This phase is done to minimize errors in the final product. One method in object-oriented modeling that is widely used is UML (Unified Modeling Language). In UML a system is seen as a collection of objects that have attributes and methods. SystemC is a hardware design language based on C++. SystemC is a library that defines the types of hardware components. In a joint modeling of hardware and software, UML and SystemC have similar capabilities. In this paper, researchers analyzed the transformation of object-oriented modeling with UML and the implementation by using SystemC. The results shows that the transformation process of UML-SystemC can be done because both have the same nature as the environment that can design both hardware and software. The device used for this study is the Rational Rose and SystemC.
Hardware simulation of automatic braking system based on fuzzy logic control Noor Cholis Basjaruddin; Kuspriyanto Kuspriyanto; Suhendar Suhendar; Didin Saefudin; Virna Apriani Azis
Journal of Mechatronics, Electrical Power and Vehicular Technology Vol 7, No 1 (2016)
Publisher : National Research and Innovation Agency

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14203/j.mev.2016.v7.1-6

Abstract

In certain situations, a moving or stationary object can be a barrier for a vehicle. People and vehicles crossing could potentially get hit by a vehicle. Objects around roads as sidewalks, road separator, power poles, and railroad gates are also a potential source of danger when the driver is inattentive in driving the vehicle. A device that can help the driver to brake automatically is known as Automatic Braking System (ABS). ABS is a part of the Advanced Driver Assistance Systems (ADAS), which is a device designed to assist the driver in driving the process. This device was developed to reduce human error that is a major cause of traffic accidents. This paper presents the design of ABS based on fuzzy logic which is simulated in hardware by using a remote control car. The inputs of fuzzy logic are the speed and distance of the object in front of the vehicle, while the output of fuzzy logic is the intensity of braking. The test results on the three variations of speed: slow-speed, medium-speed, and high-speed shows that the design of ABS can work according to design.
Acquaintance Management Algorithm Based on the Multi-Class Risk-Cost Analysis for Collaborative Intrusion Detection Network Yudha Purwanto; Kuspriyanto Kuspriyanto; Hendrawan Hendrawan; Budi Rahardjo
Journal of Engineering and Technological Sciences Vol. 53 No. 6 (2021)
Publisher : Institute for Research and Community Services, Institut Teknologi Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/j.eng.technol.sci.2021.53.6.10

Abstract

The collaborative intrusion detection network (CIDN) framework provides collaboration capability among intrusion detection systems (IDS). Collaboration selection is done by an acquaintance management algorithm. A recent study developed an effective acquaintance management algorithm by the use of binary risk analysis and greedy-selection-sort based methods. However, most algorithms do not pay attention to the possibility of wrong responses in multi-botnet attacks. The greedy-based acquaintance management algorithm also leads to a poor acquaintance selection processing time when there is a high number of IDS candidates. The growing number of advanced distributed denial of service (DDoS) attacks make acquaintance management potentially end up with an unreliable CIDN acquaintance list, resulting in low decision accuracy. This paper proposes an acquaintance management algorithm based on multi-class risk-cost analysis and merge-sort selection methods. The algorithm implements merge risk-ordered selection to reduce computation complexity. The simulation result showed the reliability of CIDN in reducing the acquaintance selection processing time decreased and increasing the decision accuracy.
Towards host-to-host meeting scheduling negotiation Rani Megasari; Kuspriyanto Kuspriyanto; Emir Mauludi Husni; Dwi Hendratmo Widyantoro
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.6

Abstract

This paper presents a different scheme of meeting scheduling negotiation among a large number of personnel in a heterogeneous community. This scheme, named Host-to-Host Negotiation, attempts to produce a stable schedule under uncertain personnel preferences. By collecting information from hosts’ inter organizational meeting, this study intends to guarantee personnel availability. As a consequence, personnel’s and meeting’s profile in this scheme are stored in a centralized manner. This study considers personnel preferences by adapting the Clarke Tax Mechanism, which is categorized as a non manipulated mechanism design. Finally, this paper introduces negotiation strategies based on the conflict handling mode. A host-to-host scheme can give notification if any conflict exist and lead to negotiation process with acceptable disclosed information. Nevertheless, a complete negotiation process will be more elaborated in the future works.
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptography Implementation Marisa W. Paryasto; Budi Rahardjo; Fajar Yuliawan; Intan Muchtadi Alamsyah; Kuspriyanto Kuspriyanto
Journal of ICT Research and Applications Vol. 6 No. 1 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.1.4

Abstract

Implementing a secure cryptosystem requires operations involving hundreds of bits. One of the most recommended algorithm is Elliptic Curve Cryptography (ECC). The complexity of elliptic curve algorithms and parameters with hundreds of bits requires specific design and implementation strategy. The design architecture must be customized according to security requirement, available resources and parameter choices. In this work we propose the use of composite field to implement finite field multiplication for ECC implementation. We use 299-bit keylength represented in GF((213)23) instead of in GF(2299). Composite field multiplier can be implemented using different multiplier for ground-field and for extension field. In this paper, LUT is used for multiplication in the ground-field and classic multiplieris used for the extension field multiplication. A generic architecture for the multiplier is presented. Implementation is done with VHDL with the target device Altera DE2. The work in this paper uses the simplest algorithm to confirm the idea that by dividing field into composite, use different multiplier for base and extension field would give better trade-off for time and area. This work will be the beginning of our more advanced further research that implements composite-field using Mastrovito Hybrid, KOA and LUT.
DT-MSOF Strategy and its Application to Reduce the Number of Operations in AHP Fazmah Arif Yulianto; Kuspriyanto Kuspriyanto; Teguh Nurhadi Suharsono
Journal of ICT Research and Applications Vol. 12 No. 3 (2018)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2018.12.3.3

Abstract

A computing strategy called Double Track"“Most Significant Operation First (DT-MSOF) is proposed. The goal of this strategy is to reduce computation time by reducing the number of operations that need to be executed, while maintaining a correct final result. Executions are conducted on a sequence of computing operations that have previously been sorted based on significance. Computation will only run until the result meets the needs of the user. In this study, the DT-MSOF strategy was used to modify the Analytic Hierarchy Process (AHP) algorithm into MD-AHP in order to reduce the number of operations that need to be done. The conventional AHP uses a run-to-completion approach, in which decisions can only be obtained after all of the operations have been completed. On the other hand, the calculations in MD-AHP are carried out iteratively only until the conditions are reached where a decision can be made. The simulation results show that MD-AHP can reduce the number of operations that need to be done to obtain the same results (decisions) as obtained by conventional AHP. It was also found that the more uneven the distribution of priority values, the more the number of operations could be reduced.  
KONSEP BARU SISTEM WAKTU-NYATA DAN ALGORITMA PENJADWALAN EDELF (EARLIEST DEADLINE EARLIEST LIVELINE FIRST) Fazmah Arif Yulianto; Kuspriyanto Kuspriyanto
TEKTRIKA Vol 8 No 1 (2003)
Publisher : Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/tektrika.v8i1.218

Abstract

Paper ini menawarkan konsep baru dalam memodelkan sistem waktu-nyata, dengan memasukkan liveline disamping deadline yang merupakan ciri model konvensional. Hal ini dilakukan karena pada kenyataannya, sebagian sistem waktu-nyata tidak hanya dibatasi oleh batas waktu maksimal, tapi juga dibatasi oleh batas waktu tercepat dalam penyajian respon. Dengan adanya liveline, maka beberapa hal harus turut pula disesuaikan, antara lain : strategi waktu pemrosesan data dan penyajian respon serta algoritma penjadwalan proses. Dengan berasumsi bahwa sistem waktu nyata terdiri dari dua modul, yakni : calculator dan actuator, maka diperkenalkan strategi tanpa jeda dan strategi dengan jeda antara eksekusi dua modul tersebut. Algoritma penjadwalan yang dimodifikasi adalah EDF (Earliest Deadline First) menjadi EDELF (Earliest Deadline Earliest Liveline First). Dengan menggunakan contoh kasus, diperlihatkan bahwa EDELF memberikan performansi rata-rata yang lebih baik dibanding EDFKata kunci : sistem waktu nyata, liveline, EDELF
Co-Authors Adin Mochammad Ramadlan AFITA YOLANDA ARI PUTRI, ELENA Albarda Albarda Alditama Rachman Anton Prafanto AQIL, ABDUL Arif B. Putra N Arif Sasongko Arry Akhmad Arman Arry Akhmad Arman Ayu Purwarianti Azis, Virna Apriani Budi Rahardjo Budi Rahardjo DHEWI, RESMITA Didin Saefudin Didin Saefudin Dini Anggraini, Dini Dwi H Widyantoro Dwi Hendratmo Widyantoro Dwi Hendratmo Widyantoro Dwi Hendratmo Widyantoro Edi Rakhman EKA CANDRA, BRIAN Emir Mauludi Husni Emir Mauludi Husni Fajar Yuliawan Fazmah Arif Yulianto Ganda Putra Hary Tjahjono Hendrawan Hendrawan Herry Sujaini Herry Sujaini Herry Sujani Husni S Sastramihardja Ian Prasetya, Nova Ian Yosep M.E Ilham Khrisna Nugraha Intan Muchtadi Alamsyah Irfan Darmawan ISLAMIYAH RAKHMAH, DINA Jaka Sembiring Kurnia Muludi MAHROINI, ZAHIDAH Maman Abdurohman Marisa W. Paryasto Mikhael Bagus Renardi Noor Cholis Basjaruddin Noor Cholis Basjaruddin Noor Cholis Basjaruddin NOVITA SARI, AINUN OLIVIA TYAS ANGGITA, NANCY Putra, Ganda Rani Megasari Richar Fredian ROFIULLOH, GAYUH Rustam Effendi Sarwono Sutikno SETIA NOVIKA PUTRI, DHARWINDA Shofyan Kusuma SILMI DHANURENDRI, CINTYA Siti Maimunah Suharsono, Teguh Nurhadi Suhendar Suhendar Suhendar Suhendar, Suhendar Suhono Harso Supangkat Supriyadi Supriyadi Virna Apriani Azis WIJI LESTARI, JAYANTI Yoga Priyana Yoga Priyana Yoga Priyana Yudha Purwanto