cover
Contact Name
Nurul Khairina
Contact Email
nurulkhairina27@gmail.com
Phone
+6282167350925
Journal Mail Official
nurul@itscience.org
Editorial Address
Jl. Setia Luhur Lk V No 18 A Medan Helvetia Tel / fax : +62 822-5158-3783 / +62 822-5158-3783
Location
Kota medan,
Sumatera utara
INDONESIA
Journal of Computer Networks, Architecture and High Performance Computing
ISSN : 26559102     EISSN : 26559102     DOI : 10.47709
Core Subject : Science, Education,
Journal of Computer Networks, Architecture and Performance Computing is a scientific journal that contains all the results of research by lecturers, researchers, especially in the fields of computer networks, computer architecture, computing. this journal is published by Information Technology and Science (ITScience) Research Institute, which is a joint research and lecturer organization and issued 2 (two) times a year in January and July. E-ISSN LIPI : 2655-9102 Aims and Scopes: Indonesia Cyber Defense Framework Next-Generation Networking Wireless Sensor Network Odor Source Localization, Swarm Robot Traffic Signal Control System Autonomous Telecommunication Networks Smart Cardio Device Smart Ultrasonography for Telehealth Monitoring System Swarm Quadcopter based on Semantic Ontology for Forest Surveillance Smart Home System based on Context Awareness Grid/High-Performance Computing to Support drug design processes involving Indonesian medical plants Cloud Computing for Distance Learning Internet of Thing (IoT) Cluster, Grid, peer-to-peer, GPU, multi/many-core, and cloud computing Quantum computing technologies and applications Large-scale workflow and virtualization technologies Blockchain Cybersecurity and cryptography Machine learning, deep learning, and artificial intelligence Autonomic computing; data management/distributed data systems Energy-efficient computing infrastructure Big data infrastructure, storage and computation management Advanced next-generation networking technologies Parallel and distributed computing, language, and algorithms Programming environments and tools, scheduling and load balancing Operation system support, I/O, memory issues Problem-solving, performance modeling/evaluation
Articles 845 Documents
Forecast-Driven Doctor Scheduling in Primary Healthcare: Ensemble Learning, a Reinforcement Learning Agent, and an Exact Baseline M. Agus Munandar; Terttiaavini Terttiaavini
Journal of Computer Networks, Architecture and High Performance Computing Vol. 8 No. 4 (2026): Research Paper October 2026
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v8i4.9575

Abstract

Doctor scheduling in primary healthcare facilities is challenging because patient visit volume fluctuates due to seasonality, holidays, weather, and unplanned staff absences, while rule-based scheduling used in many healthcare systems remains static and unresponsive. This study builds and rigorously validates a forecast-driven scheduling pipeline for a primary healthcare center (Puskesmas Talang Ratu, Palembang, Indonesia), using five years (2019–2024) of visit, attendance, weather, and holiday records engineered into 46 temporal, operational, and contextual features. Six ensemble regressors were compared using a chronological split; Random Forest generalised best (MAE = 7.08, RMSE = 10.44, R² = 0.82, next-day visits). The forecast was embedded in a Deep Q-Network (DQN) scheduling agent and benchmarked, under a leak-free walk-forward forecasting procedure with the forecast-to-decision day alignment corrected, against three baselines: the facility's existing rule-based practice, a constraint-aware forecast-to-staffing rule, and a myopic cost-optimal integer program that solves the DQN's own objective exactly each day. Over a 301-day held-out period, the exact optimizer achieved the best capacity match (MAE 8.11) and the lowest objective cost, ahead of the constraint-aware rule (MAE 8.42) and the DQN policy (MAE 9.90–10.26 across reward-scaling and seed variants), all of which greatly outperformed the existing rule-based practice (MAE 20.61). The DQN did not surpass the exact optimizer even on its own training objective, a result that held across four random seeds, extended training, and reward rescaling. We trace this to a structural property of the environment: because staffing decisions do not influence future states or rewards, the task reduces to a per-day (contextual-bandit-like) optimization rather than a genuinely sequential one, removing the advantage reinforcement learning derives from learning delayed returns. The contribution is therefore a leak-free, day-aligned forecasting-to-scheduling pipeline and an empirically grounded account of when reinforcement learning is, and is not, warranted for demand-responsive capacity allocation in primary healthcare.
Academic Risk Analysis of University Students Using Random Forest and SHAP Nouval Khairi; Reza Ade Putra
Journal of Computer Networks, Architecture and High Performance Computing Vol. 8 No. 4 (2026): Research Paper October 2026
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v8i4.9625

Abstract

 Academic risk classification can help universities identify students who require closer academic monitoring, but imbalanced classes and limited model transparency can reduce practical usefulness. Objective: This study develops a Random Forest classifier for academic-risk categories and explains model decisions using SHAP. Methods: The study used academic data from 484 Computer Science students at Universitas Islam Negeri Sumatera Utara for the 2025/2026 odd-to-even academic period. The target was formed using rule-based indicators, while the final predictors were Jumlah_MK (number of courses), Praktikum (practicum courses), and MK_Berat (heavy courses). Data were split stratified into 387 training and 97 testing observations. SMOTE was applied only to training folds during stratified five-fold cross-validation and again to the complete training set for the final model. Results: Cross-validation produced mean Accuracy 91.72%, Precision 46.05%, Recall 81.33%, F1-Score 58.21%, and ROC-AUC 90.46%. On the original testing set, the model achieved Accuracy 97.94%, Precision 85.71%, Recall 85.71%, F1-Score 85.71%, and ROC-AUC 98.65%, with TN=89, FP=1, FN=1, and TP=6. Feature Importance and Mean Absolute SHAP both ranked Jumlah_MK as the most influential predictor. Conclusion: Random Forest with training-only SMOTE provided strong testing performance and improved minority-class detection, while SHAP added an interpretable layer. The results should be interpreted cautiously because the high-risk class was small and the study used a single academic period
ANDROID-BASED INFORMATION SYSTEM FOR MONITORING NOTARIAL DEED DOCUMENTATION Pandu Ula Dian Pradana; Yahfizham Yahfizham; Fajrillah Fajrillah
Journal of Computer Networks, Architecture and High Performance Computing Vol. 8 No. 4 (2026): Research Paper October 2026
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v8i4.9723

Abstract

Manual monitoring of notarial deed documentation in notary offices leads to slow file retrieval, a risk of data loss, and human error. This study aims to design an Android-based information system prototype for monitoring notarial deed documentation at the Notary/Land Deed Official (PPAT) Office of Rudi Tua Panjaitan, S.H., Sp.N., M.Kn. in Medan. The study applies a Research and Development (R&D) framework: requirements were gathered through observation, semi-structured interviews, and a literature study, and the software development sequence follows the Waterfall method. The system is modeled using UML (use case, activity, and class diagrams), with Java for the Android application and MySQL for data storage. The result is a design-level prototype that connects file submission, verification, rejection or revision, approval, deed registration, archiving, and retrieval in a single monitoring workflow, with separate access for employees, the notary, and the administrator. The prototype has not yet been tested or deployed in an operational environment; therefore, improvements in efficiency, security, and user acceptance are objectives that require empirical validation in future work.
Development and Evaluation of a No-Code Key Performance Indicator (KPI) Dashboard Using Base44 for Divisional Performance Monitoring (Case Study: Macwish Indonesia) Amalia; Muhammad Akhyar Abdan Syakuron; Amalia Rahmah
Journal of Computer Networks, Architecture and High Performance Computing Vol. 8 No. 4 (2026): Research Paper October 2026
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v8i4.9803

Abstract

Divisional performance monitoring that still relies on spreadsheets prevents key performance indicator (KPI) achievements from being presented in a centralized manner, requires manual data processing, and slows down evaluation and decision-making. This condition was found at Macwish Indonesia, a macaroni-based food and beverage business that originated from a campus entrepreneurship program. This study aims to develop and evaluate a no-code KPI dashboard built on the Base44 platform to monitor divisional performance. The study employed a Research and Development (R&D) approach with the Waterfall model, comprising problem identification, literature review, data collection, design and implementation, testing, and evaluation. User requirements were elicited through observation and semi-structured interviews with three division heads. The resulting dashboard provides login, division and KPI management, performance input, a monitoring dashboard, and quarterly evaluation features. Testing was conducted using Black Box Testing and User Acceptance Testing (UAT) with a four-point Likert scale. All 18 Black Box Testing items passed in the functional scenarios tested, which did not cover access rights, data security, or system resilience. The UAT, involving three division heads and one expert practitioner, yielded scores of 96.25% for system functionality, 97.50% for ease of use, 98.75% for performance and reliability, and 96.25% for user satisfaction, with an overall mean of 97.19% ("Very Good" category). These results are an initial indication of user acceptance in a single case study with four respondents and therefore cannot be generalized, and the advantage over spreadsheets was not measured quantitatively. This study has so far demonstrated only functional feasibility and initial user acceptance, not an improvement in monitoring effectiveness. It contributes to the literature on the use of no-code platforms for performance monitoring systems and presents a replicable implementation example for small and medium-sized food and beverage businesses.
Decoupling Expiration Risk Classification and Discount Rules in a Web Inventory Monitoring Prototype Syahprian
Journal of Computer Networks, Architecture and High Performance Computing Vol. 8 No. 4 (2026): Research Paper October 2026
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v8i4.9820

Abstract

Recorded expiration status and future inventory loss are different decision targets. This study audits a date-based monitoring architecture, a historical K-nearest neighbor (KNN) experiment, and independent markdown rules. Source-document recovery established that the 1,000 simulated labels were deterministic date bands: High at seven days or fewer, Medium at 8–30 days, and Low beyond 30 days. The revised architecture assigns date status directly and retains KNN only as an offline diagnostic. The historical K = 9 confusion matrix gives accuracy 0.735, macro F1 0.502, balanced accuracy 0.488, High recall 0.441, and Medium recall 0.063; 32 of 59 High records were classified Low. These results are not an independently selected-model estimate. A new sensitivity grid evaluated 135 hypothetical combinations of demand response, sell-through, cost, and discount. Discounting improved accounting profit in 60 of 108 discounted scenarios and worsened it in the remainder; these counts describe a designed grid, not real-world success probabilities. Forty black-box cases passed for a new Python reference decision core, without validating the original PHP application. The findings support direct treatment of known dates and conditional economic review of markdowns. Original-data ablation, matched classifier comparisons, renewed validation, and application-level testing remain dependent on the original CSV and source code.

Filter by Year

2019 2026


Filter By Issues
All Issue Vol. 8 No. 4 (2026): Research Paper October 2026 Vol. 8 No. 3 (2026): Research Paper July 2026 Vol. 8 No. 2 (2026): Research Paper April 2026 Vol. 8 No. 1 (2026): Articles Research Januari 2026 Vol. 7 No. 2 (2025): Research Article, Volume 7 Issue 2 April, 2025 Vol. 7 No. 2 (2025): Forthcoming: Research Article, Volume 7 Issue 2 April, 2025 Vol. 7 No. 4 (2025): Articles Research October 2025 Vol. 7 No. 3 (2025): Articles Research July 2025 Vol. 7 No. 1 (2025): Article Research January 2025 Vol. 6 No. 3 (2024): Articles Research Volume 6 Issue 3, July 2024 Vol. 6 No. 2 (2024): Articles Research Volume 6 Issue 2, April 2024 Vol. 6 No. 1 (2024): Article Research Volume 6 Issue 1, January 2024 Vol. 6 No. 4 (2024): Articles Research October 2024 Vol. 5 No. 2 (2023): Article Research Volume 5 Issue 2, July 2023 Vol. 5 No. 1 (2023): Article Research Volume 5 Issue 1, January 2023 Vol. 4 No. 2 (2022): Article Research Volume 4 Number 2, July 2022 Vol. 4 No. 1 (2022): Article Research Volume 4 Number 1, Januay 2022 Vol. 3 No. 1 (2021): Computer Networks, Architecture and High Performance Computing, January 2021 Vol. 3 No. 2 (2021): Journal of Computer Networks, Architecture and High Performance Computing, July Vol. 2 No. 2 (2020): Computer Networks, Architecture and High Performance Computing Vol. 2 No. 1 (2020): Computer Networks, Architecture and High Performance Computing Vol. 1 No. 2 (2019): Computer Networks, Architecture and High Performance Computing Vol. 1 No. 1 (2019): Computer Networks, Architecture and High Performance Computing More Issue