Báo cáo toán học: "How to Draw Tropical Planes" doc

... the max-convention for tropical addition, weight vectors have to be negat ed. The output is handed over to the program gfan tropicaltraverse, which computes all other maximal cones. For this computation to finish ... to trees. the electronic journal of combinatorics 16(2) (2009), #R6 17 the notion of Grassmannians and Dressians from ∆(d, n) to arbitrary matroid polytopes. We are in...

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

... fail to determine all of them. Let p ≥ 2 be an integer. We obtain the graph G 1 p from two disjoint complete graphs K 2p+1 and K 2p by removing an edge xy ∈ E(K 2p+1 ) and joining x to u and y to ... 303–317. [4] A.J.W. Hilton and P.D. Johnson. Graphs which are vertex-critical with respect to the edge-chromatic number. Math. Proc. Cambridge Philos. Soc. 102 (1987), 103–112. [5] A.J.W....

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

... is required to account for growth correlations. The general principle is to simulate a dynamic topo- logical network of organs at various stages using mor- phogenetic models, and to simulate ... related to both structure and function. In order to improve the architectural models of the root system, and to enlarge their scope of interest, a next step in their development would be...

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

... of vertebrate elastic fibers. Furthermore, the elastomeric properties have been related to the capacity to shift from a weakly globular structure to an extended form, mediated by the Pro- and Gly-rich repeats ... Val) moved from a series of folded to extended structures (Fig. 3). Together, these results suggest a dynamic ensemble of conformers, ranging from fully extended to loosely...

Ngày tải lên: 14/02/2014, 18:20

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

... time. Finally, we want to relate LMBOT to the STSSG of Sun et al. (2009). To this end, we also introduce the top-down semantics for LMBOT. As expected, both semantics coincide. The top-down semantics ... T ∗ Σ . The finite tree automa- ton M recognizes the tree language L(M) = {t ∈ T Σ | δ(t) ∩ F = ∅} . A tree language L ⊆ T Σ is regular if there exists a finite tree automaton M such tha...

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

... from left to right, this information is already attached to their corresponding active edges. Scan- Tasks, which are seeking to the left of the island, access information attached to the vertex ... such as top-down or bottom-up are reflected in different conditions for the introduction of empty active edges. An empty edge repre- sents the task to search a constituent; it po...

Ngày tải lên: 18/03/2014, 02:20

... language to assign word-class labels to words. CLAWS can be modified to detect grammatical errors, essentially by flagging unlikely word-class transitions in the input text. This may seem to be ... of words flagged to nearly zero should raise the precision but lower the recall. The problem is to balance this trade-off to arrive at recall AND precision levels acceptable to...

Ngày tải lên: 24/03/2014, 05:21

... very much linked together, we assume that the words of the window belong to two different domains. It means that the window is located across the transition from one topic to another. 1481 ... 20 words wide, was used to take into account the thematic links. The texts were pre-processed with the probabilistic POS tagger TreeTagger (Schmid, 1994) in order to keep only the lemmat...

Ngày tải lên: 31/03/2014, 04:20

... grammar: gotol (ql , ~) = q'a; gotol (q,, I~ ) = q,; gotol (q~, noun) = q~; gotol (qs, g) qs; gotol(qs, verb) = ~,; goto~(qs, ~=) = qs; goto, (~, , Po ) = elo; goto, (es, ~) = ... 'natural' syntax trees, generally belong to this subset. For an example, see section 6. 5.2 The automaton To determine the automaton we specify, in addition to the set of states Q,...

Ngày tải lên: 31/03/2014, 18:20