No description available.

Growing issues such as climate crises, social injustice and neglection of basic human rights have created a new type of consumption, namely ethical consumption. Ethical consumption was initially mainly concerned for environmental issues but has in later years starting to include a variety of pressing issues. Ethical consumption was also initially mainly connected to groups of extremists, but with the increasing availability of ethical products in mainstream outlets, ethical consumption has shifted to be a mainstream consumer game. Mainstream ethical consumption has largely been neglected in previous research where the field is lacking knowledge in form of qualitative behavioral data. Departing from the gap, this study will mainly focus on exploring the motives for ethical consumption in the mainstream consumer segment. We will examine several driving forces in form of altruistic-based motives, egoistic-based motives, and non-value-based motives. However, in order to give this an additional dimension we also want to examine the level of morality of ethical consumption by using five ethical theories. This approach has been overlooked in previous ethical consumption research and it will question the basic assumption that ethical consumption is the morally correct thing to do. Therefore, the purpose of this study is to explore the motivational factors for ethical consumption and through the lens of ethical theories examine the level of morality of this behavior. In order to fulfill this purpose we have conducted a qualitative study within the context of organic groceries in the Swedish market. Organic groceries is a branch of ethical consumption that few studies has examined before, and that applies especially to the Swedish market. 14 mainstream consumers have been interviewed were all of these were frequent buyers of organic groceries. The interviews were conducted in a semi-structured fashion which was then analyzed by the use of thematic analysis. Furthermore, the study was guided by an exploratory inductive approach where subjectivity played a significant part. The results show that ethical consumption is driven by altruistic-based motives in form of social justice, where consumer want their consumption to benefit other. However, it is far from the only motive because ethical consumers are equally driven by egoistic motives. The result show that consumers are driven strongly by the sense of self- satisfaction created by the force of social norms, health and wellbeing, and product quality. This duality of motives creates a paradoxical tension in form of a win-win situation where the consumers strive for both the benefit of self as well as the benefit of others. Furthermore, ethical consumption is driven by habitual behavior where the consumers rely much on mental shortcuts in their purchases. Consumers are also not well- informed about ethical products and labels and therefore rely heavily on mythical benefits. In addition, when examining the level of morality of ethical consumption we can conclude that it is on level between mediocre to high. From a consequentialist and a non- consequentialist perspective the level of morality is fairly high, but from a character-based perspective the morality stumbles.

No description available.

Cette thèse réunit en trois articles mon intérêt éclectique pour la théorie des graphes. Le premier problème étudié est la conjecture de Erdos-Faber-Lovász: La réunion de k graphes complets distincts, ayant chacun k sommets, qui ont deux-à-deux au plus un sommet en commun peut être proprement coloriée en k couleurs. Cette conjecture se caractérise par le peu de résultats publiés. Nous prouvons qu’une nouvelle classe de graphes, construite de manière inductive, satisfait la conjecture. Le résultat consistera à présenter une classe qui ne présente pas les limitations courantes d’uniformité ou de régularité. Le deuxième problème considère une conjecture concernant la couverture des arêtes d’un graphe: Si G est un graphe simple avec alpha(G) = 2, alors le nombre minimum de cliques nécessaires pour couvrir l’ensemble des arêtes de G (noté ecc(G)) est au plus n, le nombre de sommets de G. La meilleure borne connue satisfaite par ecc(G) pour tous les graphes avec nombre d’indépendance de deux est le minimum de n + delta(G) et 2n − omega(racine (n log n)), où delta(G) est le plus petit nombre de voisins d’un sommet de G. Notre objectif a été d’obtenir la borne ecc(G) <= 3/2 n pour une classe de graphes la plus large possible. Un autre résultat associé à ce problème apporte la preuve de la conjecture pour une classe particulière de graphes: Soit G un graphe simple avec alpha(G) = 2. Si G a une arête dominante uv telle que G \ {u,v} est de diamètre 3, alors ecc(G) <= n. Le troisième problème étudie le jeu de policier et voleur sur un graphe. Presque toutes les études concernent les graphes statiques, et nous souhaitons explorer ce jeu sur les graphes dynamiques, dont les ensembles d’arêtes changent au cours du temps. Nowakowski et Winkler caractérisent les graphes statiques pour lesquels un unique policier peut toujours attraper le voleur, appellés cop-win, à l’aide d’une relation <= définie sur les sommets de ce graphe: Un graphe G est cop-win si et seulement si la relation <= définie sur ses sommets est triviale. Nous adaptons ce théorème aux graphes dynamiques. Notre démarche nous mène à une relation nous permettant de présenter une caractérisation des graphes dynamiques cop-win. Nous donnons ensuite des résultats plus spécifiques aux graphes périodiques. Nous indiquons aussi comment généraliser nos résultats pour k policiers et l voleurs en réduisant ce cas à celui d’un policier unique et un voleur unique. Un algorithme pour décider si, sur un graphe périodique donné, k policiers peuvent capturer l voleurs découle de notre caractérisation. / This thesis represents in three articles my eclectic interest for graph theory. The first problem is the conjecture of Erdos-Faber-Lovász: If k complete graphs, each having k vertices, have the property that every pair of distinct complete graphs have at most one vertex in common, then the vertices of the resulting graph can be properly coloured by using k colours. This conjecture is notable in that only a handful of classes of EFL graphs are proved to satisfy the conjecture. We prove that the Erdos-Faber-Lovász Conjecture holds for a new class of graphs, and we do so by an inductive argument. Furthermore, graphs in this class have no restrictions on the number of complete graphs to which a vertex belongs or on the number of vertices of a certain type that a complete graph must contain. The second problem addresses a conjecture concerning the covering of the edges of a graph: The minimal number of cliques necessary to cover all the edges of a simple graph G is denoted by ecc(G). If alpha(G) = 2, then ecc(G) <= n. The best known bound satisfied by ecc(G) for all the graphs with independence number two is the minimum of n + delta(G) and 2n − omega(square root (n log n)), where delta(G) is the smallest number of neighbours of a vertex in G. In this type of graph, all the vertices at distance two from a given vertex form a clique. Our approach is to extend all of these n cliques in order to cover the maximum possible number of edges. Unfortunately, there are graphs for which it’s impossible to cover all the edges with this method. However, we are able to use this approach to prove a bound of ecc(G) <= 3/2n for some newly studied infinite families of graphs. The third problem addresses the game of Cops and Robbers on a graph. Almost all the articles concern static graphs, and we would like to explore this game on dynamic graphs, the edge sets of which change as a function of time. Nowakowski and Winkler characterize static graphs for which a cop can always catch the robber, called cop-win graphs, by means of a relation <= defined on the vertices of such graphs: A graph G is cop-win if and only if the relation <= defined on its vertices is trivial. We adapt this theorem to dynamic graphs. Our approach leads to a relation, that allows us to present a characterization of cop-win dynamic graphs. We will then give more specific results for periodic graphs, and we will also indicate how to generalize our results to k cops and l robbers by reducing this case to one with a single cop and a single robber. An algorithm to decide whether on a given periodic graph k cops can catch l robbers follows from our characterization.

In recent years, microtransactions have become a norm for monetization and a standardbusiness model in free-to-play games. This is something that affects multiple individuals andhas caused quite a stir among players. Through this research, we want to gain anunderstanding of why some microtransaction types might be considered more acceptable thanothers. In addition, to gaining potential data that could possibly give us a look into the futureof the design of microtransactions. We have gathered our data by conducting online chatbased semi-structured interviews with current and former university students studying gamedesign at Uppsala University.The research found that game design students have a predominantly negative opinion aboutmost microtransactions, especially when they were affecting the gameplay, contrary to whenthey were not.

Réalisé avec le support financier du Conseil de recherches en sciences naturelles et en génie du Canada (CRSNG) et du Fonds de Recherche du Québec – Nature et technologies (FRQNT). / Ce mémoire étudie le jeu de policiers-voleur et contient trois articles, chacun portant sur une classe de graphes spécifique. Dans le premier chapitre, la notation et les définitions de base de la théorie de graphe qui nous serons utiles sont introduites. Bien que chaque article comporte une introduction citant les concepts et résultats pertinents, le premier chapitre de ce mémoire contient aussi une introduction générale au jeu de policiers-voleur et présente certains des résultats majeurs sur ce jeu. Le deuxième chapitre contient l’article écrit avec Seyyed Aliasghar Hosseini et Peter Bradshaw portant sur le jeu de policiers-voleurs sur les graphes de Cayley abéliens. Nous améliorons la borne supérieure sur le cop number de ces graphes en raffinant les méthodes utilisées précédemment par Hamidoune, Frankl et Bradshaw. Le troisième chapitre présente l’article concernant le cop number des graphes 2K2-libres. Plus précisément, il est prouvé que 2 policiers peuvent toujours capturer le voleur sur ces graphes, prouvant ainsi la conjecture de Sivaraman et Testa. Finalement, le quatrième chapitre est l’article écrit avec Samuel Yvon et porte sur les graphes qui ont cop number 4. Nous montrons que tous ces graphes ont au moins 19 sommets. En d’autres mots, 3 policiers peuvent toujours capturer le voleur sur tout graphe avec au plus 18 sommets, ce qui répond par la négative à une question de Andreae formulée en 1986. Un pan important de la preuve est faite par ordinateur; ce mémoire contient donc une annexe comprenant le code utilisé. / This thesis studies the game of cops and robbers and consists of three articles, each considering a specific class of graphs. In the first chapter, notation and basic definitions of graph theory are introduced. Al- though each article has an introduction citing the relevant concepts and results, the first chapter of this thesis also contains a general introduction to the game of cops and robbers and presents some of its major results. The second chapter contains the paper written with Seyyed Aliasghar Hosseini and Peter Bradshaw on the game of cops and robbers on abelian Cayley graphs. We improve the upper bound on the cop number of these graphs by refining the methods used previously by Hamidoune, Frankl and Bradshaw. The third chapter presents the paper concerning the cop number of 2K2-free graphs. More precisely, it is proved that 2 cops can always catch the robber on these graphs, proving a conjecture of Sivaraman and Testa. Finally, the fourth chapter is the paper written with Samuel Yvon which deals with graphs of cop number 4. We show that such graphs have at least 19 vertices. In other words, 3 cops can always catch the robber on any graph with at most 18 vertices, which answers in the negative a question by Andreae from 1986. An important part of the proof is by computer; this thesis thus has an appendix containing the code used.

The following diploma thesis deals with the management of asynchronous motor revolutions by a frequency converter MICROMASTER 440 via the programmable controller S7-200. At the beginning, I researched the company documentation of Siemens, which is the producer of the frequency converter and the programmable controller mentioned above. As my work proceeded, I also started to study the company documentation of Mitsubishi Electric, which produces the operating pannel. The first part of my thesis provides a general description of the stated devices and the second part deals with the solution of the task itself. My task was to design a way of communication between the converter and the controller. I chose a USS protocol via serial port RS-485. The operation of the controller was performed by using an operating terminal type GOT1000 which was connected to the controller. In summary, my diploma thesis primarily deals with the construction of an operating programme for the controller and with creating of a graphical control on the terminal. In the end, I evaluated the knowledge gained during the work on this subject and suggested further procedures.

In this thesis a Gaussian process regression (GPR) model and a Kalman filter (KF) model were developed and applied to a trajectory prediction problem. The main subject of the thesis is GPR, where the intended purpose of the KF is to compare it to the GPR model. The input data for the models consists of two noisy spherical angle coordinates of a moving target relative to a moving guided projectile. In order to perform trajectory predictions the models need to estimate the distance between the target and guided projectile since there are only two coordinates available and an estimation of three coordinates is desired. The distance estimation was done by a Low Speed Approximation. The trajectories investigated were harmonic-exponential, exponential-spiral and linear. The results showed issues with the hyperparameters of the GPR model which may be related to the preprocessing of the trajectory data. However, the GPR model did outperform the KF model when there was acceleration, despite the issues with the hyperparameters. The KF model outperformed the GPR model when the target trajectory behaved linearly. The results indicate that GPR has potential as a trajectory prediction algorithm. / I denna avhandling utvecklades och tillämpades en Gaussisk process regression (GPR)-modell och en Kalman Filter (KF)-modell på ett positionspredikteringsproblem. Huvudämnet för avhandlingen är GPR medan det avsedda syftet med KF är att jämföra den med GPR-modellen. Modellernas indata består av två brusiga sfäriska vinkelkoordinater av ett rörligt mål i förhållande till en styrd projektil. För att modellerna ska kunna utföra positionsprediktering så behöver avståndet mellan målet och den styrda projektilen skattas, eftersom det endast finns två tillgängliga koordinater och en uppskattning av tre koordinater önskas. Avståndsberäkningen gjordes baserat på ett antagande om att hastigheten för målet är liten relativt hastigheten för den styrda projektilen, i avhandlingen är denna approximation benämnd Low Speed Approximation. De undersökta banorna var harmonisk-exponentiell, exponentiell-spiral och linjär. Resultaten visade problem med hyperparametrarna för GPR-modellen, vilket kan vara relaterat till förbehandlingen av bandatan. Trots problem med hyperparametrarna så presterade GPR-modellen bättre än KF-modellen när det fanns acceleration. KF-modellen presterade bättre än GPR-modellen när målets bana betedde sig linjärt. Resultaten indikerar att GPR har potential som en algoritm för positionsprediktering.

<p>I och med friskolereformen i början på 1990-talet har förutsättningarna för skolor förändrats och konkurrensen hårdnat. Marknadsföring av skolor har blivit allt vanligare och vilket anseende skolan har är avgörande. Tidigare forskning har visat att nöjda anställda leder till att kunder blir tillfredställda och lojala, de som tar hand om sina anställda och agerar på deras idéer visar ett bättre resultat. Därför kan intern marknadsföring ses som ett verktyg för att hantera denna konkurrens.</p><p>Syftet med denna uppsats är att utifrån ledningens perspektiv få förståelse för och beskriva vilka faktorer inom skolbranschen som påverkar den interna kommunikationen och vilka förutsättningar dessa faktorer ger för intern marknadsföring. Studien har intagit ett Grounded Theory-inspirerat tillvägagångsätt och tillämpar intervjuer för att svara på syftet. Fem informanter i ledande befattningar på lika många grundskolor i Stockholm har medverkat.</p><p>Undersökningen har kommit fram till att faktorer som organsationens storlek och ålder har betydelse för hur den interna marknadsföringen fungerar, men också uppdragsgivarens och ledarens förhållningssätt gentemot sin personal är av vikt. Det finns goda ansatser för intern marknadsföring inom skolan, men ett medvetet arbete måste ske på alla organisatoriska nivåer och ett genuint kundfokus måste finnas genomgående, först då kan den interna marknadsföringen fungera som ett verktyg att hantera den förändrade konkurrensen.</p> / <p>With the reformation of the Swedish schoolsystem in the early 1990s, which allowed for private actors to operate schools, the conditions for schools have changed and competition has increased. Marketing of schools has become increasingly common and the reputation of schools has become crucial. Previous research has shown that employee satisfaction leads to satisfied and loyal customers, companys who take care of their employees and act on their ideas show better results. Therefore, internal marketing is seen as a tool to manage the changed conditions for competition. The purpose of this paper is to obtain understanding and describing from management's perspective the factors within the school sector that affect the internal communication and what conditions these factors provide for internal marketing. The study has adopted a Grounded Theory-inspired approach and applies interviews to answer the purpose. Five informants in senior positions in elementary schools in Stockholm participated. The investigation has concluded that factors as organizational size and age have a bearing on how the internal marketing work out, but also governement´s and principal´s attitudes towards staff is important. There are good possibilities for the internal marketing in elementary schools, but a deliberate work has to be done at all organizational levels and a keen customer focus must be held, only then can the internal marketing work as a tool to deal with the changing competition.</p>

I och med friskolereformen i början på 1990-talet har förutsättningarna för skolor förändrats och konkurrensen hårdnat. Marknadsföring av skolor har blivit allt vanligare och vilket anseende skolan har är avgörande. Tidigare forskning har visat att nöjda anställda leder till att kunder blir tillfredställda och lojala, de som tar hand om sina anställda och agerar på deras idéer visar ett bättre resultat. Därför kan intern marknadsföring ses som ett verktyg för att hantera denna konkurrens. Syftet med denna uppsats är att utifrån ledningens perspektiv få förståelse för och beskriva vilka faktorer inom skolbranschen som påverkar den interna kommunikationen och vilka förutsättningar dessa faktorer ger för intern marknadsföring. Studien har intagit ett Grounded Theory-inspirerat tillvägagångsätt och tillämpar intervjuer för att svara på syftet. Fem informanter i ledande befattningar på lika många grundskolor i Stockholm har medverkat. Undersökningen har kommit fram till att faktorer som organsationens storlek och ålder har betydelse för hur den interna marknadsföringen fungerar, men också uppdragsgivarens och ledarens förhållningssätt gentemot sin personal är av vikt. Det finns goda ansatser för intern marknadsföring inom skolan, men ett medvetet arbete måste ske på alla organisatoriska nivåer och ett genuint kundfokus måste finnas genomgående, först då kan den interna marknadsföringen fungera som ett verktyg att hantera den förändrade konkurrensen. / With the reformation of the Swedish schoolsystem in the early 1990s, which allowed for private actors to operate schools, the conditions for schools have changed and competition has increased. Marketing of schools has become increasingly common and the reputation of schools has become crucial. Previous research has shown that employee satisfaction leads to satisfied and loyal customers, companys who take care of their employees and act on their ideas show better results. Therefore, internal marketing is seen as a tool to manage the changed conditions for competition. The purpose of this paper is to obtain understanding and describing from management's perspective the factors within the school sector that affect the internal communication and what conditions these factors provide for internal marketing. The study has adopted a Grounded Theory-inspired approach and applies interviews to answer the purpose. Five informants in senior positions in elementary schools in Stockholm participated. The investigation has concluded that factors as organizational size and age have a bearing on how the internal marketing work out, but also governement´s and principal´s attitudes towards staff is important. There are good possibilities for the internal marketing in elementary schools, but a deliberate work has to be done at all organizational levels and a keen customer focus must be held, only then can the internal marketing work as a tool to deal with the changing competition.