Báo cáo toán học: "Compact hyperbolic Coxeter n-polytopes with n + 3 facets" pdf

Báo cáo toán học: "Compact hyperbolic Coxeter n-polytopes with n + 3 facets" pdf

Báo cáo toán học: "Compact hyperbolic Coxeter n-polytopes with n + 3 facets" pdf

... replacements 1 2 3 4 G 232 G 1 131 1 G 21112 G 12121 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 4 4 5 G 252 G 34 2 G 21411 G 1 232 1 G 2 231 1 G 131 31 n = 7 PSfrag replacements 1 2 3 4 G 232 G 1 131 1 G 21112 G 12121 1 1 1 1 1 2 2 2 3 3 3 3 4 4 4 5 G 35 2 G 424 G 31 411 G 132 31 Now we restrict our considerations to items ... replacements 1 2 3 4 G 232 G 1 131...

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

36 155 0
Báo cáo toán học: " Opportunistic wireless network coding with relay node selection" pdf

Báo cáo toán học: " Opportunistic wireless network coding with relay node selection" pdf

... rate can be achieved by linearly combining input packets at an intermediate node. Random linear net- work coding [6] (RLNC) and opportunistic network cod- ing [7] (OPNC) have been known as one of ... simulation environment is summarized in Table 1. The channel from one node to another is modeled as independent Rayleigh fading channel. This is equivalent tothecasewheretherelaynodesandthesinkno...

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

9 242 0
Báo cáo toán học: "Bounds for DNA codes with constant GC-content" pdf

Báo cáo toán học: "Bounds for DNA codes with constant GC-content" pdf

... lower bounds on the maximum size of DNA codesoflengthn with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance ... some n ≥ w then by (8) we have A GC 4 (n +1 , 2,w) ≤ 2 (n +1 − w)/ (n +1 )  n w  2 n 1 =  n+ 1 w  2 n . Hence by induction A GC 4 (n, 2,w) ≤  n w  2 n 1 for all...

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

13 280 0
Báo cáo toán học: "Computation in Coxeter Groups—I. Multiplication" potx

Báo cáo toán học: "Computation in Coxeter Groups—I. Multiplication" potx

... s m . When t = s m+1 , sx m = x m+1 and the chain x m s m+2 −→ sx m+2 s m +3 −→ sx m +3 is the reflection under s of the InverseShortLex chain x m+1 s m+2 −→ x m+2 s m +3 −→ x m +3 There are no exchange ... −1) α 3 =(−1, −1, 2) which turn out in this case to be linearly dependent—they span the plane x 1 +x 2 +x 3 = 0. The reflections ρ i leave the plane x 1 + x 2 + x 3 =...

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

22 250 0
Báo cáo toán học: " Optimized spectrum sensing algorithms for cognitive LTE femtocells" pdf

Báo cáo toán học: " Optimized spectrum sensing algorithms for cognitive LTE femtocells" pdf

... follows: d u ( n ) = ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩ e −j ∂un ( n +1 ) 63 , n = 0, 1, 2, ,30 e −j ∂u ( n +1 )( n +2 ) 63 , n = 31 , 32 , , 61 (9) Numerous investigations were done in 3GPP for the selection of the sequence indices ... compromise between the sensing performance and sensing duration. Increasing the sensing duration of t he CP correlation sensing algorithm to 10 ms i...

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

19 296 0
Báo cáo toán học: " Semi-industrial production of methane from textile wastewaters" pdf

Báo cáo toán học: " Semi-industrial production of methane from textile wastewaters" pdf

... 100 m 3 Volume of the post-fermenter 50 m 3 Volume of the gas tank 30 0 m 3 N N N N + Cl - N NH N N + HCl reduction dehydrogenase colorless red Figure 5 3 domestic homes and especially ... Conclusions To implement an economic and ecological sustainable textile finishing of cotton, innovative technologies are becoming more and more important which ena...

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

18 382 0
w