Báo cáo toán học: " R bits user selection switch feedback for zero forcing MU-MIMO based on low rate codebook" docx
... region from lower R to upper R 3.3. User selection procedure In USS feedback scheme, the user selection will use USS information to avoid large inter -user interference. The step is as follows: ... USS feedback scheme and relative user selection procedure are proposed to avoid large inter -user interference in downlink ZF MU-MIMO for low rate fixed codebook...
Ngày tải lên: 20/06/2014, 20:20
... for the nonlinear deflection analysis of an infinite beam resting on a nonlinear elastic foundation under localized external loads. Although their method app ears powerful as a mathematical procedure ... eam resting on a both non-uniform and nonlinear elastic foundation by means of Banach fixed point theorem. In fact, this restriction on the candidate space...
Ngày tải lên: 20/06/2014, 20:20
... For many species, also the spatial behaviour (such as dispersal or home range behaviour), population 1 Population level risk assessment: practical considerations for evaluation of population ... intervals can be calculated after recreation of the original sample underlying the data, and variability can be estimated based on the data distribution (or calculatio...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Population level risk assessment: practical considerations for evaluation of population models from a risk assessor''''s perspective" docx
... the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Population level risk assessment: practical considerations for evaluation ... intervals can be calculated after recreation of the original sample underlying the data, and variability can be estimated based on the data distribution (or calculation of...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " A comparative study of some methods for color medical images segmentation" pptx
... increasing amount of medical images. As a result, reliable automatic methods for image segmenta- tion are necessary. It cannot be said that there is a segmentation method for medical images that produces ... representing individual anatomical objects. This task plays a vital role in many biomedical imaging applications: the quantifica- tion of tissue volumes, diagnosis,...
Ngày tải lên: 20/06/2014, 21:20
báo cáo hóa học:" R bits user selection switch feedback for zero forcing MU-MIMO based on low rate codebook" doc
... (HTML) versions will be made available soon. R bits user selection switch feedback for zero forcing MU-MIMO based on low rate codebook EURASIP Journal on Wireless Communications and Networking 2012, 2012:7 ... quantization bits Conventional: 7bits USS: 2bits USS: 4bits USS: 6bits RVQ: 2bits RVQ: 4bits RVQ: 6bits Figure 7 This Provisional PDF corresponds...
Ngày tải lên: 21/06/2014, 17:20
Báo cáo toán học: "Two remarks concerning the theorem of S. Axler, S.-Y. A. Chang and D. Sarason " docx
... class="bi x0 y0 w2 h 1" alt =""
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: "nX-Complementary Generations of the Rudvalis Group Ru Ali Reza Ashrafi1 and Ali Iranmanesh2" docx
... - - - Theorem 2.2. The Rudvalis group Ru is pX-c omplementary generated, if p is an odd prime divisor of |Ru| . nX-Complementary Generations of the Rudvalis Group Ru 7 9. M. R. Darafsheh and A. ... Δ Ru (pY, 5B,29A) > 0andsoRu is 5B-complementary generated. Vietnam Journal of Mathematics 33:1 (2005) 1–7 nX-Complementary Generations of the Rudvalis Gro...
Ngày tải lên: 06/08/2014, 04:21
Báo cáo toán học: "Boundedness of Multilinear Littlewood-Paley Operators for the Extreme Cases" potx
... C |α|=m ||D α A|| BMO ||f|| L n/δ . Combining these estimates, we complete the proof of Theorem 1. Vietnam Journal of Mathematics 33:2 (2005) 123–134 Boundedness of Multilinear Littlewood-Paley Operators for the Extreme Cases * Liu ... y)| 2 dydt t n+1 1/2 , where ∗ This work was supported by the NNSF (Grant: 10271071). Boundedness of Multilinear Littlewood-Pa...
Ngày tải lên: 06/08/2014, 05:20
Báo cáo toán học: "The Prime Power Conjecture is True for n pdf
... that abelian planar difference sets of order n exist only for n a prime power. Evans and Mann [2] verified this for cyclic difference sets for n ≤ 1600. In this paper we verify the PPC for n ≤ 2,000,000, using ... group for an exponent larger than v ∗ was greater than n + 1, it could be eliminated immediately, and was not included in the table. ThePrimePowerConjectureisTru...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: " Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted" pptx
... 1995 Bijective proofs of the hook formulas for the number of ordinary standard Young tableaux and for the number of shifted standard Young tableaux are given. They are formulated in a uniform ... provide a bijective proof of the hook formula for the number of shifted standard Young tableaux (and its q-analogue; see the Theorem in...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: " DIAGONAL CHECKER-JUMPING AND EULERIAN NUMBERS FOR COLOR-SIGNED PERMUTATIONS" pps
... recurrence in Theorem 3.3, using p ,q up to n , and thereafter continuing with p, q. DIAGONAL CHECKER-JUMPING AND EULERIAN NUMBERS FOR COLOR-SIGNED PERMUTATIONS Niklas Eriksen ∗ Henrik Eriksson † Kimmo ... reduce to the Eulerian numbers of type B,andforq = 0 they reduce to the ordinary Eulerian numbers. 3. Color-signed permutations From the definition of the q -...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Maximising the permanent of (0,1)-matrices and the number of extensions of Latin rectangles" docx
... (12) The required bound follows from (12) and knowledge of the first two moments, (6). Maximising the permanent of (0,1)-matrices and the number of extensions of Latin rectangles B. D. McKay and ... for the set of k ×n Latin rectangles. For R ∈ L(k, n) define E(R)tobethe number of R ∈ L(k+1,n) such that the first k rows of R are identical to...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "R(3, 4) = 17" ppt
... 4.2. lim k→∞ R(k,k) 2 R R(k,k) (k, k) = c < ∞ It follows from Theorem 2.1 that R(4, 4) ≤ 36 by considering the game on n(4, 4) = 2n(3, 4) = 20 vertices. But, since 9 = R(3, 4) < n(3, 4) = 10, one can expect ... the Book. Theorem 3.2. R(3, 4) = 17 Proof. Since R(3, 4) ≤ R 12 (3, 4) = 17 (see Theorem 3.1) it is enough to show that R(3, 4)...
Ngày tải lên: 07/08/2014, 15:23
Báo cáo toán học: "R-S correspondence for (Z2 × Z2) Sn and Klein-4 diagram algebras" doc
... combinatorics 15 (2008), #R98 5 R-S correspondence for (Z 2 × Z 2 ) S n and Klein-4 diagram algebras M. Parvathi and B. Sivakumar ∗ Ramanujan Institute for Advanced Study in Mathematics University ... every corner one step at a time and the resulting diagram is called the growth diagram Gr d for the diagram d. The growth diagram Gr d for the running example...
Ngày tải lên: 07/08/2014, 21:20