Applied and Computational Engineering

Open access

Print ISSN: 2755-2721

Online ISSN: 2755-273X

About ACE

The proceedings series Applied and Computational Engineering (ACE) is an international peer-reviewed open access series that publishes conference proceedings from various methodological and disciplinary perspectives concerning engineering and technology. ACE is published irregularly. The series contributes to the development of computing sectors by providing an open platform for sharing and discussion. The series publishes articles that are research-oriented and welcomes theoretical and applicational studies. Proceedings that are suitable for publication in the ACE cover domains on various perspectives of computing and engineering.

Aims & scope of ACE are:
·Computing
·Machine Learning
·Electrical Engineering & Signal Processing
·Applied Physics & Mechanical Engineering
·Chemical & Environmental Engineering
·Materials Science and Engineering

View full aims & scope

Editors View full editorial board

Anil Fernando
University of Strathclyde
United Kingdom
Editor-in-Chief
anil.fernando@strath.ac.uk
Yilun Shang
Northumbria University
United Kingdom
Associate Editor
yilun.shang@northumbria.ac.uk
Ella Haig
University of Portsmouth
Portsmouth, UK
Associate Editor
ella.haig@port.ac.uk
Moayad Aloqaily
Mohamed Bin Zayed University of Artificial Intelligence
The United Arab Emirates
Associate Editor
moayad.aloqaily@mbzuai.ac.ae

Latest articles View all articles

Research Article
Published on 18 August 2026 DOI: 10.54254/2755-2721/2026.BA36234
Jingkai Gao

Accurate one-hour-ahead electricity load forecasting sustains dispatch, reserve planning, and dependable power-system operation, but additional inputs do not always improve predictions. This study assesses how different parameter settings contribute to power demand forecasting. Four long short-term models with a unified architecture were trained on 48048 hourly observations and a 24-hour window. Input configurations include historical demand alone, demand with twelve weather variables, demand with two calendar indicators, or all inputs. Each configuration was trained five times and evaluated on a chronological test set. The weather-based model achieved the lowest mean errors: a mean absolute percentage error of 1.599% and a root mean square error of 26.333. The history-only model remained competitive, while calendar indicators and the all-input model offered no improvement. Recent demand therefore provides most of the useful information at this horizon, with lagged weather adding a modest signal. Careful feature selection can reduce complexity and support interpretable, dependable operational forecasts.

Show more
View pdf
Gao,J. (2026). One-Hour-Ahead Short-Term Electricity Load Forecasting Using Long Short-Term Memory Networks. Applied and Computational Engineering,258,65-71.
Export citation
Research Article
Published on 18 August 2026 DOI: 10.54254/2755-2721/2026.BA36232
Yirui Mao

Short-term taxi order forecasting is a key reference for dynamic allocation of urban transportation capacity. New York taxi passenger flow exhibits significant intraday cyclical fluctuations, making it difficult for manual dispatch to predict changes in passenger flow. This paper takes hourly taxi order time-series data in New York City as the research object, selecting the Seasonal Autoregressive Integrated Moving Average (SARIMA) model and the Support Vector Regression (SVR) model to conduct a short-term order prediction comparison. Based on AIC and BIC criteria, the optimal SARIMA parameters are traversed and screened, and SVR data are subjected to Min-Max normalization. Both types of models use multi-step rolling forecasting to generate a complete 7-day prediction sequence, relying on MAE, RMSE, MAPE, and R2 indicators to quantify prediction accuracy. Experimental results show that the optimal SARIMA (1,0,1)(1,1,24) model can accurately fit peak and valley fluctuations in passenger flow, with an R2 of 0.815. SVR models can only capture overall trends and lack the ability to characterize extreme passenger flows. The study demonstrates that for taxi time series data with strong intraday cycles, the SARIMA model offers better prediction stability and accuracy, providing a reference for taxi capacity scheduling.

Show more
View pdf
Mao,Y. (2026). New York City Taxi Order Volume Forecasts Based on SARIMA and SVR Models. Applied and Computational Engineering,258,58-64.
Export citation
Research Article
Published on 18 August 2026 DOI: 10.54254/2755-2721/2026.BA36242
Lujing Wang

Accurate hourly bike-sharing demand prediction is important for bicycle rebalancing and resource allocation. This study evaluates the individual and combined contributions of environmental and temporal features to hourly bike-sharing demand prediction using 17,414 hourly records from the London Bike Sharing Dataset. A time-ordered 80:20 split is adopted to mimic forecasting future demand from historical observations. A distance-weighted k-nearest neighbors (KNN) regressor is adopted as the baseline, and a tuned random forest (RF) regressor serves as the main model. RF achieves MAE=173.08 rentals/h, RMSE=304.76 rentals/h, and R²=0.927, reducing MAE and RMSE by 65.7% and 60.2% compared with KNN. Feature-combination experiments show that environmental features alone have limited explanatory power (R²=0.132), whereas temporal features capture the main demand structure (R²=0.868). After feature fusion, MAE and RMSE decrease by 29.0% and 25.6% relative to the temporal-only setting. Visual analyses and permutation importance indicate that temporal variables establish the main demand baseline, while environmental variables provide complementary corrections. The results offer interpretable evidence for feature selection and short-term bike-sharing operations.

Show more
View pdf
Wang,L. (2026). Short-Term Bike-Sharing Demand Prediction Using Environmental and Temporal Feature Fusion. Applied and Computational Engineering,258,49-57.
Export citation
Research Article
Published on 18 August 2026 DOI: 10.54254/2755-2721/2026.BA36241
Qi Wu

Intrusion detection systems built on hand-written rules are losing ground as attackers find new ways to bypass fixed signatures. Working with the NSL-KDD benchmark, the paper put three classical machine learning methods—Decision Tree (DT), Random Forest (RF), and K-Nearest Neighbors (KNN)—through the same set of binary and five-class detection tests. Random forest handled the diverse five-class label set best, hitting 76.3% accuracy with an F1 of 0.720. In the simpler binary task, however, the decision tree pulled ahead (81.2%, F1 0.813). The reason was straightforward: the ensemble model grew too cautious when samples were scarce, suppressing false alarms at the cost of missing real attacks. DoS floods were caught almost without fail (F1 0.884). R2L and U2R, on the other hand, evaded detection almost entirely—their training presence was vanishingly small, at 0.83% and 0.04% of the training pool. Feature importance scores from the random forest pointed overwhelmingly to traffic volume and rate-based statistics as the strongest signals, while class skew stood out as the single largest obstacle. Rather than chasing marginal accuracy gains, the results argue for treating rare-class detection as the main priority in future work.

Show more
View pdf
Wu,Q. (2026). Comparison of Network Attack Detection Algorithms Based on NSL-KDD Dataset. Applied and Computational Engineering,258,41-48.
Export citation

Volumes View all volumes

Volume 258August 2026

Find articles

Proceedings of CONF-MLA 2026 Symposium: Learning and Decision Making in Multi Agent Software Systems

Conference website: https://2026.confmla.org/Bath/Home.html

Conference date: 26 October 2026

ISBN: 978-1-80590-921-7(Print)/978-1-80590-922-4(Online)

Editor: Hisham AbouGrad , Jie Zhang

Volume 257August 2026

Find articles

Proceedings of CONF-CDS 2026 Symposium: Computer Vision-Based Multimodal Cognitive Load Estimation for Adaptive Media Communication

Conference website: https://2026.confcds.org/Glasgow/Home.html

Conference date: 14 August 2026

ISBN: 978-1-80590-899-9(Print)/978-1-80590-900-2(Online)

Editor: Marwan Omar , Anil Fernando

Volume 256August 2026

Find articles

Proceedings of the 4th International Conference on Machine Learning and Automation

Conference website: https://2026.confmla.org/

Conference date: 16 November 2026

ISBN: 978-1-80590-903-3(Print)/978-1-80590-904-0(Online)

Editor: Hisham AbouGrad

Volume 255August 2026

Find articles

Proceedings of CONF-CDS 2026 Symposium: Machine Learning and Neural Network Applications in Engineering

Conference website: https://2026.confcds.org/Astana/Home.html

Conference date: 17 September 2026

ISBN: 978-1-80590-871-5(Print)/978-1-80590-878-4(Online)

Editor: Marwan Omar , Mian Umer Shafiq

Indexing

The published articles will be submitted to following databases below: