Results 211 to 220 of about 1,857,722 (261)

OsbHLH064, an IVb bHLH Transcription Factor, Regulates Iron Homeostasis and Enhances Grain Fe Accumulation in Rice. [PDF]

open access: yesPlant Biotechnol J
Gao F   +13 more
europepmc   +1 more source

Spiking neural models for decision-making tasks with learning. [PDF]

open access: yesJ Math Biol
Jaffard S   +3 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Sufficient Conditions for Error Bounds

SIAM Journal on Optimization, 2002
Summary: For a lower semicontinuous (l.s.c.) inequality system on a Banach space, it is shown that error bounds hold, provided every element in an abstract subdifferential of the constraint function at each point outside the solution set is norm bounded away from zero. A sufficient condition for a global error bound to exist is also given for an l.s.c.
Zili Wu, Jane J. Ye
openaire   +2 more sources

Sufficient conditions for a digraph to be Hamiltonian

Journal of Graph Theory, 1996
The authors consider sufficient degree conditions for a digraph to be hamiltonian. In particular, they prove the following two results. Theorem 1: If \(D\) is a strong digraph such that for every pair of dominated nonadjacent vertices \(\{x, y\}\), either \(d(x)\geq n\) and \(d(y)\geq n- 1\) or \(d(x)\geq n- 1\) and \(d(y)\geq n\), then \(D\) is ...
Jørgen Bang-Jensen   +2 more
openaire   +11 more sources

Sufficient Conditions for Inessentiality

Econometrica, 1993
Summary: Consider a sequence economy in which small agents trade event-contingent claims to a single physical good. The agents have uncommon priors, state- contingent utility functions, and asymmetric information in every period. The claims traded vary from period to period.
openaire   +1 more source

Sufficient Conditions for a Digraph to be Supereulerian

Journal of Graph Theory, 2014
AbstractA (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian.
Jørgen Bang-Jensen   +1 more
openaire   +2 more sources

On Sufficient Conditions for Subexponentiality

Theory of Probability & Its Applications, 2009
A distribution function \(F\) on \([0,\infty)\) is said to be subexponential if \[ 1-(F*F)(x)\sim2(1-F(x)),\quad \text{as}\;x\to\infty. \] The author gives conditions ensuring subexponentiality in cases where, as \(x\to\infty\), either \(1-F(x)\) decreases more rapidly than \(e^{-x^{\alpha}}\) for \(\alpha\) arbitrarily close to 1, or \[ 1-F(x)=e^{-g(x)
openaire   +2 more sources

Home - About - Disclaimer - Privacy