Results 61 to 70 of about 177,002 (308)
Markov Chains with finite convergence time
We study the properties of finite ergodic Markov Chains whose transition probability matrix P is singular. The results establish bounds on the convergence time of Pm to a matrix where all the rows are equal to the stationary distribution of P.
Brosh, Israel, Gerchak, Yigal
core +1 more source
Coarse‐grained (left) and atomistic (right) models of the shape memory polymer ESTANE ETE 75DT3 are shown schematically. The two representations bridge molecular detail and mesoscopic description. Both models capture shape memory behavior, linking segmental mobility and conformational relaxation of anisotropic chains to macroscopic recovery, and ...
Fathollah Varnik
wiley +1 more source
A 3-D impact angle constrained partial integrated guidance and control design with finite-time convergence is developed for a surface-to-air skid-to-turn missile intercepting a head-on maneuvering target.
Chao Lai +4 more
doaj +1 more source
This study shows that superalloys used in aircraft engine disks become much more prone to deformation at high temperatures if they have been strained during manufacturing. This effect increases with the level of prior strain but eventually reaches a limit.
Fabio Machado Alves da Fonseca +9 more
wiley +1 more source
Finite-time and Fixed-time Convergence in Continuous-time Optimization
8 pages, 9 ...
Yuquan Chen, Yiheng Wei, YangQuan Chen
openaire +2 more sources
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
A Neural Network for Moore–Penrose Inverse of Time-Varying Complex-Valued Matrices
The Moore–Penrose inverse of a matrix plays a very important role in practical applications. In general, it is not easy to immediately solve the Moore–Penrose inverse of a matrix, especially for solving the Moore–Penrose inverse of a complex-valued ...
Yiyuan Chai +4 more
doaj +1 more source
Convergence in density in finite time windows and the Skorohod representation
According to the Dudley-Wichura extension of the Skorohod representation theorem, convergence in distribution to a limit in a separable set is equivalent to the existence of a coupling with elements converging a.s. in the metric. A density analogue of this theorem says that a sequence of probability densities on a general measurable space has a ...
openaire +4 more sources
Finite-Time Convergent Algorithms for Time-Varying Distributed Optimization
This paper focuses on finite-time (FT) convergent distributed algorithms for solving time-varying (TV) distributed optimization (TVDO). The objective is to minimize the sum of local TV cost functions subject to the possible TV constraints by the coordination of multiple agents in finite time.
Xinli Shi, Guanghui Wen, Xinghuo Yu 0001
openaire +2 more sources
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source

