Claim Missing Document
Check
Articles

Rancang Bangun Media Pembelajaran Pengenalan Hewan Nokturnal Untuk Anak Autisme Sriayuwahyuni, Putri; Sutedi, Ade; Latifah, Ayu; Fitriani, Leni
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2588

Abstract

Children with autism often experience difficulties in focusing, communicating, and processing abstract information, making conventional learning methods less effective. This requires learning media that can accommodate special needs through visual, auditory, and exploratory approaches. This study aims to design and develop Android-based interactive learning media to introduce nocturnal animals to children with autism. The method used is the Multimedia Development Life Cycle (MDLC), which consists of the stages of concept, design, material collecting, assembly, testing, and distribution. This media has two main features, namely “Learn,” which presents text, images, sounds, and voice-overs, and “Puzzle,” which trains children's memory and fine motor skills through animal picture assembly activities. Testing results through alpha testing using the black-box method showed that all application features ran according to design without errors. The implication of this research is the availability of learning media that is more interactive, enjoyable, and suitable for the characteristics of children with autism, thus providing an innovative alternative in supporting their learning process.
Rancang Bangun Aplikasi Stok Opname Berbasis Web Sutedi, Ade; Fitriani, Leni; Nuraeni, Fitri; Suryani, Isma
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2732

Abstract

PT Usaha Garda Arta (UG Arta) Jakarta Branch currently still uses a manual system for cassette stock-taking, which results in the risk of data discrepancies, delays in reporting, and potential recording errors. The operational process begins with the creation of a cash replenishment request by the admin and scheduler to the bank, followed by the collection of cash by the Cash In Transit (CIT) team, sorting by the Cash Processing Center (CPC) team, and finally the replenishment of cash into Automated Teller Machine (ATM) cassettes by the Cash Replenishment (CR) team. This operational process requires team coordination and relies on manual recording, which makes it prone to errors. This research was conducted with the aim of designing a web-based stocktaking system to optimize the cassette stock management process at PT UG Arta's Jakarta Branch. This system is designed with features to input staff and officers, input cassette data, monitor cassette stock, global data and history to improve data accuracy, data recording activities, facilitate monitoring of goods in and out, and reduce manual processes. Therefore, this study is expected to make the stocktaking management process easily accessible to parties involved in the operational process. Additionally, this system is also expected to reduce the risk of recording and reporting errors, thereby improving company performance.
Sistem Manajemen Pembelajaran Berbasis Web Menggunakan Metode RAD Musa, Abdul Basri; Fitriani, Leni
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2812

Abstract

Perkembangan teknologi informasi mendorong perubahan signifikan dalam dunia pendidikan, khususnya pada penerapan pembelajaran daring. SMK PGRI Selaawi masih menghadapi kendala seperti penyampaian materi secara manual, keterbatasan akses bagi siswa yang berhalangan hadir, serta proses evaluasi yang konvensional dan memakan waktu. Penelitian ini merancang dan membangun Learning Management System (LMS) dan dibangun sebagai aplikasi berbasis web dengan pendekatan Rapid Application Development (RAD). Hasil implementasi menunjukkan bahwa sistem mampu membantu guru dalam penyebaran materi, penugasan, absensi, serta penilaian secara terpusat. Uji fungsionalitas dengan black box testing membuktikan semua fitur berjalan baik, sementara pengujian usability menggunakan System Usability Scale (SUS) memperoleh skor 90,5 dengan kategori “Excellent”. Dengan demikian, sistem ini dapat menjadi solusi efektif dalam mendukung digitalisasi pembelajaran di SMK PGRI Selaawi.
Arsitektur Model SSDMobileNet V2 untuk Klasifikasi Bahasa Isyarat BISINDO Nurzaman, Muhammad Zein; Fitriani, Leni
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2850

Abstract

In this study, we used a commonly used object detection algorithm to classify sign language gestures, namely BISINDO or Indonesian Sign Language. The process of learning sign language is still limited, especially with the use of traditional methods such as direct conversation or using a dictionary. However, there are still obstacles with this approach, for example, some students have difficulty interpreting what they see in the dictionary. Therefore, this study aims to overcome this problem by using a real-time image classification model. The dataset used in this study was collected by the researchers themselves, with a total of 520 images consisting of 26 classes of BISINDO alphabet gestures. We also used transfer learning in this study to utilize the pre-trained SSDMobileNet V2 architecture. Using the COCO evaluation metric, the results show that this model achieved 94% mean average precision, 91% average precision, and 85% recall. This model can also classify sign language gestures in real-time.
Komparasi Algoritma Greedy Best First Search Dan Ant Colony Optimization Untuk Pemilihan Jalur Evakuasi Bencana Alam Sutedi, Ade; Nugraha, Mohammad Dimas Maulana; Fitriani, Leni; Nuraeni, Fitri
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 13 No 4: Agustus 2026
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25126/jtiik.134

Abstract

Ketidaktepatan dalam pemilihan jalur evakuasi pada situasi bencana alam berpotensi menyebabkan keterlambatan proses penyelamatan dan meningkatkan risiko bagi korban. Permasalahan tersebut menjadi dasar dilakukannya penelitian ini untuk mengkaji strategi penentuan rute evakuasi yang lebih efisien. Penelitian ini bertujuan mengevaluasi dan membandingkan performa algoritma Greedy Best First Search (GBFS) dan Ant Colony Optimization (ACO) dalam menentukan jalur evakuasi dengan jarak terpendek dan waktu tempuh tercepat dari lokasi bencana ke titik evakuasi. Proses pengujian dilakukan melalui pengembangan prototipe berbasis Python yang memanfaatkan graf sebagai representasi jaringan jalur dan posisi geografis lokasi bencana, dengan pendekatan metode pengembangan prototipe. Analisis kinerja kedua algoritma difokuskan pada pengukuran waktu pemrosesan dan panjang rute yang dihasilkan. Hasil evaluasi menunjukkan adanya perbedaan kinerja kedua algoritma secara kuantitatif berdasarkan parameter yang diuji. Secara statistik, GBFS menunjukkan efisiensi komputasi yang sangat signifikan dengan waktu rata-rata >8.000 kali lebih cepat dibandingkan ACO serta tingkat keberhasilan 100%. Meskipun kualitas bobot rute setara pada sebagian besar skenario, ACO menunjukkan variabilitas waktu yang tinggi dan kegagalan solusi pada satu titik awal, namun unggul dalam menghasilkan rute alternatif. Temuan ini diharapkan dapat memberikan kontribusi sebagai bahan rujukan dalam pengembangan sistem evakuasi yang lebih efektif untuk mendukung upaya mitigasi dan penanggulangan bencana alam.   Abstract Inaccurate evacuation route selection during natural disasters can potentially delay rescue efforts and increase the risk to victims. This issue underpins this research, which explores strategies for determining more efficient evacuation routes. This study aims to evaluate and compare the performance of the Greedy Best First Search (GBFS) and Ant Colony Optimization (ACO) algorithms in determining evacuation routes with the shortest distance and fastest travel time from the disaster site to the evacuation point. The testing process was conducted through the development of a Python-based prototype that utilizes graphs to represent the path network and the geographic location of the disaster site, using a prototype development method approach. Performance analysis of both algorithms focused on measuring processing time and the length of the resulting route. The evaluation results showed quantitative differences in the performance of the two algorithms based on the tested parameters. Statistically, GBFS demonstrated highly significant computational efficiency, with an average time >8,000 times faster than ACO and a 100% success rate. Although the quality of the route weights was equivalent in most scenarios, ACO exhibited high time variability and solution failure at one starting point, but excelled in generating alternative routes. These findings are expected to contribute as reference material in developing a more effective evacuation system to support natural disaster mitigation and response efforts.