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

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

2007
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 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 with the s...

Journal: :TACL 2014
Jane Chandlee Rémi Eyraud Jeffrey Heinz

We define two proper subclasses of subsequential functions based on the concept of Strict Locality (McNaughton and Papert, 1971; Rogers and Pullum, 2011; Rogers et al., 2013) for formal languages. They are called Input and Output Strictly Local (ISL and OSL). We provide an automata-theoretic characterization of the ISL class and theorems establishing how the classes are related to each other an...

2014
James Rogers

Strictly Local Stringsets Membership in a Strictly 2-Local (SL2) stringset (McNaughton and Papert 1971) is determined by the initial symbol, by the pairs of symbols that occur in the string and by the final symbol (independently). Thus they can be specified by giving a set of pairs of symbols drawn from the alphabet augmented by a start and an end marker. The members of the stringset are all an...

2015

I n the article by McNaughton et al, “Health Literacy and Mortality: A Cohort Study of Patients Hospitalized for Acute Heart Failure,” which published online April 29, 2015, and appeared in the May 2015 issue of the journal (J Am Heart Assoc. 2015;4:e001799 doi: 10.1161/JAHA.115. 001799), on page 1, in the Abstract, the penultimate sentence of theMethods and Results section contained errors. “A...

2008
Siamak Noorbaloochi Min-Woong Sohn

xcessive Antibiotic Use in Men with Prostatitis rent C. Taylor, PhD, MPH, Siamak Noorbaloochi, PhD, Mary McNaughton-Collins, MD, MPH, hristopher S. Saigal, MD, MPH, Min-Woong Sohn, PhD, Michel A. Pontari, MD, Mark S. Litwin, MD, MPH, imothy J. Wilt, MD, MPH, and the Urologic Diseases in America Project Center for Chronic Disease Outcomes Research, Veterans Affairs Medical Center, Minneapolis, M...

Journal: :Personality and individual differences 2009
Elliot T Berkman Matthew D Lieberman Shelly L Gable

Gray's (1970) reinforcement sensitivity theory (RST) was recently updated (Gray & McNaughton, 2000), but the changes have not received extensive empirical validation. The study tests three novel predictions of the revised RST. First, the behavioral activation system (BAS) is expected to be sensitive to both conditioned and unconditioned incentives. Second, the behavioral inhibition system (BIS)...

2002
Alfons Geser

Abstract. Loops are the most frequent cause of non-termination in string rewriting. In the general case, non-terminating, non-looping string rewriting systems exist, and the uniform termination problem is undecidable. For rewriting with only one string rewriting rule, it is unknown whether non-terminating, non-looping systems exist and whether uniform termination is decidable. If in the one-rul...

Journal: :The journal of the American Academy of Psychiatry and the Law 2002
Yuval Melamed Roberto Mester Gal I Levertov Jacob Margolin

Section 300/A/A of the Israel Penal Law, amended in 1995, deals with reduction of punishment for severe mental and/or intellectual disturbances insufficient to warrant a plea of not guilty by reason of insanity. The present version of the amendment allows the court total freedom in determining punishment, thereby creating a plethora of court decisions. In this article, we have attempted to prov...

2001
Hans L. Bodlaender Michael J. Dinneen Bakhadyr Khoussainov

In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in a specified set are visited infinitely often and vertices in another specified set are visited fin...

Journal: :Int. J. Comput. Math. 2004
Guangming Xing

The problem of converting a regular expression to NFA is a fundamental problem that has been well studied. However, the two basic construction algorithms: (1) Thompson, (2) McNaughton-Yamada and Glushkov, both have disadvantages. In this paper: First, a “smart” parsing algorithm is developed which constructs a parse tree with at most (3l − 1) nodes form a regular expression with l literals; Sec...

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

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