نتایج جستجو برای: alternation

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

Journal: :Acta biologiae experimentalis 1964
G SZWEJKOWSKA W LAWICKA J KONORSKI

In the broadest sense of the word alternation refers to any experimental procedure in which one stimulus elicits different responses depending on the ordinal number of the trial. The simplest form of alternation , which may be called " simple alternation'', is that in which a conditioned stimulus (CS) alternately signals either reinforcement or nonreinforcement in successive trials (i.e., + — t...

Journal: :Espiral 2023

Mexican political system has advanced in the democratic transition, due to appearance of alternation, which occurred 2000, after a party hegemony at national level for more than 70 years. This research studies electoral competition that post-alternation period country presidential level, through calculation Party Competition Index (ICP), order determine if can be considered as case success tran...

2002
Daniel Gildea

We evaluate probabilistic models of verb argument structure trained on a corpus of verbs and their syntactic arguments. Models designed to represent patterns of verb alternation behavior are compared with generic clustering models in terms of the perplexity assigned to held-out test data. While the specialized models of alternation do not perform as well, closer examination reveals alternation ...

2005
CHARLES G. GROSS

3 monkeys impaired on delayed response and delayed alternation after midlateral frontal lesions, 3 monkeys unimpaired on these tasks after control lesions, and 3 unoperated monkeys were tested on spatial delayed response (with direct baiting) and spatial delayed alternation following 2, 26, and 50 hr. of food deprivation. Increased deprivation improved delayed response performance by all groups...

Journal: :ITA 1999
Helmut Seidl Damian Niwinski

For every xed-point expression e of alternation-depth r, we construct a new xed-point expression e 0 of alternation-depth 2 and size O(r jej). Expression e 0 is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We show that our transformation is optimal not only w.r.t. alternation-depth but also w.r.t. the increase in ...

Journal: :Theor. Comput. Sci. 2014
Julian Gutierrez Felix Klaedtke Martin Lange

It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...

2013
Ryohei Sasano Daisuke Kawahara Sadao Kurohashi Manabu Okumura

We present a method for automatically acquiring knowledge for case alternation between the passive and active voices in Japanese. By leveraging several linguistic constraints on alternation patterns and lexical case frames obtained from a large Web corpus, our method aligns a case frame in the passive voice to a corresponding case frame in the active voice and finds an alignment between their c...

2000
MANFRED KRIFKA

There are a number of well-known restrictions for the Dative Alternation (cf. Green (1974), Oehrle (1976), Gropen, Pinker, Hollander, & Goldberg (1989), Pinker (1989), Pesetsky (1992), Levin (1993). I will show that several of the low-level semantic restrictions are consequences of a more general one involving the incorporation of a manner component into the meaning of the verb. These restricti...

2002
Timothy Baldwin Francis Bond

This research is aimed at developing a hierarchical alternation-based lexical architecture for machine translation. The proposed architecture makes extensive use of information sharing in describing valency frames through derivational links from base frames, rather than as independent entities. This has advantages in descriptive efficiency, robustness and maintainability. The lexicon being deve...

Journal: :CoRR 2017
Radu Iosif Xiao Xu

Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is possible in linear time, thus allowing to concisely encode trace inclusion problems that occur often in verification. In this paper we consider alternating a...

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

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