Báo cáo toán học: "Totally Greedy Coin Sets and Greedy Obstructions" pptx

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

... and F. Pambianco, On saturating sets in projective spaces, J. Combin. Theory Ser. A 103 (2003), 1–15. [8] A.A. Davydov, S. Marcugini and F. Pambianco, Linear Codes With Covering Radius 2, 3 and ... construction of small dense sets in P G(2, q) is relevant in other areas of Combinatorics, as dense sets are related to covering codes, see Section 4, and defining sets of block desi...

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

... Abu-Sbeih and Khamsi: On externally complete subsets and common fixed points in partially ordered sets. Fixed Point Theory and Applications 2011 2011:97. Abu-Sbeih and Khamsi Fixed Point Theory and ... ∅ . Finally, assume that we have (x i ) iÎI and (y j ) jÎJ in X such that the subsets ([x i , ® )) iÎI , and ((¬, y j ]) jÎJ intersect 2-by-2 and [x i , → ) ∩ M = ∅ and (←,...

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

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

... Huy, T. D. Phuong, and N. D. Yen, On the contractibility of the efficient and weakly efficient sets in R 2 . In P. Daniele, F. Giannessi, and A. Maugeri (Eds.), Equilibrium Problems and Variational ... linear mapping and we use this concept to A, i.e., to investigate the optimal solution set, then C is the intersection of On Efficient Sets in R 2 465 m halfspaces, which contains a lin...

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

... of subsets of a finite set S, and let a, b, c ∈ S.Ifthere exist an evolutionary path in S between a and b and another between b and c, then there is an evolutionary path in S between a and c. Proof:LetP ... S between a and b is defined as a minimal connected subset of S whose union contains a and b. Theorem 9 A finite family S of subsets of a finite set S whose union is S is connect...

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

... Conway and Guy and Lunnon. In particular, d  1 is the difference vector corresponding to the Conway–Guy sequence (for more on the Conway–Guy sequence see [B] and [G1]), and d 2 , d  2 , d 3 , and ... ρ 2n+3 ≥ 2 and w 2 is not smooth. On the other hand, if ρ 2 > 0 then (5) implies ρ 3 ≥ 0. In this case w 2 (n −1) −w 2 (n)=2ρ 3 +ρ 2 +ρ 2n+1 ≥ 2 and w 2 is not smooth. CASE 4. m...

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

... Differential Equation Method for Random Graph Processes and Greedy Algorithms. In Michal Karo´nski and Hans-J¨urgen Pr¨omel, editors, Lectures on Approximation and Randomized Algorithms, pages 73–155. ... N.C. Wormald, Differential Equations for Random Processes and Random Graphs. Annals of Applied Probability, 5:1217–1235, 1995. [13] N.C. Wormald. Models of Random Regular Graphs. In...

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

... radiolabelling: HEPES and MES, and compared this with the most commonly used acetate buffers: sodium acetate and ammonium acetate, and showed that an increased SA could be obtained when DTPA- and DOTA-conjugated ... labelling of DTPA- and DOTA-conjugated peptides and antibodies with 111 In in HEPES and MES buffer Maarten Brom* 1 , Lieke Joosten 1 , Wim JG Oyen 1 , Marti...

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

... optical devices and polarization filters [8,9,11]. Several methods for synthesizing GNSs including 1-D GNSs have been reported. These methods include photochemical and electrochemical deposition [12,13] and ... [3,10,16]. On the other hand, the use of hard t emplates such as anodic alumina and mesoporous silica for the synthesis of 1-D GNSs makes the complicated immobilization pro- ce...

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