Forthcoming and Online First Articles

International Journal of Computing Science and Mathematics

International Journal of Computing Science and Mathematics (IJCSM)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

International Journal of Computing Science and Mathematics (9 papers in press)

Regular Issues

  • Research on the Motion Trajectory of Wheel Differential Robot based on Kalman Filter   Order a copy of this article
    by Yunfei Huang, Yubin Zhang, Qiaoling Lu, Jianhui Deng, Zhengyang Xiao, Junxi Liang, Ke Wende 
    Abstract: the wheeled differential robot is widely used in the field of robotics for it adopts four-wheel driven differential steering, turns in place with strong power, is good in climbing, sudden starting, and accelerations. In robot motion trajectory planning, due to the problems of noise and sensor data uncertainty, it is difficult to accurately achieve the target position based on the preset motion speed and position. To address this issue, the motion model of the differential vehicle robot was analyzed as well as the relationship of position and velocity, the two-level control architecture and PID (proportional, integral, derivative) were analyzed. Through the encoder, the current velocity and position were obtained. Finally, the Kalman filtering was used to achieve the accurate trajectory of the robot. The effectiveness of the method was verified through simulating experiments.
    Keywords: wheeled differential robot; optimization; noise; trajectory.
    DOI: 10.1504/IJCSM.2025.10072255
     
  • A Solution to the Job Shop Scheduling Problem based on an Enhanced Slime Mould Algorithm   Order a copy of this article
    by Trong-The Nguyen, Yingping Zeng, Chia-Hung Wang, Jinchen Yuan, Thi-Kien Dao 
    Abstract: The Job Shop Scheduling Problem (JSSP) is a complex optimisation challenge with broad industrial applications. This study introduces an Enhanced Slime Mould Algorithm (ESMA), a novel extension of the Slime Mould Algorithm (SMA), to address JSSP more effectively. ESMA integrates Opposition-Based Learning (OBL) and non-linear inertia weight strategies to improve both exploration and exploitation. Benchmark evaluations demonstrate ESMA's superior performance, achieving up to a 3.36% improvement in average makespan for small-scale problems and a 15.56% reduction in makespan for large-scale instances compared to traditional and metaheuristic approaches. These results confirm ESMA's strong global search capabilities as a powerful solution to JSSP.
    Keywords: Job Shop Scheduling Problem; Slime Mould Algorithm; Opposition-Based Learning; Metaheuristic; Scheduling Optimisation.
    DOI: 10.1504/IJCSM.2025.10072536
     
  • The Application of Mathematical Analysis in Solving Nonlinear Phenomena in Fluid Mechanics   Order a copy of this article
    by You Li, Gui Li, Xuan Leng 
    Abstract: In order to assist mathematical analysis in solving nonlinear problems, reduce the computational cost and accelerate the solution process, the study explores the common mathematical methods for nonlinear solution; followed by the introduction of an optimized arithmetic algorithm for improved precision. Experimental results showed the hybrid algorithm designed in the study achieves a recall of 0.893, corresponding to a precision of 0.9, and a ROC region of 0.913, which is better than other algorithms in the same experimental environment. The algorithm demonstrated fast convergence in loss curve, high computational efficiency, taking only 9.07s. The average absolute value error converges to 0.07, and the root mean square error converges to 0.532. The method takes the optimal values of Generation Distance, Hyper volume, Spacing and Spread indexes in the process of solving nonlinear equations. This study effectively combines the mathematical analytical method and computer technology to provide a new idea and method for the mathematical analysis of nonlinear phenomena, which enriches the research content of nonlinear science.
    Keywords: Mathematical analysis method; Solitons; Abnormal wave; Nonlinear phenomena; Arithmetic optimization algorithm; Nonlinear equation.
    DOI: 10.1504/IJCSM.2025.10072716
     
  • Machine Learning Approach for Classification of Phishing Attacks with Particle Swarm Optimisation Technique   Order a copy of this article
    by Prakash Pathak, Akhilesh Shrivas 
    Abstract: Phishing is an online scam where an attacker creates fake websites or emails to collect secret information from the internet or email users. The main contribution of research work is to develop a robust and computationally efficient hybrid model using machine learning based classification techniques with Particle Swarm Optimisation (PSO) to facilitate the classification of phishing attacks. The study constructs a machine learning-based ensemble model empowered by particle swarm optimisation for effective phishing attack classification. A novel ensemble model is developed, amalgamating Support Vector Machine(SVM), Logistic Regression(LR), and Decision Trees (DT) through a voting scheme ensemble technique. Additionally, PSO feature selection techniques are applied to phishing datasets to streamline feature sets. Comparative analysis with existing classifiers and ensemble models, employing reduced feature sets, demonstrates that our proposed model achieves a remarkable 99.08% accuracy with 27 features. Consequently, our recommended model offers expedited computational time for phishing attack classification.
    Keywords: phishing attacks; machine learning; classification; ensemble model; particle swarm optimization (PSO); 10-fold cross-validation.
    DOI: 10.1504/IJCSM.2025.10072717
     
  • A Sequential Hybrid Optimisation of Harris-Hawk Optimisation with Osprey Optimisation Algorithm for Searching Global Optima   Order a copy of this article
    by Vikas Shinde, Rahul Jha, Dilip Kumar Mishra 
    Abstract: The major problems faced in global optimization are the premature convergence of local optimum and expensive exploration of complex search spaces. This article presented, a new sequential hybrid optimisation technique. Hybrid Harris Hawks Osprey Optimisation Algorithm (Hybrid-HHOOOA), which integrates Harris Hawks Optimizer with Osprey Optimisation Algorithm to overcome such challenges. Taking inspiration from the hunting process of hawks, and HHO efficiently explores the search space in a bid to find probable solutions. The final solutions obtained from HHO act as the initial inputs for OOA, by increasing the search intensity in the promising areas which improves exploitation. Hybrid-HHOOOA was run on 15 benchmark functions and showcased better outcomes compared to HHO, OOA, and other metaheuristic algorithms. Results indicate that Hybrid-HHOOOA balances between exploration and exploitation appropriately to achieve better global optimisation results. The hybrid approach has exemplified the effect of integrating sequential methods and nature-inspired principles in optimising complex real-world problems.
    Keywords: Metaheuristic Algorithms; Harris-Hawks Optimisation; Osprey Optimisation Algorithm; Hybridisation.
    DOI: 10.1504/IJCSM.2025.10072719
     
  • Single-Image Reflection Removal Algorithms: a Systematic Review Using PRISMA Guidelines   Order a copy of this article
    by Hui Hu, Wai Chong Chia, Yun-Li Lee, Kok-Lim Alvin Yau, Han Huang 
    Abstract: Taking photos through glasses or windows often introduces reflections that affect the accuracy of computer vision tasks. This systematic literature review provides a comprehensive survey on single-image reflection removal for general scenes captured through glasses. We present the priors, the factors involved in the mixture image formation process, and the quantitative metrics in model-driven methods, as well as the training and testing datasets and quantitative metrics in data-driven methods. Our review addresses a total of three research questions, ranging from 2017 to 2023, in accordance with the PRISMA 2020 guidelines. We screened over 566 research papers from four electronic databases ScienceDirect, IEEE Xplore, Web of Science, and the ACM Digital Library and ultimately selected 36 papers for in-depth analysis. By comprehensive analysis and statistics of the selected papers, we answered the 3 key research questions and then identified open problems for future researchers.
    Keywords: Reflection Removal; Reflection Separation; Deep Learning; Single-Image Reflection Removal; Systematic Literature Review.
    DOI: 10.1504/IJCSM.2025.10072774
     
  • Optimisation of Algebraic Event Structure using Trace Equivalence based on Gr   Order a copy of this article
    by Weidong Tang, Weiwen Ge, Meiling Liu 
    Abstract: The process of data flow exchange in complex concurrent systems is often redundant and uncertain, leading to resource inefficiency and "state explosion". Equivalence relationships identify processes of the same behaviour, remove redundancy to simplify system verification and analysis, and effectively mitigate the "state explosion" problem. In Glabbeek's equivalence spectrum, trace equivalence (systems that produce the same sequence of actions are considered equivalent) and bi-simulation equivalence (requiring bidirectional behaviour correspondence between systems) are widely accepted. In this paper, we discuss the method of trace equivalence judgment on the polynomial algebraic event structure, propose the judgment of polynomial event equivalence, and use Grobner basis for calculation. Grobner basis, as an algebraic tool to determine the equality of polynomial systems, has the advantages of accuracy and efficiency, and provides a strict mathematical basis for the equivalence determination. Finally, a practical case is presented to show the optimisation effect of this method.
    Keywords: state explosion; trace equivalence; bisimulation equivalence; polynomial algebraic event structure; Gröbner basis.
    DOI: 10.1504/IJCSM.2025.10072982
     
  • Effects of Fuel Pool Condition on Distribution of Fire Diffusion Velocity in Aero-Engine Variable Section Annular Cavity   Order a copy of this article
    by Guanbing Cheng, Zhangyuan CHEN, Haobo LUO 
    Abstract: Fire scenarios in annular cavities threaten operation safety of turbofan engine and its structural integrity. Physical and numerical models of one variable section annular cavity of one turbofan were established. Effects of pool conditions were examined on variations of the single pool fire plume velocity. The results show that pool fire undergoes original increase stage and quasi-steady one in various pool locations, sizes and shapes. The fire plume floats upwards, propagates and touches the core engine cavity. The fire plume velocity above the pool is higher than those at other locations in the cavity. The plume velocity is low at left and right sides of inner ring. The smaller size and width pool and the longer distance between the pool and the inner ring may prolong fire plume floating distances and time. The pool fire shape and its plume velocity distribution oscillate from symmetrical state to unsymmetrical one.
    Keywords: Turbofan; Variable section annular cavity; Single fuel pool; pool location; size and shape; Plume velocity; FDS.
    DOI: 10.1504/IJCSM.2025.10072984
     
  • Linear Polynomial Algebra Migration System for Program Equivalence and Approximate Optimisation   Order a copy of this article
    by Weiwen Ge, Weidong Tang, Meiling Liu 
    Abstract: Program structure simplification constitutes a critical research domain in software engineering. With increasing system complexity, traditional simplification approaches remain predominantly confined to deterministic equivalence verification, lacking substantial investigation into approximate equivalence, error quantification, and control mechanisms. This paper develops a novel concept of common algebraic set bi-simulation equivalence by integrating Wu's characteristic series within a linear polynomial algebraic migration system framework. To address non-deterministic equivalence problems, this work introduces novel least squares solution metrics and singular value thresholding control mechanisms. These innovations establish an approximate bi-simulation equivalence theory that quantifies program behaviour differences while maintaining controllable error bounds. Consequently, approximately equivalent systems can replace the original complex systems, thereby simplifying program architecture. Experimental validation using a concurrent communication program demonstrates the efficacy of our proposed methodology in program optimisation.
    Keywords: Wu's characteristic series; linear polynomial algebra migration system; least squares solution; singular value thresholding; approximate bisimulation equivalence.
    DOI: 10.1504/IJCSM.2025.10073023