Results 21 to 30 of about 36,105,653 (286)
Expected propagation time for probabilistic zero forcing [PDF]
, 2022 Zero forcing is a coloring process on a graph that was introduced more than fifteen years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing
Hogben, Leslie, Geneson, Jesse
core
Sweetcorn production from transplants
International Journal of Horticultural Science, 2007 In our trial we tried to find out how the time of propagation and transplanting influenced the growing season of sweet corn along with some major properties relevant to quality.
F. Orosz, K. Slezák
doaj +1 more source
On the error of a priori sampling: zero forcing sets and propagation time [PDF]
Linear Algebra and its Applications, 2017 Zero forcing is an iterative process on a graph used to bound the maximum nullity. The process begins with select vertices as colored, and the remaining vertices can become colored under a specific color change rule.
Franklin Kenter, J. Lin
semanticscholar +1 more source
Imaginary Time Propagation on a Quantum Chip [PDF]
, 2021 Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter and nuclear ...
F. Turro +7 more
semanticscholar +1 more source
SIR Computer Virus Propagation Model with Time Delay [PDF]
Jisuanji gongcheng, 2016 In reality,the network virus is latent and the probabilities of removing different state nodes from the network are not equal.According to the theory of transmission dynamics,a network SIR virus model with time delay is established with direct immunity ...
HU Baoan,LI Bing,LI Yaling
doaj +1 more source
APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embedding [PDF]
SIGMOD Conference, 2020 To capture higher-order structural features, most GNN-based algorithms learn node representations incorporating k-hop neighbors' information. Due to the high time complexity of querying k-hop neighbors, most graph algorithms cannot be deployed in a giant
Xuhong Wang +10 more
semanticscholar +1 more source
J-Matrix time propagation of atomic hydrogen in attosecond fields
Scientific Reports, 2022 The J-Matrix approach for scattering is extended to the time-dependent Schrödinger equation (TDSE) for one electron atoms in external few cycle attosecond fields.
Rolf Gersbacher, John T. Broad
doaj +1 more source
ECAPA-TDNN: Emphasized Channel Attention, Propagation and Aggregation in TDNN Based Speaker Verification [PDF]
Interspeech, 2020 Current speaker verification techniques rely on a neural network to extract speaker representations. The successful x-vector architecture is a Time Delay Neural Network (TDNN) that applies statistics pooling to project variable-length utterances into ...
Brecht Desplanques +2 more
semanticscholar +1 more source
Mutual information between geomagnetic indices and the solar wind as seen by WIND : implications for propagation time estimates [PDF]
, 2005 The determination of delay times of solar wind conditions at the sunward libration point to effects on Earth is investigated using mutual information. This measures the amount of information shared between two timeseries.
R. O. Dendy +5 more
core +1 more source
Energies, 2017 The main purpose of this paper is to evaluate electrical tree degradation for cross-linked polyethylene (XLPE) cable insulation for three difference models. In order to show the distribution characteristics using phase resolved partial discharge (PD), we
Donguk Jang, Seonghee Park
doaj +1 more source