Does relaxing strict acceptance condition improve test based pareto coevolution?

2017 ◽  
Author(s):  
A T M Golam Bari ◽  
Alessio Gaspar ◽  
R. Paul Wiegand ◽  
Anthony Bucci
Keyword(s):  
Acceptance Condition

scholarly journals OBLIGATION BLACKWELL GAMES AND P-AUTOMATA

2017 ◽  
Vol 82 (2) ◽  
pp. 420-452
Author(s):  
KRISHNENDU CHATTERJEE ◽  
NIR PITERMAN
Keyword(s):  
Markov Chains ◽  
Decision Problem ◽  
Value Function ◽  
Acceptance Condition ◽  
Parity Games ◽  
The Value Function

AbstractWe generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1.We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata.

Progress measures, immediate determinacy, and a subset construction for tree automata

1992 ◽  
Vol 21 (430) ◽  
Author(s):  
Nils Klarlund
Keyword(s):  
Blow Up ◽  
Fundamental Result ◽  
Tree Automata ◽  
Infinite Games ◽  
Infinite Words ◽  
Graph Theoretic ◽  
The Past ◽  
Double Exponential ◽  
Acceptance Condition ◽  
Better Than

<p>Using the concept of progress measure, we give a new proof of Rabin's fundamental result that the languages defined by tree automata are closed under complementation.</p><p>To do this we show that for certain infinite games based on tree automata, an <em>immediate determinacy</em> property holds for the player who is trying to win according to a Rabin acceptance condition. Immediate determinacy is stronger than the <em> forgetful determinacy</em> of Gurevich and Harrington, which depends on more information about the past, but applies to another class of games.</p><p>Next, we show a graph theoretic duality theorem for winning conditions. Finally, we present an extended version of Safra's determinization construction. Together, these ingredients and the determinacy of Borel games yield a straightforward recipe for complementing tree automata.</p><p>Our construction is almost optimal, i.e. the state space blow-up is essentially exponential --- thus roughly the same as for automata on finite or infinite words.</p><p>To our knowledge, no prior constructions have been better than double exponential.</p>

THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON

1993 ◽  
Vol 03 (02) ◽  
pp. 237-250
Author(s):  
D. BEAUQUIER ◽  
M. NIVAT ◽  
D. NIWIŃSKI
Keyword(s):  
Cardinal Number ◽  
Tree Automaton ◽  
Büchi Automata ◽  
Infinite Trees ◽  
Acceptance Condition ◽  
Tree Languages ◽  
Büchi Automaton ◽  
Buchi Automata ◽  
Computation Path

We modify an acceptance condition of Büchi automaton on infinite trees: rather than to require that each computation path is successful, we impose various restrictions on the number of successful paths in a run of the automaton on a tree. All these modifications alter the recognizing power of Büchi automata. We examine the classes induced by the acceptance conditions that require ≤α, ≥α, =α successful paths, where α is a cardinal number. It turns out that, except for some trivial cases, the “≤” classes are incomparable with the class Bü of Büchi acceptable tree languages, while the classes “≥” are strictly included in Bü.

FORCE DISTRIBUTION AND OFFSET CONFIGURATION FOR CARBON NANOTUBES

2012 ◽  
Vol 11 (02) ◽  
pp. 1250014 ◽  
Author(s):  
F. ALISAFAEI ◽  
R. ANSARI ◽  
H. ROUHI
Keyword(s):  
Carbon Nanotubes ◽  
Direct Method ◽  
Interaction Force ◽  
Single Walled Carbon Nanotube ◽  
Jones Potential ◽  
Optimum Configuration ◽  
Multi Walled Carbon Nanotubes ◽  
Acceptance Condition ◽  
Walled Carbon Nanotubes ◽  
The Continuum

In this study, a novel semi-analytical approach is presented to evaluate the preferred position of an offset inner single-walled carbon nanotube (SWCNT) with reference to the cross-section of outer one. Moreover, on the basis of the continuum method utilized together with Lennard-Jones potential function, suction energy and acceptance condition for a SWCNT entering the outer one are investigated. Using netting analysis, the optimum configuration is determined to minimize the potential energy. To obtain the nature of interaction force, a universal potential curve is presented for an offset inner tube entering various semi-infinite outer ones. Lastly, based on the direct method, the mechanics of multi-walled carbon nanotubes (MWCNT) is investigated.

Body Image Distortion Following Social Rejection or Acceptance Cues

2019 ◽  
Vol 38 (5) ◽  
pp. 395-408 ◽  
Author(s):  
Wenting Mu ◽  
Michelle Schoenleber ◽  
Ariana Castro Leon ◽  
Howard Berenbaum
Keyword(s):  
Body Image ◽  
Undergraduate Students ◽  
Body Satisfaction ◽  
Social Rejection ◽  
Body Image Disturbance ◽  
Virtual Image ◽  
Conditioning Procedure ◽  
Women's Body Image ◽  
Acceptance Condition ◽  
State Negative Affect

Introduction: Body image has been shown to be subject to explicit, body-related feedback influences, yet little attention has been paid to subtle feedback about overall social acceptability. The current study tested competing hypotheses regarding women's body image after being primed with cued social rejection or acceptance. Whereas sociometer theory predicts that women will perceive their bodies more negatively following a social rejection prime, self-enhancement theory predicts the opposite. Method: A total of 105 female undergraduate students underwent a conditioning procedure in which distinctive tones were paired with signs of social rejection or acceptance. After this, body distortion (measured by a participant-adjusted virtual image), self-reported body satisfaction and affect were measured, while one of the tones sounded repeatedly in the background. Results: Compared with the acceptance condition, rejection condition participants reported greater state negative affect, F(1, 103) = 4.41, p = .04, greater state positive affect, F(1, 103) = 5.52, p = .02, and perceived their bodies as being smaller, F(1, 103) = 6.53, p = .01, consistent with the expectations of self-enhancement theory. Discussion: Implications of these findings are discussed regarding improved understanding of body image disturbance as well as development of novel clinical treatments.

SUPPRESS OR ACCEPT? A PILOT STUDY TO EVALUATE THE EFFECT OF COPING STRATEGIES ON ERN AMPLITUDE AMONG INDIVIDUALS WITH OBSESSIVE-COMPULSIVE TRAITS

2019 ◽  
Vol 17 (3) ◽  
pp. 283-301
Author(s):  
Laura Zambrano-Vazquez ◽  
Yvette Z. Szabo ◽  
Craig Lee Santerre ◽  
John J.B. Allen
Keyword(s):  
Clinical Symptoms ◽  
Video Clip ◽  
Cognitive Strategies ◽  
Cognitive Strategy ◽  
Healthy Population ◽  
Marginal Effect ◽  
Obsessive Compulsive ◽  
Thought Control ◽  
Error Related Negativity ◽  
Acceptance Condition

Intrusive thoughts are characteristic of psychological disorders; attempts to cope can become maladaptive perpetuating the problem (e.g., thought suppression), while others can provide long-term symptoms relief (e.g., acceptance). Although emerging research begins to explore the neural correlates of these strategies in healthy population, it is important to explore these strategies in populations more likely to naturally attempt to use such strategies (clinical symptoms). The present study explored if the use of cognitive strategies to manage intrusive cognitions would be differentially reflected in psychophysiological measures (i.e., error-related negativity) of individuals characterized by obsessive-compulsive symptoms -a group commonly associated with suppression efforts- relative to a low OC control. 67 participants with high and low OC symptoms were randomly assigned to cognitive strategy (suppression or acceptance). Participants watched an emotion-eliciting video clip and used the assigned cognitive strategy while performing the Stroop task. EEG data was collected. Consistent with well-established and emerging literature, ERN was enhanced in individuals with high OC symptoms and a marginal effect of thought-control strategy was observed, such that ERN amplitude was reduced in the suppression condition and greater for the acceptance condition. Uniquely, the study expanded on emerging literature by exploring whether the relationship between ERN and cognitive strategies was moderated by OC level. Although results were not conclusive, these preliminary findings represent an important first step to study effects of suppression and acceptance on the ERN in a sample characterized by clinically-relevant symptoms and overall encourage further exploration.

scholarly journals A coalgebraic take on regular and $\omega$-regular behaviours

2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Tomasz Brengos
Keyword(s):  
Tree Automata ◽  
Probabilistic Automata ◽  
Acceptance Condition

We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad suitable for modelling (in)finite behaviour. The second part of the paper focuses on presenting the concepts of a (coalgebraic) automaton and its ($\omega$-) behaviour. We end the paper with coalgebraic Kleene-type theorems for ($\omega$-) regular input. The framework is instantiated on non-deterministic (B\"uchi) automata, tree automata and probabilistic automata.

Introduction to Simulation and MCMC Methods

2011 ◽  
pp. 182-217 ◽  
Author(s):  
Siddhartha Chib
Keyword(s):  
Monte Carlo ◽  
Markov Chain ◽  
Markov Chain Monte Carlo ◽  
Marginal Likelihood ◽  
Mcmc Methods ◽  
Posterior Distributions ◽  
Extensive Discussion ◽  
Block Algorithm ◽  
Target Probability ◽  
Acceptance Condition

The purpose of this article is to provide an overview of Monte Carlo methods for generating variates from a target probability distribution that are based on Markov chains. These methods, called Markov chain Monte Carlo (MCMC) methods, are widely used to summarize complicated posterior distributions in Bayesian statistics and econometrics. This article begins with an intuitive explanation of the ideas and concepts that underlie popular algorithms such as the Metropolis-Hastings algorithm and multi-block algorithm. It provides the concept of a source or proposal density, which is used to supply a randomization step or an acceptance condition to determine if the candidate draw should be accepted. It is important to assess the performance of the sampling algorithm to determine the rate of mixing. Finally, this article offers an extensive discussion of marginal likelihood calculation using posterior simulator output.

Sign in / Sign up

Export Citation Format

Share Document