Báo cáo khoa học: "EXTENDED GRAPH UNIFICATION" pot

... concise. 2 GRAPH SPECIFICATION We start by defining a language GSL (graph spec- ification language} for describing graphs, and by specifying the conditions under which two graphs unify. ... mandatory. A graph descriptor consists of a set of path de- scriptors separated by commas. The graph con- sists of the set of described paths. If two node descriptors in a graph de...

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

... applications of statistical potentials to pre- diction of relative binding energies. The effect of training set composition on potential function performance All knowledge-based potentials face the possibility ... complexes. The statistical potential performs as well as highly optimized physical potential functions in tests of docking decoy discrimination. We anticipate that the performance o...

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

... nm and emission was collected from 490 to 740 nm. The acquired data were converted to graphs with kaleida- graph 3.0. Flow cytometric analysis and sorting were performed using a FACStarPLUS apparatus ... JP, Duennwald M, Zazulak H, Webster JM, Messer A, Lindquist S, Ingram VM & Wittrup KD (2004) Potent inhibition of hunting- tin aggregation and cytotoxicity by a disulfide bond-free singl...

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

... x j ∈ X ncp (2) The diagonal degree matrix D is defined for graph g by D=  j ˜w ij . In general graph- based SSL, a function over the graph is estimated such that it satisfies two conditions: 1) ... =  i∈L∪U w x i f i  i∈L∪U w x i (6) Thus, we use induction, where we can, to avoid re-construction of the graph for new test points. 4 Graph Summarization Research on graph- based SSL a...

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

... understand. Parsing with term-based internal representations is more efficient than parsing with graph- based representations. Therefore, it is effective to translate unification grammar formalism ... the viewpoint of the ways feature structures are represented: (a) those using labeled, directed graphs (Shieber, 1984) and (b) those using first-order terms (Pereira and Warren, 1980; Ma...

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

... system, but recognizable by a combination of contextual expectations and morphological or orthographic features (e.g., capitalization). In the first situation, there is no meaningful recovery ... expectation-based spelling correcter must be invoked from within the morphological decomposition routines on potentially misspelt roots or inflexions. 2.4. Incorrect segmentation Input typed t...

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

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

... ural thing to do. After all, the trees and feature structures used in linguistics are simple graphical objects. To put it another way, they are merely rather simple Kripke models, and modal ... computational complexity of grammatical formalisms. The second type of shortcoming is more serious and potentially far more interesting. Two cases in point are (i) the distinction made in 6PS6...

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

... super- natant was then ultradiafiltered and chromatographed on a Q-Sepharose ion-exchange column. Eluted calreticulin was further purified by size-exclusion chromatography on a Sephacryl S-100 HR column. The ... Journal 275 (2008) 515–526 ª 2008 The Authors Journal compilation ª 2008 FEBS The chaperone and potential mannan-binding lectin (MBL) co-receptor calreticulin interacts with MBL through...

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

... can be described as either graph- based or transition- based (McDonald and Nivre, 2007). In graph- based parsing, we learn a model for scoring possible de- pendency graphs for a given sentence, ... with label l in the graph. A dependency graph G for a sentence x must be a directed tree orig- inating out of the root node 0 and spanning all nodes in V , as exemplified by the graph in figur...

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