Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Informatika: Jurnal Pengembangan IT

Review FotoForensic.com dengan Teknik Eror Level Analysis dan JPEG untuk mengetahui Citra Asli Fajar Mahardika; Aurora Dwi Khatulistian; Adam Prayogo Kuncoro
Jurnal Informatika: Jurnal Pengembangan IT Vol 3, No 1 (2018): JPIT, Januari 2018
Publisher : Politeknik Harapan Bersama

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30591/jpit.v3i1.690

Abstract

In this modern era of photography, many facilities including software or hardware can be used as a tool to produce better images and so on falsified images. This research aimed to simulate falsified image detection, utilizing developed error level analysis method. The output of this research is a decision whether an image is authentic one or falsified one. From the testing phase, it can be concluded that the developed method error level analysis method resulted a good detection accuracy.
Penerapan Teori Graf Pada Jaringan Komputer Dengan Algoritma Kruskal Fajar Mahardika
Jurnal Informatika: Jurnal Pengembangan IT Vol 4, No 1 (2019): JPIT, Januari 2019
Publisher : Politeknik Harapan Bersama

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30591/jpit.v4i1.1032

Abstract

Graph theory a branch of mathematics that studies graphs of a problem that arises. Problems related to graph theory include electricity grid planning, water networks, computer networks and so on. In this graph theory, many of the methods studied include Minimum Spanning Tree (MST). This MST method is used to determine a minimum of a graph.  In this MST there is an algorithm which is a kruskal algorithm. This kruskal algorithm is used to determine the shortest distance or minimum tree of a graph. The author conducted several trials related to the algorithm to be used. The author also conducts literature studies to determine the existing problems. In this study, choosing graph theory on a computer network with the algorithm used is the kruskal algorithm. In this study the authors conducted several stages such as hypotheses, trials and results. The results of this study are graph theory can be applied to computer networks, the number of devices needed can be known and in this experiment the algorithm gives a very maximum total used.