Topical, temporal, and spatial constraints on linguistic realization

Previous work in natural language génération has exploited discourse focus to guide the selection of propositional content and the génération of referring expressions (e.g., pronominalization, définite noun phrase génération). However, there are many other sources of contextual information which can be used to constrain linguistic realization. The realization of certain classes of temporal and spatial référents, for example, can be guided by more detailed models of time and space. Therefore, this article first identifies a number of contextual coordinates or points of référence (known as indexicals in linguistics). Next, we formalize three of these contextual coordinates – topic, time, and space – in a computational model. In doing so, the article describes the use of a Reichenbachian temporal model which is exploited to guide the realization of verb tense and aspect as well as the realization of temporal référents (e.g., temporal connectives and adverbials such as "meanwhile" and "ten minutes later"). The article then describes a spatial model which is used to guide the linguistic realization of spatial référents (e.g., "here,""there") and spatial adverbials (e.g., "two miles away"). We discuss the relation between these temporal and spatial models and illustrate their use in generating text from two different application systems. We find that the combined use of topical, temporal, and spatial contextual coordinates enhances the fluency, connectivity, and conciseness of the resulting text.     

Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams

We present a data structure for Boolean manipulation-the Mod-2-OBDDs-that considerably extends ESOPs (EXOR-sum-of-products) as well as OBDDs (ordered binary decision diagrams). There are Boolean functions of practical interest which have exponential size optimal ESOPs (even multilevel EXOR-expressions) and/or OBDDs that can be represented by (low degree) polynomial size Mod-2-OBDDs. We show that Boolean manipulation tasks such as apply operation, quantification, composition can be performed with Mod-2-OBDDs at least as efficient as with OBDDs. Indeed, since the size of a minimal Mod-2-OBDD-representation of a Boolean function is, in general, smaller (sometimes even exponentially smaller) than the size of an optimal OBDD-representation, the increase in efficiency is considerable. Moreover, EXOR-operations as well as complementations can be performed in constant timeO (1). However, the price of constant time EXOR-apply operations is the canonicity of the Mod-2-OBDD-representation. In order to allow in spite of this fact efficient analysis of Mod-2-OBDDs we present a fast probabilistic equivalence test with one-sided error probability for Mod-2-OBDDs (and, hence, for ESOPs) which performs only linear many arithmetic operations.     

Face and emotion recognition deficits in Turner syndrome: A possible role for X-linked genes in amygdala development.

Face recognition is thought to rely on configural visual processing, Where face recognition impairments have been identified, qualitatively delayed or anomalous configural processing has also been found. A group of women with Turner syndrome (TS) with monosomy for a single maternal X chromosome (45, Xm) showed an impairment in face recognition skills compared with normally developing women. However, normal configural face-processing abilities were apparent. The ability to recognize facial expressions of emotion, particularly fear, was also impaired in this TS subgroup. Face recognition and fear recognition accuracy were significantly correlated in the female control group but not in women with TS. The authors therefore suggest that anomalies in amygdala function may be a neurological feature of TS of this karyotype. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

含有限缓冲区的上游生产线协调生产调度

通过对制造企业生产现场的调研，发现在实际的生产过程中存在仓库(有限缓冲区)问题，而且是多条生产线生产不同的成品。针对这一问题，文中研究了一类带有限缓冲区的上游生产线协调的生产调度问题．把生产线简化为一个Flow shop问题．给出了单条生产线输入输出结构图，建立了上下游生产线之间部件成品关联结构，依据该关联结构建立了实用的数学模型，给出Tabu搜索算法。     

Compiling short-circuit boolean expressions in one pass

We present a very simple scheme for compiling boolean expressions in the short-circuit manner in one pass. The generated code is of very high quality and avoids most inefficiencies commonly associated with one-pass code generation. In particular, redundant conditional and unconditional branches are kept to a minimum. The scheme is general enough to compile the boolean expressions of a typical high-level language such as Pascal. It is presented in a format suited for syntax-directed translation and can be used with both top-down and bottom-up parsing.     

空间遥感相机电子学仿真专家系统

根据空间遥感相机的特点,提出了应用于空间遥感相机电子学部分测试的方法。结合关系数据库技术建立了仿真专家系统的知识库及推理机制。提出的正反推理相结合的推理方案提高了系统的推理效率,实现了快速全面的对空间遥感相机电子学部分的测试。     

An entity-oriented data model - MIX

Our goal is to make the data in the database more accessible to end-users. We introduce a new data model, called MIX, which incorporates the concepts from semantic data models such as entities, ISA, aggregation, characteristic property, and shared property hierarchies into the universal relation data models (URM) to model a database in a top-down modular way. We then show how a consistent URM style's language can be provided for both database retrievals and database updates. The database schema graph of this model further facilitates us to implement an integrated graphic user interface for the database system design life cycle.     

Panorama: A database system that annotates its answers to queries with their properties

When responding to queries, humans often volunteer additional information about their answers. Among other things, they may qualify the answer as to its reliability, and they may characterize it abstractly. This paper describes a relational database system that similarly annotates its answers with their properties. The process assumes that various assertions about properties of the data have been stored in the database (meta-information). These assertions are then used to infer properties of each answer provided by the system (meta-answers). Meta-answers are offered to users along with each answer issued, and help them to assess the value and meaning of the information that they receive. The advantages of the method described include: (1) It is extensible in that it allows users to determine the kinds of properties that the system will maintain and manipulate. (2) It has a built-in mechanism for determining the relevance of computed meta-information. (3) It is efficient: the number of operations required for meta-processing a given query can be expressed as a polynomial in the size of the meta-database. (4) It can be implemented externally with any commercial relational database system.