13 papers · ranked by Valyu relevance
Amir Hossein Salehi Shayegan
Time-fractional diffusion equations have emerged as powerful models for describing anomalous transport phenomena in physics, biology and engineering. To address the computational challenges arising from their non-local operators, we employ the WEB-spline finite element method, which provides a flexible and accurate…
Hongbin Lv, Meixiang Chen, Wen Li
The R-linear convergence of the NQZ algorithm for computing the H-spectral radius of a class of weakly irreducible nonnegative tensors is established by utilizing the directed graphs of tensors. Meanwhile, an upper bound for the root convergence factor R is derived and a general condition ensuring the linear…
Theodoros Anagnostopoulos, Evanthia Zervoudi, Christos Anagnostopoulos, Apostolos Christopoulos + 1 more
Linear regression analysis focuses on predicting a numeric regressand value based on certain regressor values. In this context, k-Nearest Neighbors (k-NN) is a common non-parametric regression algorithm, which achieves efficient performance when compared with other algorithms in literature. In this research effort an…
Zhuo Chen, Yan Liu, Liang Dong, Anyong Liu + 1 more
Highlights What are the main findings? 1. CFMINFO is a weighted-mean optimizer with good-lattice initialization, STC chaos, and cloud mutation, designed for constrained array synthesis. 2. It optimizes both element spacings and amplitudes, ensuring prescribed deep-null steering.What is the implication of the main…
Ahsan Sanaullah, Nathaniel K. Brown, Pramesh Shakya, Arun Deegutla + 4 more
Lossless full text indexes are utilized in a myriad of applications in bioinformatics. The continuously decreasing cost of generating biological data has resulted in the need to build full text indexes on biological datasets of increasing size. Many compressed full text indexes have been developed to address this…
Juha Harviainen, Francisco Sena, Corentin Moumard, Aleksandr Politov + 2 more
In this paper, we make progress in the direction of obtaining linear-time algorithms for bubble-like structures, if we assume that the pangenome graph has at least one tip (a vertex whose incident bidirected edges all have the same sign), or at least one cutvertex. In such a graph, we prove that all ultrabubbles can be…
Yury Zabegaev, Inga Berre, Eirik Keilegavlen
Modeling multiphysics processes in porous media requires preconditioned iterative linear solvers to enable efficient simulations at industry-relevant scales. These solvers are typically composed of sub-algorithms that target individual physical processes. Various options are available for each algorithm, with the…
Mengqi Zhang, Guangqiang Teng, Xiaoyu Lei, Boris Ryabko
Lei proposed an algorithm Algorithm $A_{3}$ in 2023 to generate an exact discrete uniform distribution from an unknown biased Bernoulli source. The present paper does not claim a new extraction algorithm. Its contributions are analytical: first, we provide a Fourier-analytic proof of the uniformity mechanism based on…
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Amir Hossein Salehi Shayegan
In this work, we present a solution to the critical limitation of qubit capacity in near-term quantum hardware by giving a hybrid framework that integrates the spectral element method (SEM) with distributed quantum computing. Using domain decomposition techniques, the additive and multiplicative Schwarz methods, the…
Jan Broulím, Matěj Prokop, Libor Nouzák, Pavel Smrčka + 1 more
In this article, we provide a study of the energy calibration model used for Timepix-type detectors. The Timepix detectors, operating in Time-over-Threshold mode, measure information that needs to be mapped into the corresponding energies using a non-linear function. We consider three iterative algorithms…
Duc-Cuong Dang, Per Kristian Lehre
While some common fitness landscape characteristics are critical when determining the runtime of evolutionary algorithms (EAs), the relationship between fitness landscape structure and the runtime of EAs is poorly understood. Recently, Dang, Eremeev, and Lehre introduced a classification of pseudo-Boolean problems…
Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer
We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek}…