Results 51 to 60 of about 541,185 (309)
Notions and applications of algorithmic randomness [PDF]
Algorithmic randomness uses computability theory to define notions of randomness for infinite objects such as infinite binary sequences. The different possible definitions lead to a hierarchy of randomness notions. In this thesis we study this hierarchy,
Vermeeren, Stijn
core
The nonlinearity and randomness in composite materials such as concrete present challenges regarding the safety analysis and reliability-based design of structures.
Guangda Lu, Jiankang Xie
doaj +1 more source
We present a systematic simulation study on the impact of disorder in thin film silicon solar cells with hybrid light trapping structure. For the periodical structures introducing certain randomness in some parameters, the nanophotonic light trapping ...
Yanpeng Shi, Xiaodong Wang, Fuhua Yang
doaj +1 more source
A scientific and effective coordinated control strategy is crucial to the safe and economic operation of a microgrid (MG). With the continuous improvement of the renewable energy source (RES) penetration rate in MG, the randomness and intermittency of ...
Jingfeng Chen +5 more
doaj +1 more source
Objective Mycophenolate mofetil (MMF) use in limited cutaneous systemic sclerosis (lcSSc) is relatively uncommon because of the lower fibrotic burden and the predominance of vascular complications. In vitro observations and clinical data from transplanted patients suggest a protective effect of MMF on endothelial function.
Enrico De Lorenzis +77 more
wiley +1 more source
Physical Layer Key Generation (PLKG) provides a promising approach for establishing secure cryptographic keys between legitimate parties. However, in static and quasi-static environments, the key generation rate is significantly limited due to the low ...
Mina Fadhil Hasan, Aqiel Niama Almamori
doaj +1 more source
A quasi-randomized Runge-Kutta method [PDF]
Summary: We analyze a quasi-Monte Carlo method to solve the initial-value problem for a system of differential equations \(y^{\prime}(t) = f (t,y(t))\). The function \(f\) is smooth in \(y\) and we suppose that \(f\) and \(D_y^1f\) are of bounded variation in \(t\) and that \(D_{y}^2 f\) is bounded in a neighborhood of the graph of the solution.
Ibrahim Coulibaly, Christian Lécot
openaire +1 more source
This study presents an infrared monitoring approach for direct laser interference patterning (DLIP) combined with a convolutional neural network (CNN). Thermal emission data captured during structuring are used to predict surface topography parameters.
Lukas Olawsky +5 more
wiley +1 more source
Large Holes in Quasi-Random Graphs [PDF]
Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs.
openaire +3 more sources
Phase‐field simulations coupled with dislocation‐density‐based crystal plasticity modeling reproduce γ′ rafting behavior in single‐crystal Ni‐based superalloys under varied loading conditions. The model captures both macroscopic creep and microscopic morphology evolution, with results matching high‐temperature creep experiments.
Micheal Younan +5 more
wiley +1 more source

