Results 51 to 60 of about 220,579 (315)
Digital Methods for the Fatigue Assessment of Engineering Steels
The use of engineering steels is often limited by their fatigue strength. In the sake of a faster product development, the fatigue behavior can be predicted by machine learning (ML). In this work, ML is applied on a heterogeneous database, covering a wide range of steel types.
Sascha Fliegener+7 more
wiley +1 more source
The Hitting Times with Taboo for a Random Walk on an Integer Lattice
For a symmetric, homogeneous and irreducible random walk on d-dimensional integer lattice Z^d, having zero mean and a finite variance of jumps, we study the passage times (with possible infinite values) determined by the starting point x, the hitting ...
A. A. Borovkov+20 more
core +1 more source
Electrospinning Technology, Machine Learning, and Control Approaches: A Review
Electrospinning produces micro‐ and nanoscale fibers, holding great promise in biomedical engineering. Industrial adoption faces challenges in controlling fiber properties, reproducibility, and scalability. This review explores electrospinning techniques, modeling, and machine learning for process optimization.
Arya Shabani+5 more
wiley +1 more source
DTFLOW: Inference and Visualization of Single-cell Pseudotime Trajectory Using Diffusion Propagation
One of the major challenges in single-cell data analysis is the determination of cellular developmental trajectories using single-cell data. Although substantial studies have been conducted in recent years, more effective methods are still strongly ...
Jiangyong Wei+3 more
doaj
The range of tree-indexed random walk in low dimensions
We study the range $R_n$ of a random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ indexed by a random tree with $n$ vertices. Under the assumption that the random walk is centered and has finite fourth moments, we prove in dimension $d\leq3$ that ...
Gall, Jean-François Le, Lin, Shen
core +1 more source
Martin boundaries and asymptotic behavior of branching random walks [PDF]
Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic directions taken by the particles, and as a consequence we find a new connection between $t$-Martin boundaries and ...
arxiv
The MaterialDigital initiative drives the digital transformation of material science by promoting findable, accessible, interoperable, and reusable principles and enhancing data interoperability. This article explores the role of scientific workflows, highlights challenges in their adoption, and introduces the Workflow Store as a key tool for sharing ...
Simon Bekemeier+37 more
wiley +1 more source
Strong local survival of branching random walks is not monotone
The aim of this paper is the study of the strong local survival property for discrete-time and continuous-time branching random walks. We study this property by means of an infinite dimensional generating function G and a maximum principle which, we ...
Bertacchi, Daniela, Zucca, Fabio
core +1 more source
Branching Processes in Simple Random Walk [PDF]
Let N ( a ) N(a) be the number of overcrossings of height a a in a simple random walk. For p > 1 / 2 p > 1/2 , the process N ( 0 ) , N ( 1 ) ,
openaire +3 more sources
This study demonstrates the feasibility of fabricating free‐standing carbon paper electrodes by electroplating and galvanic replacement. Nanostructured AgM (M = Au, Pt, Pd) bimetallic catalysts are directly grown on the electrode substrate, which exhibit good performance for glycerol electrolysis, a sustainable approach for the co‐production of green ...
Hui Luo, Maria‐Magdalena Titirici
wiley +1 more source