Báo cáo toán học: "Orthogonal arrays with parameters OA(s3, s2+s+1, s, 2) and 3-dimensional projective geometries" pot

... (s) and u, v ∈ Ω(A). Definition 1.6 Let P and Q are orthogonal arrays with the same parameters. P and Q are isomorphic if Q can be obtained from P by p ermutation of the columns, the rows, and ... electronic journal of combinatorics 18 (2011), #P69 3 Orthogonal arrays with parameters OA(s 3 , s 2 +s+1, s, 2) and 3-dimensional projective geometries Kazuaki Ishii ∗ S...

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

... structure of figure 15. With the permutation R( 12) C( 12) S( 12) squares with row 0 of 032X and 023X are equivalent to squares with row 0 of 013X and 031X. Thus only squares with row 0 of 012X, 021X, ... 10, 2) 4 1 code. For LC to ensure cells (1 ,2) and (1,3) cannot be filled cells (2 ,2) and (2,3) may be filled uniquely. From this row 2 and column 0 already contain al...

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

... Applications 8 (20 02), 1-13. [7] C. Hermite, Sur les fonctions de sept lettres, C. R. Acad. Sci. Paris, 57 (1863), 750-757; Oeuvres, vol. 2, 280-288, Gauthier-Villars, Paris, 1908. [8] J. B. Lee and Y. H. ... F q with a = 0and 0 <n<m<q− 1, then the possible values of m − n are m − n =        2s;wheres>1, (s, 2p)=1, and 2p<m<n+2p, 4s;where (s, 2p)=1, 2 i s;w...

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

... conjectures concerning guarding polygons with holes is due to Shermer (see Fig. 2): Conjecture 1.1 (Shermer’s Conjecture 19 82) Any orthogonal polygon with n vertices and h holes can always be guarded ... quadrilateralization. References [1] A. Aggarwal, The Art Gallery Theorem: Its Variations, Applications, and Algorith- mic Aspects, Ph.D. Thesis, The Johns Hopkins University 1984...

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

... quick to program and extendible with custom modules, XVR uses a UDP connection to receive from the robot the current 3D position of its hand, and works as interface to convert and forward the control ... mapping, feedbacks, and robot control parameters, and this is all part of the artistic creative process. The artist made positive comments about the integration of the interface...

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

... points of random maps. Choudhury [8], Park [9], Schu [10], and Choud- 2 Random approximation with weak contrac- tion random operators and a random fixed point theorem for nonexpansive random self- mappings Suhong ... study a random iteration process with weak contraction random operator and obtain the convergence the- orem of the random iteration process to a random fixed point for no...

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

... Walsh family. In Figs. 9 and 10, spectrum balancing is searched over K = 8 and K = 32 subbands, respectively, and codes of lengths 8 and 32 chips, respectively. In Fig. 10, only 8 randomly chosen codes ... achieved after 8 iterations with best and worst cases of 5 and 10 iterations, respectively. Thus, convergence is very fast when balancing is performed with a single-frequenc...

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

Ngày tải lên: 05/08/2014, 09:46

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

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