نتایج جستجو برای: mcnaughton function

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

2008
Philip J. Corr

The Reinforcement Sensitivity Theory (RST) of personality is a theoretical account of the neural and psychological processes underlying the major dimensions of personality. The first section of this introductory chapter traces the development of RST, from its official birth in 1970, through to Gray’s highly influential 1982 The Neuropsychology of Anxiety, and on to its major revision in 2000 wi...

2003
Jean Berstel Luc Boasson Olivier Carton Bruno Petazzoni Jean-Éric Pin

Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], where L is a language, the set of all words of L filtered by S. The filtering problem is to characterize the filters S such that, for every recognizable language L, L[S] is recognizable. In this paper, the filtering problem is solve...

1997
C. A. Federer B. Fekete

Five methods (Thornthwaite, Hamon, Jensen-Haise, Turc, and Penman) for estimating potential evaporation for a reference surface (PEr) were compared to four methods (Priestley-Taylor, McNaughton-Black, Penman-Monteith, and ShuttleworthWallace) for estimating surface-dependent potential evaporation (PEs) using three cover types at each of seven locations from Fairbanks, Alaska, to San Juan, Puert...

Journal: :Journal of personality and social psychology 2011
Kyle Nash Ian McGregor Mike Prentice

Four studies investigated a goal regulation view of anxious uncertainty threat (Gray & McNaughton, 2000) and ideological defense. Participants (N = 444) were randomly assigned to have achievement or relationship goals implicitly primed. The implicit goal primes were followed by randomly assigned achievement or relationship threats that have reliably caused generalized, reactive approach motivat...

Journal: :Ann. Pure Appl. Logic 2009
Fabrice Chevalier Deepak D'Souza M. Raj Mohan Pavithra Prabhakar

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or ‘‘signals’’. In particular, we introduce a natural class of automata for generating finitely varying functions called ST-NFA’s, and show that it coincides in terms of language definability with a natural monadic second...

Journal: :Cognitive science 2014
Randall C. O'Reilly Rajan Bhattacharyya Michael D. Howard Nicholas Ketz

This paper reviews the fate of the central ideas behind the complementary learning systems (CLS) framework as originally articulated in McClelland, McNaughton, and O'Reilly (1995). This framework explains why the brain requires two differentially specialized learning and memory systems, and it nicely specifies their central properties (i.e., the hippocampus as a sparse, pattern-separated system...

Journal: :Theor. Comput. Sci. 2006
Jean Berstel Luc Boasson Olivier Carton Bruno Petazzoni Jean-Éric Pin

Given a strictly increasing sequence s of non-negative integers, filtering a word a0a1 · · · an by s consists in deleting the letters ai such that i is not in the set {s0, s1, . . .}. By a natural generalization, denote by L[s], where L is a language, the set of all words of L filtered by s. The filtering problem is to characterize the filters s such that, for every regular language L, L[s] is ...

2012
Fabrice Chevalier Deepak D'Souza M. Raj Mohan Pavithra Prabhakar

We extend some of the classical connections between automata and logic due to Büchi [1] and McNaughton and Papert [2], to languages of finitely varying functions or “signals”. In particular we introduce a natural class of automata for generating finitely varying functions called ST-NFA’s, and show that it coincides in terms of language-definability with a natural monadic second-order logic inte...

2011
Rusins Freivalds

We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency c...

Journal: :Health law in Canada 2009
Mark E Geiger

Bargaining in the Healthcare Sector: Towards a New Model — Mark E. Geiger .......................................... 33 Data Protection for “Innovative Drugs” — Guidance Now Final — Eileen McMahon and Teresa Reguly.......... 44 Mandatory Influenza Vaccination Requirement for All Nurses Upheld at Arbitration — Shane Smith................................................. 46 The Use of Restraints:...

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

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