A game theoretical approach to the algebraic counterpart of the Wagner hierarchy

La hiérarchie de Wagner constitue à ce jour la plus fine classification des langages ω-réguliers. Par ailleurs, l'approche algébrique de la théorie de langages formels montre que ces ensembles ω-réguliers correspondent précisément aux langages reconnaissables par des ω-semigroupes finis pointés. Ce travail s'inscrit dans ce contexte en fournissant une description complète de la contrepartie algébrique de la hiérarchie de Wagner, et ce par le biais de la théorie descriptive des jeux de Wadge. Plus précisément, nous montrons d'abord que le degré de Wagner d'un langage ω-régulier est effectivement un invariant syntaxique. Nous définissons ensuite une relation de réduction entre ω-semigroupes pointés par le biais d'un jeu infini de type Wadge. La collection de ces structures algébriques ordonnée par cette relation apparaît alors comme étant isomorphe à la hiérarchie de Wagner, soit un quasi bon ordre décidable de largeur 2 et de hauteur ω. Nous exposons par la suite une procédure de décidabilité de cette hiérarchie algébrique : on décrit une représentation graphique des ω-semigroupes finis pointés, puis un algorithme sur ces structures graphiques qui calcule le degré de Wagner de n'importe quel élément. Ainsi le degré de Wagner de tout langage ω-régulier peut être calculé de manière effective directement sur son image syntaxique. Nous montrons ensuite comment construire directement et inductivement une structure de n''importe quel degré. Nous terminons par une description détaillée des invariants algébriques qui caractérisent tous les degrés de cette hiérarchie. Abstract The Wagner hierarchy is known so far to be the most refined topological classification of ω-rational languages. Also, the algebraic study of formal languages shows that these ω-rational sets correspond precisely to the languages recognizable by finite pointed ω-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ω-rational language to the ω-semigroup context. More precisely, we first show that the Wagner degree is indeed a syntactic invariant. We then define a reduction relation on finite pointed ω-semigroups by means of a Wadge-like infinite two-player game. The collection of these algebraic structures ordered by this reduction is then proven to be isomorphic to the Wagner hierarchy, namely a well-founded and decidable partial ordering of width 2 and height $\omega^\omega$. We also describe a decidability procedure of this hierarchy: we introduce a graph representation of finite pointed ω-semigroups allowing to compute their precise Wagner degrees. The Wagner degree of every ω-rational language can therefore be computed directly on its syntactic image. We then show how to build a finite pointed ω-semigroup of any given Wagner degree. We finally describe the algebraic invariants characterizing every Wagner degree of this hierarchy.

A model of gender prejudice, power, and discrimination: How hierarchy-enhancing factors predominate over hierarchy-attenuating factors

Gender inequalities remain an issue in our society and particularly in the workplace. Several factors can explain this gender difference in top-level managerial positions such as career ambitions but also biases against women. In our chapter, we propose a model explaining why gender inequalities and particularly discrimination against women is still present in our societies despite social norms and existing legislation on gender equality. To this purpose, we review research on discrimination through two different approaches, (a) a prejudice approach through the justification-suppression model developed by Crandall and Eshleman (2003) and (b) a power approach through the social dominance theory (Pratto, Sidanius, Stallworth, & Malle, 1994; Sidanius & Pratto, 1999). In our work, we integrate these two approaches and propose a model of gender prejudice, power and discrimination. The integration of these two approaches contributes to a better understanding of how discrimination against women is formed and maintained over time.

A cognitive hierarchy model of behavior in the action commitment game

We apply the cognitive hierarchy model of Camerer et al. (Q J Econ 119(3):861-898, 2004)-where players have different levels of reasoning-to Huck et al. (Games Econ Behav 38:240-264, 2002) discrete version of Hamilton and Slutsky (Games Econ Behav 2:29-46, 1990) action commitment game-a duopoly with endogenous timing of entry. We show that, for an empirically reasonable average number of thinking steps, the model rules out Stackelberg equilibria, generates Cournot outcomes including delay, and outcomes where the first mover commits to a quantity higher than Cournot but lower than Stackelberg leader. We show that a cognitive hierarchy model with quantal responses can explain the most important features of the experimental data on the action commitment game in (2002). In order to gauge the success of the model in fitting the data, we compare it to a noisy Nash model. We find that the cognitive hierarchy model with quantal responses fits the data better than the noisy Nash model.

Supplier Evaluation Using Analytical Hierarchy Process

The goal of the thesis is to make a supplier evaluation using analytical hierarchy process. Before the supplier evaluation is performed there will be introduced the principles of purchasing which gives a viewpoint to the supplier evaluation and management. The thesis will also give an overview on quality, performance and forecasts which are very important to the supplier evaluation and future improvements. The chapter which describes analytical hierarchy process will show the reader what exactly is analytical hierarchy process and how can it be utilized in supplier evaluation. In the later stages, thesis will provide information about the case company EADS Secure Networks Oy, the processes applied there towards purchasing and how the analytical hierarchy process is applied in practise. In the end of the thesis there will be an overview about each supplier’s strong and weak points as well as some comments and ideas about developing also EADS Secure Networks procedures to a direction which would benefit the whole customer–supplier–chain.

Hierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type

Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. In this thesis, we study two-dimensional subshifts offinite type (2D SFTs), where the underlying grid is Z2 and the set of for-bidden patterns is finite. We are mainly interested in the interplay between the computational power of 2D SFTs and their geometry, examined through the concept of expansive subdynamics. 2D SFTs with expansive directions form an interesting and natural class of subshifts that lie between dimensions 1 and 2. An SFT that has only one non-expansive direction is called extremely expansive. We prove that in many aspects, extremely expansive 2D SFTs display the totality of behaviours of general 2D SFTs. For example, we construct an aperiodic extremely expansive 2D SFT and we prove that the emptiness problem is undecidable even when restricted to the class of extremely expansive 2D SFTs. We also prove that every Medvedev class contains an extremely expansive 2D SFT and we provide a characterization of the sets of directions that can be the set of non-expansive directions of a 2D SFT. Finally, we prove that for every computable sequence of 2D SFTs with an expansive direction, there exists a universal object that simulates all of the elements of the sequence. We use the so called hierarchical, self-simulating or fixed-point method for constructing 2D SFTs which has been previously used by Ga´cs, Durand, Romashchenko and Shen.

Memory Hierarchy Hardware-Software Co-design in Embedded Systems

The memory hierarchy is the main bottleneck in modern computer systems as the gap between the speed of the processor and the memory continues to grow larger. The situation in embedded systems is even worse. The memory hierarchy consumes a large amount of chip area and energy, which are precious resources in embedded systems. Moreover, embedded systems have multiple design objectives such as performance, energy consumption, and area, etc. Customizing the memory hierarchy for specific applications is a very important way to take full advantage of limited resources to maximize the performance. However, the traditional custom memory hierarchy design methodologies are phase-ordered. They separate the application optimization from the memory hierarchy architecture design, which tend to result in local-optimal solutions. In traditional Hardware-Software co-design methodologies, much of the work has focused on utilizing reconfigurable logic to partition the computation. However, utilizing reconfigurable logic to perform the memory hierarchy design is seldom addressed. In this paper, we propose a new framework for designing memory hierarchy for embedded systems. The framework will take advantage of the flexible reconfigurable logic to customize the memory hierarchy for specific applications. It combines the application optimization and memory hierarchy design together to obtain a global-optimal solution. Using the framework, we performed a case study to design a new software-controlled instruction memory that showed promising potential.

hierarchy typology balance

hierarchy typology balance with links to health science RM&EBP articles. working sep 15. No balance animation

Research Hierarchy Typology Balance

Explores the balance between different kinds of evidence in research methodology

Rational modification of the hierarchy of intermolecular interactions in molecular crystal structures by using tunable halogen bonds

A family of 16 isomolecular salts (3-XpyH)(2)[MX'(4)] (3-XpyH=3-halopyridinium; M=Co, Zn; X=(F), Cl, Br, (I); X'=Cl, Br, I) each containing rigid organic cations and tetrahedral halometallate anions has been prepared and characterized by X-ray single crystal and/or powder diffraction. Their crystal structures reflect the competition and cooperation between non-covalent interactions: N-H center dot center dot center dot X'-M hydrogen bonds, C-X center dot center dot center dot X'-M halogen bonds and pi-pi stacking. The latter are essentially unchanged in strength across the series, but both halogen bonds and hydrogen bonds are modified in strength upon changing the halogens involved. Changing the organic halogen (X) from F to I strengthens the C-X center dot center dot center dot X'-M halogen bonds, whereas an analogous change of the inorganic halogen (X') weakens both halogen bonds and N-H center dot center dot center dot X'-M hydrogen bonds. By so tuning the strength of the putative halogen bonds from repulsive to weak to moderately strong attractive interactions, the hierarchy of the interactions has been modified rationally leading to systematic changes in crystal packing. Three classes of crystal structure are obtained. In type A (C-F center dot center dot center dot X'-M) halogen bonds are absent. The structure is directed by N-H center dot center dot center dot X'-M hydrogen bonds and pi-stacking interactions. In type B structures, involving small organic halogens (X) and large inorganic halogens (X'), long (weak) C-X center dot center dot center dot X'-M interactions are observed with type I halogen-halogen interaction geometries (C-X center dot center dot center dot X' approximate to X center dot center dot center dot X'-M approximate to 155 degrees), but hydrogen bonds still dominate. Thus, minor but quite significant perturbations from the type A structure arise. In type C, involving larger organic halogens (X) and smaller inorganic halogens (X'), stronger halogen bonds are formed with a type II halogen-halogen interaction geometry (C-X center dot center dot center dot X' approximate to 180 degrees; X center dot center dot center dot X'-M approximate to 110 degrees) that is electrostatically attractive. The halogen bonds play a major role alongside hydrogen bonds in directing the type C structures, which as a result are quite different from type A and B.

User-intimate requirements hierarchy resolution framework (UI-REF)

Abstract. This paper presents the User-Intimate Requirements Hierarchy Resolution Framework (UI-REF) based on earlier work (Badii 1997-2008) to optimise the requirements engineering process particularly to support userintimate interactive systems co-design. The stages of the UI- EF framework for requirements resolution-and-prioritisation are described. UI-REF has been established to ensure that the most-deeply-valued needs of the majority of stakeholders are elicited and ranked, and the root rationale for requirements evolution is trace-able and contextualised so as to help resolve stakeholder conflicts. UI-REF supports the dynamically evolving requirements of the users in the context of digital economy as under-pinned by online service provisioning. Requirements prioritisation in UI-REF is fully resolved while a promotion path for lower priority requirements is delineated so as to ensure that as the requirements evolve so will their resolution and prioritisation.