The purpose of this study is to examine how the effects of commercialisation impact the management of sports organizations. Additionally, the study aims to investigate how sports organizations handle commercialisation to ensure a sustainable balance between the market logic and safe sports for children. Neo -institutional theory, and its various components, have been used as a theoretical lens to answer these research questions. The study was conducted using a deductive, qualitative method, and the questions for the semi-structured interviews were designed and analysed with the help of neo-institutional theory. The results and analysis show that commercialisation primarily affects the management of sports organizations through increased professionalisation. To manage commercialisation and maintain a sustainable balance between market logic and safe sports for children, sports organizations work on educating employees, coaches, and parents. They establish guidelines and ensure compliance, focusing on a proactive approach to prevent infringement. Within the organizations, there is an ongoing dialogue to integrate these guidelines into the organization. The results also highlight the importance of understanding the individual needs of athletes so that sports activities can be conducted on their terms. A long-term perspective on sports participation is also emphasised as important for sustainability.

The modal satisfiability problem has to date been solved using either a specifically designed algorithm, or by translating the modal logic formula into a different class of problem, such as a first-order logic, a propositional satisfiability problem or a constraint satisfaction problem. These approaches and the solvers developed to support them are surveyed and a synthesis thereof is presented. The translation of a modal K formula into a constraint satisfaction problem, as developed by Brand et al. [18], is further enhanced. The modal formula, which must be in conjunctive normal form, is translated into layered propositional formulae. Each of these layers is translated into a constraint satisfaction problem and solved using the constraint solver ECLiPSe. I extend this translation to deal with reflexive and transitive accessibility relations, thereby providing for the modal logics KT and S4. Two of the difficulties that arise when these accessibility relations are added are that the resultant formula increases considerably in complexity, and that it is no longer in conjunctive normal form (CNF). I eliminate the need for the conversion of the formula to CNF and deal instead with formulae that are in negation normal form (NNF). I apply a number of enhancements to the formula at each modal layer before it is translated into a constraint satisfaction problem. These include extensive simplification, the assignment of a single value to propositional variables that occur only positively or only negatively, and caching the status of the formula at each node of the search tree. All of these significantly prune the search space. The final results I achieve compare favorably with those obtained by other solvers. / Computing / M.Sc. (Computer Science)

D. Admin. (Public Administration)

The downscaling of transistors is assumed to come to an end within the next years, and the semiconductor nonvolatile memories are facing the same physical downscaling challenge. Therefore, it is necessary to consider new computing paradigms and new memory concepts. Resistive switching devices (also referred to as memristive switches) are two-terminal passive device, which offer a nonvolatile switching behavior by applying short bias pulses. They have been considered as one of the most promising candidates for next generation memory and nonvolatile logic applications. They provide the possibility to carry out the information processing and storage simultaneously using the same resistive switching device. This dissertation focuses on the fabrication and characterization of BiFeO3 (BFO)-based metal-insulator-metal (MIM) devices in order to exploit the potential applications in nonvolatile memory and nonvolatile reconfigurable logics. Electroforming-free bipolar resistive switching was observed in MIM structures with BFO single layer thin film. The resistive switching mechanism is understood by a model of a tunable bottom Schottky barrier. The oxygen vacancies act as the mobile donors which can be redistributed under the writing bias to change the bottom Schottky barrier height and consequently change the resistance of the MIM structures. The Ti atoms diffusing from the bottom electrode act as the fixed donors which can effectively trap and release oxygen vacancies and consequently stabilize the resistive switching characteristics. The resistive switching behavior can be engineered by Ti implantation of the bottom electrodes. MIM structures with BiFeO3/Ti:BiFeO3 (BFO/BFTO) bilayer thin films show nonvolatile resistive switching behavior in both positive and negative bias range without electroforming process. The resistance state of BFO/BFTO bilayer structures depends not only on the writing bias, but also on the polarity of reading bias. For reconfigurable logic applications, the polarity of the reading bias can be used as an additional logic variable, which makes it feasible to program and store all 16 Boolean logic functions simultaneously into the same single cell of BFO/BFTO bilayer MIM structure in three logic cycles. / Die Herunterskalierung von Transistoren für die Informationsverarbeitung in der Halbleiterindustrie wird in den nächsten Jahren zu einem Ende kommen. Auch die Herunterskalierung von nichtflüchtigen Speichern für die Informationsspeicherung sieht ähnlichen Herausforderungen entgegen. Es ist daher notwendig, neue IT-Paradigmen und neue Speicherkonzepte zu entwickeln. Das Widerstandsschaltbauelement ist ein elektrisches passives Bauelement, in dem ein der Widerstand mittels elektrischer Spannungspulse geändert wird. Solche Widerstandsschaltbauelemente zählen zu den aussichtsreichsten Kandidaten für die nächste Generation von nichtflüchtigen Speichern sowie für eine rekonfigurierbare Logik. Sie bieten die Möglichkeit zur gleichzeitigen Informationsverarbeitung und -speicherung. Der Fokus der vorliegenden Arbeit liegt bei der Herstellung und der Charakterisierung von BiFeO 3 (BFO)-basierenden Metal-insulator-Metall (MIM) Strukturen, um zukünftig deren Anwendung in nichtflüchtigen Speichern und in rekonfigurierbaren Logikschaltungen zu ermöglichen. Das Widerstandsschalten wurde in MIM-Strukturen mit einer BFO-Einzelschicht untersucht. Ein besonderes Merkmal von BFO-basierten MIM-Strukturen ist es, dass keine elektrische Formierung notwendig ist. Der Widerstandsschaltmechnismus wird durch das Modell einer variierten Schottky-Barriere erklärt. Dabei dienen Sauerstoff-Vakanzen im BFO als beweglichen Donatoren, die unter der Wirkung eines elektrischen Schreibspannungspulses nichtflüchtig umverteilt werden und die Schottky-Barriere des Bottom-Metallkontaktes ändern. Dabei spielen die während der Herstellung von BFO substitutionell eingebaute Ti-Donatoren in der Nähe des Bottom-Metallkontaktes eine wesentliche Rolle. Die Ti-Donatoren fangen Sauerstoff-Vakanzen beim Anlegen eines positiven elektrischen Schreibspannungspulses ein oder lassen diese beim Anlegen eines negativen elektrischen Schreibspannungspules wieder frei. Es wurde gezeigt, dass die Ti-Donatoren auch durch Ti-Implantation der Bottom-Elektrode in das System eingebracht werden können. MIM-Strukturen mit BiFeO 3 /Ti:BiFeO 3 (BFO/BFTO) Zweischichten weisen substitutionell eingebaute Ti-Donatoren sowohl nahe der Bottom-Elektrode als auch nahe der Top-Elektrode auf. Sie zeigen nichtflüchtiges, komplementäres Widerstandsschalten mit einer komplementär variierbaren Schottky-Barriere an der Bottom-Elektrode und an der Top-Elektrode ohne elektrische Formierung. Der Widerstand der BFO/BFTO-MIM-Strukturen hängt nicht nur von der Schreibspannung, sondern auch von der Polarität der Lesespannung ab. Für die rekonfigurierbaren logischen Anwendungen kann die Polarität der Lesespannung als zusätzliche Logikvariable verwendet werden. Damit gelingt die Programmierung und Speicherung aller 16 Booleschen Logik-Funktionen mit drei logischen Zyklen in dieselbe BFTO/BFO MIM-Struktur.

This study aims to explore how individuals who are operating Swedish elite football clubs manage the tension between non-profit and commercial logics, and whether organizational form is important when managing them. The respondents in this study are individuals with positions at the very highest organizational level, and predetermined themes that concern the tension within Swedish elite football were used in the design of the interview guide. The results were then analysed from a new institutional perspective. The outcome showed that elite football clubs tend to use similar strategies when managing the logics regardless of organizational form. / Denna studie ämnar undersöka hur individer som är verksamma inom svenska elitfotbollsföreningar hanterar spänningen mellan ideella och kommersiella logiker och om organisationsform har betydelse för hanteringen av dem. Respondenterna i denna studie är individer med befattningar på allra högsta organisatoriska nivå och förutbestämda teman som berör spänningen inom svensk elitfotboll användes vid utformandet av intervjuguiden. Resultaten analyserades sedan ur ett nyinstitutionellt perspektiv. Utfallet visade att elitfotbollsföreningar tenderar att använda likartade strategier vid hanteringen av logikerna oberoende av organisationsform.

Diese Arbeit leistet Beiträge zu drei Gebieten der deskriptiven Komplexitätstheorie. Zunächst adaptieren wir einen repräsentationsinvarianten Graphkanonisierungsalgorithmus mit einfach exponentieller Laufzeit von Corneil und Goldberg (1984) und folgern, dass die Logik "Choiceless Polynomial Time with Counting" auf Strukturen, deren Relationen höchstens Stelligkeit 2 haben, gerade die Polynomialzeit-Eigenschaften (PTIME) von Fragmenten logarithmischer Größe charakterisiert. Der zweite Beitrag untersucht die deskriptive Komplexität von PTIME-Berechnungen auf eingeschränkten Graphklassen. Wir stellen eine neuartige Normalform von Intervallgraphen vor, die sich in Fixpunktlogik mit Zählen (FP+C) definieren lässt, was bedeutet, dass FP+C auf dieser Graphklasse PTIME charakterisiert. Wir adaptieren außerdem unsere Methoden, um einen kanonischen Beschriftungsalgorithmus für Intervallgraphen zu erhalten, der sich mit logarithmischer Platzbeschränkung (LOGSPACE) berechnen lässt. Im dritten Teil der Arbeit beschäftigt uns die ungelöste Frage, ob es eine Logik gibt, die alle Polynomialzeit-Berechnungen charakterisiert. Wir führen eine Reihe von Ranglogiken ein, die die Fähigkeit besitzen, den Rang von Matrizen über Primkörpern zu berechnen. Wir zeigen, dass diese Ergänzung um lineare Algebra robuste Logiken hervor bringt, deren Ausdrucksstärke die von FP+C übertrifft. Außerdem beweisen wir, dass Ranglogiken strikt an Ausdrucksstärke gewinnen, wenn wir die Zahl an Variablen erhöhen, die die betrachteten Matrizen indizieren. Dann bauen wir eine Brücke zur klassischen Komplexitätstheorie, indem wir über geordneten Strukturen eine Reihe von Komplexitätsklassen zwischen LOGSPACE und PTIME durch Ranglogiken charakterisieren. Die Arbeit etabliert die stärkste der Ranglogiken als Kandidat für die Charakterisierung von PTIME und legt nahe, dass Ranglogiken genauer erforscht werden müssen, um weitere Fortschritte im Hinblick auf eine Logik für Polynomialzeit zu erzielen. / This thesis is making contributions to three strands of descriptive complexity theory. First, we adapt a representation-invariant, singly exponential-time graph canonization algorithm of Corneil and Goldberg (1984) and conclude that on structures whose relations are of arity at most 2, the logic "Choiceless Polynomial Time with Counting" precisely characterizes the polynomial-time (PTIME) properties of logarithmic-size fragments. The second contribution investigates the descriptive complexity of PTIME computations on restricted classes of graphs. We present a novel canonical form for the class of interval graphs which is definable in fixed-point logic with counting (FP+C), which shows that FP+C captures PTIME on this graph class. We also adapt our methods to obtain a canonical labeling algorithm for interval graphs which is computable in logarithmic space (LOGSPACE). The final part of this thesis takes aim at the open question whether there exists a logic which generally captures polynomial-time computations. We introduce a variety of rank logics with the ability to compute the ranks of matrices over (finite) prime fields. We argue that this introduction of linear algebra results in robust logics whose expressiveness surpasses that of FP+C. Additionally, we establish that rank logics strictly gain in expressiveness when increasing the number of variables that index the matrices we consider. Then we establish a direct connection to standard complexity theory by showing that in the presence of orders, a variety of complexity classes between LOGSPACE and PTIME can be characterized by suitable rank logics. Our exposition provides evidence that rank logics are a natural object to study and establishes the most expressive of our rank logics as a viable candidate for capturing PTIME, suggesting that rank logics need to be better understood if progress is to be made towards a logic for polynomial time.

Alors que les outils de gestion envahissent les organisations, nous en savons encore très peu sur la manière dont ils agissent sur les habitudes de penser, sur les façons de faire et sur les comportements.Cette thèse s'intéresse au rôle des progiciels CRM dans la construction des représentations et des pratiques de la relation client. Ces progiciels sont étudiés à deux niveaux: celui de l'espace professionnel des Directeurs commerciaux et celui d'une organisation. Tout d'abord, à partir de l'analyse, entre 1990 et 2009, d'une revue professionnelle destinée aux Directeurs commerciaux, nous montrons l'institutionnalisation des progiciels CRM et que cette institutionnalisation s'est accompagnée d'un déplacement des représentations relatives à ce qui est considéré comme une "bonne" gestion de la relation client. Parallèlement, nous avons mené une étude de cas en profondeur sur dix ans, rendant compte de la mise en oeuvre et de l'utilisation d'un progiciel CRM particulier. Nous montrons que la mise en oeuvre d'un progiciel CRM requiert un processus de traduction continu. Puis, nous mettons en évidence plusieurs transformations des pratiques dont certaines n'étaient pas attendues. Les transformations touchent la connaissance client et son partage, ainsi que les modes de contrôle à l'oeuvre dans l'organisation. Au-delà des transformations des pratiques en matière de contrôle hiérarchique, le progiciel CRM a notamment favorisé la mise en place de deux nouveaux modes de contrôle: un contrôle latéral (entre pairs) et un contrôle transversal (entre fonctions). Notre recherche s'inscrit dans la lignée des travaux qui considèrent que les outils de gestion, et plus globalement les artefacts, méritent qu'on leur accorde une attention plus grande. Nous illustrons plus largement dans ce travail l'intérêt d'aborder les processus organisationnels en prenant au sérieux les objets techniques indissociables de l'action. En les prenant comme points d'entrée, il est possible de documenter des phénomènes jusqu'alors peu explorés / Though management tools are more and more present in organizations, little is known on how they act on mindsets, on habits and on behaviours.This dissertation focuses on the role of CRM software packages in the construction of customer relationship representations and practices. These software packages were studied at two different levels: the sales director community and an organization. First of all, a professional journal analysis between 1990 and 2009 was conducted. The results show that CRM software packages were institutionalized and that this institutionalization comes with a shift in the representations of what is considered as "good" customer relationship management. Then, a ten year in-depth case study of the implementation and the use of a CRM software package was conducted.The results show that the implementation of a CRM software package requires a continuous translation process. They also highlight some changes in practices, of which some are unintended. The changes are related to customer knowledge, its sharing and the modes of control inside the firm. Beyond changes in hierarchical control, the CRM software package leads to the implementation of two new modes of control: a lateral control(between peers) and a transversal control (between functions). This research is in line with the literature that considers that more attention has to be paid to management tools, and more generally to artefacts. We illustrate more broadly in this dissertation the interest of addressing organizational processes by taking seriously the technical objects indissociable from action. Taking them as a starting point for research could be a mean to inform currently underexplored phenomena

Le problème de séparation pour une classe de langages S est le suivant : étant donnés deux langages L1 et L2, existe-t-il un langage appartenant à S qui contient L1, en étant disjoint de L2 ? Si les langages à séparer sont des langages réguliers, le problème de séparation pour la classe S est plus général que le problème de l'appartenance à cette classe, et nous fournit des informations plus détaillées sur la classe. Ce problème de séparation apparaît dans un contexte algébrique sous la forme des parties ponctuelles, et dans un contexte profini sous la forme d'un problème de séparation topologique. Pour quelques classes de langages spécifiques, ce problème a été étudié en utilisant des méthodes profondes de la théorie des semigroupes profinis.Dans cette thèse, on s'intéresse, dans un premier temps, à la décidabilité de ce problème pour plusieurs sous-classes des langages réguliers. Dans un second temps, on s'intéresse à obtenir un langage séparateur, s'il existe, ainsi qu'à la complexité de ces problèmes.Nous établissons une approche générique pour prouver que le problème de séparation est décidable pour une classe de langages donnée. En utilisant cette approche, nous obtenons la décidabilité du problème de séparation pour les langages testables par morceaux, les langages non-ambigus, les langages localement testables, et les langages localement testables à seuil. Ces classes correspondent à des fragments de la logique du premier ordre, et sont parmi lesclasses de langages réguliers les plus étudiées. De plus, cette approche donne une description d'un langage séparateur, pourvu qu'il existe. / The separation problem, for a class S of languages, is the following: given two input languages, does there exist a language in S that contains the first language and that is disjoint from the second langage ?For regular input languages, the separation problem for a class S subsumes the classical membership problem for this class, and provides more detailed information about the class. This separation problem first emerged in an algebraic context in the form of pointlike sets, and in a profinite context as a topological separation problem. These problems have been studied for specific classes of languages, using involved techniques from the theory of profinite semigroups.In this thesis, we are not only interested in showing the decidability of the separation problem for several subclasses of the regular languages, but also in constructing a separating language, if it exists, and in the complexity of these problems.We provide a generic approach, based on combinatorial arguments, to proving the decidability of this problem for a given class. Using this approach, we prove that the separation problem is decidable for the classes of piecewise testable languages, unambiguous languages, and locally (threshold) testable languages. These classes are defined by different fragments of first-order logic, and are among the most studied classes of regular languages. Furthermore, our approach yields a description of a separating language, in case it exists.

Information and communication systems enter an increasing number of areas of daily lives. Our reliance and dependence on the functioning of such systems is rapidly growing together with the costs and the impact of system failures. At the same time the complexity of hardware and software systems extends to new limits as modern hardware architectures become more and more parallel, dynamic and heterogenous. These trends demand for a closer integration of formal methods and system engineering to show the correctness of complex systems within the design phase of large projects. The goal of this thesis is to introduce a formal holistic approach for modeling, analysis and synthesis of parallel systems that potentially addresses complex system behavior at any layer of the hardware/software stack. Due to the complexity of modern hardware and software systems, we aim to have a hierarchical modeling framework that allows to specify the behavior of a parallel system at various levels of abstraction and that facilitates designing complex systems in an iterative refinement procedure, in which more detailed behavior is added successively to the system description. In this context, the major challenge is to provide modeling formalisms that are expressive enough to address all of the above issues and are at the same time amenable to the application of formal methods for proving that the system behavior conforms to its specification. In particular, we are interested in specification formalisms that allow to apply formal verification techniques such that the underlying model checking problems are still decidable within reasonable time and space bounds. The presented work relies on an exogenous modeling approach that allows a clear separation of coordination and computation and provides an operational semantic model where formal methods such as model checking are well suited and applicable. The channel-based exogenous coordination language Reo is used as modeling formalism as it supports hierarchical modeling in an iterative top-down refinement procedure. It facilitates reusability, exchangeability, and heterogeneity of components and forms the basis to apply formal verification methods. At the same time Reo has a clear formal semantics based on automata, which serve as foundation to apply formal methods such as model checking. In this thesis new modeling languages are presented that allow specifying complex systems in terms of Reo and automata models which yield the basis for a holistic approach on modeling, verification and synthesis of parallel systems. The second main contribution of this thesis are tailored branching-time and alternating time temporal logics as well as corresponding model checking algorithms. The thesis includes results on the theoretical complexity of the underlying model checking problems as well as practical results. For the latter the presented approach has been implemented in the symbolic verification tool set Vereofy. The implementation within Vereofy and evaluation of the branching-time and alternating-time model checker is the third main contribution of this thesis.

The modal satisfiability problem has to date been solved using either a specifically designed algorithm, or by translating the modal logic formula into a different class of problem, such as a first-order logic, a propositional satisfiability problem or a constraint satisfaction problem. These approaches and the solvers developed to support them are surveyed and a synthesis thereof is presented. The translation of a modal K formula into a constraint satisfaction problem, as developed by Brand et al. [18], is further enhanced. The modal formula, which must be in conjunctive normal form, is translated into layered propositional formulae. Each of these layers is translated into a constraint satisfaction problem and solved using the constraint solver ECLiPSe. I extend this translation to deal with reflexive and transitive accessibility relations, thereby providing for the modal logics KT and S4. Two of the difficulties that arise when these accessibility relations are added are that the resultant formula increases considerably in complexity, and that it is no longer in conjunctive normal form (CNF). I eliminate the need for the conversion of the formula to CNF and deal instead with formulae that are in negation normal form (NNF). I apply a number of enhancements to the formula at each modal layer before it is translated into a constraint satisfaction problem. These include extensive simplification, the assignment of a single value to propositional variables that occur only positively or only negatively, and caching the status of the formula at each node of the search tree. All of these significantly prune the search space. The final results I achieve compare favorably with those obtained by other solvers. / Computing / M.Sc. (Computer Science)