نتایج جستجو برای: fragaceatoxin c

تعداد نتایج: 1056517  

1995
Mary P. HARPER Randall A. HELZERMAN

In this paper, we describe a system which is capable of utilizing a variety of knowledge sources to select the most appropriate parse for a spoken sentence. These knowledge sources include syntax, semantics, and contextual information. We discuss one way to utilize contextual information when determining the parse for a sentence. At its simplest level, the system can be thought of as a general-...

2004
Eugene Asarin

Current state and perspectives of development of the theory of timed languages are analyzed. A large list of open problems is suggested. 1 Why study timed systems? In most cases computer science deals with sequences of events or actions (we will call them behaviors). Powerful formalisms have been developed to express sets or trees of such sequences (various automata, grammars, expressions, proc...

2004
Pawel Sobocinski Chris Hankin Andrew Pitts Corrado Priami

This article is an overview of the recent developments of a theory originally introduced by Leifer and Milner: given a formalism with a reduction semantics, a canonical labelled transition system is derived on which bisimilarity as well as other other equivalences are congruences, provided that the contexts of the formalism form the arrows of a category which has certain colimits. We shall also...

2009
Stefanie Shattuck-Hufnagel Katherine Williams William F. Ganong Ursula Goldstein Stephen K. Holford Arafim Ordubadi Victor W. Zue

The first experiment involved the intelligibility of alternated speech. In a typical experiment by Cherry and Taylor, and later by Huggins,2 a continuous speech message was periodically switched alternately to the subject's left and right ears, so that one ear received speech, while the other received silence. The intelligibility was assessed by counting the number of words the subject was able...

2006
Patricia Bouyer H S Fabrice Chevalier

In this paper, we survey some of the results which have been obtained the last ten years on the control of hybrid and timed systems.

2003
C C Costas Busch Mukkai S. Krishnamoorthy Malik Magdon-Ismail

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید