Results 81 to 90 of about 51,940 (240)
Euclidean distance degree defect of singular projective varieties
The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many examples arising in optimization, engineering, statistics, and data science, there is a significant gap between them ...
Maxim, Laurenţiu G. +2 more
openaire +2 more sources
Triple‐Mode Ferroelectric Thin‐Film Transistor for Hybrid Electrical–Optical Reservoir Computing
A triple‐mode ferroelectric thin‐film transistor is developed by integrating Si3N4/HZO/IGZO layers to realize three independent memory modes: electric long‐term, electric short‐term, and optical short‐term. This single‐device architecture functions as both a reservoir and readout layer, achieving 92.43% MNIST accuracy. It offers a fully hardware‐based,
Hyeonho Lee +9 more
wiley +1 more source
When a company uses a shared storage system, selection of locations during the order‑picking process is not an obvious task. Every location where the picked product is placed, can be described by means of several variables, such as: storage time ...
Krzysztof Dmytrów
doaj +1 more source
The Euclidean distance degree of one-parameter anchored multiview varieties
Multiview varieties are mathematical models for the set of image feature correspondences that can be produced by a given camera arrangement. They possess an invariant known as their Euclidean distance (ED) degree, which measures the algebraic complexity of determining the 3D features that minimize the reprojection error when computing the scene ...
Finkel, Bella, Rodriguez, Jose Israel
openaire +2 more sources
SpaMode introduces a versatile framework for spatial multi‐omics integration across vertical, horizontal, and mosaic scenarios. By disentangling modality‐invariant and variant features through a mixture‐of‐experts mechanism, it adaptively reconfigures spatially heterogeneous signals.
Xubin Zheng +6 more
wiley +1 more source
The computation of the Euclidean distance degree for the middle Catalacticant for the binary forms
The $n$-secant varieties to the Veronese embedding $v_{2n}(\mathbb{P}^{1})$ are hypersurfaces of degree $n+1$, denoted by $σ_n(v_{2n}(\mathbb{P}^1))$. We compute the Euclidean distance degree $\mathrm{EDdegree}$ of $σ_n(v_{2n}(\mathbb{P}^1))$ for $n\le 5$ with respect to the Bombieri-Weyl quadratic form, which is maybe the most interesting case.
openaire +2 more sources
Euclidean distance degree of complete intersections via Newton polytopes
In this note, we consider a complete intersection $X=\{x\in \mathbb{R}^n : f_1(x)= \ldots = f_m(x)=0\}, n>m$ and study its Euclidean distance degree in terms of the mixed volume of the Newton polytopes. We show that if the Newton polytopes of $f_j,j=1,\ldots, m$ contain the origin then when these polynomials are generic with respect to their Newton ...
Thang, Nguyen Tat, Thuy, Pham Thu
openaire +2 more sources
A conversion‐resolved constitutive framework is developed for the hydrogen‐based direct reduction of iron oxide pellets. Effective reaction and transport timescales are inferred directly from measured trajectories and mapped against operating conditions, pellet architecture, and composition. The analysis reveals how late‐stage transport control emerges
Anurag Bajpai +3 more
wiley +1 more source
We have mapped the primary native and exotic vegetation that occurs in the Cerrado-Caatinga transition zone in Central Brazil using MODIS-NDVI time series (product MOD09Q1) data over a two-year period (2011–2013).
Natanael Antunes Abade +3 more
doaj +1 more source
The Euclidean distance degree of an algebraic variety
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition.
Draisma, J. +4 more
openaire +1 more source

