Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Informatika SAINS DAN MATEMATIKA Jurnal technoscientia IJID (International Journal on Informatics for Development) Indonesian Journal of Electrical Engineering and Computer Science JURNAL TEKNOLOGI TECHNOSCIENTIA
Jazi Eko Istiyanto
Gadjah Mada University
Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Earth & Planetary Sciences Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering

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

Found 10 Documents
Search

 1 
MODEL INTEROPERABILITAS ANTAR APLIKASI E-GOVERNMENT Istiyanto, Jazi Eko; Sutanta, Edhy
JURNAL TEKNOLOGI TECHNOSCIENTIA Technoscientia Vol 4 No 2 Februari 2012
Publisher : Lembaga Penelitian & Pengabdian Kepada Masyarakat (LPPM), IST AKPRIND Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (269.902 KB) | DOI: 10.34151/technoscientia.v4i2.501

Abstract

Interoperability between information systems is an urgent problem to be solved in the development of e-Gov in Indonesia. This is caused by the need for increasing the data multisectoral policy-making in order to solve problems involving data from the inter-related sectors. While the state government application in the current environment, are still largely sectoral, in isolation, can not communicate with each other, and heterogeneous. Interoperability between e-Gov applications become important things to be sought the solution to the problem of developing e-Gov in Indonesia are not protracted. This paper is a review of the literature reveals the development of e-Gov in Indonesia, the interoperability problems encountered, and how the model of interoperability between e-Gov built to implement a web services models.
Distributed Database Using Mobile Agent Sugiantoro, Bambang; Wardoyo, Retantyo; Hartati, Sri; Istiyanto, Jazi Eko
IJID (International Journal on Informatics for Development) Vol 1, No 1 (2012): IJID May
Publisher : Universitas Islam Negeri Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (202.233 KB) | DOI: 10.14421/ijid.2012.01102

Abstract

The number of sources of information brings several problems, among them about how to combine the distributed data storage and different. Information on an organization or company is usually stored in separate locations and different formats. When there is an increase in storage capacity and the amount of information search costs, the company faced with an abundance amount of data. System development methodology used is object oriented design with a development framework
APPLICATION FOR MOBILE AGENT TO ACCESS MYSQL Sugiantoro, Bambang; Wardoyo, Retantyo; Hartati, Sri; Istiyanto, Jazi Eko
IJID (International Journal on Informatics for Development) Vol 1, No 2 (2012): IJID December
Publisher : Universitas Islam Negeri Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (322.188 KB) | DOI: 10.14421/ijid.2012.01204

Abstract

Availability of information is increasing rapidly, the method for encoding and storage of information also increased. The number of sources of information brings several problems, among them about how to combine the distributed data storage and different. Information on an organization or company is usually stored in separate locations and different formats. When there is an increase in storage capacity and the amount of information search costs, the company faced with an abundance amount of data. System development methodology used is Rapid Application Development (RAD) with a development framework Guidlines for Rapid Application Engineering (GRAPPLE). The software used in building this application is Borland Jbuilder 9. Rational Rose 2000 is used for the analysis and design using Unified Modeling Language (UML). Mysql server is a type of database to be accessed on each operating system. Operating system used in this study is Windows XP and Linux Fedora Core. This application was developed with aglets, which is one of software for building mobile agent applications.
STUDI KOMPARASI ALGORITMA HIERARCHICAL DAN PARTITIONAL UNTUK CLUSTERING DOKUMEN TEKS BERBAHASA INDONESIA Hamzah, Amir; Susanto, Adhi; Soesianto, F; Istiyanto, Jazi Eko
JURNAL TEKNOLOGI TECHNOSCIENTIA Academia Ista Vol 12 No 01 Agustus 2007
Publisher : Lembaga Penelitian & Pengabdian Kepada Masyarakat (LPPM), IST AKPRIND Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (250.368 KB) | DOI: 10.34151/technoscientia.v0i0.1972

Abstract

Text document clustering is a technique which has been intensively studied be-cause of its important role in the text-mining and information retrieval. In the vector spa-ce model it is typically known two main clustering approaches,i.e. hierachical algorithm and partitional algorithm. The hierarchical algorithm produces deterministic result known as a dendogram, but its weakness is high complexity in time and memory. On the other hand, partitiaonal algorithm has linear time and memory complexity although its clustering result is not independent from its initial cluster. The aim of this research was to study experimentally to compare the perfor-mances of several techniques of hierarchical algorithms and partitional algorithms applied to text documents written in Bahasa Indonesia. The five similarity techniques i.e. UPGM-A, CSI, IST,SL and CL were chosen from hierarchical, whereas K-Means, Bisecting K-Mean and Buckshot are chosen for partitonal ones. The documents were collected from 200 to 800 Indonesian news text that have been categorized manually and used to test these algorithms using F-measure for clustering performance. This value was derived from Recall and Precision and can be used to measure the performance of the algorithms to correctly classify the collections. Results showed that Bisecting K-Mean as a variant of partitional algorithm performed comparably with the two best hierarchical techniques,i.e. UPGMA and CL but with much lower time complexity.
PENYELESAIAN TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA CHEAPEST INSERTION HEURISTICS DAN BASIS DATA Kusrini, Kusrini; Istiyanto, Jazi Eko
Jurnal Informatika Vol 8, No 2 (2007): NOVEMBER 2007
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (90.55 KB) | DOI: 10.9744/informatika.8.2.pp. 109-114

Abstract

There are plenty well-known algorithms for solving Travelling Salesman Program (TSP), such as: Linear Programming (LP), Genetic Algorithm (GA), Nearest Neighbourhood Heuristic (NNH) and Cheapest Insertion Heuristic (CIH). This paper will talk about TSP implementation by using CIH algorithm. The writer uses Borland Delphi 6 and Interbase 6 as tool for implementing TSP. CIH algorithm has been implemented successfully. By determining count of connected cities and distances between them, the traveled route and total route length to visit all cities in a cities network were obtained. However, this algorithm implementation has not yet be able to solve route searching if there are two cities have different load or there are 2 cities that is not connected. Abstract in Bahasa Indonesia : Ada banyak algoritma untuk memecahkan masalah Travelling Salesman Problem (TSP), diantaranya: Linear Programming (LP), Algoritma Genetik, Nearest Neighbourhood Heuristic (NNH) and Cheapest Insertion Heuristic (CIH). Makalah ini akan membahas tentang implementasi algoritma CIH untuk menyelesaikan TSP. Penulis menggunakan Borland Delphi 6 dan Interbase 6 sebagai tool dalam implementasi TSP. Algoritma CIH telah berhasil diimplementasikan. Dengan mengetahui jumlah kota yang terhubung dan jarak diantaranya, rute perjalanan dan total panjang rute untuk mengunjungi semua kota dalam jaringan dapat diketahui. Namun demikian, implementasi algoritma belum mampu menyelesaikan masalah pencarian rute jika ada 2 kota yang mimiliki bobot yang berbeda dengan melihat arahnya dan jika ada 2 buah kota yang tidak terhubung. Kata kunci: TSP, cheapest, insertion, heuristics, basis data.
KARAKTERISTIK PERBEDAAN ANTARA E-COMMERCE (EC) DENGAN E- GOVERNMENT (EG), DAN PENERAPAN PARADIGMA EC PADA EG DENGAN PENDEKATAN EMPIRIS Widodo, Aris Puji; Istiyanto, Jazi Eko
JURNAL SAINS DAN MATEMATIKA Volume 17 Issue 3 Year 2009
Publisher : JURNAL SAINS DAN MATEMATIKA

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

Abstract

ABSTRAKS---Lebih dari satu dekade bahwa aplikasi EC dan EG telah memberikan dampak besar pada beberapa sektor, baik sektor swasta maupun masyarakat. Pemanfaatan Teknologi Informasi dan Komunikasi (TIK) pada EC lebih berhasil dibandingkan dengan pemanfaatan TIK pada pemerintahan dalam hal ini EG. Keberhasilan EC  inilah  yang  akan  digunakan  oleh  pemerintahan  untuk  menerapkan  paradigm  EC  ke  dalam  EG,  dengan mengadopsi  konsep,  proses,  dan  teknologi  yang  diterapkan  pada  bisnis. Kajian  ini  dilakukan  secara  komperatif terhadap dua  fenomena EC dan EG. Pada makalah  ini dibahas  secara empiris mengenai karakteristik persamaan dan perbedaan antara EC dan EG, serta paradigma kekuatan dan kelemahan pada EC untuk diterapkan pada EG. Fenomena  antara  EC  dan  EG  memiliki  banyak  persamaan,  tetapi  pada  prinsipnya  meliliki  perbedaan  secara mendasar terkait mengenai peran bisnis dengan pemerintah.  Kata Kunci : E-Commerce, E-Government, Paradigma, Bisnis, dan Pemerintah   
KARAKTERISTIK METODOLOGI PENELITIAN BIDANG ILMU KOMPUTER (IK) BERLANDASKAN PENDEKATAI\ POSITIVISTIK Istiyanto, Jazi Eko
JURNAL SAINS DAN MATEMATIKA Volume 17 Issue 2 Year 2009
Publisher : JURNAL SAINS DAN MATEMATIKA

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

Abstract

ABSTRAK---Belum  adanya  definisi  secara baku  mengenai  IK,  seringkali  menimbulkanpandangan/persepsi  yang  kurang  tepat  tentang  IK, demikian  pula  untuk kajian penelitian  juga masih  terdapatpresepsi  yang berbeda-beda.  Untuk  ini  dibutuhkan proses persam&rn  presepsi mengenai  definisi,  area,metodologi,  dan karakteristik  penelitian  IK.  Penelitian  IK  dilakukan  dengan  pendekatan  positivistik yangmemiliki  karakteriktis analitik,  nomotetik, dedikatif,  laboratorik, pembuktian dengan  logika,  kebenmanuniversal, dan bersifat bebas  nilai.  Peneliatian  IK  dapat berbentuk  penelitian  rekayasa  dan nonrekayasa.Penelitian  rekayasa  memiliki tahapan  secara  life cycle  yang  terdiri dari tahapan  plan, aialysis, construct,  danapplied.  Hasil akhir  penelitian  rekayasa  berbentuk  model,  formula,  algoritma,  struktur  data,  arsitektur,  produk,maupun  sistem  yang  telah  teruji, sedangkan  hasil penelitian  nomekayasa  dapat  berupa  teori dan keputusanyang  telah  teruji  pula  secara  empiris.Kata kunci : Positivistilg  Life Cycle,  Rekayasa,  dan  Nonrekayasa
MODEL INTEROPERABILITAS ANTAR APLIKASI E-GOVERNMENT Istiyanto, Jazi Eko; Sutanta, Edhy
JURNAL TEKNOLOGI TECHNOSCIENTIA Technoscientia Vol 4 No 2 Februari 2012
Publisher : Lembaga Penelitian & Pengabdian Kepada Masyarakat (LPPM), IST AKPRIND Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34151/technoscientia.v4i2.501

Abstract

Interoperability between information systems is an urgent problem to be solved in the development of e-Gov in Indonesia. This is caused by the need for increasing the data multisectoral policy-making in order to solve problems involving data from the inter-related sectors. While the state government application in the current environment, are still largely sectoral, in isolation, can not communicate with each other, and heterogeneous. Interoperability between e-Gov applications become important things to be sought the solution to the problem of developing e-Gov in Indonesia are not protracted. This paper is a review of the literature reveals the development of e-Gov in Indonesia, the interoperability problems encountered, and how the model of interoperability between e-Gov built to implement a web services models.
STUDI KOMPARASI ALGORITMA HIERARCHICAL DAN PARTITIONAL UNTUK CLUSTERING DOKUMEN TEKS BERBAHASA INDONESIA Hamzah, Amir; Susanto, Adhi; Soesianto, F; Istiyanto, Jazi Eko
JURNAL TEKNOLOGI TECHNOSCIENTIA Academia Ista Vol 12 No 01 Agustus 2007
Publisher : Lembaga Penelitian & Pengabdian Kepada Masyarakat (LPPM), IST AKPRIND Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34151/technoscientia.v0i0.1972

Abstract

Text document clustering is a technique which has been intensively studied be-cause of its important role in the text-mining and information retrieval. In the vector spa-ce model it is typically known two main clustering approaches,i.e. hierachical algorithm and partitional algorithm. The hierarchical algorithm produces deterministic result known as a dendogram, but its weakness is high complexity in time and memory. On the other hand, partitiaonal algorithm has linear time and memory complexity although its clustering result is not independent from its initial cluster. The aim of this research was to study experimentally to compare the perfor-mances of several techniques of hierarchical algorithms and partitional algorithms applied to text documents written in Bahasa Indonesia. The five similarity techniques i.e. UPGM-A, CSI, IST,SL and CL were chosen from hierarchical, whereas K-Means, Bisecting K-Mean and Buckshot are chosen for partitonal ones. The documents were collected from 200 to 800 Indonesian news text that have been categorized manually and used to test these algorithms using F-measure for clustering performance. This value was derived from Recall and Precision and can be used to measure the performance of the algorithms to correctly classify the collections. Results showed that Bisecting K-Mean as a variant of partitional algorithm performed comparably with the two best hierarchical techniques,i.e. UPGMA and CL but with much lower time complexity.
SMOTE tree-based autoencoder multi-stage detection for man-in-the-middle in SCADA Rolansa, Freska; Istiyanto, Jazi Eko; Afiahayati, Afiahayati; Kusuma Frisky, Aufaclav Zatu
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 1: April 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i1.pp133-144

Abstract

Security incidents targeting supervisory control and data acquisition (SCADA) infrastructure are increasing, which can lead to disasters such as pipeline fires or even lost of lives. Man-in-the-middle (MITM) attacks represent a significant threat to the security and reliability of SCADA. Detecting MITM attacks on the Modbus SCADA networks is the objective of this work. In addition, this work introduces SMOTE tree-based autoencoder multi-stage detection (STAM) using the Electra dataset. This work proposes a four-stage approach involving data preprocessing, data balancing, an autoencoder, and tree classification for anomaly detection and multi-class classification. In terms of attack identification, the proposed model performs with highest precision, detection rate/recall, and F1 score. In particular, the model achieves an F1 score of 100% for anomaly detection and an F1 score of 99.37% for multi-class classification, which is preeminence to other models. Moreover, the enhanced performance of multi-class classification with STAM on minority attack classes (replay and read) has shown similar characteristics in features and a reduced number of misclassifications in these classes.
Co-Authors Adhi Susanto Afiahayati Afiahayati, Afiahayati Aris Puji Widodo Aufaclav Zatu Kusuma Frisky Bambang Sugiantoro Edhy Sutanta (Jurusan Teknik Informatika IST AKPRIND Yogyakarta) F Soesianto Freska Rolansa, Freska Herri Setiawan Kusrini Kusrini Purwo Santoso Retantyo Wardoyo Sri Hartati Wiwik Handayani