Claim Missing Document
Check
Articles

Found 3 Documents
Search

Vulnerabilities assessment of a web-based human resources management system using a penetration testing approach (hrms.tic.gov.tl) Idalia Francisca Viegas; Kadek Yota Ernanda Aryanto; I Ketut Resika Arthana
Priviet Social Sciences Journal Vol. 6 No. 5 (2026): May 2026
Publisher : Privietlab

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55942/pssj.v6i5.1801

Abstract

This study presents mini penetration testing assessment conducted on the Human Resource Management System (HRMS) hosted at https://hrms.tic.gov.tl.  This assessment aims to evaluate the security level of the system by considering the aspects of Confidentiality, Integrity, and Availability (CIA) through several processes, including reconnaissance, vulnerability scanning, and security configuration analysis. The assessment process was conducted using various automated security tools such as Nuclei, Nmap, Subfinder, and Acunetix to identify potential security weaknesses within the web application environment. The testing activities were conducted on November 2025 using passive and semi-active approaches without exploitation activities, in accordance with ethical considerations, organizational authorization, and operational security boundaries. The assessment identified several Low and Informational findings related to missing security headers, insecure cookie configurations, and weak client-side security settings. Although no High or Critical vulnerabilities were identified, the findings should not be interpreted as evidence that the system is fully secure because the assessment scope did not include exploitation or internal infrastructure testing. The results indicate that additional hardening, preventive controls, and continuous security governance mechanisms are still necessary to strengthen the overall security posture of the HRMS environment. Recommendations based on ISO/IEC 27001, Zero Trust principles, and Web Application Firewall protection are proposed to improve organizational cybersecurity resilience.
Deteksi Nodul Paru pada Citra CT dengan Klasifikasi Pseudo Nearest Neigbour Rule I Nyoman Surya Jaya; Kadek Yota Ernanda Aryanto; Dewa Gede Hendra Divayana
Jurnal Teknologi Informasi dan Multimedia Vol. 5 No. 4 (2024): February
Publisher : Sekawan Institut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35746/jtim.v5i4.463

Abstract

This research aims to obtain the classification performance of the Pseudo Nearest Neighbor Rule (PNNR) algorithm in detecting lung nodules in CT scan images. The PNNR classification algorithm is used to reduce the influence of noise or outliers in the classification process so that false positives (prediction of an object that is not a nodule as a nodule) can be reduced. The data set used is 200 patient data obtained from the public data of The Lung Image Database Consortium and Infectious Disease Research Institute (LIDC/IDRI) where 4 fold Cross Validation will be carried out. The preprocessing stage is carried out by segmenting the otsu image, where from the segmentation results the two largest blobs are then searched for to determine the area of ??the lung to be analyzed. Next, the feature extraction process from the candidate nodules (white pixels / foreground) is obtained from the Otsu segmentation process again. The results of this second segmentation contain information from the candidate nodules to then calculate the value of the shape features of the candidate nodules such as area, eccentricity, equivalent diameter, major axis length, minor axis length and perimeter which produces feature set values ??as the basis for training data and data test for the classification process in PNNR The results of the classification proposed in this research, namely using the PNNR classification method, obtained an Accuracy value of , which is included in the excellent classification level or the Accuracy level is very good but with a lower level of sensitivity or recognition of true positives, namely . In further research, classification optimization can be carried out by selecting the feature set usedThis research aims to obtain the classification performance of the Pseudo Nearest Neighbor Rule (PNNR) algorithm in detecting lung nodules in CT scan images. The PNNR classification algorithm is used to reduce the influence of noise or outliers in the classification process so that false positives (prediction of an object that is not a nodule as a nodule) can be reduced. The data set used is 200 patient data obtained from the public data of The Lung Image Database Consortium and Infectious Disease Research Institute (LIDC/IDRI) where 4 fold Cross Validation will be carried out. The preprocessing stage is carried out by segmenting the otsu image, where from the segmentation results the two largest blobs are then searched for to determine the area of ??the lung to be analyzed. Next, the feature extraction process from the candidate nodules (white pixels / foreground) is obtained from the Otsu segmentation process again. The results of this second segmentation contain information from the candidate nodules to then calculate the value of the shape features of the candidate nodules such as area, eccentricity, equivalent diameter, major axis length, minor axis length and perimeter which produces feature set values ??as the basis for training data and data test for the classification process in PNNR The results of the classification proposed in this research, namely using the PNNR classification method, obtained an Accuracy value of , which is included in the excellent classification level or the Accuracy level is very good but with a lower level of sensitivity or recognition of true positives, namely . In further research, classification optimization can be carried out by selecting the feature set used
Internet Network Analysis with Hierarchy Token Bucket Method at Dhyana Pura University Trywanto Rina; Kadek Yota Ernanda Aryanto; I Made Gede Sunarya
Paradigma - Jurnal Komputer dan Informatika Vol. 25 No. 2 (2023): September 2023 Period
Publisher : LPPM Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31294/p.v25i2.2354

Abstract

Bandwidth management is indispensable in computer networks. Not only to manage the needs of each individual, but also to keep the data traffic running smoothly. Dhyana Pura University is a private university that utilizes information technology in achieving optimal performance. Observation results with throughput, delay, packet loss and jitter parameters show that bandwidth management has not been done properly. Implementation of bandwidth management is done on Mikrotik Cloud Core Router and PC Router based on Ubuntu server version 16.04. One way to reduce performance degradation is to manage bandwidth. Good bandwidth management is expected to provide the right Quality of Service (QoS) for each internet service. The Hierarchy Token Bucket (HTB) method as a queuing method that regulates bandwidth usage to be given to each internet user shows more optimal results and is easier to use according to the desired needs. This is because the bandwidth is divided evenly and prevents one user from spending excessive bandwidth, so that it can increase employee satisfaction in using internet services. The results of the analysis of measuring the level of employee satisfaction with the Customer Satisfaction Index (CSI) method show that the HTB method has a total satisfaction index of 66.154% in the very satisfied category, while for troughput variables of 65.32%, delay of 67.14%, packet loss of 66.50% and jitter of 65.40%. Thus the implementation on the internet network at Dhyana Pura University using the Hierarchy Token Bucket (HTB) method is feasible to implement with a satisfied predicate.