نتایج جستجو برای: onm
تعداد نتایج: 279 فیلتر نتایج به سال:
whereA(u)=−div(a(x, t,u,∇u)) is a Leray-Lions operator defined onD(A)⊂W 0 LM(Ω), withM is an N-function, and χ is a given data. In the variational case (i.e., where χ ∈W−1,xEM(Ω)), it is well known that the solvability of (1.1) is done by Donaldson [2] and Robert [11] when the operator A is monotone, t2 M(t), andM satisfies a Δ2 condition, and by finally the recent work [3] for the general case...
We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is (1 + ε)competitive and uses...
Motivated by deformation quantization, we consider in this paper -algebras A over rings C = R(i), where R is an ordered ring and i = −1, and study the deformation theory of projective modules over these algebras carrying the additional structure of a (positive) A-valued inner product. For A = C(M), M a manifold, these modules can be identified with Hermitian vector bundles E overM . We show tha...
We consider constructions for cryptographic hash functions based onm-bit block ciphers. First we present a new attack on the LOKIDBH mode: the attack finds collisions in 2 encryptions, which should be compared to 2 encryptions for a brute force attack. This attack breaks the last remaining subclass in a wide class of efficient hash functions which have been proposed in the literature. We then a...
We consider the problem of designing truthful mechanisms to minimize the makespan onm unrelated machines. In their seminal paper, Nisan and Ronen [14] showed a lower bound of 2, and an upper bound of m, thus leaving a large gap. They conjectured that their upper bound is tight, but were unable to prove it. Despite many attempts that yield positive results for several special cases, the conjectu...
We derive asymptotics of moments and identify limiting distributions, under the random permutation model onm-ary search trees, for functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the so-called shape functional fall under this framework. The approach is based on establishing transfer th...
A specific mutation (DeltaE) in torsinA underlies most cases of the dominantly inherited movement disorder, early-onset torsion dystonia (DYT1). TorsinA, a member of the AAA+ ATPase superfamily, is located within the lumen of the nuclear envelope (NE) and endoplasmic reticulum (ER). We investigated an association between torsinA and nesprin-3, which spans the outer nuclear membrane (ONM) of the...
This paper characterizes the first cohomology group H(G,M) where M is a Banach space (with norm || ||M) that is also a left CG module such that the elements of G act onM as continuous C-linear transformations. We study this group for G an infinite, finitely generated group. Of particular interest are the implications of the vanishing of the group H(G,M). The first result is that H(G,CG) imbeds ...
Suppose g ≥ 1, and let α = (α1, . . . , αn) be a partition of 2g− 2, and let H(α) be a stratum of Abelian differentials, i.e. the space of pairs (M,ω) where M is a Riemann surface and ω is a holomorphic 1-form onM whose zeroes have multiplicities α1 . . . αn. The form ω defines a canonical flat metric on M with conical singularities at the zeros of ω. Thus we refer to points of H(α) as flat sur...
The effect of polylysine on pinocytosis and the cell surface of Amoeba proteus was investigated. The intensity of the pinocytotic response was evaluated by a channel counting method, and the surface was examined by means of transmission and scanning electron microscopy. Cells treated with polylysine and then immersed in a protein pinocytosis inducer showed a higher intensity of channel formatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید