0
  1. Trang chủ >
  2. Luận Văn - Báo Cáo >
  3. Báo cáo khoa học >

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:

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

... appeared upon acceptance. Fully formattedPDF and full text (HTML) versions will be made available soon. Spectrum sensing for cognitive radio exploiting spectrum discontinuities detectionEURASIP ... Hayar, M Turki, Distribution discontinuities detection using algebraic technique for spectrum sensing in cognitive radio networks, 5th International Conference on Cognitive Radio Oriented Wireless ... 1290–1295[11] W Guibene, A Hayar, Joint time-frequency spectrum sensing for cognitive radio, in 3rd Inter-national Workshop on Cognitive Radio and Advanced Spectrum Management, CogART 2010,Rome, Italy,...
  • 32
  • 402
  • 0
Báo cáo toán học:

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 video3 Resource reservation for mobile hotspots in vehicular envi-ronments with cellular/WLAN interworkingWei SongFaculty ... made available soon. Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworkingEURASIP Journal on Wireless Communications and Networking 2012,2012:18 doi:10.1186/1687-1499-2012-18Wei ... structureAs shown in Fig. 1, we focus on a vehicular network with a two-hop relay structure, which is supported bythe cellular/WLAN interworking. In a vehicular environment within mobile ambulances...
  • 28
  • 441
  • 0
Báo cáo toán học:

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

... (support code9 Resource Allocation for Asymmetric Multi-Way Relay Com-munication over Orthogonal ChannelsChristoph Hausl 1, OnurcanIáscan1and Francesco Rossetto21Institute for Communications ... appeared upon acceptance. Fully formattedPDF and full text (HTML) versions will be made available soon. Resource Allocation for Asymmetric Multi-Way Relay Communication over Orthogonal ChannelsEURASIP ... Strate-gies and Capacity Theorems for Relay Net-works. IEEE Transactions on Information Theory 2005,51(9):3037–3063.FiguresFigure 1: Multi-way relay communication over orthogonal channelsFigure...
  • 19
  • 366
  • 0
Báo cáo toán học:

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. Morespecifically of the different challenges faced by the CR decision making community and the suggestedsolution to answer them. We state that most of these decision ... upon acceptance. Fully formattedPDF and full text (HTML) versions will be made available soon. Decision making for cognitive radio equipment: analysis of the first 10 years of explorationEURASIP ... this analysis made on the first 10 years of exploration of decision making for CR mayhelp gaining perspective on the topic and thus help addressing this research domain for the next coming 10 years. EndnotesaBoth...
  • 41
  • 495
  • 0
Báo cáo toán học:

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

... 2004Abstract. For harmonic and separately harmonic functions, we give results similar tothe Carlson-Boas theorem. We give also harmonic analogous of the Polya and Guelfond theorems. 1. IntroductionThe ... following results. Uniqueness Theorems for Harmonic and Separately Harmonic Entire Functions on CN187h(z1, ,zm,z,0, ,0) = 0, ∀(z1, ,zm) ∈ Cm and ∀z ∈ C .Consequently h(z1, ,zm,zm+1, ... vanishes on N.In [3] Boas extended Carlson’s theorem to harmonic functions and provedthe following theorem:Theorem 1.1. (Boas theorem) Let h be an entire harmonic function on C ofexponential...
  • 6
  • 279
  • 0
Báo cáo toán học:

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 reduces to the familiar β( G) =β( G−e) +β( G/e) ... β( G)=1−b(G).1.IntroductionIn this paper, we define a β invariant for antimatroids and greedoids. This con-tinues the program of extending matroid invariants to greedoids which was begunin [17], where the...
  • 13
  • 285
  • 0
Báo cáo toán học:

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 degreezero.Since, by symmetry, one element in C2produces two vertices with degree zero or New Bounds for Codes Identifying Vertices in GraphsG´erard Cohencohen@inf.enst.frIiro Honkalahonkala@utu.fiAntoine ... Butthis identifying code is not optimal. Codewords can be deleted without losing the identifying property. We obtain the code of figure 9. Hence :Theorem 3.1The minimum density of an identifying...
  • 14
  • 394
  • 0
Báo cáo toán học:

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 typeF (n; λ)isacomplete set of type F (n; λ).We shall describe a construction for complete ... 2000.AbstractA construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogonal arrays, ... A construction method for complete sets of mutually orthogonal frequency squaresVCMavronDepartment of Mathematics,University of Wales,Aberystwyth, SY23 3BZU.K.vcm@aber.ac.ukSubmitted:...
  • 3
  • 335
  • 0
Báo cáo toán học:

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 sumsTom BohmanDepartment of Mathematics, 2-339Massachusetts Institute of Technology77 Massachusetts Ave.Cambridge, MA 02139bohman@math.mit.eduSubmitted: ... can make an approximation of L ≈ .22001865 with an error of less than 1.5 ·10−7. Inequality (10) can certainlybe used to obtain more precise approximations of L. the electronic journal of ... n and m are integers satisfying n ≥ 1 and m ≥ 2n then Sn,mhas distinct subset sums.There is also an alternate version of this construction. We begin with an integern>0 and construct an...
  • 14
  • 268
  • 0
Báo cáo toán học:

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 GraphsT.D. Bending D. Fon-Der-FlaassSchool 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 GQis distance regular with intersection array(2n+1− ... and Moorhouse. We study graph-theoretical properties ofthe resulting graphs, including their automorphisms. Also we demonstrate aconnection between crooked functions and bent functions.1 Crooked...
  • 14
  • 336
  • 0
Báo cáo toán học:

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

... the dimensionof 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 createthe new wrapped edges in G + P . We thus obtain a bent Hamilton cycle in Q(5, 3, 3),and by repeatedly joining ... edge going from this endpoint tothe corresponding endpoint in level i − 1. Similarly, if an endpoint in level i has nosurrounding circle then there is an edge going from such an endpoint to...
  • 18
  • 321
  • 0
Báo cáo toán học:

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

... listed in πs,mn−1.Sincen is the largest number, this forces the insertion point to be right at the beginning of the list. Since πisprecisely πs,mn−1with m =n−1−s2, this yields the permutation ... from the proof of Theorem 1.3, as if the structure of a permutation is ‘close’ to that of πs,mnthen the configuration of the first type in Figure 2 will not occur for most pairs of vertices. Then ... combinatorial problem was motivatedby the observation that the number of edges in Γπ,0equals the number of permutationsσ that are covered by π in the strong Bruhat1order on Sn, and the number...
  • 9
  • 381
  • 0
Báo cáo toán học:

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 oneendpoint, 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 incidentwith ... w -maximal matching.This result is best possible in the sense that if we allow irrational values or in nitelymany values then there need not be a strongly w -maximal matching.1 introduction In nite...
  • 18
  • 136
  • 0
Báo cáo toán học:

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 t3(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 thiscase, which we call Tur´an (3, 4)-conjecture. Conjecture 1.1 Let H be a 3-uniform hypergraph in which every set of four verticescontains ... 1 non-isomorphic constructions that attainthe bound if n = 3k. Kostochka [5] generalized Brown’s constructions to give 2k−2non-isomorphic constructions if n = 3k. These constructions are...
  • 23
  • 298
  • 0
Báo cáo toán học:

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 ofthe plain enumeration of triangulations and FuòCatalan complexes arising from certainvertex-colourings of triangulations and FuòCatalan complexes, ... inversion formula [8]. Finally, Section 4 is devoted tothe proof of Theorem 2.2, and thus also of Theorem 1.2, which it generalises.1.3 3-Coloured triangulations In the sequel, Pnstands for a...
  • 16
  • 268
  • 0

Xem thêm

Từ khóa: các báo cáo toán học haybáo cáo toán học haybáo cáo khoa học toán họcbáo cáo thực tập sư phạm năm 3 tiểu họckết quả nghiêncứu các đề án vnrp tóm tắt báo cáo khoa học tập 3báo cáo khoa họcbáo cáo y họcbáo cáo môn họcbáo cáo triết họcbáo cáo hóa họcbáo cáo khoa học mẫubáo cáo khoa học y họcbáo cáo khoa học sinh họcbáo cáo khoa học nông nghiệpbáo cáo khoa học lâm nghiệpNghiên cứu sự hình thành lớp bảo vệ và khả năng chống ăn mòn của thép bền thời tiết trong điều kiện khí hậu nhiệt đới việt namNghiên cứu tổ chức pha chế, đánh giá chất lượng thuốc tiêm truyền trong điều kiện dã ngoạiđề thi thử THPTQG 2019 toán THPT chuyên thái bình lần 2 có lời giảiGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitNGHIÊN CỨU CÔNG NGHỆ KẾT NỐI VÔ TUYẾN CỰ LY XA, CÔNG SUẤT THẤP LPWAN SLIDEPhát triển mạng lưới kinh doanh nước sạch tại công ty TNHH một thành viên kinh doanh nước sạch quảng ninhPhát triển du lịch bền vững trên cơ sở bảo vệ môi trường tự nhiên vịnh hạ longPhát hiện xâm nhập dựa trên thuật toán k meansĐịnh tội danh từ thực tiễn huyện Cần Giuộc, tỉnh Long An (Luận văn thạc sĩ)Thơ nôm tứ tuyệt trào phúng hồ xuân hươngSở hữu ruộng đất và kinh tế nông nghiệp châu ôn (lạng sơn) nửa đầu thế kỷ XIXTổ chức và hoạt động của Phòng Tư pháp từ thực tiễn tỉnh Phú Thọ (Luận văn thạc sĩ)Tăng trưởng tín dụng hộ sản xuất nông nghiệp tại Ngân hàng Nông nghiệp và Phát triển nông thôn Việt Nam chi nhánh tỉnh Bắc Giang (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 15: Tiêu hóa ở động vậtNguyên tắc phân hóa trách nhiệm hình sự đối với người dưới 18 tuổi phạm tội trong pháp luật hình sự Việt Nam (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtGiáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtChiến lược marketing tại ngân hàng Agribank chi nhánh Sài Gòn từ 2013-2015QUẢN LÝ VÀ TÁI CHẾ NHỰA Ở HOA KỲ