Miracle-dz/UniFAR-FTUs huggingface dataset:
Incremental Centering and Center Ambiguity

of verbs in Japanese, given that the number of candidate antecedents exceeds that of the zero anaphors. Their use of functional notions, viz. topicality and empathy, naturally extend the role preferences of the underlying centering model, but unlike our case, no structural ambiguities are involved. In contrast, our approach applies to the representation of both types of ambiguities. We motivated the treatment of (structural) ambiguities within the centering framework as a consequence of assuming an incremental mode of anaphor resolution, a topic that has not been raised in the centering literature so far. This is surprising insofar as even psycholinguistic studies on centering (Gordon et al., 1993; Brennan, 1995) do not touch upon this issue, though the immediacy of anaphor resolution is a common theme in cognitive text processing studies (Just & Carpenter, 1987; Sanford & Garrod, 1989). Our proposal, based on a dependency-style grammar model (Hahn et al., 1994), claims to integrate both the sentence-level as well as text-level of anaphora analysis. Furthermore, it is also fully integrated with terminological reasoning facilities as needed for in-depth text understanding , and is based on an incremental, single-pass procedure. Thus, it is superior to the work on binding theory as developed within the GB framework (Chomsky, 1981) that is restricted to the sentence-level of analysis; just recently, however , Merlo (1993) has proposed an incremental procedure for computing intrasentential coreferences based on binding theory constraints. Also Haddock (1987) considers an incre-mental mode of anaphora resolution which boils down to a variable binding, i.e., a constraint satisfaction problem in the context of a Combinatory Categorial Grammar. Any of these approaches neglects the important aspect of a preference scaling for properly selecting among several candidate discourse units as antecedents. This drawback in the same way applies to the framework of DRT (Kamp & Reyle, 1993), which is also non-incremental. Conclusions Our approach to anaphora resolution extends the original centering model by embedding the centering approach into an incremental, single-pass processing model, by providing data structures for the centering algorithm which allow for the treatment of local and global (parsing) ambiguities, and by homogeneously integrating the resolution of sentence-level (intrasentential) as well as text-level (intersentential) anaphora based on the strict requirements set up by the binding criteria (adapted to a dependency grammar framework). The anaphora resolution module has been realized as part of a dependency parser for the German language. The parser has been …
Manifold Learning with Geodesic Minimal Spanning Trees

In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we consider the closely related problem of estimating the manifold’s intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sample points as realizations of an unknown multivariate density supported on an unknown smooth manifold. We present a novel geometrical probability approach, called the geodesic-minimal-spanning-tree (GMST), to obtaining asymptotically consistent estimates of the manifold dimen sion and the R´ enyi α-entropy of the sample density on the manifold. The GMST approach is striking in its simplicity and does not require reconstructing the manifold or estimating the multivariate density of the samples. The GMST method simply constructs a minimal spanning tree (MST) sequence using a geodesic edge matrix and uses the overall lengths of the MSTs to simultaneously estimate manifold dimension and entropy. We illustrate the GMST approach for dimension and entropy estimation of a human face dataset.
56.1: Invited Paper: Recent Progress in Flexible and Drapable Reflective Cholesteric Displays

In this paper, we present recent results from encapsulation work in developing flexible and drapable cholesteric liquid crystal displays on substrates such as thin plastics, fabrics, and even paper. The approaches to create flexible displays with single and dual substrate methods based on printable emulsions and polymerization induced phase separation techniques will be discussed.
Logic programming with ordered disjunction

Logic programs with ordered disjunction (<i>LPOD</i>s) combine ideas underlying Qualitative Choice Logic (Brewka, Benferhat, & Le Berre 2002) and answer set programming. Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: <i>A × B</i> intuitively means: if possible <i>A</i>, but if <i>A</i> is not possible then at least <i>B</i>. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. <i>LPOD</i>s are useful for applications in design and configuration and can serve as a basis for qualitative decision making.
A non-holonomic systems approach to special function identities

We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma function or polylogarithms, which are not covered by the holonomic framework. The basic idea is to take into account the dimension of appropriate ideals in Ore algebras. This unifies several earlier extensions and provides algorithms for summation and integration in classes that had not been accessible to computer algebra before.
Theorem proving support in programming language semantics

We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verification condition generator and a static analyser that can be run inside the theorem prover for use in reflective proofs. Extraction of an interpreter from the denotational semantics is also described. All different aspects are formally proved sound with respect to the natural semantics specification. Key-words: Coq, natural semantics, structural operational semantics, denotational semantics, axiomatic semantics, abstract interpretation, formal verification, calculus of inductive constructions, proof by reflection, program extraction Sémantique des langages de programmation avec le support d’un outil de preuve Résumé : Nous décrivons plusieurs points de vue sur la sémantique d’un petit langage de programmation, vus comme des documents dans le calcul des constructions inductives qui peuvent être vérifiés par le système Coq. Les aspects couverts sont la sémantique naturelle, la sémantique dénotationnelle, la sémantique axiomatique, et l’interprétation abstraite. Des descriptions sous formes de fonctions récursives sont fournies quand c’est adapté, et on obtient ainsi un générateur de conditions de vérification et un analyseur statique qui peuvent être utilisés dans des preuves par réflexion. L’extraction d’un interprète à partir de la sémantique dénotationnelle est également décrite. Des preuves formelles assurant la correction des différents aspects vis-à-vis de la sémantique naturelle sont également abordes. Mots-clés : Coq, sémantique naturelle, sémantique dénotationnelle, sémantique axiomatique, interprétation abstraite, vérification formelle, calcul des constructions inductives, preuve par réflexion, extraction de programmes Theorem proving support in programming language semantics 3 This paper is dedicated to the memory of Gilles Kahn, my thesis advisor, my mentor, my friend.
The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes

In an earlier work, the statistical physics associated with finite-temperature decoding of code ensembles, along with the relation to their random coding error exponents, were explored in a framework that is analogous to Derrida's random energy model (REM) of spin glasses, according to which the energy levels of the various spin configurations are independent random variables. The generalized REM (GREM) extends the REM in that it introduces correlations between energy levels in an hierarchical structure. In this paper, we explore some analogies between the behavior of the GREM and that of code ensembles which have parallel hierarchical structures. In particular, in analogy to the fact that the GREM may have different types of phase transition effects, depending on the parameters of the model, then the above-mentioned hierarchical code ensembles behave substantially differently in the various domains of the design parameters of these codes. We make an attempt to explore the insights that can be imported from the statistical mechanics of the GREM and be harnessed to serve for code design considerations and guidelines.
A randomized fully polynomial time approximation scheme for the all terminal network reliability problem

The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. This problem has obvious applications in the design of communication networks. Since the problem is ${\sharp {\cal P}}$-complete and thus believed hard to solve exactly, a great deal of research has been devoted to estimating the failure probability. In this paper, we give a fully polynomial randomized approximation scheme that, given any n-vertex graph with specified failure probabilities, computes in time polynomial in n and $1/\epsilon$ an estimate for the failure probability that is accurate to within a relative error of $1\pm\epsilon$ with high probability. We also give a deterministic polynomial approximation scheme for the case of small failure probabilities. Some extensions to evaluating probabilities of $k$-connectivity, strong connectivity in directed Eulerian graphs and $r$-way disconnection, and to evaluating the Tutte polynomial are also described. This version of the paper corrects several errata that appeared in the previous journal publication [D. R. Karger, SIAM J. Comput. , 29 (1999), pp. 492--514].
CTLA-4 Control over Foxp3+ Regulatory T Cell Function

Naturally occurring Foxp3+CD4+ regulatory T cells (Tregs) are essential for maintaining immunological self-tolerance and immune homeostasis. Here, we show that a specific deficiency of cytotoxic T lymphocyte antigen 4 (CTLA-4) in Tregs results in spontaneous development of systemic lymphoproliferation, fatal T cell–mediated autoimmune disease, and hyperproduction of immunoglobulin E in mice, and it also produces potent tumor immunity. Treg-specific CTLA-4 deficiency impairs in vivo and in vitro suppressive function of Tregs—in particular, Treg-mediated down-regulation of CD80 and CD86 expression on dendritic cells. Thus, natural Tregs may critically require CTLA-4 to suppress immune responses by affecting the potency of antigen-presenting cells to activate other T cells.
Robust direction-of-arrival estimation for FM sources in the presence of impulsive noise

Time-frequency methods can utilize the non-stationarity of signals to enhance the resolution capability and accuracy in direction-of-arrival estimation. In this paper, we consider the problem of non-stationary sources impinging on an array of sensors in an impulsive noise environment. We apply a robust time-frequency method in combination with morphological image processing to estimate the instantaneous frequency of the sources. Then, for the extracted time-frequency points, we employ robust methods to calculate the averaged spatial time-frequency matrix, which is then used for direction-of-arrival estimation.
Utilizing Landmarks in Euclidean Heuristics for Optimal Planning

An important problem in AI is to construct high-quality heuristics for optimal search. Recently, the Euclidean heuristic (EH) has been proposed, which embeds a state space graph into a Euclidean space and uses Euclidean distances as approximations for the graph distances. The embedding process leverages recent research results from manifold learning, a subfield in machine learning, and guarantees that the heuristic is provably admissible and consistent. EH has shown good performance and memory efficiency in comparison to other existing heuristics. Our recent works have further improved the scalability and quality of EH. In this short paper, we present our latest progress on applying EH to problems in planning formalisms, which provide richer semantics than the simple state-space graph model. In particular, we improve EH by exploiting the landmark structure derived from the SAS+ planning formalism.
Retrospective Evaluation of a Teleretinal Screening Program in Detecting Multiple Nondiabetic Eye Diseases.

BACKGROUND Diabetic teleretinal screening programs have been utilized successfully across the world to detect diabetic retinopathy (DR) and are well validated. Less information, however, exists on the ability of teleretinal imaging to detect nondiabetic ocular pathology. INTRODUCTION This study performed a retrospective evaluation to assess the ability of a community-based diabetic teleretinal screening program to detect common ocular disease other than DR. MATERIALS AND METHODS A retrospective chart review of 1,774 patients who underwent diabetic teleretinal screening was performed. Eye clinic notes from the Veterans Health Administration's electronic medical record, Computerized Patient Record System, were searched for each of the patients screened through teleretinal imaging. When a face-to-face examination note was present, the physical findings were compared to those obtained through teleretinal imaging. Sensitivity, specificity, and positive and negative predictive values were calculated for suspicious nerve, cataract, and age-related macular degeneration. RESULTS A total of 903 patients underwent a clinical examination. The positive predictive value was highest for cataract (100%), suspicious nerve (93%), and macular degeneration (90%). The negative predictive value and the percent agreement between teleretinal imaging and a clinical examination were over 90% for each disease category. DISCUSSION A teleretinal imaging protocol may be used to screen for other common ocular diseases. CONCLUSION It may be feasible to use diabetic teleretinal photographs to screen patients for other potential eye diseases. Additional elements of the eye workup may be added to enhance accuracy of disease detection. Further study is necessary to confirm this initial retrospective review.
Cortisol response to d-fenfluramine in patients with obsessive-compulsive disorder and in healthy subjects: evidence for a gender-related effect.

In order to evaluate serotonergic function in obsessive-compulsive disorder (OCD), plasma cortisol response to d-fenfluramine (30 mg p.o.) was examined in 20 drug-free obsessive-compulsive patients (10 males and 10 females) and in 20 age- and sex-matched healthy subjects, under double-blind, placebo-controlled conditions. We found that: (a) baseline plasma cortisol secretion was significantly increased in patients with OCD; (b) in healthy subjects, the cortisol response to d-fenfluramine was evident in women, but no in men; (c) plasma cortisol response to the serotonergic challenge did not differ between patients and controls, but it was significantly reduced in female patients as compared to healthy women. These results demonstrate a hyperactivity of the hypothalamo-pituitary-adrenal axis in obsessive-compulsive patients and suggest a dysfunction of 5-HT transmission in female patients.
A principled framework for constructing natural language interfaces to temporal databases

Most existing natural language interfaces to databases (NLIDBs) were designed to be used with ``snapshot'' database systems, that provide very limited facilities for manipulating time-dependent data. Consequently, most NLIDBs also provide very limited support for the notion of time. The database community is becoming increasingly interested in _temporal_ database systems. These are intended to store and manipulate in a principled manner information not only about the present, but also about the past and future. This thesis develops a principled framework for constructing English NLIDBs for _temporal_ databases (NLITDBs), drawing on research in tense and aspect theories, temporal logics, and temporal databases. I first explore temporal linguistic phenomena that are likely to appear in English questions to NLITDBs. Drawing on existing linguistic theories of time, I formulate an account for a large number of these phenomena that is simple enough to be embodied in practical NLITDBs. Exploiting ideas from temporal logics, I then define a temporal meaning representation language, TOP, and I show how the HPSG grammar theory can be modified to incorporate the tense and aspect account of this thesis, and to map a wide range of English questions involving time to appropriate TOP expressions. Finally, I present and prove the correctness of a method to translate from TOP to TSQL2, TSQL2 being a temporal extension of the SQL-92 database language. This way, I establish a sound route from English questions involving time to a general-purpose temporal database language, that can act as a principled framework for building NLITDBs. To demonstrate that this framework is workable, I employ it to develop a prototype NLITDB, implemented using ALE and Prolog.
Multi-modal human-machine communication for instructing robot grasping tasks

A major challenge for the realization of intelligent robots is to supply them with cognitive abilities in order to allow ordinary users to program them easily and intuitively. One approach to such programming is teaching work tasks by interactive demonstration. To make this effective and convenient for the user, the machine must be capable of establishing a common focus of attention and be able to use and integrate spoken instructions, visual perception, and non-verbal clues like gestural commands. We report progress in building a hybrid architecture that combines statistical methods, neural networks, and finite state machines into an integrated system for instructing grasping tasks by man-machine interaction. The system combines the GRAVIS-robot for visual attention and gestural instruction with an intelligent interface for speech recognition and linguistic interpretation, and a modality fusion module to allow multi-modal task-oriented man-machine communication with respect to dextrous robot manipulation of objects.
Synthesis of Low-Power Digital Circuits Derived from Binary Decision Diagrams

This paper introduces a novel method for synthesizing digital circuits derived from Binary Decision Diagrams (BDDs) that can yield to reduction in power dissipation. The power reduction is achieved by decreasing the switching activity in a circuit while paying close attention to information measures as an optimization criterion. We first present the technique of efficient BDD-based computation of information measures which are used to guide the power optimization procedures. Using this technique, we have developed an algorithm of BDD reordering which leads to reducing the power consumption of the circuits derived from BDDs. Results produced by the synthesis on the ISCAS benchmark circuits are very encouraging.
Data-Driven Machine Translation for Sign Languages

This thesis explores the application of data-driven machine translation (MT) to sign languages (SLs). The provision of an SL MT system can facilitate communication between Deaf and hearing people by translating information into the native and preferred language of the individual. We begin with an introduction to SLs, focussing on Irish Sign Language - the native language of the Deaf in Ireland. We describe their linguistics and mechanics including similarities and differences with spoken languages. Given the lack of a formalised written form of these languages, an outline of annotation formats is discussed as well as the issue of data collection. We summarise previous approaches to SL MT, highlighting the pros and cons of each approach. Initial experiments in the novel area of example-based MT for SLs are discussed and an overview of the problems that arise when automatically translating these manual-visual languages is given. Following this we detail our data-driven approach, examining the MT system used and modifications made for the treatment of SLs and their annotation. Through sets of automatically evaluated experiments in both language directions, we consider the merits of data-driven MT for SLs and outline the mainstream evaluation metrics used. To complete the translation into SLs, we discuss the addition and manual evaluation of a signing avatar for real SL output.
Insulin and androgen relationships with abdominal body fat distribution in women with and without hyperandrogenism.

This retrospective study was carried out to investigate, in a large group of hyperandrogenized women with polycystic ovary syndrome (PCOS) and nonhyperandrogenized control women, the interrelationships between sex steroids and indices of body fat distribution. Moreover, we investigated the relationships between these parameters and insulin blood levels, since obese women with abdominal pattern of fat distribution (A-BFD), as well as those with PCOS (either obese and nonobese) are characterized by moderate to severe hyperinsulinemia. A sample of 100 women with PCOS and that of 138 women without clinical signs of hyperandrogenism, who served as a control group, were investigated. The waist to hip circumference ratio (WHR) which was used to define different patterns of fat topography was significantly (p < 0.05) higher in PCOS (0.84 +/- 0.10) than in control women (0.81 +/- 0.08). In both groups, women with WHR values lower than or equal to 0.85 were considered as having a peripheral pattern of body fat distribution (P-BFD) whereas those having WHR values higher than 0.85 had A-BFD. Compared to controls, women with PCOS had higher LH, androgen and estrogen concentrations. In both PCOS and controls there were no differences in sex hormone levels between women with different patterns of fat distribution, except androstenedione, which levels were significantly higher in women with A-BFD than with P-BFD. Women with PCOS showed significantly higher insulin levels than controls. Moreover, in both groups fasting and stimulated insulin were significantly higher in women with A-BFD than in those with P-BFD. (ABSTRACT TRUNCATED AT 250 WORDS)