Báo cáo toán học: "A construction method for complete sets of mutually orthogonal frequency squares" pdf

... survey of frequency squares. A set of (n − 1) 2 /(m − 1) mutually orthogonal frequency squares (MOFS) of type F (n; λ)isacomplete set of type F (n; λ). We shall describe a construction for complete ... 2000. Abstract A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complet...

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

... thickness of Mg is 200 Å; Mg300, thickness of Mg is 300 Å; Mg400, thickness of Mg is 400 Å. Figure 4. Dependence of reflectance on the Mg thickness and oxidation steps. Figure 5. Effect of Mg ... 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 novel method...

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

... also considered cubic forests. And we tried replacing the single values of h i by sets of values (we tried sets of size two). Neither of these modifications produced better constructions. References [1] ... graph of order 1120 having girth 15, once again the smallest such graph known [2]. A Cubic Graph of Girth 16 For girth 16 we take n = 140 and use the complete binary tre...

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

... (= 0.0016) found for Set A works well for Set B as well. That is, the tuning of α as above is not unrealistic in 252 Proceedings of the 48th Annual Meeting of the Association for Computational ... estimation of words’ context profiles obtained from a limited amount of data. This paper proposes a Bayesian method for robust distributional word similarities. The method uses...

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

... method would be intended to be used for the generation of acellular autologous bone material intraoperative. Therefore, the aim of this study is to present a reliable, quick and easy method for ... reliable method for the intra-operative generation of acellular bone explants. Methods: Therefore, ovine cancellous bone explants from the iliac crest were prepared and used to t...

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

... Acknowledgment The author thanks Prof. Yair Caro and Raphael Yuster for sending reference [7]. The author also thanks Prof. Cheng Zhao for his advice. References [1] J.A. Bondy and ... result. Theorem. Let t = 27720r + 169 (r ≥ 1), then f(n) ≥ n +32t −1 for n ≥ 6911 16 t 2 + 514441 8 t − 3309665 16 . 2 Proof of Theorem Proof. Let t = 27720r + 169,r ≥ 1,n t = 6911 16 t 2 + 514441 8 t ....

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

... transition counts of which are all the same power of two, or are two successive powers of two. A proof for the existence of exponentially balanced Gray codes is derived. The proof is much sim- pler ... e(i)=e(j) for all i, j. In [11], Wagner and West conjectured that exponentially balanced Gray codes exist for all length n. By extending the method of Robinson and Cohn for...

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

... their sets of k-deletions. We are now ready to prove our main result. Proof of Theorem 1. Suppose that we are given a positive integer k and a set ∆ of k- deletions of some (unknown) partition λ of ... the cell (k, k + 1) and that no k-deletion of λ can contain the cell (k + 1, k). Therefore every k-deletion of µ and of λ is actually a (k − 1)-deletion of µ ∧ λ = (k + 1, ....

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

... on each object of size n, thus constructing a set of objects of the successive size (see [3] for more details). The application of the ECO method often leads to an easy solution for problems that are ... interpretation of the closed formula (10) for the number of con- vex permutominoes. We remark that the expression of f n resembles the expression (1) for the number c...

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

... short proof for J. Noonan’s result on the number of permutations containing pattern 321 exactly once. In this paper, we give a short proof for the result of Noonan [3] that the number of permutations ... A short proof for the number of permutations containing pattern 321 exactly once Alexander Burstein Department of Mathematics Howard University Washington, DC ... We will use...

Ngày tải lên: 08/08/2014, 14:23