We use the following two well known bounds in our proofs. Lemma 1 (Chernoff-Hoeffding bound). Let X1, · · · , Xn be random variables with common support [0, 1] and E[Xi] = μ. Let Sn = X1 + · · ·+Xn. Then for all t ≥ 0, Pr[Sn ≥ nμ+ t] ≤ e−2t /n and Pr[Sn ≤ nμ− t] ≤ e−2t /n Lemma 2 (Bernstein inequality). Let X1, . . . , Xn be independent zero-mean random variables. If for all 1 ≤ i ≤ n, |Xi| ≤ k...

The second-order nonlinear differential equation for the rotation of Mercury implies locked-in motion when the period is within the range where e is the eccentricity and T is the period of Mercury's orbit, the time t is measured from perihelion, and lambda is a measure of the planet's disiortion. For values near 2T/3, the instantaneous period oscillates about 2T/3 with period (21lambdae/2)T.

We consider the non-local Fisher-KPP equation modeling a population with individuals competing with each other for resources with a strength related to their distance, and obtain the asymptotics for the position of the invasion front starting from a localized population. Depending on the behavior of the competition kernel at infinity, the location of the front is either 2t− (3/2) log t+O(1), as...

Three strains of prosthecate, budding bacteria, MHS-2T, MHS-3T and VP6T, were isolated from marine habitats including the open ocean (the pelagic zone), the offshore region (the neritic zone) and the hydrothermal vent region. A polyphasic approach including 16S rDNA sequencing, phenotypic analyses, serology, fatty acid analyses, membrane protein profiles and DNA-DNA hybridizations was used to p...

The t-pebbling number, ft(G), of a connected graph G, is the smallest positive integer such that from every placement of ft(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move taking two pebbles off a vertex and placing one on an adjacent vertex. A graph G satisfies the 2t-pebbling property if 2t pebbles can be moved to a specified vertex...

We say that two hypergraphs H1 and H2 with v vertices each can be packed if there are edge disjoint hypergraphs H ′ 1 and H ′ 2 on the same set V of v vertices, where H ′ i is isomorphic to Hi. It is shown that for every fixed integers k and t, where t ≤ k ≤ 2t − 2 and for all sufficiently large v there are two (t, k, v) partial designs that cannot be packed. Moreover, there are two isomorphic ...

Two bacterial strains were isolated from methanogenic butyrate-oxidizing mixed cultures. The cells were straight to slightly curved, gram-positive rods that were motile by means of multiple flagella and formed endospores. Growth was observed in the temperature range 15-45 degrees C (optimum 37 degrees C) and pH range 5.5-9.0 (optimum pH 7.5). The novel isolates were strictly anaerobic chemo-org...

tified, and the severity and classification of disease correlate approximately with genotype. In this case, we found a novel mutation c.2T>A in exon 2 responsible for ND resulting in a missense mutation. The mutation affecting the initiation codon produced an AAG codon, which could not initiate translation. As the translation start site and its context sequence play an important role in the con...

This paper studies the triangle similarity classes obtained by iterative application of longest-edge trisection triangles. The (3T-LE) a is joining two points which divide longest edge in three equal parts with opposite vertex. partition, as well bisection (2T-LE), does not degenerate, means that there positive lower bound to minimum angle generated. However, unlike what happens 2T-LE, number a...