Báo cáo toán học: "An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions" docx

... pp. 2-7] An Input Device for the Harvard Automatic Dictionary † Anthony G. Oettinger, Computation Laboratory, Harvard University, Cambridge, Massachusetts A standard input device has been ... to the Univac I. The modified device is performing satisfactorily in the compilation and experimental operation of the Harvard Automatic Dictionary. THE PROPER...

Ngày tải lên: 07/03/2014, 18:20

... stress falls on the left- syllable. 37 AN EXPERT SYSTEM FOR THE PRODUCTION OF PHONEME STRINGS FROM UNMARKED ENGLISH TEXT USING MACHINE-INDUCED RULES Alberto Maria Segre University of Illlnols ... specified in terms of phoneme strings. The automatic transformation of normal English texts into phoneme strings is therefore a useful front-end...

Ngày tải lên: 24/03/2014, 05:21

... in- termediate form of representation that represents a ‘context-free’ semantics of the expression. The role of the recognition process is then to compute as much of the semantic content of a tem- poral ... determined on the basis of the expression itself, producing an intermediate partial representation of the semantics. The role of the interpretation...

Ngày tải lên: 31/03/2014, 01:20

... (2004) doi:10.1186/1687-1812-2011-106 Cite this article as: Zhu et al.: Weak convergence theorem for the three-step iterations of non-Lipschitzian nonself mappings in Banach spaces. Fixed Point Theory and Applications 2011 2011:106. Submit ... Shahzad, N: Convergence theorems for a common fixed point of finite family of nonself nonexpansive mappings. Fixed...

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

...  3 Fixed point theorems for w -cone distance contraction mappings in K -metric spaces We note that the method of Du [2] for cone contraction mappings cannot be applied for a w -cone distance contraction ... we introduce the concept of a w -cone distance on topological vector space (tvs) -cone metric spaces and prove various fixed point theorems...

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

... methodology for estimating the statistics of the intercell interference power in the downlink of a multicellular network. We first establish an analytical expression for the probability law of the interference ... estimate of the pdf of the interference power, for dif ferent values of the shadow- ing standard deviation, s dB . Based on thes...

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

... 6:495 http://www.nanoscalereslett.com/content/6/1/495 Page 7 of 7 NANO EXPRESS Open Access An alternative route for the synthesis of silicon nanowires via porous anodic alumina masks Francisco Márquez 1* , ... article as: Márquez et al.: An alternative route for the synthesis of silicon nanowires via porous anodic alumina masks. Nanoscale...

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

... January 2006 Recommended for Publication by Yue Wang An improved algorithm for the piecewise-smooth Mumford and Shah functional is presented. Compared to the previous work of Chan and Vese, and ... Piecewise-Smooth Mumford and Shah Model in Image Segmentation Yingjie Zhang School of Mechanical Engineering, Xi an Jiaotong University, Xi an Shaanxi, 710...

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

... ab 3 ,a 5 ,a 3 b 2 ,ab 4 ,a 5 b, ba 5 ,a 3 b 3 ,ab 6 }; 200 Kieu Van Hung and Nguyen Quy Khang In this paper we propose embedding algorithms for these kinds of codes other than those obtained earlier. It is worthy ... Shyr, and G. Thierrin, Outfix and infix co des and related classes o f languages, J. Computer and System Sciences 43 (1991) 484508. 5. H. Jăurgensen an...

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

... δ). We establish these values in Sections 2, 3 and 4. TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE W. Edwin Clark University of South Florida Tampa, ... y.IfA⊆V then we let A denote the subgraph of G induced by A. Table 1 contains the value of γ(n, δ) for n ≤ 16, 0 ≤ δ ≤ n − 1 if the value is known, ot...

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

... referee for numerous comments and suggestions which have led to a substantially improved paper. An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions Lane Clark Department ... Eds., Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, Dover Publications, New York, 1966. [2] E .A. Bender, Central...

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

... (1) The second ingredient of our proof is the following result of Stiebitz. Lemma 3 ([5]) Let G be a k-critical graph containing at least one vertex of degree k − 1. Then the number of connected ... that n L > 0. An improved bound on the minimal number of edges in color-critical graphs Michael Krivelevich ∗ School of Mathematics, Institute for Advance...

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

... graph of order n with domination number at least 3 and minimum degree δ satisfying n −2 √ n −4 ≤ δ ≤ n − √ 2 √ n. Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum ... combinatorics 7 (2000), #R58 19 [2] W. Edwin Clark and Larry A. Dunning, Tight Upper Bounds for the Domination Numbers of Graphs with...

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

... invalid in the other.) This lemma, together with the discussion preceding it, completes the proof of formula (18). We leave to the reader the task of showing that this formula reduces to formula (4) ... t). In other words, the statistics for labelled paths inside the triangle with vertices (0, 0), (0,n), and (mn, n) give a combinatorial interpretation for the Hilber...

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

... b) -partition for every pair (a, b) of positive integers such that a + b = τ(G), then we say that G is τ-partitionable. The following conjecture is known as the Path Partition Conjecture (or the ... section we state our two main theorems, together with the main lemmas and the partition strategy used in the proofs. The proofs are presented in Section 4. The Partition...

Ngày tải lên: 07/08/2014, 13:21