Results 51 to 60 of about 45,297 (262)
Posterior Cramér–Rao lower bounds for extended target tracking with PMBM conjugate recursion
This letter considers the posterior Cramér–Rao lower bounds (PCRLB) problem for extended target tracking from a stack of measurement data that are modelled as random variables in the random finite sets framework.
Xingxiang Xie +3 more
doaj +1 more source
A two‐dimensional multiscale finite element analysis framework was established for the first‐generation MoSiBTiC alloy, and the mechanical and fracture‐related parameters of the constituent phases were calibrated through experiments and simulations. The framework provides a basis for analyzing crack propagation behavior in its complex microstructure ...
Junfeng Du +4 more
wiley +1 more source
Dynamic Hierarchical Fusion for Space Multi-Target Passive Tracking with Limited Field-of-View
Space-based multi-target passive tracking is critical for space situational awareness, but faces severe challenges due to the limited field-of-view (FoV) and directional ambiguity of onboard sensors.
Jizhe Wang, Di Zhou, Runle Du, Jiaqi Liu
doaj +1 more source
Random semigroup acts on a finite set [PDF]
AbstractLetXbe a finite set andSa semigroup of transformations ofX. We investigate the trace onXof a random walk onS. We relate the structure of the trace process, which turns out to be a Markov chain, to that of the random walk. We show, for example, that all periods of the trace process divide the period of the random walk.
openaire +2 more sources
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
An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata
Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs). Four algorithms that convert arbitrary DFAs to language-equivalent FDFAs are empirically investigated.
Madoda Nxumalo +3 more
doaj +1 more source
Constructions for Clumps Statistics. [PDF]
We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This object has first been studied by Schbath with the aim of counting the number of occurrences
Frédérique Bassino +3 more
doaj +1 more source
Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran +6 more
wiley +1 more source
Combinatorial specification of permutation classes [PDF]
This article presents a methodology that automatically derives a combinatorial specification for the permutation class $\mathcal{C} = Av(B)$, given its basis $B$ of excluded patterns and the set of simple permutations in $\mathcal{C}$, when these sets ...
Frédérique Bassino +4 more
doaj +1 more source
Random-Finite-Set-Based Distributed Multirobot SLAM
This article addresses fully distributed multirobot (multivehicle) simultaneous localization and mapping (SLAM). More specifically, a multivehicle scenario is considered, wherein a team of vehicles explore the scene of interest in order to cooperatively construct the map of the environment by locally updating and exchanging map information in a ...
Lin Gao 0003 +2 more
openaire +1 more source

