Article Per Year (5 Year)
p-Index From 2021 - 2026
0.751
P-Index
This Author published in this journals
All Journal Jurnal Satya Informatika JUAN: Jurnal Pengabdian Nusantara Jurnal Riset Multidisiplin Edukasi
Edison Pardengganan Siahaan
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Library & Information Science Social Sciences Other

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

Found 4 Documents
Search

 1 
PENGEMBANGAN PROTOTYPE SISTEM PENGENALAN WAJAH REAL-TIME BERBASIS PYTHON DAN OPENCV Rajagukguk, Ronaldo P; Siahaan, Edison P; Sitorus, Berlin P
JURNAL SATYA INFORMATIKA Vol. 10 No. 2 (2025): JURNAL SATYA INFORMATIKA
Publisher : FAKULTAS TEKNIK

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59134/jsk.v10i2.747

Abstract

Attendance is one of the important aspects in managing the presence of employees and students. Manual or card-based attendance methods still have several weaknesses, such as being prone to manipulation, requiring more time, and lacking efficiency. Therefore, this study develops a prototype of a real-time face recognition-based attendance system using Python and OpenCV. The research method applied is Prototyping, consisting of stages of requirement analysis, system design,implementation, and testing. The system is designed using the Haar Cascade algorithm for face detection and Local Binary Pattern Histogram (LBPH) for face recognition. The database uses SQLite with three main tables: users, positions, and attendance. The system was tested using four face datasets with a total of approximately 400 images, namely from users: Ronaldo, Lisra, Juliardo, and Riswanti. The test results show that the system can detect and recognize users' faces in real-time, automatically record attendance, and generate daily, monthly, and individual attendance reports.
Penggabungan Sifat Binary Min Heap dan Max Heap pada Struktur Data Min-Max Heap dan Max-Min Heap: Konsep dan Visualisasi Edison Pardengganan Siahaan
Jurnal Riset Multidisiplin Edukasi Vol. 3 No. 1 (2026): Jurnal Riset Multidisiplin Edukasi (Januari 2026)
Publisher : PT. Hasba Edukasi Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.71282/jurmie.v3i1.1579

Abstract

This paper outlines the organizational mechanisms of two variants of the Binary Heap data structure, namely the Binary Min-Max Heap and the Binary Max-Min Heap. These variants are derived from a combination of characteristics found in the Binary Min Heap and Binary Max Heap, allowing users to efficiently retrieve both minimum and maximum values from a collection of stored and organized data. In addition to discussing the conceptual and operational aspects of these structures, the paper also presents the design of a software tool developed to visualize the organization process, particularly the procedures for inserting new nodes and deleting existing nodes from the data structures. The visualization is represented through a class diagram, which illustrates the internal structure of the program, including the attributes and methods involved in its implementation. This design aims to assist users in gaining a more intuitive understanding of the internal workings of both Binary Heap variants.
LITERASI DIGITAL BERBASIS DESIGN THINKING: DARI EMPATI HINGGA EVALUASI USABILITY PADA PERANCANGAN ANTARMUKA Edison Pardengganan Siahaan
JUAN: Jurnal Pengabdian Nusantara Vol. 3 No. 2 (2026): April 2026
Publisher : CV Sentra Nusa Connection

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63545/juan.v3.i2.237

Abstract

Kegiatan pengabdian kepada masyarakat ini bertujuan meningkatkan literasi digital peserta dalam merancang antarmuka pengguna (User Interface/UI) dan pengalaman pengguna (User Experience/UX) melalui pendekatan Design Thinking. Webinar literasi digital dilaksanakan secara daring menggunakan platform konferensi video. Materi yang disampaikan mencakup lima tahap Design Thinking (Empathize, Define, Ideate, Prototype, Test) yang diperkaya dengan metode evaluasi System Usability Scale (SUS) serta integrasi Design Thinking dengan pengembangan perangkat lunak berbasis Agile. Hasil kegiatan menunjukkan bahwa peserta memahami konsep dasar Design Thinking, mampu membedakan UI dan UX, serta dapat menyusun Empathy Map sebagai artefak awal perancangan antarmuka. Pendekatan ini terbukti efektif sebagai kerangka kerja sistematis yang berpusat pada pengguna (human-centered design). Kesimpulan dari kegiatan ini adalah bahwa literasi digital tidak hanya mencakup kecakapan teknis, tetapi juga kemampuan berpikir empatik, analitis, dan iteratif dalam merancang produk digital yang mudah digunakan, efisien, dan memberikan pengalaman bermakna bagi pengguna.
Simulator Interaktif Single Linked List Berbasis Step Execution untuk Mempelajari Mekanisme Penunjukan dan Pengelolaan Memori Edison Pardengganan Siahaan
Jurnal Riset Multidisiplin Edukasi Vol. 3 No. 6 (2026): Jurnal Riset Multidisiplin Edukasi (Juni 2026)
Publisher : PT. Hasba Edukasi Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.71282/jurmie.v3i6.2100

Abstract

The singly linked list data structure is a fundamental concept in computer science that is often difficult to understand due to dynamic memory allocation, pointers, and changes in node relationships. This study aims to design and develop an interactive desktop-based visualization software (Java Swing) that can graphically depict a singly linked list, provide step by step simulation for insert, delete, update, and traverse operations, and synchronize the visualization with highlighted line by line C code snippets. The development method follows the iterative Unified Process with four phases: Inception, Elaboration, Construction, and Transition. In the Elaboration phase, artifacts produced include fully dressed use cases, a use case diagram, system sequence diagrams (SSDs), a design class diagram, and a low fidelity wireframe user interface. Test results show that the application successfully executes all operation scenarios, including edge conditions (empty list, single node, invalid positions). The step simulation feature with commit/non commit mechanism and backward/forward navigation works as designed. The memory panel and code highlighting help clarify the relationship between C code and changes in the data structure. This application is suitable for use as an interactive learning medium in Data Structures courses, particularly on the topic of singly linked lists.
Co-Authors Rajagukguk, Ronaldo P Sitorus, Berlin P