Claim Missing Document
Check
Articles

Found 4 Documents
Search

Penerapan RFID Dalam Pendataan Kehadiran Pegawai Negeri Sipil Berbasis Arduino Andreas Aman Tokan; Iskandar Fitri; Rini Nuraini
JURNAL MEDIA INFORMATIKA BUDIDARMA Vol 5, No 3 (2021): Juli 2021
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/mib.v5i3.3056

Abstract

In today's modern era, the development of technology and informatics is not something foreign to the public. As currently, RFID and Microsoft Excel technology can be used to overcome problems in everyday life such as student attendance or employees in private and government-owned agencies, security systems, parking systems, and can be used to monitor various reports on inventory that can be known in real time. time either by online or by synchronizing data, so the development of RFID technology cannot be doubted. However, the development of technology in Indonesia itself has not been fully evenly distributed where there are some areas that still do not apply this technology as a tool for daily activities, there are still a lot of regions that collect employee attendance still use the para or signature method, this of course can lead to fraud committed by unscrupulous employees for personal gain. The purpose of this study is to optimize and reduce attendance manipulation of sub-district office employees, because there are still a lot of government agencies, especially local government agencies that still perform attendance manually, such as the Witihama sub-district office. Witihama District is one of the sub-districts in eastern Indonesia, precisely in East Flores Regency, East Nusa Tenggara which still uses the employee initials method, so a technology such as RFID is needed to support the work of employees because this technology is very effective. The function of using RFID is to validate attendance and the function of Microsoft Excel itself is a media of information and attendance monitoring system directly and accurately by the disciplinary commission of the sub-district office.
Implementasi Metode Load Balancing Sebagai Upaya Meningkatkan Kinerja Server Rini Nuraini
Journal of Information System Research (JOSH) Vol 3 No 4 (2022): Juli 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (540.331 KB) | DOI: 10.47065/josh.v3i4.1792

Abstract

The use of the internet turns out to cause problems that must be found a solution. One of them is the service provider's server load which continues to increase. This condition is triggered by the increasing number of clients from time to time. Some sites even reported receiving hundreds of thousands of connection requests simultaneously from a number of clients. From these problems, research is needed that focuses on how to design and build a server system that is able to handle the increase in incoming requests so that the server load can be unraveled. The purpose of this research is that the service provider's server can improve its service to the client. There are several approaches to overcome these problems, one of which is by applying the load balancing method. So that by implementing load balancing, the incoming large load will be distributed to each of the service provider's servers. In the tests that have been carried out, the scalability of the system has increased. This is proven when a system with load balancing is given 10000 connections, the test results have an average response time of 44.42 ms. As for the system without load balancing, the test results have an average response time value of 185.88 ms. From the test results, it can be seen that the average response time of the server system with load balancing is smaller than without load balancing, so the service performance of the system can be continuously improved by implementing load balancing.
Tomato Ripeness Detection Using Linear Discriminant Analysis Algorithm with CIELAB and HSV Color Spaces Rini Nuraini; Teotino Gomes Soares; Popi Dayurni; Mulyadi Mulyadi
Building of Informatics, Technology and Science (BITS) Vol 5 No 2 (2023): September 2023
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v5i2.4192

Abstract

Tomatoes have a relatively short ripening period, making it essential to identify their ripeness level before distribution. The ripeness level of tomatoes can be detected based on their color. Therefore, the color of tomatoes serves as a crucial indicator in determining whether they are ripe and of good quality. However, classifying tomato ripeness levels manually has several drawbacks, namely requiring a long process, a low level of accuracy, and being inconsistent. The research aimed at developing a detection model for the ripeness level of tomatoes using the LDA algorithm based on color feature extraction, namely CIELAB (L*a*b) and HSV. The L*a*b and HSV color spaces are applied to obtain information about the color of the object being detected. Furthermore, the information obtained from feature extraction is then grouped by class using the LDA algorithm, which separates information for each class and limits the spread between classes through linear projection searches to maximize the covariance matrix between classes so that members within the class can be identified. This research produces a model that can detect the level of ripeness of tomatoes with an accuracy of 88.194%.
Implementasi Algoritma A* (A-Star) dan Greedy Dalam Penentuan Routing Pada Wide Area Network (WAN) Alfry Aristo Jansen Sinlae; Rini Nuraini; Dedy Alamsyah; Sampurna Dadi Riskiono
Journal of Computer System and Informatics (JoSYC) Vol 4 No 3 (2023): May 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josyc.v4i3.3374

Abstract

The continuous development of the internet has led to changes in routing complexity. In the context of a wide area network (WAN), network flow optimization becomes a major issue in the selection of the fastest route, which involves routing protocols. Algorithms in routing protocols are designed to determine the shortest path. Therefore, studies are needed regarding how to build a routing algorithm that can be used to get the shortest path in each process. This study aims to reduce network workload and compare the computation involved in determining the shortest path using the Greedy algorithm and the A* algorithm. The simulation results show that the A* algorithm is superior to greedy. The measurement results show that the final cost of the Greedy algorithm is 44 and the A* algorithm is 38. Taking into account the heuristic value for each node, the A* algorithm is superior to the Greedy algorithm in determining the shortest path.