Results 141 to 150 of about 2,413 (304)
On the Deterministic Complexity of Factoring Polynomials
The problem considered is factoring polynomials over finite fields. In 1970 Berlekamp published an algorithm solving this problem in probabilistic polynomial time. It is still an open question whether there exists a deterministic polynomial time algorithm, even under the extended Riemann hypothesis (ERH).
openaire +2 more sources
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source
Chalykh's Baker-Akhiezer functions as eigenfunctions of the integer-ray integrable systems
Macdonald symmetric polynomial at t=q−m reduces to a sum of much simpler complementary non-symmetric polynomials, which satisfy a simple system of the first order linear difference equations with constant coefficients, much simpler than those induced by ...
A. Mironov, A. Morozov, A. Popolitov
doaj +1 more source
This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
Arithmetic and factorization of polynomials over F_2 [PDF]
We describe algorithms for polynomial multiplication and polynomial factorization over the binary field F2 and their implementation.
Jürgen Gerhard, Joachim von zur Gathen
core
Khovanov–Rozansky cycle calculus for bipartite links
Bipartite calculus is a direct generalization of Kauffman planar expansion from $$N=2$$ N = 2 to arbitrary N, applicable to the restricted class of knots which are entirely made of antiparallel lock tangles.
A. Anokhina, E. Lanina, A. Morozov
doaj +1 more source
Modular, Textile‐Based Soft Robotic Grippers for Agricultural Produce Handling
This article introduces textile‐based pneumatic grippers that transform simple textiles into robust bending actuators. Detailed experiments uncover how cut geometry and fabric selection shape performance. Successful handling of fragile agricultural items showcases the potential of textile robotics for safe, scalable automation in food processing and ...
Zeyu Hou +4 more
wiley +1 more source
A Low‐Cost, Handheld Optical Stiffness Sensor for Minimally Invasive Surgery
A novel handheld stiffness sensor is presented for real‐time tissue stiffness characterization. By simultaneously sensing contact force and tissue deformation, the device enables accurate stiffness quantification without requiring precise manual control. This approach offers a promising solution for intraoperative tumor detection and minimally invasive
Qianyu Ma +4 more
wiley +1 more source
Darboux transformation of symmetric Jacobi matrices and Toda lattices
Let J be a symmetric Jacobi matrix associated with some Toda lattice. We find conditions for Jacobi matrix J to admit factorization J = LU (or J = 𝔘𝔏) with L (or 𝔏) and U (or 𝔘) being lower and upper triangular two-diagonal matrices, respectively.
Ivan Kovalyov, Oleksandra Levina
doaj +1 more source
Dissecting the Ecological Structure of Health and Disease in the Global Gut Microbiome
We introduce Wiredancer, a framework that identifies three continuous ecological factors of the gut microbiota. These factors exhibit distinct patterns across health and disease, jointly capturing disrupted ecological stability and offering a new perspective for precision diagnostics and therapeutic strategies.
Baoyuan Zhu +19 more
wiley +1 more source

