cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Hero Wintolo
Contact Email
herowintolo@stta.ac.id
Phone
-
Journal Mail Official
informatika@stta.ac.id
Editorial Address
-
Location
Kab. bantul,
Daerah istimewa yogyakarta
INDONESIA
Compiler
Published by Institut Teknologi Dirgantara Adisutjipto
ISSN : 22523839     EISSN : 25492403     DOI : 10.28989/compiler
Core Subject : Science,
Computer Science & IT
Jurnal "COMPILER" dengan ISSN Cetak : 2252-3839 dan ISSN On Line 2549-2403 adalah jurnal yang diterbitkan oleh Departement Informatika Sekolah Tinggi Teknologi Adisutjipto Yogyakarta. Jurnal ini memuat artikel yang merupakan hasil-hasil penelitian dengan bidang kajian Struktur Diskrit, Ilmu Komputasi , Algoritma dan Kompleksitas, Bahasa Pemrograman, Sistem Cerdas, Rekayasa Perangkat Lunak, Manajemen Informasi, Dasar-dasar Pengembangan Perangkat Lunak, Interaksi Manusia-Komputer, Pengembangan Berbasis Platform, Arsitektur dan Organisasi Komputer, Sistem Operasi, Dasar-dasar Sistem,Penjaminan dan Keamanan Informasi, Grafis dan Visualisasi, Komputasi Paralel dan Terdistribusi, Jaringan dan Komunikasi, Desain, Animasi dan Simulasi Pesawat Terbang. Compiler terbit setiap bulan Mei dan November.
Arjuna Subject : -
Articles 34 Documents
 1   2   3   4 
Search results for , issue "Vol 2, No 2 (2013): November" : 34 Documents clear
SISTEM PENDUKUNG KEPUTUSAN PEMILIHAN KOTA TUJUAN WISATA WILAYAH JAWA BALI MENGGUNAKAN METODE AKSIDENTAL SAMPLING (STUDI KASUS DI GRAS TOUR AND TRAVEL YOGYAKARTA) Ismi Yuniati; Anton Setiawan Honggowibowo; Yuliani Indrianingsih
Compiler Vol 2, No 2 (2013): November
Publisher : Institut Teknologi Dirgantara Adisutjipto

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (183.505 KB) | DOI: 10.28989/compiler.v2i2.50

Abstract

Tourist attraction in Indonesia is one of the natural resources to be proud. That we need an alternative build Decision Support System Application. This application shows can assist determine the potential tourist travel destination, make memorable and accordance with the characteristics potential tourists addition this application saves the time and effort find a tourist destination because it can be accessed anywhere. The final result steps by steps, the best obtained from two respondents are Afriani 105 for the city o f Yogyakarta and Damar 84 for the city o f Sukabumi. Based on these results, system is able to determine built the city as desired tourist destination and tourist characteristics.
ANALISA PERBANDINGAN BREADTH-FIRST SEARCH DAN DEPTHFIRST SEARCH PADA APLIKASI SISTEM PAKAR PENGOBATAN TRADISIONAL Irisma Ifrisma; Anton Setiawan Honggowibowo; Nurcahyani Dewi Retnowati
Compiler Vol 2, No 2 (2013): November
Publisher : Institut Teknologi Dirgantara Adisutjipto

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (355.95 KB) | DOI: 10.28989/compiler.v2i2.45

Abstract

This research was conducted based on the need for tools for parents who have had children in determining a traditional medicine to treat illnesses suffered by children, toddlers and babies. Aids in the fo rm o f an expert system of traditional medicine. This expert system application can be run in a way that the disease name input experienced by children, toddlersand babies, then the expert system will provide information prescription medications to treat the disease. Search method used is the method of Breadth-First Search and Depth-First Search. Results of comparative analysis o f Breadth-First Search and Depth-First Search was concluded that the analysis using the Depth-First Search more quickly provide information about traditional medicine in comparison with using the method of Breadth-First Search. However, the use of the method of Breadth-First Search is superior compared with Depth-FirstSearch. This is because the method of Breadth-First Search will not find a dead end or to find a solution although it has only one solution. And if you have two solutions, the method of Breadth-First Search will find them. The test results of the application of expert system of traditional medicine in the 30 responders was 72.67%. Thus, the application of expert systemof traditional medicine by using Breadth-First Search and Depth-First S earch good.
PERANCANGAN KEAMANAN SISTEM MENGGUNAKAN ALGORITMA HONEYPOT PADA APLIKASI KRS ONLINE (STUDI KASUS : SEKOLAH TINGGI TEKNOLOGI ADISUTJIPTO) Yoris Setiawan; Haruno Sajati; Bambang Sudibya
Compiler Vol 2, No 2 (2013): November
Publisher : Institut Teknologi Dirgantara Adisutjipto

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (160.53 KB) | DOI: 10.28989/compiler.v2i2.56

Abstract

Many colleges already apply web based academic information system use internet connection, so it is need a system security to protect from attacks such as SQL Injection and Brute Force. Honeypot is a system security which devide two system that are original and fake system. Original system used by user to access academic information system that source from correct database. While fake system used to separate hacker and user. Hackers who try to enter with SQL Injection is send to fake system directly which has wrong data. This fake system seems correct and all action that was happened in will be noted on log history. When hacker try some password ese Brute Force, system will reset user password automatically. This system already test with 79 times SQL Injection and 29 times Brute Force attack. All attacks can handle nicely with honeypot algorithm.
LOAD BALANCING MENGGUNAKAN METODE BUBBLE SORT PADA SISTEM DATABASE DENGAN MULTI SERVER Prayitno Prayitno; Agus Basukesti; Yuliani Indrianingsih
Compiler Vol 2, No 2 (2013): November
Publisher : Institut Teknologi Dirgantara Adisutjipto

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (119.177 KB) | DOI: 10.28989/compiler.v2i2.51

Abstract

The increasing demand for the utilize services computer networks has increased the traffic on the network. In general, the server provides service round the clock without a break, so that problems such as breakdown of communication in the network is lost that must be avoided. This cases need for a bettersystem with high performance and reliable every time. Current server technology development will be fast but the memory access speed is slower than the increase in the consumption of bandwidth. This is one o f the factors causing the bottleneck experienced of server. With the load balancing can be provide abetter solution. The concept used to provide a server has the same service. Then, the load balancing will check the CPU usage on each server. The server will perform selection based on the value of the smallest CPU Usage o f all existing servers. The application load balancing is placed before the user accessing ofserver with the object of distributing requests from the user to any of the servers that have been selected by the load balancer. Load balancing provides many benefits to systems that use it. The first, low cost, existing resources do not need to be replaced or discarded. Second, don't always need high end equipment. Third, easily developed when needed arose and a drastic decline in the quality o f service. Load balancing is also more secure, when a failure occurs on the server, load balancing application will redirect the user to the server is still available.

Page 4 of 4 | Total Record : 34

 1   2   3   4 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol 14, No 2 (2025): November Vol 14, No 1 (2025): May Vol 13, No 2 (2024): November Vol 13, No 1 (2024): May Vol 12, No 2 (2023): November Vol 12, No 1 (2023): May Vol 11, No 2 (2022): November Vol 11, No 1 (2022): May Vol 10, No 2 (2021): November Vol 10, No 1 (2021): May Vol 10, No 1 (2021): Mei Vol 9, No 2 (2020): November Vol 9, No 1 (2020): Mei Vol 9, No 1 (2020): May Vol 8, No 2 (2019): November Vol 8, No 1 (2019): Mei Vol 8, No 1 (2019): May Vol 8, No 1 (2019): Mei Vol 7, No 2 (2018): November Vol 7, No 2 (2018): November Vol 7, No 1 (2018): Mei Vol 7, No 1 (2018): Mei Vol 7, No 1 (2018): May Vol 6, No 2 (2017): November Vol 6, No 2 (2017): November Vol 6, No 1 (2017): Mei Vol 6, No 1 (2017): Mei Vol 5, No 2 (2016): November Vol 5, No 2 (2016): November Vol 5, No 1 (2016): Mei Vol 5, No 1 (2016): Mei Vol 4, No 2 (2015): November Vol 4, No 2 (2015): November Vol 4, No 1 (2015): Mei Vol 4, No 1 (2015): Mei Vol 3, No 2 (2014): November Vol 3, No 2 (2014): November Vol 3, No 1 (2014): Mei Vol 3, No 1 (2014): Mei Vol 2, No 2 (2013): November Vol 2, No 2 (2013): November Vol 2, No 1 (2013): Mei Vol 2, No 1 (2013): Mei Vol 1, No 2 (2012): November Vol 1, No 2 (2012): November Vol 1, No 1 (2012): Mei Vol 1, No 1 (2012): Mei More Issue