Báo cáo toán học: "Lifting projections from quotient C*-algebras " pot

... burger. 1983. Over-Answering yes-no ques- tions. IJCAI, Karlsruhe. - 130 - Generating Sentences from Different Perspectives Lee Fedder, The Computer Laboratory, University of Cambridge, ... interfaces. Abstract Certain pairs or groups of sentences appear to be semantically distinct, yet specify the same underlying state of affairs, from different per- spectives. This...

Ngày tải lên: 09/03/2014, 01:20

... paper, we look to the Web for broader if shallower sources of semantics. In order to harness the information on the Web without presupposing a deep understanding of all Web text, we instead turn ... head- words from candidate mention pairs and compute statistics derived from various potentially informa- tive queries’ counts. We explore five major cat- egories of semantically informa...

Ngày tải lên: 30/03/2014, 17:20

...

Ngày tải lên: 05/08/2014, 09:46

... alt =""

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

... alt =""

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

... class="bi x0 y1 w3 h 2" alt =""

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

... class="bi x0 y0 w3 h 1" alt =""

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

... orbits. In the present case a family is completely specified by the integer q ≡ q 1 which counts the traversals of the loop 1, i.e., the number of letters 1 in the code word. Each of these q letters ... orthogonal polynomials of integers x with 0 ≤ x ≤ N.Theyhave quite diverse applications ranging from the theory of covering codes [6] to the statistical mechanics...

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

... the lattice structure comes from orientations of the completion. 2 Lattices of Fixed Degree Orientations A plane graph is a planar graph G =(V, E) together with a fixed planar embedding. In particular ... there may exist rigid the electronic journal of combinatorics 11 (2004), #R15 15 Lattice Structures from Planar Graphs Stefan Felsner Technische Universităat Berlin, Institut fău...

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

... property,orisaHPP matroid. the electronic journal of combinatorics 11(2) (2005), #A1 3 Matroid inequalities from electrical network theory David G. Wagner ∗ Department of Combinatorics and Optimization University ... 1981, Stanley applied the Aleksandrov–Fenchel Inequalities to prove a loga- rithmic concavity theorem for regular matroids. Using ideas from electrical network t...

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

... of orbits of PGL(2,q). There are some known results on 3-designs from PGL(2,q) in the literature, see for example [1, 4, 6]. In this paper, we first determine the sizes of orbits from the actions ... in the above formula. 7 Orbit sizes and 3-designs from PGL(2,q) We use the results of the previous sections to show the existence of a large number of new 3-designs. First we state the...

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

... ∈ M k (p)andq is obtained from p by deleting i − 2 entries from 1, ,i− 1 and not deleting i}, B = {q | q ∈ M k (p)andq is obtained from p by deleting i − 2 entries from 1, ,i− 1andi}, C = {q ... paper develops in three main directions – permutation reconstruction from multisets and sets of minors as well as permutation reconstruction from sets of minors within certain classes...

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

... n-cycles or neither is an n -cycle. We consider these two cases separately. Case 1. Suppose neither p nor q is an n -cycle. Let k be the length of the cycle in p (and hence the length of the cycle ... permutation p “contains” the k -cycle (a 1 a 2 . . . a k ), or the k -cycle is “in” p, if it appears in the decomposition of p into disjoint cycles. 2 Reconstruction from Cycle Minors...

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

... y-ordinate from the bottom edge of Q k+1 to the top edge of Q k . For Q in Diagr am 3, δ(Q) =  2 3 6 4 4 5 3 2 3 5 5 2 6 5 4 1  . The map δ is a bijection from CCP to Y. As such, δ allows CCPs to be ... to a bipartition of N 2 . In this section, we use their Pattern Algebra to obtain a q-analog of Kitaev’s [25] Theorem 30 and to deduce a better generating function for per...

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

... find a path from (u, k) to (u, ℓ−λ ) , then by following the lifting of the path in G, there is a path from (u, ℓ − λ) to (v, ℓ). Now, assuming that k = ℓ − λ, we must find a path from (u, k) ... path from (u, k) to (w, k + κ) in G ′ . Since (w, k + κ) is in the lifting of the small cycle, we know that there is a path from (w, k + κ) to (w, ℓ − λ − κ) in G ′ . Thus, the path in G ′...

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