cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Darmanto
Contact Email
aicoms@politap.ac.id
Phone
+6282254576270
Journal Mail Official
aicoms@politap.ac.id
Editorial Address
Politeknik Negeri Ketapang, Jalan Rangge Sentap, Dalong, Sukaharja, Kec. Delta Pawan, Kabupaten Ketapang, Kalimantan Barat 78112
Location
Kab. ketapang,
Kalimantan barat
INDONESIA
Applied Information Technology and Computer Science (AICOMS)
Published by Politeknik Negeri Ketapang
ISSN : -     EISSN : 29647703     DOI : https://doi.org/10.58466/aicoms
Core Subject : Science,
Computer Science & IT
Applied Information Technology and Computer Science (AICOMS) is an online version of national journal in Bahasa Indonesia and English, published by Department of Informatics Engineering, Politeknik Negeri Ketapang. AICOMS also has a print version. AICOMS also invites academics and researchers in the field of information technology, particularly from informatics engineering and information systems research to submit their articles. The articles to be published is an original work and has never been published. Incoming articles will be reviewed by a team of reviewers from internal and external sources.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 75 Documents
 4   5   6   7   8 
Penerapan Metode Branch and Bound untuk Optimalisasi Rute Wisata Terdekat di Kota Palembang Jaysen Stephanus; Felix Gunawan; Yohannes Yohannes
Applied Information Technology and Computer Science (AICOMS) Vol 5 No 1 (2026): AICOMS
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/eqadem96

Abstract

This study discusses the application of the Branch and Bound method to optimize the nearest tourist route in Palembang City using the Traveling Salesman Problem (TSP) approach. The problem raised is how to determine the most efficient tourist route from several tourist destinations with minimum travel distance. The study utilizes geographic coordinate data of tourist destinations obtained through OpenStreetMap, then the distance between locations is calculated using the Haversine Formula to obtain an accurate distance estimate based on latitude and longitude. Furthermore, the Branch and Bound Algorithm is used to find the optimal route solution through the process of branching, bounding, and pruning so that the solution search becomes more efficient than the brute force method. The results show that the system successfully produces an optimal circular tourist route with a total minimum distance of 40.47 km and an execution time of 12.84 seconds. The integration of the Haversine Formula and Branch and Bound is proven to be able to provide efficient, accurate, and adaptive tourist route recommendations to help tourists save travel time and transportation costs in Palembang City.
Perbandingan Algoritma Greedy dan Dynamic Programming Pada Optimasi Playlist Spotify Untuk Jogging Fadhel Muhammad; Muhammad Radja Juang Jamemiko; Yohannes Yohannes
Applied Information Technology and Computer Science (AICOMS) Vol 5 No 1 (2026): AICOMS
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/1htfcz49

Abstract

Spotify provides audio metadata that can be utilized to support physical activities such as jogging. This study compares the performance of Greedy and Dynamic Programming algorithms for Spotify playlist optimization modeled as a 0/1 Knapsack Problem. Song duration is treated as weight, while a score derived from popularity and energy is used as value. The dataset was obtained from Spotify Wrapped 2025 Top 50 Songs and Spotify All-Time Top 100 Songs, resulting in 31 candidate songs after preprocessing and filtering. Experiments were conducted on playlist durations of 30, 45, 60, 75, and 90 minutes. The results show that Dynamic Programming consistently achieved higher total scores than Greedy across all scenarios. For the 60-minute playlist, Dynamic Programming obtained a total score of 1897 compared to 1894 achieved by Greedy. However, Greedy required a lower execution time (4.244 ms) than Dynamic Programming (16.196 ms). The average optimality gap between the two methods was 1.89%, indicating that Greedy produced solutions that were close to the optimal solutions generated by Dynamic Programming while requiring less computation time.
Perbandingan Kinerja Algoritma Greedy dan Dynamic Programming dalam Optimasi Diskon Keranjang Belanja E-Commerce Menggunakan Dataset Online Retail UCI Jonathan Tanujaya; Daffa Yudha Musyaffa; Yohannes Yohannes
Applied Information Technology and Computer Science (AICOMS) Vol 5 No 1 (2026): AICOMS
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/f0fdve41

Abstract

E-commerce platforms heavily rely on automated promotional strategies, such as tiered discounts, to enhance customer loyalty. Therefore, this study aims to analyze the performance of computational algorithms in determining item priorities within a shopping cart under promotional budget constraints. The 0/1 Knapsack Problem was addressed by comparing two computational approaches: Dynamic Programming (DP) and the Greedy Algorithm. Transaction data from the UCI Online Retail dataset were cleaned and aggregated into 3,746 unique product catalogs, then simulated using a promotional budget limit of £499.40 with a 10% discount policy. Computational experiments revealed contrasting trade-off characteristics between the two approaches. The DP algorithm guaranteed an absolute optimal solution with a total profit of £2,725,575.77 but required 28.10 seconds of computation time. In contrast, the Greedy algorithm completed the selection process in a fraction of a second (0.17 seconds) while incurring only a marginal profit deficit of 0.01%. The Greedy heuristic approach proved to be highly practical and efficient for integration into real-time user interface systems, whereas the superior accuracy of DP makes it more suitable for offline database processing and inventory analytics research.
Arsitektur Hibrida CNN–LSTM Berbasis Retinex untuk Deteksi Lesi Periapikal pada Radiograf CBCT–Panoramik Safar Dwi Kurniawan; Tri Haryo Nugroho; David Bani Adam
Applied Information Technology and Computer Science (AICOMS) Vol 4 No 2 (2025)
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/vc18dh25

Abstract

Periapical lesion detection plays a crucial role in endodontic diagnosis; however, manual interpretation of Cone-Beam Computed Tomography (CBCT) and panoramic radiographs remains time-consuming, highly dependent on the clinician's expertise, and susceptible to diagnostic variability. This study proposes a hybrid deep learning framework that integrates a Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) architecture, combined with Retinex-based image enhancement, for the automatic detection and classification of periapical lesions. Retinex enhancement is employed as a preprocessing step to normalize illumination and improve lesion contrast. The hybrid CNN-LSTM model captures both spatial and contextual dependencies through sequential patch-based processing of panoramic and CBCT images. Using a dataset of 1,500 annotated images collected from clinical radiographic datasets and publicly available sources, the proposed model achieved an accuracy of 97.8%, precision of 96.4%, recall of 95.9%, and an F1-score of 0.96, significantly outperforming conventional CNN and U-Net models. These findings demonstrate that the integration of image enhancement and hybrid deep learning improves sensitivity to small lesions while reducing false-negative detections, offering a clinically viable AI-assisted approach for endodontic diagnosis.
Analisis Host-Based Digital Forensics terhadap Artefak Penggunaan Tor browser pada Sistem Operasi Linux Rico Saputra; Ghufron Zaida Muflih
Applied Information Technology and Computer Science (AICOMS) Vol 5 No 1 (2026): AICOMS
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/e4aq5a03

Abstract

The use of Tor Browser as a digital anonymity platform continues to increase alongside the growing demand for internet privacy. Although Tor is designed to conceal user identities and activities through onion routing mechanisms, previous studies have shown that digital artifacts can still be recovered from the host system. This study aims to analyze the existence of digital artifacts generated by Tor Browser usage on the BackBox Linux operating system using a host-based digital forensics approach. The research employed an experimental method consisting of seven testing scenarios, namely behavioral forensic leakage, session persistence, cross-session correlation, host versus virtualization comparison, memory footprint analysis, network pattern consistency, and passive onion observation. Data acquisition and analysis were conducted using Autopsy, Hindsight, Plaso, LiME, Volatility, Bulk Extractor, and Wireshark. The results indicate that Tor Browser usage still leaves digital artifacts within storage media, volatile memory, and network traffic. This study concludes that the host-based digital forensics approach remains effective for identifying Tor Browser activities in Linux environments.

Page 8 of 8 | Total Record : 75

 4   5   6   7   8 

Filter by Year

2022 2026


Reset
Filter By Issues
All Issue Vol 5 No 1 (2026): AICOMS Vol 4 No 2 (2025) Vol 4 No 1 (2025) Vol 3 No 2 (2024) Vol 3 No 1 (2024) Vol 2 No 2 (2023) Vol 2 No 1 (2023) Vol 1 No 1 (2022)