No description available.

This research is an effort to improve the performance of successive approximation algorithm with a prime aim of solving finite states and actions, infinite horizon, stationary, discrete and discounted Markov Decision Processes (MDPs). Successive approximation is a simple and commonly used method to solve MDPs. Successive approximation often appears to be intractable for solving large scale MDPs due to its computational complexity. Action elimination, one of the techniques used to accelerate solving MDPs, reduces the problem size through identifying and eliminating sub-optimal actions. In some cases successive approximation is terminated when all actions but one per state are eliminated. The bounds on value functions are the key element in action elimination. New terms (action gain, action relative gain and action cumulative relative gain) were introduced to construct tighter bounds on the value functions and to propose an improved action elimination algorithm. When span semi-norm is used, we show numerically that the actual convergence of successive approximation is faster than the known theoretical rate. The absence of easy-to-compute bounds on the actual convergence rate motivated the current research to try a heuristic action elimination algorithm. The heuristic utilizes an estimated convergence rate in the span semi-norm to speed up action elimination. The algorithm demonstrated exceptional performance in terms of solution optimality and savings in computational time. Certain types of structured Markov processes are known to have monotone optimal policy. Two special action elimination algorithms are proposed in this research to accelerate successive approximation for these types of MDPs. The first algorithm uses the state space partitioning and prioritize iterate values updating in a way that maximizes temporary elimination of sub-optimal actions based on the policy monotonicity. The second algorithm is an improved version that includes permanent action elimination to improve the performance of the algorithm. The performance of the proposed algorithms are assessed and compared to that of other algorithms. The proposed algorithms demonstrated outstanding performance in terms of number of iterations and omputational time to converge.

L’effet de potentialisation motrice, initialement décrit par Tucker et Ellis (1998), correspond au bénéfice entrainé par l’action potentielle évoquée par la perception d’objets manipulables en lien avec le dispositif de réponse. Cet effet a été observé dans de nombreux contextes expérimentaux. Toutefois, il semble que cet effet ne s’observe pas lorsque la tâche des participants ne porte pas directement sur une caractéristique requise pour le contrôle de l’action (Tipper, Paul & Hayes, 2006) ou qui n’entraîne pas suffisamment d’attention sur l’objet (Ellis, Tucker, Symes & Vainio, 2007 ; Symes, Ellis & Tucker, 2005). Le cas particulier de l’identification de la couleur est un exemple dans lequel cet effet n’est généralement pas constaté (Symes et al. 2005 ; Tipper et al. 2006). En s’appuyant sur des travaux qui proposent une alternative aux théories dissociatives classiques du système visuel (Creem & Proffitt, 2001 ; Frey, 2007 ; Young, 2006 ; Derbyshire, Ellis & Tucker, 2006) et qui se basent essentiellement sur des processus de résonance motrice et de simulation comme condition nécessaire à l’identification et à la reconnaissance (Rizzolatti & Matelli, 2003 ; Bar, 2007 ; Berthoz & Petit, 2003), cette thèse a pour objet de spécifier les conditions d’observation du phénomène de potentialisation motrice en tâche d’identification chromatique. Pour ce faire, nous avons adapté le paradigme SRC modifié de Tucker et Ellis (1998) et le protocole d’amorçage développé par Phillips et Ward (2002) à l’étude de l’identification des couleurs d’objets manipulables. Les résultats que nous avons obtenus montrent une interaction entre l’identification de la couleur et les simulations motrices associées à la perception d’objets manipulables. Ces résultats sont discutés en faveur des modèles qui cherchent à réconcilier les approches écologiques et représentationnelles de la perception ainsi que de ceux qui insistent sur la nature profondément proactive et simulationniste du système perceptif. / Potentiation of action effect, originally described by Tucker and Ellis (1998), corresponds to the advantage led by action evoked by the perception of graspable objects related to the response device. These effects have been reported for many experimental conditions. However, this effect is not observed when the task is not directly about a characteristic required for action control (Tipper, Paul & Hayes, 2006) or when it does not allowed for enough attention on the object (Ellis, Tucker, Symes & Vainio, 2007; Symes, Ellis & Tucker, 2005). Color perception and identification is a particular case where these effects are generally not observed (Symes et al. 2005; Tipper et al. 2006). Relying on recent works that propose an alternative to theories of classic dissociation of the visual system (Creem & Proffitt, 2001; Frey, 2007; Young, 2006; Derbyshire, Ellis & Tucker, 2006) and that are essentially based on motor resonance and simulation processes as a condition to identification and recognition (Rizzolatti & Matelli, 2003; Bar, 2007; Berthoz & Petit, 2003), this thesis aims to specify the conditions of observation of a potentiation of action phenomenon in a chromatic identification task. To that end, we have adapted the SRC paradigm (stimulus response compatibility) modified by Tucker and Ellis (1998) and the priming paradigm developed by Phillips and Ward (2002) to study color identification of graspable objects. Results we obtain shows an interaction between the identification of color and the motor simulations associated with the perception of graspable objects. We discuss our results in the light of models which tend to reconcile ecological and representational approaches of perception as well as those which insist on the deeply proactive and simulationist nature of the perceptual system.

In a recent paper, Bentzen proposes a semantically characterised logic called Action Type Deontic Logic, where normative concepts are applied to action expressions, rather than propositional statements. The logic offers solutions to many of the paradoxes of deontic logic. In particular, Bentzen's semantics solves many puzzles involving the interaction of permission with conjunction and disjunction. One of the reasons for these positive results is the assumption that agents always act according to norm. This assumption means that only agents with ideal behaviour are modelled; there is no possibility for norm-violation. In this thesis, proof techniques and decision procedures for Action Type Deontic Logic in the style of semantic tableau are investigated, and soundness, completeness and termination results are obtained. In order to account for the possibility of norm-violation, a new semantics based on a generalisation of Action Type Deontic Logic models is proposed. The new semantics keeps the possibility of norm-violation open, while many of the virtues of Action Type Deontic Logic remain.

Types of civil actions in the civil process This graduation paper is divided into four chapters. The first chapter describes an action as such. It covers most aspects of an action such as the elements of an action, defects, consequences of filing an action and possible dispositions. An analysis of these aspects should enhance the reader's orientation in the legal terms and help to understand the context and relations between individual types of actions in the following chapters. More focus was put on the prayer for relief as a key element used to categorise individual types of action. The section "Prayer for relief and its types" provides several examples that could help clarify the issue of their categorisation to the non-professional public. The second chapter describes the modern history of the types of actions and the development of procedural legislation. It also contains a reference to the new drafted rules of judicial procedure as a considered replacement of the current Rules of Civil Procedure. The third chapter provides a categorisation of actions and their individual types. Major focus is devoted to the highly discussed declaratory action, plea of res judicata, and the binding nature of the court's justification. Each analysed type of action contains at least one practical and informal...

The development of affirmative action strategies designed to achieve equal employment opportunity has been studied along six dimensions of functioning within four separate organisations. Three of these organisations were participants in the Federal Government's Affirmative Action Pilot Program in 1984/5, and one was not. It has been shown that change occurred in a continuous developmental sequence, here called an "Affirmative Action Continuum", within each of these six dimensions over the period of study, with each organisation following a similar sequence of movement. Exceptions occurred where an organisation made no movement at all, or where one or more of the sequential processes was omitted or displaced, in a dimension. The reasons for some of these exceptions, and some of their consequences for later action, have been explored. It has been shown that simultaneous activity occurred across several, dimensions, so that no organisation acted upon only one dimension in isolation from all others. There was some chronological sequencing between dimensions. The indicators of movement along the Affirmative Action Continuum within each dimension were used to describe the change process in each organisation. These indicators proved to be useful both in this regard, and in placing each organisation an the Affirmative Action Continuum in each dimension at two different points in time. In this way, the indicators' usefulness was shown to generalise to four very different institutions, thus suggesting applicability beyond the bounds of this particular study. It is intended that the results of this dissertation, and in particular the model of the Affirmative Action Continuum and the indicators described in Chapter Two, be used by Equal Employment Opportunity practitioners to facilitate their decision making about sequencing of activities designed to achieve equal employment oppportunity.

This research is an effort to improve the performance of successive approximation algorithm with a prime aim of solving finite states and actions, infinite horizon, stationary, discrete and discounted Markov Decision Processes (MDPs). Successive approximation is a simple and commonly used method to solve MDPs. Successive approximation often appears to be intractable for solving large scale MDPs due to its computational complexity. Action elimination, one of the techniques used to accelerate solving MDPs, reduces the problem size through identifying and eliminating sub-optimal actions. In some cases successive approximation is terminated when all actions but one per state are eliminated. The bounds on value functions are the key element in action elimination. New terms (action gain, action relative gain and action cumulative relative gain) were introduced to construct tighter bounds on the value functions and to propose an improved action elimination algorithm. When span semi-norm is used, we show numerically that the actual convergence of successive approximation is faster than the known theoretical rate. The absence of easy-to-compute bounds on the actual convergence rate motivated the current research to try a heuristic action elimination algorithm. The heuristic utilizes an estimated convergence rate in the span semi-norm to speed up action elimination. The algorithm demonstrated exceptional performance in terms of solution optimality and savings in computational time. Certain types of structured Markov processes are known to have monotone optimal policy. Two special action elimination algorithms are proposed in this research to accelerate successive approximation for these types of MDPs. The first algorithm uses the state space partitioning and prioritize iterate values updating in a way that maximizes temporary elimination of sub-optimal actions based on the policy monotonicity. The second algorithm is an improved version that includes permanent action elimination to improve the performance of the algorithm. The performance of the proposed algorithms are assessed and compared to that of other algorithms. The proposed algorithms demonstrated outstanding performance in terms of number of iterations and omputational time to converge.

Univ., Diss.--Hamburg, 2003.

Associé à la démocratie représentative, le vote en France est souvent observé à travers ses résultats (chiffre d’abstention, du vote blanc, inscription ou non inscription sur les listes électorales, etc.), ce qui laisse entendre que le fait démocratique serait caractérisé par les suffrages exprimés. Or, pour le citoyen le vote a un sens qui va au-delà du rituel des urnes. En tant que Sujet socio-psychologique, il vote en agissant autour d’enjeux fondamentaux dans le but de construire et de se construire par un acte puissant et utile en confirmant son histoire.Pour comprendre la signification du vote en tant qu’agir politique articulé à de nombreux agir (s) sociaux, eux-mêmes reposant sur des fondements psychologiques de l’agir humain, nous nous sommes positionnés en amont et en aval de la dynamique électorale et envisagé le comportement votant en fonction des connaissances, des croyances, des prédispositions normatives, affectives, bref, de l’attitude qui le sous-tend.La question générale de notre recherche est de décliner les conditions qui construisent le comportement votant. / Associated with representative democracy, voting in France is often seen through its results (abstention, blank vote, registration or non-registration on electoral lists, etc.), which suggests that the actual democratic would be characterized by the votes cast. For the citizen, the vote has a meaning that goes beyond the ritual of the ballot box. As a socio-psychological subject, he votes regarding fundamental issues in order to bring out solutions and construct himself through this historical action seen as a powerful, effective and useful. In order to understand the significance of voting as a political act expressed in many social actions, which are based on the psychological foundations of human action, we positioned ourselves upstream and downstream of the vote and considered the voting behavior relatively to knowledge, beliefs, normative, affective dimensions, in short, to the attitude that supports it.The general aim of our research is to specify the conditions that construct the voting behavior.

Thoughts about reflection and reflective practice have evolved over many decades, through carefully constructed theory and research applications, mainly based on the work of Dewey (1933) and Schön (1983). Evidence also exists in the literature that the ability to reflect on practice is considered a necessity for effective instruction (Sowder, 2007). By reflecting critically teachers become more positive in the search for a new understanding of their teaching practice and design more ways to deal with the challenges that confront them daily. When teachers act reflectively, they consider carefully the problems in their own teaching and think about how those problems are related to their educational or social context. They are aware of the consequences of their teaching and how their own assumptions or beliefs can influence their teaching. This main purpose of my research study was to explore the nature of mathematics teachers’ reflective practice in the context of lesson study. To achieve this aim, an in-depth exploration of five mathematics teachers’ reflection before, during and after teaching a lesson was conducted. The possible relationship between these teachers’ reflection and their classroom practice was also examined. The research also aimed to explore whether and how mathematics teachers’ reflections differ from the conceptualisations of reflection in classroom practice as found in the literature. Contextual factors that might influence the nature of mathematics teachers’ reflective practice were also investigated. My findings indicate that the mathematics teachers in my sample have a limited understanding of the concept of reflection. Furthermore, based on lesson plan analysis, there was no evidence that these teachers reflect-for-action. However, they all reflected on-action verbally and in writing, and three of the five teachers reflected-in-action while teaching. They all reflected on Level R1 (recall level of reflection) and Level R2 (rationalisation level of reflection) and three teachers reflected critically on their learners’ understanding of mathematics and their own teaching of concepts towards the end of the research project (Lee, 2005). Language and the lesson study group experience emerged as contextual factors that seemed to influence the teachers’ reflection. Although the research study’s results cannot be generalised due to the small sample, I believe that through engaging in the lesson study experience the five teachers of this study improved their reflective practice, reporting an increase in self-knowledge and finding new ways of teaching mathematics to learners. / Thesis (PhD)--University of Pretoria, 2011. / Science, Mathematics and Technology Education / unrestricted