Báo cáo toán học: "Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs" pdf

Báo cáo toán học: " Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection" potx

Báo cáo toán học: " Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection" potx

... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection EURASIP ... Hayar, M Turki, Distribution discontinuities detection using algebraic technique for spectrum sensing in cognitive radio networks, 5th International Conference on Cog...

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

32 402 0
Báo cáo toán học: " Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking" ppt

Báo cáo toán học: " Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking" ppt

... considered in this study. In Section 3, we introduce the approaches to analyze video 3 Resource reservation for mobile hotspots in vehicular envi- ronments with cellular/WLAN interworking Wei Song Faculty ... made available soon. Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking EURASIP Journal on Wire...

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

28 441 0
Báo cáo toán học: " Resource Allocation for Asymmetric Multi-Way Relay Communication over Orthogonal Channels" potx

Báo cáo toán học: " Resource Allocation for Asymmetric Multi-Way Relay Communication over Orthogonal Channels" potx

... (support code 9 Resource Allocation for Asymmetric Multi-Way Relay Com- munication over Orthogonal Channels Christoph Hausl 1 , Onurcan Iáscan 1 and Francesco Rossetto 2 1 Institute for Communications ... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Resource Allocation for Asymmetric Multi-Way Relay...

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

19 366 0
Báo cáo toán học: " Decision making for cognitive radio equipment: analysis of the first 10 years of exploration" potx

Báo cáo toán học: " Decision making for cognitive radio equipment: analysis of the first 10 years of exploration" potx

... view on the first 10 years of CR. More specifically of the different challenges faced by the CR decision making community and the suggested solution to answer them. We state that most of these decision ... upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Decision making for cognitive radio equipment: analysis...

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

41 495 0
Báo cáo toán học: "Uniqueness Theorems for Harmonic and Separately Harmonic Entire Functions on CN" doc

Báo cáo toán học: "Uniqueness Theorems for Harmonic and Separately Harmonic Entire Functions on CN" doc

... 2004 Abstract. For harmonic and separately harmonic functions, we give results similar to the Carlson-Boas theorem. We give also harmonic analogous of the Polya and Guelfond theorems. 1. Introduction The ... following results. Uniqueness Theorems for Harmonic and Separately Harmonic Entire Functions on C N 187 h(z 1 , ,z m, z,0, ,0) = 0, ∀(z 1 , ,z m ) ∈ C...

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

6 279 0
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

... β invariant from matroids to greedoids, con- centrating especially on antimatroids. Several familiar expansions for β( G) have greedoid analogs. We give combinatorial interpretations for β( G )for simplicial ... greedoid and let {e}∈F. Then β( G) =β( G/e)+(−1) r(G)−r(G−e) β( G − e). We remark that since r(G − e)=r(G) for all non-isthmuses e in a matroid G, the formula above...

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

13 285 0
Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf

Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf

... appear. [2]G.D.Cohen,I.Honkala,S.LitsynandA.Lobstein:Covering Codes, Elsevier, 1997. [3] M.G.Karpovsky,K.ChakrabartyandL.B.Levitin: Onanewclassofcodes for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, ... vertex of degree zero. Since, by symmetry, one element in C  2 produces two vertices with degree zero or New Bounds for Codes Identifying Vertices...

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

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

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

3 335 0
Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx

Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx

... a construction for sets of integers with distinct subset sums Tom Bohman Department of Mathematics, 2-339 Massachusetts Institute of Technology 77 Massachusetts Ave. Cambridge, MA 02139 bohman@math.mit.edu Submitted: ... can make an approximation of L ≈ .22001865 with an error of less than 1.5 ·10 −7 . Inequality (10) can certainly be used to obtain more precise ap...

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

14 268 0
Báo cáo toán học: " Crooked Functions, Bent Functions, and Distance Regular Graphs" pptx

Báo cáo toán học: " Crooked Functions, Bent Functions, and Distance Regular Graphs" pptx

... taken with multiplicity 2. Crooked Functions, Bent Functions, and Distance Regular Graphs T.D. Bending D. Fon-Der-Flaass School of Mathematical Sciences, Queen Mary and Westfield College, London ... {(a, i, α)}; vertices (a, i, α )and( b, j, β) are adjacent if and only if they are distinct, and α + β = D(a, i; b, j). PROPOSITION 13 The graph G Q is distance regular wit...

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

14 336 0
Báo cáo toán học: "Bent Hamilton Cycles in d-Dimensional Grid Graphs" pdf

Báo cáo toán học: "Bent Hamilton Cycles in d-Dimensional Grid Graphs" pdf

... the dimension of joining. Then P must contain w disjoint bent cycles that partition the vertices of P . Each of these w cycles must contain a wrapped edge in P along the joining dimension. Further, ... we join the endpoints with red arrows pointing away from each other to create the new wrapped edges in G + P . We thus obtain a bent Hamilton cycle in Q  (5, 3, 3), and by repeated...

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

18 321 0
Báo cáo toán học: "Bounding the number of edges in permutation graphs" pdf

Báo cáo toán học: "Bounding the number of edges in permutation graphs" pdf

... listed in π s,m n−1 .Sincen is the largest number, this forces the insertion point to be right at the beginning of the list. Since π  is precisely π s,m n−1 with m = n−1−s 2 , this yields the permutation ... from the proof of Theorem 1.3, as if the structure of a permutation is ‘close’ to that of π s,m n then the configuration of the first type in Figure 2...

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

9 381 0
Báo cáo toán học: "Strongly maximal matchings in infinite weighted graphs" pdf

Báo cáo toán học: "Strongly maximal matchings in infinite weighted graphs" pdf

... finite and both its endpoints do not belong to supp(M). It is said to be in nitely improving (or in nitely M-improving) if it is in nite, has one endpoint, and this endpoint does not belong to ... finite K-indifferent path). (ii) For every in nite element R of G  (i.e. for every in nitely K-improving path in G) incident with Q, let k = k(R) be the last edge on R that lies in K and is i...

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

18 136 0
Báo cáo toán học: "More Constructions for Tur´n’s (3, 4)-Conjecture a" doc

Báo cáo toán học: "More Constructions for Tur´n’s (3, 4)-Conjecture a" doc

... bound for the Tur´an number t 3 (n, 4), J. Combin. Theory Ser. A 87 (1999), no. 2, 381–389. the electronic journal of combinatorics 15 (2008), #R137 22 More Constructions for Tur´an’s (3, 4)-Conjecture Andrew ... case is when m = 3 and r = 4. Tur´an had a conjecture for this case, which we call Tur´an (3, 4)-conjecture. Conjecture 1.1 Let H be a 3-uniform hypergraph in wh...

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

23 298 0
Báo cáo toán học: "Chromatic statistics for triangulations and Fuß–Catalan complexes" ppsx

Báo cáo toán học: "Chromatic statistics for triangulations and Fuß–Catalan complexes" ppsx

... refine Catalan numbers and FuòCatalan numbers , by introducing colour statistics for triangulations and FuòCatalan complexes. Our renements consist in showing that the number of triangulations, respectively ... (Theorems 1.1, 1.2, 2.1, and 2.2) present renements of the plain enumeration of triangulations and FuòCatalan complexes arising from certain vertex-colourings of trian...

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

16 268 0
w