Using Lexical Chaining to Rank Protein-Protein Interactions in Biomedical Text

Abstract Biomedical information extraction is becoming an increasingly important application of Computational Linguistics research. We propose a method for analyzing full-text articles on protein interactions that takes a discourse-based approach to provide a means of ranking the biological validity of such interactions. Specifically, we use lexical chaining-strings of semantically related words-as an indicator of the validity of the protein interactions appearing in the same textual context

Stability Analysis of Jump-Linear Systems Driven by Finite-State Machines with Markovian Inputs

A control system with a fault recovery mechanism in the feedback loop and with faults occurring in a non-deterministic manner can be modeled as a class of hybrid systems, i.e., a dynamical system switched by a finite-state machine or an automaton. When the plant and controller are linear, such a system can be modeled as a jump-linear system driven by a finite-state machine with a random input process. Such fault recovery mechanisms are found in flight control systems and distributed control systems with communication networks. In these critical applications, closed-loop stability of the system in the presence of fault recoveries becomes an important issue. Finite-state machines as mathematical constructs are widely used by computer scientists to model and analyze algorithms. In particular, fault recovery mechanisms that are implemented in hardware with logic based circuits and finite memory can be modeled appropriately with finite-state machines. In this thesis, mathematical tools are developed to determine the mean-square stability of a closed-loop system, modeled as a jump-linear system in series with a finite-state machine driven by a random process. The random input process is in general assumed to be any r-th order Markov process, where r ≥ 0. While stability tests for a jump-linear system with a Markovian switching rule are well known, the main contribution of the present work arises from the fact that output of a finite-state machine driven by a Markov process is in general not Markovian. Therefore, new stability analysis tools are provided for this class of systems and demonstrated through Monte Carlo simulations

Automata & Sequential Machines, A Survey

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-36-039-TR US AMC 02208(E

Cellular synthesis of synchronous sequential machines

With the advancing solid-state technology, it is necessary to develop new techniques for synthesizing digital networks. The regular pattern of cellular circuits seems to be the best fitted for the new LSI technology. Recently, cellular implementations of comibinational circuits have received considerable attention but very little attention has been given to sequential circuits. In this paper, we present two new methods for realizing sequential machines, both using cellular circuits. These new techniques will also enable us to do away with the time-consuming and difficult problem of state assignment. State-assigned (Moore) machines are assumed throughout. The first method converts sequential functions into combinational like equations. In order to do so, the machine must be either definite or finite input and feedback memory (FIFM). If the machine is neither definite nor FIFM, it is made FIFM by constructing a proper feedback function. These combinational like equations can easily be implemented by conventional combinational cellular circuits, such as the cutpoint cellular arrays, together with delay elements. The second method utilizes matrix methods. It is noted that when a machine is in a certain state and is subject to an input, it does two things: it makes a state transition and it produces outputs. If the diagonal elements of an nxn array of cells are thought as representing n states, the transition of states can be accomplished by first moving horizontally and then vertically and the output can be collected by an added bottom collection row. In both cases, bounds on the number of cells are established and minimal realizations are studied. Methods for starting these cellular machines are also investigated. In order to make the machine more flexible, techniques are devised to initialize the machine into any state desired. It is safe to predict that future computing systems will continue to increase the demands on several sophisticated design areas. They will need to be more readily expandable and modifiable. Automatic error detection and correction will also play a more significant role. Therefore, besides modularity, reliability and programmability are also important aspects of any new design techniques. Both synthesis methods presented in this paper can easily be modified to include these features

Calcul sur architecture non fiable

Although materials could be fabricated as error-free theoretically with a huge cost for worst-case design methodologies, the circuit is still susceptible to transient faults by the effects of radiation, temperature sensitivity, and etc. On the contrary, an error-resilient design enables the manufacturing process to be relieved from the variability issue so as to save material cost. Since variability and transient upsets are worsening as emerging fabrication process and size shrink are tending intense, the requirement of robust design is imminent. This thesis addresses the issue of designing on unreliable circuit. The main contributions are fourfold. Firstly a fast error-correction and low cost redundancy fault-tolerant method is presented. Moreover, we introduce judicious two-dimensional criteria to estimate the reliability and the hardware efficiency of a circuit. A general-purpose model offers low-redundancy error-resilience for contemporary logic systems as well as future nanoeletronic architectures. At last, a decoder against internal transient faults is designed in this work.En théorie, les circuits électroniques conçus selon la méthode du pire-cas sont supposés garantir un fonctionnement sans erreur pourun coût d’implémentation élevé. Dans la pratique les circuits restent sujets aux erreurs transitoires du fait de leur sensibilité aux aléastels que la radiation et la température. En revanche, une conception prenant en compte la tolérance aux fautes permet de faire face à detels aléas comme la variabilité du processus de fabrication. De plus, les erreurs transitoires et la variabilité de fabrication s’intensifientavec l’émergence de nouveaux processus de fabrication et des circuits de dimension de plus en plus réduite. La demande d’une conceptionintégrant la tolérance aux fautes devient désormais primordiale. La présente thèse a pour objectif de cerner la problématique de laconception de circuits sur des puces peu fiables et apporte des contributions suivant quatre aspects. Dans un premier temps, nous proposonsune méthode de tolérance aux fautes, basée sur la correction d’erreurs et la redondance à faible coût. Puis, nous présentonsun critère bidimensionnel judicieux permettant d’évaluer la fiabilité et l’efficacité matérielle de circuits. Nous proposons ensuite un modèleuniversel qui apporte une tolérance avec fautes à redondance faible pour les systèmes logiques d’aujourd’hui et les architecturesnanoélectroniques de demain. Enfin, nous découvrons un décodeur tolérant aux fautes transitoires internes

Space Communications: Theory and Applications. Volume 3: Information Processing and Advanced Techniques. A Bibliography, 1958 - 1963

Annotated bibliography on information processing and advanced communication techniques - theory and applications of space communication

T.: Authoring scenes for adaptive, interactive performances

In this paper, we introduce a toolkit called SceneMaker for authoring scenes for adaptive, interactive performances. These performances are based on automatically generated and prescripted scenes which can be authored with the SceneMaker in a two-step approach: In step one, the scene flow is defined using cascaded finite state machines. In a second step, the content of each scene must be provided. This can be done either manually by using a simple scripting language, or by integrating scenes which are automatically generated at runtime based on a domain and dialogue model. Both scene types can be interweaved in our planbased, distributed platform. The system provides a context memory with access functions that can be used by the author to make scenes user-adaptive. Using CrossTalk as the target application, we describe our models and languages, and illustrate the authoring process. CrossTalk is an interactive installation with animated presentation agents which “live ” beyond the actual presentation and systematically step out of character within the presentation, both to enhance the illusion of life. The context memory enables the system to adapt to user feedback and generates data for later evaluation of user/system behavior. The SceneMaker toolkit should enable the non-expert to compose adaptive, interactive performances in a rapid prototyping approach