Results 81 to 90 of about 94,123 (313)
Fast algorithms for the characteristics polynomial
Theoretical Computer Science, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Improved algorithms for isomorphisms of polynomials [PDF]
, 1998 This paper is about the design of improved algorithms to solve Isomorphisms of Polynomials (IP) problems. These problems were first explicitly related to the problem of finding the secret key of some asymmetric cryptographic algorithms (such as Matsumoto and Imai's C* scheme of [12], or some variations of Patarin's HFE scheme of [14]). Moreover, in [14]
Jacques Patarin +2 more
openaire +1 more source
Seifert's algorithm, Châtelet bases and the Alexander ideals of classical knots [PDF]
, 2002 I begin by developing a procedure for the construction of a Seifert surface, using Seifert's algorithm, and the calculation of a Seifert matrix for a knot from a suitable encoding of a knot diagram. This procedure deals with the inherent indeterminacy of
O'Brien, Killian Michael
core
Hard‐Magnetic Soft Millirobots in Underactuated Systems
Advanced Robotics Research, EarlyView.This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source
Semidefinite Programming by Perceptron Learning [PDF]
, 2003 We present a modified version of the perceptron learning algorithm (PLA) which solves semidefinite programs (SDPs) in polynomial time. The algorithm is based on the following three observations: (i) Semidefinite programs are linear programs with ...
Thore Graepel +7 more
core
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
A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection [PDF]
We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion.
Sotirov, R., Takano, Y.
core +1 more source
Polynomial programming with DIGS: a second order cone implementation [PDF]
, 2022 DIGS is an algorithm developed by Anjos, Ghaddar and Vera (2016) proved to be a valid alternative to Lasserre Hierarchies for solving Polynomial Programs. In this thesis we implemented, tested and then improved its SOCP formulation.
Angioni, Davide
core
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
Applied Sciences, 2020 In wavelength-tuning interferometry, the surface profile of the optical component is a key evaluation index. However, the systematic errors caused by the coupling error between the higher harmonics and phase shift error are considerable. In this research,
Fuqing Miao, Seokyoung Ahn, Yangjin Kim
doaj +1 more source