Results 201 to 210 of about 252,932 (279)
Environmental Effects via Frozen Density Embedding in Real-Time Time-Dependent Dirac-Kohn-Sham Theory: Solvation of Lead Halides. [PDF]
De Santis M +6 more
europepmc +1 more source
A priori bounds for the generalised parabolic Anderson model
Abstract We show a priori bounds for solutions to (∂t−Δ)u=σ(u)ξ$(\partial _t - \Delta) u = \sigma (u) \xi$ in finite volume in the framework of Hairer's Regularity Structures [Invent Math 198:269–504, 2014]. We assume σ∈Cb2(R)$\sigma \in C_b^2 (\mathbb {R})$ and that ξ$\xi$ is of negative Hölder regularity of order −1−κ$- 1 - \kappa$ where κ<κ¯$\kappa <
Ajay Chandra +2 more
wiley +1 more source
Deterministic time rewinding of waves in time-varying media. [PDF]
Kim S, Kim K.
europepmc +1 more source
EQMT integrates earthquake catalog data, fault‐network geometry, engineered features, and graph embeddings in a unified framework for forecasting earthquake magnitude and occurrence time. The framework is designed to reflect inter‐fault spatial dependencies together with temporal seismic patterns, addressing limitations of approaches based only on ...
Kiymet Kaya +5 more
wiley +1 more source
Investigation of laser stripping process parameters for insulation layers of large diameter aviation cables based on thermodynamic coupling. [PDF]
Li P, Wang S, Gao P, Tang E, Tian C.
europepmc +1 more source
Recursive and Cyclic Constructions for Double‐Change Covering Designs
ABSTRACT A double‐change covering design (DCCD) is a v‐set V and an ordered list L of b blocks of size k where every pair from V must occur in at least one block and each pair of consecutive blocks differs by exactly two elements. It is minimal if it has the fewest blocks possible and circular when the first and last blocks also differ by two elements.
Amanda Lynn Chafee, Brett Stevens
wiley +1 more source
Generalized non-Hermitian Hamiltonian for guided resonances in photonic crystal slabs. [PDF]
Nguyen VA +8 more
europepmc +1 more source
Ore‐Type Conditions for Existence of a Jellyfish in a Graph
ABSTRACT The famous Dirac's theorem states that for each n ≥ 3 every n‐vertex graph G with minimum degree δ ( G ) ≥ n / 2 has a Hamiltonian cycle. When δ ( G ) < n / 2, this cannot be guaranteed, but the existence of some other specific subgraphs can be provided.
Jaehoon Kim +2 more
wiley +1 more source

