Article Per Year (5 Year)
p-Index From 2021 - 2026
2.258
P-Index
This Author published in this journals
All Journal ALGORITMA : JURNAL ILMU KOMPUTER DAN INFORMATIKA Jurnal Informatika Kaputama (JIK) JTIK (Jurnal Teknik Informatika Kaputama) Journal of Computer Networks, Architecture and High Performance Computing JiTEKH (Jurnal Ilmiah Teknologi Harapan) Prosiding Snastikom Journal of Practical Computer Science (JPCS) Digital Transformation Technology (Digitech) Literasi: Jurnal Pengabdian Masyarakat dan Inovasi Jurnal Ilmu Komputer dan Sistem Informasi
Divi Handoko
Universitas Harapan Medan
Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering Library & Information Science Mechanical Engineering Other

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

Found 18 Documents
Search

 1   2 
Implementasi Metode Backward Chaining Dalam Mendiagnosis Penyakit Periodontitis Terhadap Perokok Aktif Berbasis Android Muhammad Agri Febriansyah; Ilham Faisal; Divi Handoko
Journal of Practical Computer Science Vol. 3 No. 2 (2023): November 2023
Publisher : DPPM Universitas Pelita Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37366/jpcs.v3i2.2669

Abstract

Periodontitis is a serious dental and oral health problem, especially for individuals who are involved in smoking habits. This study discusses the implementation of the backward chaining method in diagnosing periodontitis in active smokers using the Android platform. The backward chaining method is used as an approach in expert systems to analyze symptoms and risk factors associated with periodontitis. The system implemented on the Android platform allows users to access it easily via mobile devices. The results of this study are expected to help active smokers receive early information about the possibility of periodontitis and encourage them to seek further treatment from medical professionals. With this application, it is hoped that awareness about dental and oral health and the impact of smoking on periodontitis can increase among active smokers
Penerapan Bilateral Filtering untuk Peningkatan Kualitas Citra Digital Fokus pada Gaussian, Salt-and-Pepper, dan Speckle Noise Dermawan, Andre; Tommy, Tommy; Handoko, Divi
Algoritma: Jurnal Ilmu Komputer dan Informatika Vol 8, No 2 (2024): November 2024
Publisher : Universitas Islam Negeri Sumatera Utara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30829/algoritma.v8i2.22130

Abstract

The main objective of this research is to improve the quality of digital images without losing important details, such as object edges, while also developing efficient and user- friendly software for image processing. Bilateral filtering is a non-linear filtering method used to reduce noise in images while preserving edge details. This filter works by combining smoothing based on spatial proximity and pixel intensity similarity. Thus, bilateral filtering is effective in reducing noise without blurring the important edges of the image. This research develops an application that can open, process, and save digital images, allowing users to practically reduce noise in images. The results show that bilateral filtering can significantly enhance digital image quality with substantial noise reduction, although certain types of noise may require further parameter adjustments for optimal results. Keywords: Bilateral Filtering, Digital Image, Noise, Visual Basic, Image Processing.
Menerapkan Algoritma Hill Cipher dan Matriks 2x2 Dalam Mengamankan File Teks Menggunakan Kode ASCII Nurharianna Siregar; Ilham Faisal; Divi Handoko
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 1 No. 2 (2022): September 2022
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v1i2.15

Abstract

In today's technological developments, information (messages) is a basic need for society. Therefore the security of an information is very important. To secure the information required a technique that can secure the data, namely cryptography. Therefore, the author makes an application that can keep confidential information. In this application, the author uses a cryptographic method, namely the hill cipher method, where the hill cipher has two processes in encoding messages, namely encryption and description. In this encryption and description process, a matrix key is used. The matrix key used by the author is a 2x2 matrix. Making this application using the Python programming language. The result to be achieved from this research is the creation of an application that can encode confidential information (messages).
Analisis Implementasi Laravel 9 Pada Website E-Book Dalam Mengatasi N+1 Problem Serta Penyerangan Csrf dan Xss M. Mahdi Maulana Lubis; Tommy; Divi Handoko; Nur Wulan
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 2 No. 1 (2023): Januari 2023
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v2i1.46

Abstract

In the current digital era, the use of websites is increasing rapidly, people like everything that is instant, even in terms of reading books, they prefer to read e-books rather than reading books conventionally. Therefore we need a website that is able to process data quickly so that readers will not wait long when they want to find the book or journal they want. In addition, the website also stores data for readers and stores it, but there are lots of irresponsible people who use their data illegally, so further security is needed for the convenience of readers, therefore researchers will analyze the solution to website security problems from xss attacks. and csrf and N+1 problems using Laravel whether it has an effect on the e-book website or not at all
Analisis Keretanan Website Dengan Aplikasi Owasp Zap Abdul Fattah Hasibuan; Tommy; Divi Handoko
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 2 No. 2 (2023): Mei 2023
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v2i2.51

Abstract

Website security is often ignored by developers, including small websites or company profile websites that have data that may be stolen by irresponsible parties. Self-test is needed in order to find out security holes that might be attacked. Therefore, a vulnerability assessment is needed to find security holes. Vulnerability Assessment (VA) is a system scanning process to find vulnerabilities and loopholes in a website system, this loophole provides a backdoor for attackers to attack the victim's system. Owasp-zap is an application that can look for a security hole in the website system, after information about the vulnerability is obtained, the developer can make changes or add scripts to a system so that security holes can be overcome in order to maintain data integrity from attacks by irresponsible parties.
Penerapan Algoritma Floyd Warshall dengan Menggunakan Euclidean Distance dalam Menentukan Rute Terbaik Darmadi Darmadi; T. M. Diansyah; Divi Handoko
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 2 No. 2 (2023): Mei 2023
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v2i2.68

Abstract

Path search is closely related to distance with searching at a location or place in a mapping in a search many heuristic algorithms are used. One of the algorithms used to determine the closest path is the floyd warshal algorithm which applies a heuristic function so that it will provide the most effective path search results. The problem that arises when the general public wants to find the nearest hospital is that there is no information that can be used as a medium that can determine the nearest hospital, therefore this study will apply the floyd warsahll algorithm with a distance formula that can be used to determine the best path or the closest distance To reach the nearest hospital, one of the distance formulas is the Euclidean Distance formula which is a calculation of the distance from 2 points in the Euclidean Distance space. the overall result of the calculation between the starting point or starting point with the end point or end node in the current case the starting point is at Permata Bunda Hospital which is assumed to be the starting point and ending point, namely the Madani Hospital. The results show that for a civil hospital the closest distance is 0.88 km which passes through nodes 2,3, and 4.
Analisis Perbandingan Kinerja Routing Ospf Multi Area IP Versi 4 dan Routing OSPF V3 IP Versi 6 Pada Mikrotik OS Simulasi GNS3 Almayadi Pratama; Ilham Faisal; Divi Handoko
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 1 (2024): Januari 2024
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v3i1.108

Abstract

Large-scale and multi-area networks with quite a lot of routers are certainly very inconvenient if there is no appropriate routing protocol management. One of the reliable routing protocols for distributing routing with quite a lot of routers is the Open Shortest Path First (OSPF) protocol. However, there are 2 types of OSPF on IP version 4 and IP version 6, where on IP version 6 OSPF was developed into OSPF V3, making it difficult for network admins to determine which OSPF quality is better in routing protocols. Therefore, in this study, a comparison was made with the GNS3 simulation to determine the best routing protocol between OSPF IP version 4 and OSPF V3 IP version 6. especially the delay time for IPv4 496ms, IPv6 438ms and packet loss for IPv4 19.74% while IPv6 is 11.97%. Keywords: Routing, OSPF, OSPF V3, IPv4, IPv6
Sistem Pendukung Keputusan Pemilihan Asisten Laboratorium Menggunakan Metode MABAC Rili Aditya; Satrio Apriza Pradana; Wahyudi Maulana; Divi Handoko; David David
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 4 No. 1 (2025): Januari 2025
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v4i1.176

Abstract

The selection of the right laboratory assistant is very important to support practicum activities in the laboratory. The complex selection process requires a systematic approach to assessing candidates based on various criteria, such as GPA, semester specialty, programming knowledge test, interview test. The Multi-Attributive Border Approximation Area Comparison (MABAC) method is one of the methods in multi-criteria decision-making that can be used to solve this problem. MABAC offers an effective approach to evaluating and ranking candidates based on the weight of predetermined criteria. This study implements the MABAC method in SPK for the selection of laboratory assistants, with the aim of improving objectivity and accuracy in the selection process. The results of this system show that MABAC is able to provide consistent and reliable recommendations in determining the most suitable candidates as laboratory assistants.
Co-Authors Abdul Fattah Hasibuan Ade Subarqah Ahmad Zakir, Ahmad Almayadi Pratama Arie Rafika Dewi Asih, Munjiat Setiani Dalimunthe, Yulia Agustina Darmadi Darmadi David David Dermawan, Andre Harahap, Herlina Ilham Faisal M. Mahdi Maulana Lubis Mhd. Tri Arief Mufida Khairani Muhammad Agri Febriansyah Nur Wulan Nurharianna Siregar Rili Aditya Satrio Apriza Pradana Siregar, Yunita Sari Sisca Dwivayana Siti Fadilah Munawarah Syahputri, Nenna Irsa T. M. Diansyah T.M Diansyah Tengku M. Diansyah Tommy Tommy Tommy, Tommy Wahyudi Maulana