Results 81 to 90 of about 215,248 (216)
An Algorithm for the Forward Position Kinematics of General Stewart Platform Mechanism
Jixie chuandong, 2016 A new algebra algorithm for the forward position kinematics of general Stewart platform（ GSP）is presented. First of all,the 20 original equations containing 9 variables are built according to the geometric construction of GSP.
Wang Furong, Xin Jiaoli
doaj
Sustainability trade-offs at the nexus of solar energy, agriculture, and biodiversity
Geography and SustainabilityA rapid transition to renewable energy is necessary for achieving global decarbonization targets, but siting conflicts, particularly beyond the built environment, remain a key barrier to sustainable development.
Adam Gallaher +4 more
doaj +1 more source
Analysis of Eigenvalue Clustering Leads to Optimal Scaling in Numerical Radiative Transfer
Numerical Linear Algebra with Applications, Volume 33, Issue 5, October 2026.ABSTRACT We consider a multidimensional polychromatic radiative transfer (RT) problem, accounting for scattering processes in a general form, that is, anisotropic (dipole) scattering with partial frequency redistribution. Given a discrete ordinates (SN$$ {S}_N $$) discretization, we report the corresponding matrix structures, depending on the model and
Pietro Benedusi +3 more
wiley +1 more source
Conditional lexicographic orders in constraint satisfaction problems
Annals of Operations Research, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard J. Wallace, Nic Wilson
openaire +3 more sources
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
Quality and Reliability Engineering International, Volume 42, Issue 6, Page 3326-3334, October 2026.ABSTRACT We introduce Circulant Matrix‐Based Box–Behnken Designs (CBBDs), a new class of three‐level, second‐order response surface designs constructed using circulant matrix structures. These designs satisfy an enhanced orthogonal minimally aliased (OMA∗${\rm OMA}^*$) property: they retain the classical OMA property—where main effects are orthogonal ...
Tung‐Dinh Pham, Nam‐Ky Nguyen
wiley +1 more source
A theorem on refining division orders by the reverse lexicographic order
Duke Mathematical Journal, 1987 If \(S_ d\) is the K-vector space of homogeneous polynomials of degree d in \(S=k[x_ 1,...,x_ n]\), where K is an infinite field, then a (partial) order \(>\) on the monomials of \(S_ d\) for each d is compatible with the monoid structure of the monomials of S if \(x^ A>x^ B\) implies \(x^ Cx^ A>x^ Cx^ B\) for all monomials \(x^ C\). If the order \(>\)
Bayer, David, Stillman, Michael
openaire +2 more sources
Bounded diameter monochromatic component covers
Mathematika, Volume 72, Issue 4, October 2026.Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
From constraints to finite automata to filtering algorithms [PDF]
, 2004 We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two case studies of constraints on vectors of variables.
Mats Carlsson +14 more
core +1 more source
Applied SciencesIn this paper, we take the longitudinal two-stage and two-yard EMU (Electric Multiple Unit) depot as an example and discusses the optimization challenges of the first-level maintenance shunting operation plan under the background of limited maintenance ...
Hua Zhang +4 more
doaj +1 more source
Lexicographic Optimization on Polytopes is Linear Programming [PDF]
Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.lexicographic optimization;linear ...
Tijs, S.H.
core