Claim Missing Document
Check
Articles

Found 2 Documents
Search

Analysis Of Course Distribution Scheduling For Lecturers Using Genetic Algorithms And Constraint Satisfaction Methods At Batam University Sony Putra; Muhammad Iqbal; Andysah Putera Utama Siahaan
Jurnal Info Sains : Informatika dan Sains Vol. 14 No. 04 (2024): Informatika dan Sains , 2024
Publisher : SEAN Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Optimal course scheduling is a significant challenge in university academic management, especially in allocating courses to lecturers efficiently. This study aims to analyze the application of Genetic Algorithm and Constraint Satisfaction Method in optimizing the scheduling of course distribution at Batam University. Genetic Algorithm is used to find the optimal solution through the evolution process, while the Constraint Satisfaction method is used to ensure that all scheduling constraints, such as the availability of lecturers, classrooms, and time, are met. This research method involves collecting data on course schedules, lecturer preferences, and classroom capacity. Furthermore, the implementation of the algorithm is carried out through computer simulations with population, mutation, and crossover parameters that are set to achieve the optimal solution. Based on the results of this study, the optimization achieved includes several important aspects. First, there were no schedule conflicts (zero conflicts) between courses, classrooms, and lecturers. Second, in terms of time efficiency, the automatic scheduling process runs faster than the manual method. Furthermore, the utilization of resources such as rooms and time has been used optimally, while the teaching load of lecturers is well distributed without any excess. Finally, constraint satisfaction has been achieved, where all constraints, such as no scheduling conflicts in space, lecturers, and time, have been successfully met.
EYE ASPECT RATIO ADJUSTMENT DETECTION FOR STRONG BLINKING SLEEPINESS BASED ON FACIAL LANDMARKS WITH EYE-BLINK DATASET Syahputra, Eswin; Nursukmi, Irpan; Putra, Sony; Sani, Bayu Sukma; Wijaya, Rian Farta
ZERO: Jurnal Sains, Matematika dan Terapan Vol 6, No 2 (2022): Zero: Jurnal Sains Matematika dan Terapan
Publisher : UIN Sumatera Utara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30829/zero.v6i2.14751

Abstract

Blink detection is an important technique in a variety of settings, including facial motion analysis and signal processing.  However, automatic blink detection is challenging due to its blink rate. This paper proposes a real-time method for detecting eye blinks in a video series. The method is based on automatic facial landmark detection trained on real-world datasets and demonstrates robustness against various environmental factors, including lighting conditions, facial emotions, and head position. The proposed algorithm calculates the position of facial landmarks, extracts scalar values using the Eye Aspect Ratio (EAR), and characterises eye proximity in each frame. For each video frame, the proposed method calculates the location of the facial landmark and extracts the vertical distance between the eyelids using the position of the facial landmark. Blinks are detected by using the EAR threshold value and recognising the pattern of EAR values in a short temporal window. According to the results from a common data set, it is shown that the proposed approach is more efficient than state-of-the-art techniques.