Results 41 to 50 of about 40,126 (265)
Polynomial tails of additive-type recursions [PDF]
Polynomial bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees, or in recursive algorithms.
Eva-Maria Schopp
doaj +1 more source
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno +19 more
wiley +1 more source
Algorithms for computing chromatic polynomials and chromatic index polynomials
Objectives: The aim of this article is to enhance the understanding of the computation of chromatic polynomials and chromatic index polynomials, and to facilitate their practical use in various fields by demonstrating and supporting the proposed ...
Lateram Zawuga Hordofa +2 more
doaj +1 more source
A combinatorial optimization problem is called stable if its solution is preserved under perturbation of the input parameters that do not exceed a certain threshold – the stability radius.
I. V. Kozlov
doaj +1 more source
Data‐Driven SuStaIn Model of Disability Progression in Amyotrophic Lateral Sclerosis
ABSTRACT Objective To determine whether ordinal Subtype and Stage Inference (SuStaIn) applied to routine ALSFRS‐R item scores can identify reproducible disability progression patterns in amyotrophic lateral sclerosis (ALS) and provide clinically meaningful staging.
Giammarco Milella +5 more
wiley +1 more source
Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques
In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruence mod p to polynomial congruence mod pk. For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the form axn≡b(
M. Khalid Mahmood, Farooq Ahmad
doaj +1 more source
Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$ [PDF]
Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum ...
Xi Lu, Yuan Liu, Hongwei Lin
doaj +1 more source
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
Biharmonic Equation on Annulus in a Unit Sphere with Polynomial Boundary Condition
We studied Biharmonic boundary value problem on annulus with polynomial data. We utilize an exact algorithms for solving Laplace equations with Dirichlet conditions with polynomial functions data.
Ikhsan Maulidi, Agah D Garnadi
doaj +1 more source
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source

