Results 61 to 70 of about 40,126 (265)
End-to-End Quantum Algorithms for the Jones Polynomial
PRX QuantumWe present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any input link, i.e., a closed braid.
Tuomas Laakkonen +8 more
doaj +1 more source
AlgorithmsThis article proposes single-layer neural network algorithms for solving second-order ordinary differential equations, based on the principles of functional connection.
Roman Parovik
doaj +1 more source
Analysis of Polynomial Nonlinearity Based on Measures of Nonlinearity Algorithms
Sensors, 2020 We consider measures of nonlinearity (MoNs) of a polynomial curve in two-dimensions (2D), as previously studied in our Fusion 2010 and 2019 ICCAIS papers.
Mahendra Mallick, Xiaoqing Tian
doaj +1 more source
Advanced Materials Technologies, EarlyView.Single‐filament material extrusion enables spatial stiffness programming through locally controlled thermal foaming of TPU. A data‐driven G‐code framework tunes porosity from 15.7% to 40.7% and hardness from 90 to 63 Shore A within and across layers. Monolithic hands and soft actuators consequently achieve distinct programmed motions without material ...
Rosanna Rifino +3 more
wiley +1 more source
The Medusa algorithm for polynomial matings
Conformal Geometry and Dynamics of the American Mathematical Society, 2012 The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations for the parameters of the rational map, as well as an image of its Julia set. Whether these approximations converge
Boyd, Suzanne Hruska +1 more
openaire +3 more sources
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
Journal of Graph Algorithms and Applications, 2020 Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an $L$-bounded flow is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the maximum $L$-bounded flow problem the task is to find
Kateřina Altmanová +2 more
doaj +1 more source
Advanced Robotics Research, EarlyView.Pak Biawak, a necrobot, embodies an unusual fusion of biology and robotics. Designed to repurpose natural structures after death, it challenges conventional boundaries between nature and engineering. Its movements are precise yet unsettling, raising questions about sustainability, ethics, and the untapped potential of biointegrated machines.
Leo Foulds +2 more
wiley +1 more source
Advanced Robotics Research, EarlyView.This work presents a state‐adaptive Koopman linear quadratic regulator framework for real‐time manipulation of a deformable swab tool in robotic environmental sampling. By combining Koopman linearization, tactile sensing, and centroid‐based force regulation, the system maintains stable contact forces and high coverage across flat and inclined surfaces.
Siavash Mahmoudi +2 more
wiley +1 more source
Algorithms for Solvents of Matrix Polynomials [PDF]
SIAM Journal on Numerical Analysis, 1978 In an earlier paper we developed the algebraic theory of matrix polynomials. Here we introduce two algorithms for computing “dominant” solvents. Global convergence of the algorithms under certain conditions is established.
Dennis Jr., J.E. +2 more
openaire +3 more sources
Edit Distance with Block Deletions
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source