Báo cáo toán học: "A Note about Bezdek’s Conjecture on Covering an Annulus by Strips" pdf

... by S 1 , S 2 , ··· , S n . We denote by c(εK) any copy of εK obtained by translating or rotating εK, and if c(εK) ⊂ K, K\c(εK) is also called an annulus. Denote by P(u, v, β) a parallelogram with ... proved two theorems: Conjecture. ([2]) For each convex region K there is an ε > 0 such that if εK lies in the interior of K and the annulus K\εK is covered by finitely many st...

Ngày tải lên: 07/08/2014, 15:22

... recursive phoneme recognition and noise suppression methods is given in Section 3. The detail experiments and simulation results are shown in Section 4. Finally, the discussion and conclusion are ... threshold. In this article, the non-speech is assumed as an additional phoneme (named as  usp  ) corresponding to the conventional phonemes (such as  zh  ,  ang  et al.) in mandarin. More...

Ngày tải lên: 20/06/2014, 20:20

... Berkes and Cs ´ aki [7], H ¨ ormann [8], Wu [9, 10], and Ye and Wu [11]. Huang and Zhang [12] and Zhang and Yang [13] obtained ASCLT results for self-normalized version. Under mild moment conditions ... (1995) 12 This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A note on the a...

Ngày tải lên: 20/06/2014, 21:20

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:21

... maximal nonhamiltonian s plit graph if G is nonhamiltonian but the graph G + uv is hamiltonian for every uv ∈ E where u ∈ I and v ∈ K. It is known from a result in [12] that any nonhamiltonian Burkard–Hammer ... graph is contained in a maximal nonhamil- tonian Burkard–Hammer graph. So knowledge about maximal nonhamiltonian Burkard–Hammer graphs provides us certain information about nonha...

Ngày tải lên: 06/08/2014, 05:20

... calculate the transmission of each vertex of degree 1. In fact, we will compute σ(v) for one fixed vertex of G(h, d). Any other vertex of degree 1 has the same transmission. To this end, consider two ... there is only one vertex (the root o); (iii) At level i (1  i  h), there are d(d − 1) i−1 vertices. Our goal is to evaluate the average distance of G(h, d). By applying Propo- sition 3.2,...

Ngày tải lên: 06/08/2014, 05:20

... denoted by |w|. Thus |banana| = 6, for example. The language consisting of all words over Σ is denoted by Σ ∗ . If x, y ∈ Σ ∗ , the concatenation of x and y, written xy, is simply the string consisting ... = an ,z =‘a’. We say that ‘banana’ encounters yy. Thus a ‘coded’ version of yy showsupin‘banana’. The relation ‘u encounters w’ is transitive, and thus generates an order on words....

Ngày tải lên: 07/08/2014, 06:20

... denote the dimension of the space of class functions on S n spanned by all the χ N , N ≥ 0. 1 Supported by an NSERC PGS-B fellowship 2 Partially supported by NSF grant DMS-9500714 1 the electronic ... constant c>0 such that H(n) ≥ n 2 2 −cn 3/2 for all n ≥ 1. Proof. From the definition of H(n) and Proposition 3.2 (and the fact that the right-hand side of equation (5) is increasing...

Ngày tải lên: 07/08/2014, 06:20