this paper. In FGD, the correlates of function words in syntactic representations do not take the form of specific nodes in the tree. Rather, these correlates take the form of labels on edges (see the syntactic units previously illustrated) or of parts of complex labels on nodes (such as values of morphological categories, e.g. Plural, Feminine, Preterite, Conditional, and semantic distinction within the individual syntactic categories of adverbial modifications, such as the meanings of the prepositions in, on, above, under with Locative)

Legacy code can often be made more understandable and maintainable by extracting out selected sets of statements to form procedures and replacing the extracted code with procedure calls. Sets of statements that are noncontiguous and/or include non-local jumps (caused by gotos, breaks, continues

number of authors and rearranging them into an orderly, unambiguous and automatic procedure, is to provide a tool to help researchers and practitioners who want to deal with the reconstruction problem. In detail the authors propose a systematic tool that allows the reconstruction of a 3D pseudo

This paper describes a specific part of the Prague Dependency Treebank annotation, the step from the surface dependency structure towards the underlying representation of the sentence. The first section explains the theoretical basis of the project. In Section 2 all the procedure of conversion

Abstract: This review describes computational procedures for deriving the amino acid sequences that are compatible with a given protein backbone structure. Such procedures can be used to gain insight into the constraints imposed by the 3D structure of the protein sequence, or to design proteins

; Harter, 1899). Skills are thought to consist largely of collections of automatic processes and procedures

crucially on the choice of effective term-weighting systems. This article summarizes the insights gained in automatic term weighting, and provides baseline single-term-indexing models with which other more elaborate content analysis procedures can be compared.

We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent

Previous research has shown that trait concepts and stereotypes become active automatically in the presence of relevant behavior or stereotyped-group features. Through the use of the same priming procedures as in previous impression formation research, Experiment l showed that participants whose

this technical report is to provide a simple and efficient software tool for implementing a force controller on an industrial robot with position interface. The starting point of the design procedure is that the specifications, which the design is based on, can be provided by the robot's user