Graph coarsening for fugitive interception by Irene S. van Droffelaar, Jan H. Kwakkel, Jelte P. Mense, Alexander Verbraeck

“…The number of nodes in the network, each being a crossing where routes of the fleeing suspect can split, greatly contributes to the computation time. Graph coarsening is a promising approach to reduce the complexity of the network, and therefore the computation time. …”
Get full text

LiDAR Forest Inventory with Single-Tree, Double-, and Single-Phase Procedures by Robert C. Parker, David L. Evans

“…LiDAR samples were selected with focal filter procedures and heights computed from interpolated canopy and DEM surfaces. …”
Get full text

First-principles and machine-learning approaches for interpreting and predicting the properties of MXenes by José D. Gouveia, Tiago L. P. Galvão, Kais Iben Nassar, José R. B. Gomes

“…Key advances and challenges are critically examined, offering insights into applying computational research to transition these materials from the lab to practical use.…”
Get full text

Why Are FGM Copulas Successful? A Simple Explanation by Songsak Sriboonchitta, Vladik Kreinovich

“…One of the most computationally convenient nonredundant ways to describe the dependence between two variables is by describing the corresponding copula. …”
Get full text

Fake Detect: A Deep Learning Ensemble Model for Fake News Detection by Nida Aslam, Irfan Ullah Khan, Farah Salem Alotaibi, Lama Abdulaziz Aldaej, Asma Khaled Aldubaikil

Get full text

Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas by V. Yu. Tsviatkou, Anh Tuan Nguyen

“…Morphological search algorithms provide the selection of non-strict extremes, but have a high computational complexity. A mathematical model and an algorithm based on the brightness analysis of adjacent homogeneous regions are proposed to isolate strict and non-strict local extremes of images with low computational complexity. …”
Get full text

Fast surface reconstruction algorithm with adaptive step size. by Jingguo Dai, Yeqing Yi, Chengzhi Liu

“…To further improve the computational efficiency, an adaptive step size adjustment strategy for surface reconstruction algorithm is investigated. …”
Get full text

An Improved Stochastic Configuration Networks With Compact Structure and Parameter Adaptation by Sanyi Li, Hongyu Guan, Peng Liu, Weichao Yue, Qian Wang

“…However, traditional SCNs have limitations in network size and computation time. To address these issues, this paper proposes an improved version of SCNs. …”
Get full text

A linear filter regularization for POD-based reduced-order models of the quasi-geostrophic equations by Girfoglio, Michele, Quaini, Annalisa, Rozza, Gianluigi

“…Our numerical results show that the solution computed by the regularized ROM is more accurate, even when the retained POD modes account for a small percentage of the eigenvalue energy. …”
Get full text

BVS: A Lightweight Forward and Backward Secure Scheme for PMU Communications in Smart Grid by Wei Ren, Jun Song, Min Lei, Yi Ren

“…In particular, appealing security scheme needs to perform well in PMUs that usually have computational resource constraints, thus designed security protocols have to remain lightweight in terms of computation and storage. …”
Get full text

Efficient Method for Aeroelastic Tailoring of Composite Wing to Minimize Gust Response by Yang Yu, Zhengjie Wang, Shijun Guo

“…Aeroelastic tailoring of laminated composite structure demands relatively high computational time especially for dynamic problem. This paper presents an efficient method for aeroelastic dynamic response analysis with significantly reduced computational time. …”
Get full text

A Labeled Multi-Bernoulli Filter Based on Maximum Likelihood Recursive Updating by Yuhan Song, Han Shen-Tu, Junhao Lin, Yizhen Wei, Yunfei Guo

“…However, when tracking multiple targets in dense clutters, the computational complexity of the traditional labeled multi-Bernoulli filter will increase exponentially. …”
Get full text

Human Search in a Fitness Landscape: How to Assess the Difficulty of a Search Problem by Oana Vuculescu, Mads Kock Pedersen, Jacob F. Sherson, Carsten Bergenholtz

“…Computational modeling is widely used to study how humans and organizations search and solve problems in fields such as economics, management, cultural evolution, and computer science. …”
Get full text

Incremental Gene Expression Programming Classifier with Metagenes and Data Reduction by Joanna Jedrzejowicz, Piotr Jedrzejowicz

“…A detailed description of the algorithm is followed by the extensive computational experiment. Its results validate the approach. …”
Get full text

Fast two dimensional to three dimensional registration of fluoroscopy and CT-scans using Octrees on segmentation maps by Luca Bertelli, Frédéric Gibou

“…The DRR generation process is the bottleneck of any three dimensional to two dimensional registration system, since its computational complexity scales with the number of voxels in the Computed Tomography Data, which can be of the order of tens to hundreds of millions. …”
Get full text

The assembly sequences modeling using graph incidence matrix by I. A. Volkov, D. D. Primak, V. B. Masyagin, R. L. Artykh

“…The article discusses the problem solution of computer aided determination of the precision axisymmetric products assembly sequence. …”
Get full text

Electronic Structure and Momentum Density of BaO and BaS by R. Kumar, B. K. Sharma, G. Sharma

“…In the present computation, the correlation scheme proposed by Perdew-Burke-Ernzerhof and the exchange scheme of Becke were considered. …”
Get full text

Connecting Patterns Inspire Link Prediction in Complex Networks by Ming-Yang Zhou, Hao Liao, Wen-Man Xiong, Xiang-Yang Wu, Zong-Wen Wei

Get full text

Improving Sleep Disorder Diagnosis Through Optimized Machine Learning Approaches by Md. Atiqur Rahman, Israt Jahan, Maheen Islam, Taskeed Jabid, Md Sawkat Ali, Mohammad Rifat Ahmmad Rashid, Mohammad Manzurul Islam, Md. Hasanul Ferdaus, Md Mostofa Kamal Rasel, Mahmuda Rawnak Jahan, Shayla Sharmin, Tanzina Afroz Rimi, Atia Sanjida Talukder, Md. Mafiul Hasan Matin, M. Ameer Ali

“…Thus, this research proposes Gradient Boosting as the most effective method, outperforming all state-of-the-art techniques by achieving the highest accuracy, precision, recall, F1-score, and AUC, highlighting its superior classification performance and computational efficiency.…”
Get full text

The condition number associated with ideal lattices from odd prime degree cyclic number fields by de Araujo Robson Ricardo

“…In this work, we compute the condition number of a generator matrix of the ideal lattice from the whole ring of integers of any odd prime degree cyclic number field using canonical embedding.…”
Get full text