Article Per Year (5 Year)
p-Index From 2021 - 2026
7.267
P-Index
This Author published in this journals
All Journal IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Teknika Jurnal IPTEK Jurnal KARISMATIKA Sinkron : Jurnal dan Penelitian Teknik Informatika Jurnal Mercumatika : Jurnal Penelitian Matematika dan Pendidikan Matematika EKSAKTA : Jurnal Penelitian dan Pembelajaran MIPA Zero : Jurnal Sains, Matematika, dan Terapan Jurnal Nasional Komputasi dan Teknologi Informasi Jurnal Kridatama Sains dan Teknologi bit-Tech Jurnal Pendidikan Teknologi Informasi dan Vokasional JATI (Jurnal Mahasiswa Teknik Informatika) Jurnal Sistem Informasi dan Sains Teknologi SKANIKA: Sistem Komputer dan Teknik Informatika Journal of Soft Computing Exploration Griya Journal of Mathematics Education and Application Jurnal SAINTIKOM (Jurnal Sains Manajemen Informatika dan Komputer) Teknik: Jurnal Ilmu Teknik dan Informatika INCODING: Journal of Informatics and Computer Science Engineering Instal : Jurnal Komputer ALACRITY : Journal Of Education Kresna: Jurnal Riset dan Pengabdian Masyarakat Formosa Journal of Science and Technology (FJST) Journal of Artificial Intelligence and Engineering Applications (JAIEA) Jurnal Matematika, Komputasi dan Statistika Blend Sains Jurnal Teknik QISTINA: Jurnal Multidisiplin Indonesia Journal of Education Technology Information Social Sciences and Health Innovative: Journal Of Social Science Research TAMIKA: Jurnal Tugas Akhir Manajemen Informatika & Komputerisasi Akuntansi Jurnal Multidisiplin Teknologi dan Arsitektur Journal of Informatics and Data Science (J-IDS) Jurnal Komputer dan Teknologi (JUKOMTEK) Jurnal Ilmiah Sistem Informasi Journal of Accounting Law Communication and Technology Journal of Education Transportation and Business Journal of Computer Science Advancements Jurnal Publikasi Ilmu Komputer dan Multimedia
Zulfahmi Indra, Zulfahmi
Uniersitas Negeri Medan
Religion Aerospace Engineering Agriculture, Biological Sciences & Forestry Humanities Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Mathematics Mechanical Engineering Neuroscience Nursing Physics Public Health Social Sciences Transportation Other

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

Found 58 Documents
Search

 2   3   4   5   6 
Penerapan Metode SMART Pada Sistem Pendukung Keputusan Penentuan Penerima Bantuan Sosial Bagi Keluarga Miskin Ada Novisari D. Simanungkalit; Nerli Khairani; Zulfahmi Indra; Said Iskandar Al Idus
bit-Tech Vol. 7 No. 2 (2024): bit-Tech
Publisher : Komunitas Dosen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32877/bt.v7i2.1814

Abstract

Kemiskinan merupakan permasalahan utama yang dihadapi banyak negara di dunia, termasuk Indonesia, yang menghambat tercapainya kesejahteraan masyarakat karena berdampak pada rendahnya kualitas sumber daya manusia dan sulitnya memenuhi kebutuhan dasar. Salah satu upaya untuk mengatasi kemiskinan adalah melalui pemberian bantuan sosial kepada keluarga miskin. Namun, penyaluran bantuan ini sering kali tidak berjalan optimal akibat data penerima yang tidak akurat, sehingga memicu konflik dan protes. Penelitian ini bertujuan untuk menentukan kelayakan penerimaan bantuan sosial bagi keluarga miskin di Gereja Bethel Pembaruan Duri dengan menggunakan Metode SMART (Simple Multi Attribute Rating Technique). Penelitian ini dilakukan melalui beberapa tahapan, seperti identifikasi masalah, studi lapangan, kajian literatur, analisis, penerapan metode, serta pengujian dan validasi hasil. Data penelitian mencakup informasi dari 70 jemaat, meliputi nama, alamat, jumlah tanggungan, status pernikahan, tingkat pendidikan kepala keluarga, penghasilan, dan pengeluaran rumah tangga. Hasil penelitian menunjukkan bahwa jemaat dengan nilai akhir >=0,65 layak menerima bantuan, nilai antara >= 0,50 hingga  <=0,64 dipertimbangkan lebih lanjut berdasarkan jumlah tanggungan dan penghasilan, sementara nilai <= 0,49 dianggap tidak layak. Penelitian ini menyimpulkan bahwa Metode SMART efektif dalam menentukan kelayakan penerimaan bantuan sosial, karena mampu meminimalkan masalah ketidakakuratan data penerima, sehingga membantu meningkatkan efisiensi dan keadilan dalam proses distribusi bantuan sosial.
Implementasi Program Penjadwalan CPU Menggunakan Algoritma Round Robin Untuk Penyelesaian Soal Penjadwalan Proses Syti Salwaa; Ridho Affandi; Shaqila Rahmayani; Zulfahmi Indra
Jurnal Publikasi Ilmu Komputer dan Multimedia Vol. 5 No. 1 (2026): Januari: Jurnal Publikasi Ilmu Komputer dan Multimedia
Publisher : Pusat Riset dan Inovasi Nasional

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55606/jupikom.v5i1.5596

Abstract

In operating systems, CPU scheduling plays a crucial role in determining the execution order of processes to ensure efficient and fair processor utilization. One of the most commonly used scheduling algorithms in time-sharing systems is the Round Robin algorithm. This algorithm works by allocating an equal time slice (time quantum) to each process and then rotating unfinished processes back into the ready queue for subsequent execution. This mechanism makes Round Robin fair and responsive to all processes. This study discusses the implementation of a CPU scheduling program using the Round Robin algorithm in operating systems to solve process scheduling problems. The developed program simulates various process scenarios with different arrival times, burst times, and time quanta to analyze their effects on waiting time and turnaround time. The simulation results indicate that the selection of an appropriate time quantum significantly affects system performance: a too-small time quantum increases the frequency of context switching, while a too-large time quantum reduces system responsiveness. With an optimal time quantum, the Round Robin algorithm achieves a balance between efficiency and fairness in CPU process management, making it highly effective for modern time-sharing operating systems.
Implementasi Algoritma First In First Out (FIFO) Berbasis Web untuk Perhitungan dan Simulasi Berbagai Kasus Antrean Akbar Alif Haikal; Zulfahmi Indra; Azril Arfansyah; Ammar Kamil Al Abror; Aldrik Bastio
Jurnal Publikasi Ilmu Komputer dan Multimedia Vol. 5 No. 1 (2026): Januari: Jurnal Publikasi Ilmu Komputer dan Multimedia
Publisher : Pusat Riset dan Inovasi Nasional

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55606/jupikom.v5i1.5615

Abstract

Algoritma First In First Out (FIFO) merupakan metode penjadwalan sederhana yang secara luas digunakan dalam berbagai sistem antrean. Prinsip utama algoritma ini adalah entitas yang datang terlebih dahulu akan dilayani terlebih dahulu tanpa mempertimbangkan prioritas tertentu. Penelitian ini bertujuan untuk mengimplementasikan algoritma FIFO dalam bentuk aplikasi berbasis web menggunakan bahasa pemrograman HTML, CSS, dan JavaScript. Aplikasi ini dirancang untuk menghitung dan mensimulasikan sistem antrean berdasarkan parameter arrival time dan burst time, serta menghasilkan keluaran berupa start time, waitingtime, dan turn around time secara otomatis. Metode penelitian meliputi tahap perancangan algoritma, pengembangan antarmuka web, serta pengujian melalui berbagai skenario antrean sederhana. Hasil implementasi awal menunjukkan bahwa sistem mampu menampilkan hasil perhitungan secara akurat sesuai teori dasar FIFO. Aplikasi ini dapat digunakan sebagai media pembelajaran interaktif yang membantu pengguna memahami konsep sistem antrean dan penerapan algoritma penjadwalan proses secara praktis.
Analisis Perbandingan DFA dan NFA Dalam Pencocokan String Muhammad Rafli Wijaya; Zulfahmi Indra; M. Gali Almahdi; Sebastian Saut Marulitua Sinaga
TAMIKA: Jurnal Tugas Akhir Manajemen Informatika & Komputerisasi Akuntansi Vol 6 No 1 (2026): TAMIKA: Jurnal Tugas Akhir Manajemen Informatika & Komputerisasi Akuntansi
Publisher : Universitas Methodist Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46880/tamika.Vol6No1.pp64-70

Abstract

String matching is a fundamental process in pattern recognition systems and large-scale text processing, where computational efficiency significantly affects system performance. This study analyzes the comparison between Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA) in string matching using the pattern (a|b)*abb. The research was implemented through a web-based simulator developed with JavaScript, HTML, and CSS and evaluated using eight short test strings representing accepted and rejected inputs, as well as longer strings to observe execution time differences. The results indicate that DFA and NFA produce identical acceptance outcomes for all test cases, indicating that both automata recognize the same language. However, DFA demonstrates better computational efficiency because each input symbol is processed through a single deterministic transition, whereas NFA requires tracking a set of active states, which increases computational overhead. For longer strings, the execution time gap becomes more pronounced, with DFA remaining consistently faster than NFA. These findings suggest that DFA is more suitable for string matching applications requiring time efficiency, while NFA offers greater flexibility in transition design.
Analisis Kinerja Sistem Transportasi Daring: Simulasi Dampak Ukuran Armada dan Algoritma Penugasan Terhadap Waktu Tunggu Pelanggan Muhammad Rizki Alfahri; Zulfahmi Indra; Rizal Muslim Sinaga; Agata Putri Handayani Simbolon
Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI) Vol 8, No 6 (2025): Desember 2025
Publisher : Program Studi Teknik Komputer, Fakultas Teknik. Universitas Serambi Mekkah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32672/jnkti.v8i6.9895

Abstract

Abstrak - Mobilitas perkotaan modern bergantung pada layanan transportasi online.  Optimasi ukuran armada dan algoritma penugasan sangat penting untuk kinerja sistem ini; namun, penelitian empiris tentang perbedaan antara kedua komponen tersebut masih sedikit.  Studi ini menggunakan simulasi komputer untuk melihat bagaimana interaksi antara ukuran armada dan algoritma penugasan berdampak pada waktu tunggu pelanggan.  Studi ini menguji 24 skenario yang menggabungkan 8 ukuran armada (3–30 driver) dan 3 algoritma penugasan (paling dekat, pengaturan acak, dan berbasis queue).  Algoritma driver paling dekat mengurangi waktu tunggu rata-rata sebesar 41,6 persen dibandingkan dengan random assignment, dan setiap simulasi dijalankan selama 150 langkah waktu.  Dengan service rate 100%, armada 25 driver mencapai zero waiting time. Studi ini menunjukkan bukti nyata bahwa kinerja sistem transportasi online dapat secara signifikan ditingkatkan dengan mengoptimalkan kombinasi armada dan algoritma.  Untuk mencapai tingkat efisiensi operasional terbaik, disarankan untuk menggunakan algoritma driver terdekat dengan armada 20 hingga 25 driver.Kata kunci: Transportasi Daring; Optimasi Armada; Algoritma Penugasan; Waktu Tunggu; Simulasi Agent-based; Abstract - Modern urban mobility depends on online transportation services.  Optimizing fleet size and assignment algorithms is critical to the performance of these systems; however, empirical research on the differences between these two components is still scarce.  This study uses computer simulations to examine how the interaction between fleet size and assignment algorithms affects customer wait times.  The study tested 24 scenarios combining 8 fleet sizes (3–30 drivers) and 3 assignment algorithms (nearest driver, random assignment, and queue-based).  The nearest driver algorithm reduced average waiting time by 41.6 percent compared to random assignment, and each simulation ran for 150 time steps.  With a service rate of 100%, a fleet of 25 drivers achieved zero waiting time. This study provides clear evidence that the performance of online transportation systems can be significantly improved by optimizing the combination of fleet size and algorithm. To achieve the highest level of operational efficiency, it is recommended to use the nearest driver algorithm with a fleet size of 20 to 25 drivers.Keywords: Online Transportation; Fleet Optimization; Assignment Algorithm; Waiting Time; Agent-based Simulation;
Flood Prediction for the Wampu River Basin Using the Simple Additive Weighting Method:A Case Study of the Wampu River in Bahorok Miftahul Janna; Said Iskandar; Arnita; Zulfahmi Indra; Susiana
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 5 No. 3 (2026): June 2026
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v5i3.2268

Abstract

Flood is one of the natural disasters that frequently occurs in the Wampu Watershed (DAS Wampu), especially in Bahorok District. Flood risk is influenced by several factors such as rainfall, slope gradient, land use changes, and river depth. The problem in this study is the absence of a decision support system that can objectively determine flood risk levels. This study aims to determine the criteria and weights of flood risk, apply the Simple Additive Weighting (SAW) method, and analyze the accuracy level of the SAW method in determining flood risk. The method used in this research is the Simple Additive Weighting (SAW) method through several stages including criteria weighting, decision matrix construction, data normalization, preference value calculation, and alternative ranking. The research data consists of 18 villages with four criteria: rainfall, slope gradient, land use change, and river depth. The results show the classification of flood risk levels into high, medium, and low categories based on the obtained preference values. Villages with the highest preference values indicate a higher level of flood vulnerability compared to other villages. The model evaluation results indicate that the SAW method has an accuracy level of approximately 90% in determining flood risk classification. Based on these results, it can be concluded that the SAW method can be used as a decision support system to determine flood risk levels and provide recommendations for priority flood mitigation areas in Bahorok District.
Desain Model Matematika Deterministic Finite Automata (DFA) untuk Validasi Keamanan Alur Transaksi Finansial pada Mesin Anjungan Tunai Mandiri (ATM) Perbankan Zulfahmi Indra; Christian Nicholas Sinaga; Lastri Putri Silaban; Jatmiko Althaf Aziz; Callysa Elistia; Azis Kurniadi; Zevan Irfandi Surbakti
KRESNA: Jurnal Riset dan Pengabdian Masyarakat Vol 6 No 1 (2026): Jurnal KRESNA Mei 2026
Publisher : DRPM Universitas Budi Luhur

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36080/kresna.v6i1.314

Abstract

Perkembangan layanan perbankan digital meningkatkan pentingnya keamanan pada sistem transaksi Automatic Teller Machine (ATM). Penelitian ini bertujuan merancang model matematika berbasis Deterministic Finite Automata (DFA) untuk memvalidasi urutan proses transaksi ATM serta mencegah terjadinya penyimpangan alur transaksi. Model yang diusulkan merepresentasikan setiap tahapan transaksi sebagai state dan setiap aksi pengguna sebagai transisi yang bersifat deterministik. Metode penelitian meliputi pengumpulan data melalui studi literatur dan dokumentasi teknis, analisis kebutuhan menggunakan pendekatan 5W1H, pemodelan formal DFA, implementasi menggunakan bahasa pemrograman Python, serta pengujian logika melalui berbagai skenario transaksi. Model DFA dibangun menggunakan struktur 5-tuple dan dilengkapi dengan error state untuk menangani input yang tidak sesuai dengan aturan sistem. Hasil pengujian menunjukkan bahwa model mampu membedakan alur transaksi yang valid dan tidak valid secara efektif. Skenario transaksi normal berhasil diterima hingga mencapai final state, sedangkan percobaan bypass dan penyimpangan urutan transaksi berhasil ditolak melalui mekanisme trap state. Model yang dikembangkan memiliki keunggulan berupa kepastian logika, kemampuan validasi alur transaksi, dan efisiensi komputasi yang tinggi, meskipun masih memiliki keterbatasan pada aspek fleksibilitas dan validasi berbasis waktu.
Implementasi Algoritma K-Nearest Neighbors (KNN) dalam Deteksi Dini Hipertensi berdasarkan Analisis Tekanan Darah Ary Prandika Siregar; Said Iskandar Al Idrus; Zulfahmi Indra; Insan Taufik
INCODING: Journal of Informatics and Computer Science Engineering Vol 5, No 2 (2025): INCODING OKTOBER
Publisher : Mahesa Research Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34007/incoding.v5i2.1018

Abstract

This study aims to develop a web-based hypertension detection system using the K-Nearest Neighbors (KNN) algorithm and to analyze its accuracy in classifying hypertension status. The dataset was obtained from 447 patient medical records at RSKG Rasyida, consisting of eight variables: gender, age, systolic blood pressure, diastolic blood pressure, height, weight, body mass index (BMI), and hypertension status. The preprocessing stage involved three main steps—feature selection (age, systolic and diastolic blood pressure, BMI), data balancing using undersampling, and data normalization through the Min-Max method—resulting in 425 balanced data samples with five hypertension categories. The web application includes modules for login, dashboard, data input, detection results, and detection history, and has been evaluated using black box testing. The best KNN performance was achieved at k = 13 with 92.94% accuracy, 94% precision, 93% recall, and 93% F1-score. These results indicate that the proposed system can accurately classify hypertension and serve as an effective, data-driven screening tool for healthcare professionals.
Co-Authors Abdi Setiawan Ada Novisari D. Simanungkalit Adidtya Perdana, Adidtya Adwitia, Keysa Shifa Agata Putri Handayani Simbolon Akbar Alif Haikal Akbar Tjg, Muhammad Raffi Aldrik Bastio Alfarizi Wijaya Alsya Adelia Putri Ammar Kamil Al Abror Ananda Hatmi, Reza Ananda, Rizky Ananta, Willy Pramudia Anastasya Carity S, Disty Angga Warjaya ARNAH RITONGA, ARNAH Arnita Arnita Arnita Ary Prandika Siregar Asra, Naufal Aqiilah Augis Dinanti Azis Kurniadi Azril Arfansyah Barus, Angelica Batubara, Shabrina Husna Buulolo, Calvin Sahputra Callysa Elistia Chairunisah Chairunisah, Chairunisah Christian Nicholas Sinaga Dede Yusuf Wagiman DIdi Febrian Dinda Kartika Drilanang, Mhd Ilyasyah Evaliana Sembiring, Khatrin Fahra Pebiana Putri Farezi, Nazwar Farhan Ramadhan, Haikal Fauzan, M Rosyid Halawa, Sovantri Putra Paskah Harahap, Muhammad Abarorya Hasibuan, Muhammad Alby Savana Hasibuan, Najwa Latifah Hermawan Syahputra Hidayat, Muhammad Ferdiansyah Hijka Listia Hutagalung, Fhadillah Br Ida Ayu Putu Sri Widnyani Inna Muthmainnah Insan Taufik Jatmiko Althaf Aziz Kana Saputra S Khairany Zuhriyyah Jinan Hsb Khusnul Arifin . Lastri Putri Silaban Lorinez, Yohana Lubis, Afiq Alghazali Lubis, Fauzan Azima Lubis, Muhammad Ghafur Rahman Luge, Miclyael M. Gali Almahdi M. Reza Pratama Harahap MANSUR AS Manullang, Sudianto Melika Debiyana Putri Miftahul Janna Muhammad Andika Muslim Muhammad Iqbal Fahrezzi Muhammad Rafli Wijaya Muhammad Ridho Muhammad Rizki Alfahri Nafil Rizq Trianto Nasution, Adzkia Nur Nasution, Hamidah . Neltriana Syafira Nerli Khairani Niska, Debi Yandra Nouri, Maulana Al Palevi, Muhammad Rheza Pandiangan, Gus Rosauli Paramitha Purba, Desni Parapak, R Putri Angela Parapat, Gerhard Hasangapon Pratama, Ega Purba, Jogi Putri, Repi Meilani Putri, Rezkya Nadilla Rahmah, Nadya Ramayani Siagian Ridho Affandi Rinjani Cyra Nabila Risna Simorangkir Rizal Muslim Sinaga Rumahorbo, Gilbert Aldrich Sabina Wardaniah Said . Iskandar Saketang, Tia Risky Yasmin Samosir, Wahyu Ardiantito Saragih, Vinny Ramayani Savana HSB, Muhammad Alby Sebastian Saut Marulitua Sinaga Selfi Audy Priscilia Shaqila Rahmayani Siagian, Angel Agasari Simamora, Elmanani Simanjorang, Rio Givent A Simanulang, Mika Monica Fransiska Sinaga, Marlina Setia Sipahutar, Nuriana siti wulandari Sitompul, Dicky Sambora Sri Mulyana subanar subanar Sultan Lazuardiansyah Susiana SUSIANA Syahfitri, Ardilla Syarida Aini, Desti Syifa Cendikia, Yolanda Syti Salwaa Tambunan, M. Ananda Rizki Wahabi Hasibuan, Rahman Walidin, Adamsyach Prana Waruwu, Pedro Stella Mario Meyar Yulita Molliq Rangkuti Zai, Samuel Anaya Putra Zai, Tri Sapta Warman Zevan Irfandi Surbakti