cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yusuf Ramadhan Nasution
Contact Email
jirsi.jurnal@gmail.com
Phone
+6285297473212
Journal Mail Official
jirsi.jurnal@gmail.com
Editorial Address
Jl. Kapten M. Jamil Lubis No.45, Bandar Selamat, Kec. Medan Tembung, Kota Medan, Sumatera Utara 20223
Location
Kota medan,
Sumatera utara
INDONESIA
Jurnal Ilmu Komputer dan Sistem Informasi
Published by Unity Academy
ISSN : 28306031     EISSN : 28303954     DOI : -
Core Subject : Science,
Computer Science & IT Library & Information Science
Jurnal Ilmu Komputer dan Sistem Informasi (JIRSI) dikelola secara profesional oleh LKP UNITY Academy dalam membantu para akademisi, peneliti dan praktisi untuk menyebarkan hasil penelitiannya dalam panduan Kemendikbud Ristek Dikti. Jurnal Ilmu Komputer dan Sistem Informasi (JIRSI) Adalah sebuah Jurnal blind peer-review yang didedikasikan untuk publikasi hasil karya ilmiah yang berkualitas di bidang Ilmu Komputer dan Teknologi Informasi (bidang rekayasa perangkat lunak, ilmu komputer, sistem informasi, teknologi informasi dan komunikasi, meachine learning, mikrokontroller, artificial intelligence, computer vision, jaringan komputer). Jurnal Ilmu Komputer dan Sistem Informasi (JIRSI) Terbit 3 kali setahun (Januari, Mei, September).
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 95 Documents
 4   5   6   7   8 
Sistem Deteksi Jenis Kendaraan Metode YOLOv4 Untuk Mendukung Transportasi Cerdas Kota Medan Pramana Putra, M Rizky; Haida Dafitri; Sumi Khairani
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 2 (2024): Mei 2024
Publisher : LKP Unity Academy

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

Abstract

This research discusses the evaluation and implementation of the YOLOv4 model in detecting and tracking vehicle types in the context of road traffic. To address the research questions, the study examined the model's performance across various aspects. The results indicate that the YOLOv4 model achieved a Mean Average Precision (mAP) of 77.88% on the training dataset after 7000 iterations. The model exhibits a commendable ability to detect different vehicle types within images, with varying accuracy rates across distinct classes. The developed application within this study can record detection data for every frame within a video sequence, providing crucial information for analyzing vehicle density on roads. Despite its relatively high accuracy level, errors persist in object detection and labeling. In conclusion, this research offers insights into the capabilities and potential of the YOLOv4 model in addressing challenges related to vehicle detection in road traffic, while also identifying areas that warrant further improvement.
leman, D Deteksi Penyakit Pada Daun Pisang dengan Penggunakan Algoritma Local Binary Pattern Dan K-Nearest Neighbor Dedi Leman; Obedh Eliezer Sidauruk
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 2 (2024): Mei 2024
Publisher : LKP Unity Academy

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

Abstract

Bananas are a type of fruit that has high production and is liked by many people. Mango productivity fluctuates from year to year. This is due to fluctuations in harvest area, plants that have not produced optimally, climate disturbances and attacks by various pests and diseases which are factors inhibiting banana growth and production in Indonesia. This identification will take a relatively long time and produce various diseases on banana leaves because humans have visual limitations in identifying, the level of fatigue and differences in opinion about diseases on banana leaves. The process of recognizing leaf patterns can be done by recognizing the characteristics of leaf structures such as leaf shape and texture. The method used in this research is Local Binary Pattern, an algorithm that can be used to classify based on images. In this study, 4 types of banana leaf diseases were used. Based on the results of the accuracy test, an accuracy value of 90.5% was obtained for the disease detection process on banana leaves for 10 pieces of data.
Menyusun Display Barang dengan Data Mining Assosiation Rule Menggunakan Rapid Miner Algoritma FP-GROWTH Komala Sari; Muhammad Khaibar Putra Adithia; Saiful Amir
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

A cosmetic cheerful shop located in the Marelan area of Medan city is a shop that sells women's cosmetic equipment. The owner of a cheerful cosmetics shop is very disciplined in recording sales and purchases of goods. Every transaction is always recorded and stored in the Microsoft Excel application. Meanwhile, the Ceria Cosmetics store has been running since 2015 and has recorded lots of transactions, both sales and purchases. From 2015 until now the data has been increasing, and so far this data has only been a record and stored in a folder on the store's computer. From the piles of transaction data at the cheerful cosmetics store, the authors took the idea of research to utilize this pile of data. One of the applications of information technology that can be used to utilize the pile of data is the data mining technique. By using data mining, a pile of data from a cheerful cosmetic store can be used to find association patterns. And the application of data mining with association rules can use the FP-Growth algorithm. The FP-Growth algorithm can be used as an alternative to determine the most frequently occurring data set (frequent itemset) in a data set. Later, the combination patterns obtained in this study can be used to arrange the layout of goods (cosmetics) at the Ceria Cosmetics store in Medan Marelan.
Perancangan Sistem Keamanan Rumah Menggunakan Face Recognition (Pengenalan Wajah) Berbasis Raspberry Pi Adi Nugraha Batubara; Abdul Jabbar lubis; Arnes Sembiring
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

Talking about technology, currently computer technology is developing very rapidly and is a field that has a very important role in several aspects of human life, including in the field of security. Currently, many home or room security systems have been developed with several identity verification methods using a computer system, using keys, cards, passwords, and so on. However, this method still has shortcomings such as humans' limitations in remembering number combinations which makes the door inaccessible. Therefore, techniques for reliable and accurate identification or verification can be designed using biometric technology that utilizes the special characteristics of the human individual.
Implementasi RFID Berbasis Arduino untuk Meningkatkan Keamanan Inventaris di Laboratorium SMK Ifan Fauzi Firmansyah
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

This study aims to improve the security of laboratory inventory at SMKS Al Muhajirin by using RFID technology integrated with student cards as access keys. This system is designed to differentiate student cards of grades 11 and 12 to prevent loss or damage to laboratory equipment during learning activities. Through student training and system testing, the results showed a system accuracy rate of 90% in recognizing valid cards. From the results of the questionnaires collected, the majority of students stated that the use of RFID was easy and suitable for implementation in the laboratory. Further development is directed at improving system integration with the school database and expanding its application in other schools. This study makes a positive contribution to the security of school laboratory facilities, which can help smooth technology-based learning activities.
Sistem Cerdas Rekomendasi Klinik Pratama di Kota Medan Berbasis Data Mining Dengan Metode K-Means Untuk Pasien BPJS dan Umum Dedi Leman; Elvin Syahrin
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

The growth in the number of clinics in Medan City, along with the increasing population, has triggered a need for more efficient and targeted healthcare services. However, patients often face difficulties in choosing clinics that meet their medical needs, especially BPJS Kesehatan users and general patients. This is due to the lack of information regarding the facilities, service quality, and optimal clinic locations. To address this issue, an Intelligent Clinic Recommendation System is needed to provide clinic suggestions based on patient profiles and needs. This study aims to develop a clinic recommendation system in Medan City using data mining techniques with the K-Means Clustering method. The K-Means method is employed to group clinics based on several important criteria, such as location, types of services, doctor availability, and the clinic's capability to accept BPJS patients as well as general patients. Patient data analyzed includes medical history, distance from the clinic, and service preferences. The results of the study show that the K-Means-based recommendation system can effectively cluster clinics and provide relevant recommendations according to patient profiles. This system not only helps patients choose the right clinic but also improves the efficiency of patient distribution in Klinik Pratama across Medan City. With the implementation of this system, it is expected that access to healthcare services will become more equitable and the quality of services will improve, both for BPJS and general patients.
Perancangan Sistem Informasi Akademik Dengan Menggunakan Metode Rapid Application Development (RAD) Berbasis Webiste Studi Kasus di SMP NU Medan Gilang Dwi Fahri Harahap; Muhammad Khaibar Putra Adithia; Demonius Sarumaha; Mardiah
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

The education system in Indonesia is experiencing rapid development characterised by an increase in the number of schools, students, and the complexity of the teaching and learning process. To manage academic data that includes information on students, teachers, grades, attendance, and class schedules, schools need to improve the quality of their services. Education is an important aspect of the country's development, and in this context, Academic Information System (AIS) plays a vital role in supporting administration and management in educational institutions. This research focuses on SMP NU Medan, where the need for an efficient and integrated AIS is increasingly urgent to improve the quality of education services. With the rapid development of information technology, the Rapid Application Development (RAD) method is the right choice because it allows rapid and iterative application development. In addition, Web-based AIS provides wide accessibility for education stakeholders, including making it easier for prospective students to access information and register online. The case study at SMP NU Medan provides a strong foundation for this research by identifying specific needs and coming up with solutions that are relevant and can be implemented immediately. This research aims to design, implement, and evaluate a Web-based AIS using the RAD method, so that it can make a positive contribution in improving the efficiency, accuracy, and quality of service of the school.
Perancangan Sistem Informasi Penerimaan Siswa Baru Berbasis Web Pada Lembaga Kursus dan Pelatihan Annisa Global Course Yuliana Hutasuhut; Furqan Khalidy; Saiful Amir; Demonius Sarumaha; Mardiah
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

New student admission is one of the processes of the system running in educational institutions such as schools to filter prospective students according to the criteria determined by the school. In research on new student admissions at the Annisa Global Course and Training Institute which has been done manually using brochures. Therefore, the system design that will be made is a web-based information system. With the times and the increasingly rapid development of science and technology. This web-based new student admission should be done. This information system development method applies the waterfall method. The website created has facilities to provide complete and fast information about LKP Annisa Global Course to users or registrants and facilitate the registration process. Then for the administrator or admin can do easy data processing.
Optimization of the Travelling Salesman Problem Based on Genetic Algorithm with Adaptive Crossover and Mutation Probabilitie Gunawan, Chichi Rizka
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

The Travelling Salesman Problem (TSP) is a combinatorial optimization problem that aims to find the shortest route to visit each city exactly once and return to the starting city. As an NP-hard problem, solving TSP requires heuristic approaches. This study employs the Genetic Algorithm to solve TSP by integrating adaptive crossover and mutation probabilities. The adaptive approach allows the crossover and mutation parameters to be dynamically adjusted based on the population conditions at each generation, thereby improving the efficiency of the optimal solution search. The research begins with chromosome representation as a sequence of cities, followed by the initialization of the initial population randomly. Fitness evaluation is conducted based on the total travel distance to determine the solution’s quality. Selection of the best individuals, adaptive crossover, and adaptive mutation are applied to generate a better new population. Elitism is used to ensure that the best solutions are preserved. The algorithm iterates until it reaches the maximum number of generations or a specific fitness threshold. The results show that the adaptive approach produces an optimal travel route with the minimum total distance. The optimal route is visualized by connecting city points, and the fitness progression demonstrates significant improvement in the early generations and stabilization in the later generations. With a crossover probability of 0.8 and mutation probability of 0.005, the algorithm effectively maintains a balance between exploration and exploitation of the solution space, preventing premature convergence, and producing efficient solutions. This study demonstrates that the Genetic Algorithm with an adaptive approach if effective in solving TSP with a moderate number of cities. Additionally, this approach can be adapted for larger datasets or compared with other optimization methods, such as Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO), to further evaluate its performance.
Penjadwalan Mata Kuliah Otomatis Menggunakan Algoritma Late Acceptance Hill-Climbing Hyper-Heuristics dengan Domain Permasalahan ITC Fadhilla, Cut Alna
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 3 No. 3 (2024): September 2024
Publisher : LKP Unity Academy

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

Abstract

The International Timetabling Competition is an international scheduling competition that aims to motivate further research on scheduling issues especially in scheduling in the field of education. In the world of education, scheduling problems have become a topic that is often encountered. One of the scheduling problems found in higher education is scheduling courses. Course scheduling is conducted routinely at the beginning of each semester, in scheduling must pay attention to the allocation of resources contained in the university. Scheduling is a long process, it is because in allocating resources in a scheduling problem must pay attention to various aspects or limits that have been set in order to get optimal results. This problem is classified as a Non-Polynomial hard problem, where there is no exact algorithm to solve it in a polynomial time. In the preparation of this final project subject scheduling is done using a tabu search algorithm - simulated annealing hyper-heuristics. The dataset used is a dataset obtained from the 2019 International Timetabling Competition. The results of this final project are java-based automatic scheduling applications which are expected to help solve problems related to scheduling subjects more optimally, and solutions that are produced competitive with benchmark algorithms.

Page 6 of 10 | Total Record : 95

 4   5   6   7   8 

Filter by Year

2022 2025


Reset
Filter By Issues
All Issue Vol. 4 No. 3 (2025): September 2025 Vol. 4 No. 2 (2025): Mei 2025 Vol. 4 No. 1 (2025): Januari 2025 Vol. 3 No. 3 (2024): September 2024 Vol. 3 No. 2 (2024): Mei 2024 Vol. 3 No. 1 (2024): Januari 2024 Vol. 2 No. 3 (2023): September 2023 Vol. 2 No. 2 (2023): Mei 2023 Vol. 2 No. 1 (2023): Januari 2023 Vol. 1 No. 2 (2022): September 2022 Vol. 1 No. 1 (2022): Mei 2022 More Issue