Results 51 to 60 of about 1,991 (112)
Convex Combinatorial Optimization [PDF]
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several
Onn, Shmuel, Rothblum, Uriel G.
core +4 more sources
Steenrod operations via higher Bruhat orders
Abstract The purpose of this paper is to establish a correspondence between the higher Bruhat orders of Yu. I. Manin and V. Schechtman, and the cup‐i$i$ coproducts defining Steenrod squares in cohomology. To any element of the higher Bruhat orders, we associate a coproduct, recovering Steenrod's original ones from extremal elements in these orders ...
Guillaume Laplante‐Anfossi +1 more
wiley +1 more source
Cost of Simulating Entanglement in Steering Scenarios [PDF]
Quantum entanglement is a fundamental feature of quantum mechanics, yet certain entangled states that are unsteerable can be classically simulated in steering scenarios, making them unable to exhibit quantum steering.
Yujie Zhang +2 more
doaj +1 more source
Hierarchical zonotopal spaces [PDF]
Zonotopal algebra interweaves algebraic, geometric and combinatorial properties of a given linear map X. Of basic significance in this theory is the fact that the algebraic structures are derived from the geometry (via a non-linear procedure known as ...
Holtz, Olga, Ron, Amos, Xu, Zhiqiang
core +1 more source
A data‐driven safety preserving control architecture for constrained cyber‐physical systems
Abstract In this article, we propose a data‐driven networked control architecture for unknown and constrained cyber‐physical systems capable of detecting networked false‐data‐injection attacks and ensuring plant's safety. In particular, on the controller's side, we design a novel robust anomaly detector that can discover the presence of network attacks
Mehran Attar, Walter Lucia
wiley +1 more source
On the design of Robust tube-based MPC for tracking [PDF]
17th IFAC World Congress (IFAC'08)Seoul, Korea, July 6-11This paper deals with the design procedure of the recently presented robust MPC for tracking of constrained linear systems with additive disturbances.
Alamo, Teodoro +3 more
core +1 more source
CAT(0) and cubulated Shephard groups
Abstract Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2. We extend a well‐known result that Coxeter groups are CAT(0)$\mathrm{CAT}(0)$ to a class of Shephard ...
Katherine M. Goldman
wiley +1 more source
ERROR BOUNDS FOR SURFACE AREA ESTIMATORS BASED ON CROFTON’S FORMULA
According to Crofton's formula, the surface area S(A) of a sufficiently regular compact set A in Rd is proportional to the mean of all total projections pA (u) on a linear hyperplane with normal u, uniformly averaged over all unit vectors u.
Markus Kiderlen, Daniel Meschenmoser
doaj +1 more source
On \pi-surfaces of four-dimensional parallelohedra [PDF]
We show that every four-dimensional parallelohedron P satisfies a recently found condition of Garber, Gavrilyuk & Magazinov sufficient for the Voronoi conjecture being true for P. Namely we show that for every four-dimensional parallelohedron P the group
Garber, Alexey
core +1 more source
Flexible load resources on the demand side are characterized by diverse types, small capacity, and wide distribution. Since these load resources cannot be individually invoked at the system level, it is becoming increasingly important to consider how to establish heterogeneous flexible load aggregates and utilize their adjustable characteristics.
Chenzheng Xie +4 more
wiley +1 more source

