R. Gunawan Santosa
Program Studi Teknik Informatika, Fakultas Teknologi Informasi,Universitas Kristen Duta Wacana

Published : 12 Documents
Articles

Found 12 Documents
Search

IMPLEMENTASI ALGORITMA PRIM SEBAGAI CREATOR JALUR PERMAINAN MAZE Hutama, Devian Ricko; Santosa, R. Gunawan; Karel, Junius
Jurnal Informatika Vol 9, No 2 (2013): Jurnal Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2013.92.316

Abstract

In this modern era, computer provides more than mere a computing machine. Game is one of the advancements made, and maze is among the popular computer games. While maze is having a simple goal to exit, creating the maze itself is a challenging matter: creating a single winding and confusing path which connects one entry and one exit. This research implements the Prim Algorithm as a maze generator. User will required to enter certain size of the maze, and the system will automatically create the grids, randoming the entry and exit, and providing the necessary weight data for the grid. The Prim Algorithm will then process the weight data, rendering a maze path. This will provide a variation of maze for each game play. Results of the research shown that maze complexity is not affected by the randoming algorithm used to distribute the grid weights, but dependent to the maze size. Another result is that the number of  path walls deconstructed in an already- formed maze in order to make the correct path is carried on a certain pattern (N x N) - 1, dependent to the size of the maze (N x N).
ANALISIS PERBANDINGAN PERFORMA POINT-TO-POINT TUNNELING PROTOCOL DAN ETHERNET OVER INTERNET PROTOCOL DALAM MEMBENTUK VPN Susanto, Robby Triadi; Indriyanta, Gani; Santosa, R. Gunawan
Jurnal Informatika Vol 9, No 1 (2013): Jurnal Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2013.91.135

Abstract

Virtual Private Network (VPN) is a technology implemented as a solution to connect head and branch offices through a network. VPN enables all offices connected to be treated as a single broadcast domain or a single network, providing a private connection. VPN can be implemented over several protocols: Point-To-Point Tunneling Protocol (PPTP) and Ethernet over Internet Protocol (EoIP). This research conducted through implementation of both protocols on a site-to site VPN and measuring each protocol’s performance using throughput, packet loss and delay parameters obtained from real topology. Overall result shows that EoIP performs better than PPTP. Within six days of observation, obtained data shows that EoIP has better throughput and less delay than PPTP, while PPTP has a smaller rate of packet loss than EoIP.
IMPLEMENTASI ALGORITMA TWOFISH DANI LEAST SIGNIFICANT BIT (LSB) UNTUK PENYEMBUNYIAN FILE TEXT PADA CITRA DIGITAL Setyawan, Devri Riza; Rahardjo, Willy Sudiarto; Santosa, R. Gunawan
Jurnal Informatika Vol 10, No 1 (2014): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2014.101.324

Abstract

Security and confidentiality of information are considered a requirement in today's communication media. Many people have used Internet to share and distribute confidential information. On the other hand, many malicious activities attempts to steal those information by irresponsible parties. Therefore, information must be secured and converted into another form before it is sent to the destination by the use of cryptography and steganography. We developed a program to secure this information, by using Twofish and Least Significant Bit algorithm to encrypt secret messages and then insert it into an image file. By combining these two methods, we can achieve higher levet of information security.The information encoded with twofish algorithm will change the fite size stightly. This changes are caused by the use of padding. In addition, both of the output image are not resistant by some manipulation operations. The output of the system in BMP format does not change the file size after insertion process, while PNG format will have a stightty dffirence infile size due to processing in bitmap mode.
PERBANDINGAN ALGORITMA SHORTEST PATH DALAM PEMROSESAN CITRA DIGITAL SEAM CARVING Sebastian, Florentinus Alvin; Santosa, R. Gunawan; R., Theresia Herlina
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2015.112.449

Abstract

Seam carving is a method of content aware image resizing. As solutions shortest path algorithms are used to find images seams. Seam is a horizontal or vertical path of an image that has minimum energy. There are two (2) shortest path algorithms that will be discussed in this paper. This paper contains the results of shortest path algorithms comparison between Dijkstra and Directed Acyclic Graph to see which one is better than another in case of efficiency. The precomputed and recomputed methods will be compared to find the more efficient method for executing the seam carving transformation. A web application has been built for this purpose. This web app is capable of transforming image size with seam carving method. The complexity of Dijkstra and Acyclic will be compared to find which one is better. The result is Dijkstra has been won, with the O(4V) with Acyclicis O(5V). The use of precomputed and recomputed is evaluated by the conditions. If the preparation is evaluated then recomputed is more efficient, but if the preparation is not evaluated then the precomputed method is the better one and has faster performance. 
ANALISIS GAUSSIAN DAN EDGE CONNECTION DALAM PENAJAMAN DETEKSI TEPI MENGGUNAKAN METODE CANNY Satyawati, Kezia; Tampubolon, Junius Karel; Santosa, R. Gunawan
Jurnal Informatika Vol 12, No 1 (2016): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2016.121.456

Abstract

Edge detection is one of many ways to get information from an image without big data storage needed. In this research, the edge detecting is done by implementing Canny edge detection algorithm. The focus of this research is to analyze the effect of two variables of the first process of Canny, Gaussian filter smoothing, that is size of matrix and variance, to the sharpening of edge detection. The testing is done by changing the size of the matrix and the value of the variance. The results showed that the best matrix size and variance for sharp edge detection is less than 30x30 and 30.
PERBANDINGAN METODE LZ77, METODE HUFFMAN DAN METODE DEFLATE TERHADAP KOMPRESI DATA TEKS Nugraha, Christian Puji; Santosa, R. Gunawan; Chrisantyo A.A., Lukas
Jurnal Informatika Vol 10, No 2 (2014): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2014.102.327

Abstract

Data compression is a very important process in the world that has been vastly using digital files, such as for texts, images, sounds or videos. Those digital files has a varied size and often taking disk storage spaces. To overcome this problem, many experts created compression algorithms, both for lossy and lossless compression. This research discusses about testing of four lossless compression algorithms that applied for text files, such as LZ77, Static Huffman, LZ77 combined with Static Huffman, and Deflate. Performance comparison of the four algorithms is measured by obtaining the compression ratio. From the test results can be concluded that the Deflate algorithm is the best algorithm due to the use of multiple modes, i.e. uncompressed mode, LZ77 combined with Static Huffman mode, and LZ77 combined with Dynamic Huffman Coding mode. The results also showed that the Deflate algorithm can compress text files and generates an average compression ratio of 38.84%.
Implementasi Transformasi Haar Wavelet untuk Deteksi Citra Jeruk Nipis yang Busuk Sunjoyo, Lidya Andriani; Santosa, R. Gunawan; Nugraha, Kristian Adi
Jurnal Informatika Vol 12, No 2 (2016): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2016.122.498

Abstract

Lime is a fruit that has been widely cultivated and used in Indonesia. Many products use this fruit in the production process. The process of sorting fruit is undeniably a very substantial early process. It is necessary for large-scale  be aware of this in term of result and time required for the sorting process. Pattern Recognition is a discipline that focuses on classifying or picturing an object based on characteristics or main attribute of the object. In this research, the author implements Haar Wavelet Transformation method by characteristic extraction based on colour and texture ,  performs classification using K-Nearest Neighbor (k-NN) to detect indication of rotten lime and the grade of k on k-NN so the accuracy of the result could be acquired. Based on analysis result, Haar Wavelet Transformation method is able to be implemented to detect the indication of rotten lime and most optimal accuracy level of this system reaches the number of 85 percent.
IMPLEMENTASI DYNAMIC PROGRAMMING PADA PENENTUAN JENIS MATERIAL UTAMA BANGUNAN ARENA FUTSAL Anthony, Andree; Santosa, R. Gunawan; Lukito, Yuan
Jurnal Informatika Vol 10, No 1 (2014): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2014.101.322

Abstract

Building futsal court need some planning, especially about the materials needed to build a futsal court such as synthetic grass, roofs, walls, benches, and some other materials. Each of materials have many choices usually based on quality and price. Thus it needs a system to assist on calculating the optimum materials combination based on a specified budget. Minimax Route method are used with dynamic programming techniques to maximize the quality of materials while minimizing the price of materials chosen. Based on system testing conducted to futsal court owners in Yogyakarta, the implementation are helpful and have many useful information for someone who want to build futsal court.
Penyelesaian Masalah Symmetric Traveling Salesman Problem Dengan Jaringan Saraf Continuous Hopfield Net S, Apul Prima; Suwarno, Sri; Santosa, R. Gunawan
Jurnal Informatika Vol 6, No 2 (2010): Jurnal Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21460/inf.2010.62.91

Abstract

Makalah ini membahas Penyelesaian Masalah Symmetric Traveling Salesman Problem Dengan Jaringan Saraf Continuous Hopfield Net. Fokus permasalahan adalah seorang salesman harus mengunjungi semua kota sebanyak satu kali dan salesman tersebut harus mulai dari dan kembali ke kota asal. Tujuannya adalah menentukan rute perjalanan dengan jarak total ataupun biaya yang paling minimum. Salah satu bentuk permasalahan TSP adalah symmetric TSP yang menandakan bahwa jarak antar kota bersifat simetrik dengan setiap kota terhubung satu sama lain. Solusi dari permasalahan ini adalah dengan membangun suatu sistem aplikasi untuk menyelesaikan permasalahan symmetric TSP. Adapun penulis menggunakan salah satu metode jaringan saraf tiruan yaitu Continuous Hopfield Net
Accuracy Comparison of C4.5 and CART Algorithms in Predicting Student Achievement Index Category Alverina, Dea; Chrismanto, Antonius Rachmat; Santosa, R. Gunawan
Jurnal Teknologi dan Sistem Komputer Volume 6, Issue 2, Year 2018 (April 2018)
Publisher : Departemen Teknik Sistem Komputer, Fakultas Teknik, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (309.455 KB) | DOI: 10.14710/jtsiskom.6.2.2018.76-83

Abstract

This research compared the accuracy of prediction of Grade Point Average (GPA) of the first semester students using C4.5 and CART algorithms in Faculty of Information Technology (FTI), Universitas Kristen Duta Wacana (UKDW). This research also explored various parameters such as numeric attribute categorization, data balance, GPA categories number, and different attributes availability due to the difference of data availability between Achievement Admission (AA) and Regular Admission (RA). The training data used to create decision tree were FTI students, 2008-2015 batch, while the testing data were FTI students, 2016 batch. The accuracy of prediction was measured by using crosstab table. In AA, the accuracy of both algorithms can be achieved about 86.86%. Meanwhile, in RA the accuracy of C4.5 is about 61.54% and CART is about 63.16%. From these accuracy result, both algorithms are better to predict AA rather than RA.