Results 31 to 40 of about 2,610,164 (335)
A New Algorithm for Privacy-Preserving Horizontally Partitioned Linear Programs
In a linear programming for horizontally partitioned data, the equality constraint matrix is divided into groups of rows. Each group of the matrix rows and the corresponding right-hand side vector are owned by different entities, and these entities are ...
Chengxue Zhang+3 more
doaj +1 more source
Gait Analysis for a Tiltrotor: The Dynamic Invertible Gait
A conventional feedback-linearization-based controller, when applied to a tiltrotor (eight inputs), results in extensive changes in tilting angles, which are not expected in practice. To solve this problem, we introduce the novel concept of “UAV gait” to
Zhe Shen, Takeshi Tsuchiya
doaj +1 more source
Invertible Concept-based Explanations for CNN Models with Non-negative Concept Activation Vectors [PDF]
Convolutional neural network (CNN) models for computer vision are powerful but lack explainability in their most basic form. This deficiency remains a key challenge when applying CNNs in important domains.
Ruihan Zhang+4 more
semanticscholar +1 more source
Finding Bit-Based Division Property for Ciphers with Complex Linear Layers
The bit-based division property (BDP) is the most effective technique for finding integral characteristics of symmetric ciphers. Recently, automatic search tools have become one of the most popular approaches to evaluating the security of designs against
Kai Hu, Qingju Wang, Meiqin Wang
doaj +1 more source
An analogue of Serre’s conjecture for a ring of distributions
The set 𝒜 := δ0+ 𝒟+′, obtained by attaching the identity δ0 to the set 𝒟+′ of all distributions on with support contained in (0, ∞), forms an algebra with the operations of addition, convolution, multiplication by complex scalars.
Sasane Amol
doaj +1 more source
On the Inverting of a General Heptadiagonal Matrix [PDF]
In this paper, we developed new numeric and symbolic algorithms to find the inverse of any nonsingular heptadiagonal matrix. Symbolic algorithm will not break and it is without setting any restrictive conditions. The computational cost of our algorithms is $O(n)$.
openaire +3 more sources
Degree-inverting involutions on matrix algebras [PDF]
Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying $(A_g)^*\subseteq A_{g^{-1}}$, for all $g\in G$.
Luís Felipe Gonçalves Fonseca+1 more
openaire +4 more sources
On the conjecture of the norm Schwarz inequality [PDF]
For any positive invertible matrix $A$ and any normal matrix $B$ in $M_{n}({\Bbb C})$, we investigate whether the inequality $ ||A\sharp (B^{*}A^{-1}B)||\geq ||B|| $ is true or not, where $\sharp$ denotes the geometric mean and $||\cdot||$ denotes the ...
Hayashi, Tomohiro
core +2 more sources
Stochastic Stability of Lyapunov Exponents and Oseledets Splittings for Semi‐invertible Matrix Cocycles [PDF]
We establish (i) stability of Lyapunov exponents and (ii) convergence in probability of Oseledets spaces for semi‐invertible matrix cocycles subjected to small random perturbations.
Gary Froyland+2 more
semanticscholar +1 more source
Classical R-matrix structure for the Calogero model [PDF]
A classical R-matrix structure is described for the Lax representation of the integrable n-particle chains of Calogero-Olshanetski-Perelo\-mov. This R-matrix is dynamical, non antisymmetric and non-invertible. It immediately triggers the integrability of
Arnol'd+22 more
core +3 more sources