نتایج جستجو برای: determined from e0

تعداد نتایج: 5807881  

2004
F. Ryde

We describe the strong spectral evolution that occurs during a gamma-ray burst (GRB) pulse and the means by which it can be analyzed. In particular, we discuss the change of the light curve as a function of energy and the spectral lag. Based on observed empirical correlations, an analytical model is constructed which is used to describe the pulse shape and quantize the spectral lags and their d...

Journal: :Physical chemistry chemical physics : PCCP 2016
Krisztina Voronova Chrissa M Mozaffari Easter Krisztián G Torma Andras Bodi Patrick Hemberger Bálint Sztáray

The fragmentation processes of internal energy selected acetic acid anhydride cations, Ac2O+, were investigated by imaging photoelectron photoion coincidence (iPEPICO) spectroscopy. The first dissociation channel leads to the formation of CH3C(O)OCO+ (m/z = 87) by a CH3-loss. The 0 K appearance energy (E0) was determined to be 10.289 ± 0.010 eV, in excellent agreement with the G4-calculated 10....

2002
Cristian Grozea

Let (Er)r∈N be the hierarchy of Grzegorczyk. Its weakest level, E0 is indeed quite weak, as it doesn’t even contains functions such as max(x, y) or x+y. In this paper we show that SAT ∈ E0 by developing a technique which can be used to show the same result holds for other NP problems. Using this technique, we are able to show that also the Hamiltonian Cycle Problem is solvable in E0.

2014
Thierry Gensane Pascal Honvault

For each real number E in ]0, 1], we describe the densest packing PE of two non-overlapping congruent ellipses of aspect ratio E in a square. We find three different patterns as E belongs to ]0, 1/2], [1/2, E0] where E0 = √ (6 √ 3− 3)/11, and [E0, 1]. The technique of unavoidable sets – used by Friedman for proving the optimality of square packings – allows to prove the optimality of each packi...

2010
H. G. Grundman

We generalize the concept of happy number as follows. Let e = (e0, e1, ....) be a sequence with e0 = 2 and ei = {1, 2} for i > 0. Define Se : Z + → Z by

2010
Yangjun Chen

In this paper, we discuss an adjustable strategy for the transitive closure compression to support graph reachability queries, asking whether a given node u in a directed graph G is reachable from another node v through a path. The main idea behind it is to define a series of graph deductions G0(V0, E0) (= G), G1(V1, E1), ..., Gk(Vk, Ek) with ni > ni+1 (i = 0, ..., k 1), where ni = |Vi|. Each n...

2004
Xue Ping WANG

In this paper, we study a generalization of the Efimov effect for three-body Schrödinger operators to N -body ones with N ≥ 4. We prove the infiniteness of the discrete spectrum under the conditions that the bottom of the essential spectrum, E0, is only attained by the spectra of a unique three-cluster Subhamiltonian and its three associated two-clusters Subhamiltonians, and that at least two o...

2007
W. Brostow W. Chonkaew K. P. Menard

The viscoelasticity of several polymers has been determined using dynamic mechanical analysis (DMA). For the same materials the sliding wear in multiple scratching along the same groove has also been determined. The materials studied were polycarbonate (PC), polystyrene (PS), styrene/ acrylonitrile (SAN), Surlyn, polyethersulfone (PES), acrylonitrile/butadiene/styrene (ABS), polypropylene (PP),...

2011
Atri Rudra

A binary matrix M is said to be (d, e0, e1)-separable iff from the test outcome vector y which can contain up to e0 false positives and e1 false negatives we are still able to unambiguously identify the (true) positive items. Note that we always assume there are at most d unknown positive items/columns. Since such matrices can correct errors we also call them error-correcting separable matrices...

Journal: :IACR Cryptology ePrint Archive 2010
N. Rajesh Pillai S. S. Bedi Sanjay Kumar Roopika Chaudhary

The low degree relation for algebraic attacks on E0 combiner given in [1] had an error. The correct version of low degree relation for the E0 combiner for use in algebraic attack is given.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید