International Journal of Research in Computing https://ijrcom.org/index.php/ijrc <p data-start="352" data-end="739"><strong data-start="352" data-end="422">What is the International Journal of Research in Computing (IJRC)?</strong><br data-start="422" data-end="425" />The <em data-start="217" data-end="272">International Journal of Research in Computing (IJRC)</em> is a peer-reviewed, open-access journal published by the Faculty of Computing, General Sir John Kotelawala Defence University. IJRC follows COPE standards and employs AI-enabled publishing to ensure fast, high-quality dissemination of research. The journal follows a Diamond Open Access model, meaning publication is free for both authors and readers.</p> <p data-start="741" data-end="856"><strong data-start="741" data-end="775">What does the journal publish?</strong><br data-start="775" data-end="778" />IJRC publishes original research in all computing-related fields, including:</p> <ul data-start="857" data-end="987"> <li data-start="857" data-end="877"> <p data-start="859" data-end="877">Computer Science</p> </li> <li data-start="878" data-end="902"> <p data-start="880" data-end="902">Computer Engineering</p> </li> <li data-start="903" data-end="927"> <p data-start="905" data-end="927">Software Engineering</p> </li> <li data-start="928" data-end="957"> <p data-start="930" data-end="957">Information Systems &amp; ICT</p> </li> <li data-start="958" data-end="987"> <p data-start="960" data-end="987">Computational Mathematics</p> </li> <li data-start="958" data-end="987"> <p data-start="960" data-end="987">Practical and transdisciplinary research, where authors integrate computing components into other fields. This includes innovations in engineering, sciences, healthcare, business, social sciences, and other areas where computing plays a key role in research outcomes.</p> </li> </ul> <p data-start="1296" data-end="1514"><strong data-start="1296" data-end="1317">Submission Format</strong><br data-start="1317" data-end="1320" />IJRC supports free-format submission: manuscripts can be prepared in a single-column layout using standard MS Word heading styles, making submission simple and author-friendly.</p> <p data-start="1516" data-end="1702"><strong data-start="1516" data-end="1544">Who can publish in IJRC?</strong><br data-start="1544" data-end="1547" />The journal welcomes submissions from scholars worldwide, including research presented at the International Research Conferences, provided that conference papers incorporate feedback received during the conference and implement suggested future work that demonstrates high research value in their final submission to the journal</p> <p data-start="1704" data-end="2040"><strong data-start="1704" data-end="1740">How is research quality ensured?</strong><br data-start="1740" data-end="1743" />All papers undergo double-blind peer review, and submissions follow FAIR principles for data management and Transparency and Openness Promotion (TOP) Guidelines. Each research article is also aligned with the United Nations Sustainable Development Goals (SDGs) wherever relevant.</p> <p data-start="2042" data-end="2182"><strong data-start="2042" data-end="2081">How often is the journal published?</strong><br data-start="2081" data-end="2084" />IJRC publishes two open-access issues per year, ensuring rapid visibility and accessibility.</p> <p data-start="2184" data-end="2341"><strong data-start="2184" data-end="2237">Does IJRC charge an Article Processing Fee (APC)?</strong><br data-start="2237" data-end="2240" />No. IJRC follows Diamond Open Access, meaning publication is free for both authors and readers.</p> <p data-start="2343" data-end="2382"><strong data-start="2343" data-end="2380">What are the journal identifiers?</strong></p> <ul data-start="2383" data-end="2443"> <li data-start="2383" data-end="2413"> <p data-start="2385" data-end="2413">Online ISSN: 2820-2147</p> </li> <li data-start="2414" data-end="2443"> <p data-start="2416" data-end="2443">Print ISSN: 2820-2139</p> </li> </ul> <p data-start="2445" data-end="2480"><strong data-start="2445" data-end="2478">What makes IJRC future-ready?</strong></p> <ul data-start="2481" data-end="2836"> <li data-start="2481" data-end="2556"> <p data-start="2483" data-end="2556">Zero-click and Answer Engine Optimization for AI and search engines</p> </li> <li data-start="2557" data-end="2619"> <p data-start="2559" data-end="2619">SEO-optimized site structure for quick discoverability</p> </li> <li data-start="2620" data-end="2689"> <p data-start="2622" data-end="2689">Automatic latest articles section for immediate public access</p> </li> <li data-start="2690" data-end="2761"> <p data-start="2692" data-end="2761">Adoption of latest publishing techniques for faster publication</p> </li> <li data-start="2762" data-end="2836"> <p data-start="2764" data-end="2836">Promotion of open, transparent, and sustainable research practices</p> </li> </ul> <p><strong>How does IJRC support authors?</strong></p> <p>IJRC warmly supports authors throughout the publication journey. The journal prioritizes the novelty and scientific contribution of each submission, while also helping authors with drafting, formatting, and preparing manuscripts to meet journal and AEO-ready standards. Authors can directly contact the Editor-in-Chief or the academic staff of the Faculty of Computing for guidance and counselling on writing and publishing. All of these services are provided free of charge, reflecting IJRC’s commitment as a state university journal to provide an easy and supportive platform for sharing valuable research.</p> Faculty of Computing, General Sir John Kotelawala Defence University en-US International Journal of Research in Computing 2820-2139 <h2 id="copyright-licensing-and-intellectual-property-poli" class="mb-2 mt-6 text-base font-[500] first:mt-0 md:text-lg dark:font-[475] [hr+&amp;]:mt-4">Copyright, Licensing, and Intellectual Property Policy</h2> <p class="my-0"><strong>1. Copyright and Author Rights</strong><br />Authors retain full copyright of their work upon submission. By submitting a manuscript to IJRC, authors grant the journal an <em>exclusive license</em> to publish, distribute, and disseminate the work worldwide in all current and future media formats—including print and electronic—once the manuscript is accepted for publication. This license covers the first publication and ongoing availability of the article.</p> <p class="my-0"><strong>2. Exclusive Submission and Peer Review Rights</strong><br />Manuscripts must be original, unpublished, and not under consideration elsewhere during the peer review process. Submission to IJRC grants the journal exclusive consideration rights throughout the review. Simultaneous submissions to other journals or venues are strictly prohibited.</p> <p class="my-0">Once the peer review process has formally commenced, authors may not withdraw their manuscript except under very exceptional and compelling circumstances approved by the editorial office. Withdrawal requests made after peer review starts may incur penalties or restrictions, as such withdrawal adversely affects editorial procedures and reviewer efforts.</p> <p class="my-0">Upon rejection or permitted withdrawal (only before peer review begins), all publication rights fully and immediately revert to the author without restrictions.</p> <p class="my-0"><strong>3. Open Access Publishing and Licensing</strong><br />IJRC operates under the <strong>Diamond Open Access</strong> model: all published articles are freely accessible to readers worldwide immediately upon publication without any subscription or article processing charges (APCs) to authors.</p> <p class="my-0">Articles are published under the <strong>Creative Commons Attribution 4.0 International License (CC BY 4.0)</strong>. This license allows anyone to share, copy, distribute, and adapt the work—even for commercial purposes—as long as proper attribution is provided to the original author(s) and IJRC as the publisher. The full license details can be found here: <a class="break-word hover:text-super hover:decoration-super underline decoration-from-font underline-offset-1 transition-all duration-300" href="https://creativecommons.org/licenses/by/4.0/" target="_blank" rel="nofollow noopener">https://creativecommons.org/licenses/by/4.0/</a>.</p> <p class="my-0"><strong>4. Permissions for Third-Party Material</strong><br />Authors are responsible for obtaining all necessary permissions for any third-party material (e.g., figures, images, data, tables) included in their submission and for providing appropriate attribution. IJRC disclaims responsibility for unauthorized use of third-party content.</p> <p class="my-0"><strong>5. Licensing Terms and Publication Agreement</strong><br />Submission of a manuscript constitutes a binding agreement granting IJRC the necessary publishing rights as described above. No separate copyright transfer or license signing is routinely required unless specifically requested after acceptance. Licensing terms are clearly indicated on each published article in all formats (HTML, PDF).</p> <p class="my-0"><strong>6. Compliance with COPE Principles</strong><br />This policy complies fully with the Committee on Publication Ethics (COPE) Core Practices concerning intellectual property, ensuring transparency, fairness, and respect for authors’ rights. IJRC regularly reviews these policies to uphold international best practices.</p> <p class="my-0"><strong>7. Authors’ Responsibilities</strong><br />Authors must ensure the originality and ethical integrity of their work, properly cite all sources, secure permissions for third-party content, and adhere strictly to the licensing and submission policies stated here. Compliance with these responsibilities is mandatory for manuscript consideration and publication.</p> <p class="my-0"><strong>By submitting to IJRC, authors acknowledge and agree to abide by these terms, which support responsible research dissemination and uphold the principles of equitable open access publishing.</strong></p> Learning-Rate Scheduling for Neural Network Training: A Scoping Review of ReduceLROnPlateau, Cosine Annealing with Warm Restarts, Cyclical Learning Rates, and Linear Warmup with Linear Decay https://ijrcom.org/index.php/ijrc/article/view/251 <p>This scoping review presents a structured synthesis of learning-rate scheduling for neural network training. The learning rate is a consequential hyperparameter in gradient based neural network training because it mediates the trade-off between early exploration and late-stage convergence precision. The review focuses on four widely used learning-rate scheduling paradigms: (1) ReduceLROnPlateau (RLROP), a feedback-driven reactive scheduler; (2) Stochastic Gradient Descent with Warm Restarts (SGDR), a periodic cosine-shaped schedule; (3) Cyclical Learning Rates (CLR), an oscillatory triangular or exponential schedule; and (4) Linear Warmup with Linear Decay (LW+LD), a two-phase schedule widely used with transformer models. We use a common notation as a pedagogical organizing device, distinguish formal results from empirical tendencies and heuristic analogies, and summarize how each method relates to classical step-size conditions and adaptive-optimizer stability. The quantitative tables are explicitly treated as heterogeneous literature summaries rather than controlled head-to-head benchmarks; they are retained only to document source-specific evidence and practical signals. The article includes a scoping-search log, a quality-assessment rubric, caveats on benchmark comparability, hyperparameter-sensitivity diagnostics, failure-mode checks, and an AI tool usage and human contribution statement. The resulting scheduler-selection framework is intended as practical guidance, not as a statistically ranked performance claim.</p> SPGE Illukkumbura Copyright (c) 2026 SPGE Illukkumbura https://creativecommons.org/licenses/by/4.0 2026-07-16 2026-07-16 5 2 83 107 ShieldLink: Retry‑Aware Authenticated Encryption for Secure and Reliable Chiplet Interconnects https://ijrcom.org/index.php/ijrc/article/view/208 <div> <p>Chiplet-based systems-in-package increasingly rely on high-speed die-to-die links such as UCIe and CXL, where link- layer retry mechanisms and authenticated encryption are of- ten implemented as separate reliability and security func- tions. This separation can create a time-of-check/time-of- use risk when acknowledgments advance before authentication completes. This study introduces ShieldLink, a retry-aware authenticated-encryption protocol that integrates link-layer delivery, buffer retirement, and cryptographic verification to enable secure and reliable chiplet interconnects. Shield- Link formalizes a deliverability invariant requiring CRC, se- quence, and AEAD verification before receiver advancement. It defines per-frame authentication (Mode A) and epoch authentication (Mode B), evaluates them with a discrete- event Gilbert–Elliott burst-error model, and includes bounded safety exploration plus RTL control-plane resource sizing. Mode A removes the validity-before-verification race while improving goodput by approximately 2.4–2.5 percentage points over the secure naive baseline at representative burst prob- abilities. Mode B improves wire efficiency, reaching about 0.926 at M = 32, but its epoch-retransmission cost causes a crossover around πB ≈ 0.04 under the default β = 0.2 stress regime. The results show that authenticated delivery must be treated as part of retry semantics rather than an afterthought. ShieldLink provides an auditable design invariant and practi- cal guidance on mode selection for future secure chiplet inter- connect adapters, with relevance to SDG 9: Industry, Innovation and Infrastructure.</p> </div> <p>DOI: <a href="https://doi.org/10.64701/ijrc/345/9121">doi.org/10.64701/ijrc/345/9121</a></p> Michel Nguyen Copyright (c) 2026 Michel Nguyen https://creativecommons.org/licenses/by/4.0 2026-07-16 2026-07-16 5 2 1 16 Differentiated Thyroid Cancer Recurrence Classification Using Machine Learning Models and Bayesian Neural Networks with Varying Priors: A SHAP-Based Interpretation of the Best Performing Model https://ijrcom.org/index.php/ijrc/article/view/161 <p>Differentiated thyroid cancer (DTC) recurrence is a major public health concern, requiring classification and predictive models that are not only accurate but also interpretable and uncertainty aware. This study introduces a comprehensive framework for DTC recurrence classification using a dataset containing 383 patients and 16 clinical and pathological variables. Initially, 11 machine learning (ML) models were employed using the complete dataset, where the Support Vector Machines (SVM) model achieved the highest accuracy of 0.9481. To reduce complexity and redundancy, feature selection was carried out using the Boruta algorithm, and the same ML models were applied to the reduced dataset, where it was observed that the Logistic Regression (LR) model obtained the maximum accuracy of 0.9611. However, these ML models often lack uncertainty quantification, which is critical in clinical decision making. Therefore, to address this limitation, the Bayesian Neural Networks (BNN) with six varying prior distributions, including Normal (0,1), Normal (0,10), Laplace (0,1), Cauchy (0,1), Cauchy (0,2.5), and Horseshoe (1), were implemented on both the complete and reduced datasets. The BNN model with Normal (0,10) prior distribution exhibited maximum accuracies of 0.9740 and 0.9870 before and after feature selection, respectively. As the BNN model with N(0,10) prior distribution employed after feature selection outperformed all the other models, it was chosen as the best performing model for DTC recurrence classification. This model was further analysed using epistemic and aleatoric uncertainty, reflecting the model’s confidence in its prediction. In addition, to enhance this model’s interpretability, SHapley Additive exPlanations (SHAP) values were calculated, providing valuable insights into the contribution of key variables to the model’s output.</p> Nadeesha Shyami Kumari Herath Mudiyanselage HMLS Kumari UMMPK Nawarathne Copyright (c) 2026 HMNS Kumari, HMLS Kumari, UMMPK Nawarathne https://creativecommons.org/licenses/by/4.0 2026-07-16 2026-07-16 5 2 17 42 Prompt Optimization Strategies for Large Language Models: Insights from Random Prompting with Gemini API https://ijrcom.org/index.php/ijrc/article/view/255 <p>The increasing use of large language models (LLMs) has raised concerns about efficiency regarding token usage, as excessive token consumption burdens computational resources. This study addresses the need for systematic techniques to optimize prompts, evaluating three specific strategies within the Gemini API framework aimed at reducing token usage. The research examined 480 prompts across 16 models in the Gemini family to quantify potential token savings. The three strategies assessed are structured concise formatting, which utilizes bullet lists, headings, and concise language to streamline content; verbose removal, which eliminates redundant and irrelevant information to enhance clarity and focus; and code formatting, which promotes consistent syntax while minimizing inline commentary. Token counts were tracked before and after optimization using the Gemini count Tokens API endpoint. Findings revealed an average token saving of 37.15% across most Gemini-family models, with Gemma 3 models achieving a higher average reduction of 43.55%. Among the strategies, verbose removal yielded the greatest efficiency at an average reduction of 51.98%, followed by structured concise formatting at 33.36% and code formatting at 29.71%. The maximum individual saving recorded was 126 tokens. Multimodal testing with a shared fixed prompt set demonstrated consistent tokenization behaviour within the Gemini ecosystem across Gemini 2.0, 2.5, 3 preview, latest Gemini, and Gemma 4 model groups. Gemma 3 models consistently demonstrated higher efficiency, indicating variations in tokenization behaviour influenced by model architecture. These results suggest that prompt optimization can significantly enhance token efficiency within the Gemini model family, achieving reductions of approximately 30% to over 50% depending on strategy and model type; cross-ecosystem generalizability remains to be established. This research offers valuable insights for practitioners aiming to reduce computational costs and improve inference efficiency in LLM-based systems.</p> OAM Jayawardana Copyright (c) 2026 OAM Jayawardana https://creativecommons.org/licenses/by/4.0 2026-07-16 2026-07-16 5 2 43 65 Machine Learning-Based Student Academic Performance Prediction in a Nigerian University Context: A Comparative Evaluation of Classification Algorithms https://ijrcom.org/index.php/ijrc/article/view/244 <p>Academic failure and attrition remain persistent problems in Nigerian higher education, where institutions typically respond only after a student has already failed an examination. Educational data mining has shown that machine learning can flag at risk students early, yet most published work relies on datasets and institutional practices that do not reflect the realities of resource constrained African universities, limiting practical applicability. This study develops and benchmarks a machine learning framework for predicting first-year undergraduate academic outcomes at a single private Nigerian university, comparing six classification algorithms, identifying the most informative predictors, and assessing computational feasibility and fairness for single institution deployment. Six classifiers, Random Forest, XGBoost, LightGBM, Support Vector Machine, Logistic Regression, and k-Nearest Neighbour, were trained on 1,200 student records covering demographics, study habits, socioeconomic indicators, and first-year CGPA. After preprocessing, SMOTE class balancing, and Information Gain feature selection, models were evaluated using accuracy, precision, recall, F1-score, ROC-AUC, and PRAUC, with SHAP values used to interpret feature contributions. Random Forest achieved the highest accuracy (91.3%) and AUCROC (0.947), closely followed by XGBoost (91.1%, 0.945) and LightGBM (90.8%, 0.940); all three ensemble methods substantially outperformed SVM, Logistic Regression, and k-NN. Attendance rate, hours of self-study per day, and internet access were the three most predictive features under both Information Gain and SHAP analysis. A preliminary fairness audit found modestly lower recall for low-income students (81.5%) than high-income students (87.0%). The framework runs on standard institutional hardware without GPU infrastructure, making early-warning deployment computationally feasible for resource-constrained universities. Machine learning can support academic advising as a decision-support tool, though institutional governance, ethical oversight, and further fairness auditing are needed before operational use (SDG 4: Quality Education).</p> FI Mamudu TO Taiwo RO Folaranmi Copyright (c) 2026 Francis Itanyi Mamudu, Timothy Oluwagbenga Taiwo, Rotimi Oluwasegun Folaranmi https://creativecommons.org/licenses/by/4.0 2026-07-16 2026-07-16 5 2 67 81