báo cáo khoa học: " Family-based genetic risk prediction of multifactorial disease" docx
... information 0.00 0.05 0.10 0.15 0.20 Prediction information 0.00 0.05 0.10 0.15 0.20 Prediction information 0.00 0.05 0.10 0.15 0.20 (a) (b) Risk Risk Risk Risk Risk Risk P(D I ) P(D I |G I ) P(D I |D S ) ... this article as: Ruderfer DM, et al.: Family-based genetic risk prediction of multifactorial disease. Genome Medicine 2010, 2:2. Page 7 of 7 components of varia...
Ngày tải lên: 11/08/2014, 12:20
... mean that all combinations of values of two (or more) categories are systematically possible, i.e. that every member of the cartesian product of the two (or more) sets of values do appear in the ... value of the variable being predicted (y); the rest of the attributes is denoted by x as expected. Values of attributes will be denoted by an overstrike (~, 5). The pool of co...
Ngày tải lên: 17/03/2014, 07:20
... of parent node in dependency tree. c-word: word of child node. p-pos: POS of parent node. c-pos: POS of child node. p-pos+1: POS to the right of parent in sentence. p-pos-1: POS to the left of ... parent of x j . T = {(x t , y t )} T t=1 denotes the training data. We follow the edge based factorization method of Eisner (1996) and define the score of a dependency tree as the s...
Ngày tải lên: 20/02/2014, 15:20
Tài liệu Báo cáo khoa học: "Detecting Errors in Part-of-Speech Annotation" docx
... instance of this method based on identity of words in the variation contexts, so-called variation n-grams, successfully detects a variety of errors in the WSJ corpus. The usefulness of the notion of ... instance of our general idea to detect variation in compara- ble contexts presented in this paper prioritizes the precision of error detection by requiring identity of the word...
Ngày tải lên: 22/02/2014, 02:20
Tài liệu Báo cáo khoa học: "Resolution for Machine Translation of Telegraphic Messages" docx
... maximized when we rely on syntactic rules defined in terms of part -of- speech at the cost of a high degree of ambiguity. Thus, the goal of maximizing the parsing coverage while minimizing the ... results of the technique on the basis of two sets of unseen test data. In section 5 we discuss system engineering issues to accommodate the proposed technique, i.e., integration...
Ngày tải lên: 22/02/2014, 03:20
Báo cáo khoa học: "Word Maturity: Computational Modeling of Word Knowledge" docx
... model the devel- opment of meaning of words as a function of in- creasing exposure to language, and ultimately - the degree to which the meaning of words at each stage of exposure resemble their ... training corpora of the two models have in common (recall that the adult corpus is a superset of each of the intermedi- ate corpora). The result of the Procrustes Align- ment...
Ngày tải lên: 07/03/2014, 22:20
Báo cáo khoa học: "deals with the interpretation of conceptual operations" docx
... TYPE OF CONCEPTUAL OPERATIONS ? The conceptual operations of NL we intend to interpret are, for instance, Indlvldustions of objects, evaluations of objects, evaluations of properties of objects, ... kinds of memory, etc. Let us introduce a new example. The adjective is one of the more conlplex phenomena of NL which cannot be reduced to the notion of predicate sinc...
Ngày tải lên: 18/03/2014, 02:20
Báo cáo khoa học: "A Game-Theoretic Model of Metaphorical Bargaining" docx
... model of negotia- tion through offers and counter-offers between two players with a public benefit constraint. The model consists of (1) two players repre- senting the opposing sides, (2) a set of ... idea of the proof is to construct a pair of strategies where each side attempts to pull the pub- licly accepted frame in the direction of its peak utility point. We show, assuming the...
Ngày tải lên: 30/03/2014, 21:20
Báo cáo khoa học:Tight estimates for eigenvalues of regular graphs docx
... that lies within distance 2k of any of the vertices, then G has at least s eigenvalues which are smaller than −2 √ d − 1cos( π 2k ). The proof is analogous to that of Theorem 1, one simply defines ... electronic journal of combinatorics 11 (2004), #N9 1 2 The proof Let G =(V,E)bead-regular graph, where d ≥ 3. Let v ∈ V be a vertex, define V 0 = {v}, and let V i be the set of all verti...
Ngày tải lên: 07/08/2014, 08:20
báo cáo khoa học: " Copy number variation in Parkinson’s disease" docx
... identification of SNPs associated with disease, these studies also allow quantitative assessment of the genome. A total of five GWASs of PD have been published so far. However, analyses of struc- tural genetic ... have confirmed the association of common non-coding genetic variants at the SNCA locus and increased risk of PD [9]. ese findings suggest that variation in re...
Ngày tải lên: 11/08/2014, 12:20