Báo cáo toán học: "Asymptotically Optimal Box Packing Theorems" potx

... coupled coincidence point and proved coupled coincidence and coupled common xed point results for mappings F from X ì X into X and g from X into X satisfying nonlinear contraction in ordered metric ... fixed point in generalized ordered metric space. Recently, Choudhury and Maity [36] initiated the study of coupled fixed point in generalized ordered metric...

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

... θ |I 1 |,|I 2 | x 2 . 6 Nea r optimal bound of orthogonal matching pursuit using restricted isometric constant Jian Wang, Seokbeop Kwon and Byonghyo Shim ∗ School of Information and Communication, ... formatted PDF and full text (HTML) versions will be made available soon. Near optimal bound of orthogonal matching pursuit using restricted isometric c...

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

... Upadhyay and Prakriya: Outage-optimal opportunistic scheduling with analog network coding in multiuser two-way relay networks. EURASIP Journal on Wireless Communications and Networking 2011 2011:194. Submit ... Open Access Outage-optimal opportunistic scheduling with analog network coding in multiuser two-way relay networks Prabhat K Upadhyay 1* and...

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

... 2011:96 http://www.fixedpointtheoryandapplications.com/content/2011/1/96 Page 12 of 20 RESEARC H Open Access Weak and strong convergence theorems of implicit iteration process on Banach spaces Lai-Jiu Lin 1* , ... Lin et al.: Weak and strong convergence theorems of implicit iteration process on Banach spaces. Fixed Point Theory and Applications...

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

... consider weak convergence theorems of implicit iterative processes for two nonexpansive mappings and a mapping which satisfies condition (C). Next, we consider strong convergence theorem of an implicit- shrinking ... iterative process for two nonexpansive mappings and a relative nonexpansive mapping on Banach spaces. Note that the conditions of strong convergen...

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

... realtime random greedy algorithm.Welettimetgo continuously starting from zero. The packing P = P t will vary with time as will S t = V −  P t .WeletH t denote the restriction of H to S t .Ifbytimetedge ... idea that the revival of w at time s makesrevivalsat later times less likely as it lowers the degree. More formally, as X s ≥ deg s (w) the probability w is revived at time s is at m...

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

... t. Proof. Partition the set of vertices V into t subsets V 1 ,V 2 , ,V t by choosing for each vertex randomly and independently an index i in {1, ,t} and placing it into V i .For v ∈ V (G)and1≤ i ≤ t,letA i,v denote ... certain regularity and local density conditions on H, one can find an almost perfect matching M in H, i.e., the number of vertices in no edge of M is negligible. In fac...

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

... Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way. We can cut the box across ... our box by translations. All rectangles that appear in this note are axis-aligned. Bower and Michael [1] recently showed the following nice result. A hyperplane cut is a separat...

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

... of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by filling in 9 missing constant weight codes, all of which are optimal ... A. Sloane, “Table of Constant Weight Binary Codes,” http://www.research.att.com/~njas/codes/Andw/ [4] D. H. Smith, L. A. Hughes and S. Perkins, “A New Table of Constant Weight...

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

... large boxes that can be packed by T . If we can resolve this, then we have what we call an “asymptotically optimal box- packing theorem”. In the special case that all the prototiles are boxes ... determines sufficient conditions for a box to be packable. Moreover, these conditions are also necessary, by Theorem 3.6, so it is easy to give an asymptotically optimal box- packing theore...

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

... graphs without short cycles, Colloq. Math. Soc. Janos Bolyai 60 (1991) 727–732. the electronic journal of combinatorics 16 (2009), #N30 3 A note on packing graphs without cycles of length up to ... (xσ ′ (v))(yσ ′ (w))σ ′ is a packing of G. Thus we get a contradiction. Assume now that G ′ − U is a star (with at least one edge). Note that since G has no cycle...

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

... (SA). SA is one method to determine a suboptimal solution of combinatorial problems, the electronic journal of combinatorics 17 (2010), #N17 2 A note on packing chromatic number of the square lattice Roman ... the upper b ound on the packing chromatic number of the square lattice. Keywords: Packing chromatic number, Packing colouring, Square l...

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

... strategy. the electronic journal of combinatorics 17 (2010), #N33 4 Asymptotically optimal pairing strategy for Tic-Tac-Toe with numerous directions Padmini Mukkamala Rutgers, New Jersey Dăomăotăor Pa lvăolgyi Eăotvăos ... eve ry vertex v in a set V N with N  1 has a neighbour f (v) in V N−1 . Then G contains an infinite path, v 0 v 1 with v N ∈ V N for all N. Given a...

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

... of identifying codes. Identifying codes and locating-dominating codes have been extensively studied: see the Internet bibliography [11] maintained by Antoine Lobstein. For results on the triangular grid, ... ✉ Figure 1: A strongly identifying code with density 6/19. The purpose of this note is to prove that this code is optimal, i.e., the density of every strongly id...

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

... 229–268. [5] R. Hill, Optimal linear codes, in: C. Mitchell, ed., Cryptography and Coding II (Oxford Univ. Press, Oxford, 1992) 75–104. [6] R. Hill, An extension theorem for linear codes, Des. Codes Cryptogr. ... Lizak, Extensions of linear codes, Proc. IEEE Int. Symposium on Inform. Theory (Whistler, Canada, 1995) 345. [8] R. Hill, D.Z. Newton, Optimal ternary linear codes,...

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