Aim: The purpose of this paper is to investigate how Södertörn University may build a stronger brand through marketing communications. The paper discussed each stage of the buying process. With models like these it is possible to measure the number of consumers who occupy the different stages. Method: The data was collected in a non-random convenience selection at the Stockholm fair for higher education with 21 000 visitors. I used a survey questionnaire. The number of respondents was 409 respondents. My method of investigation is quantitative. It is measurable so that communication goals can be set. In order to build a stronger brand I analyzed prospective students and their awareness of Södertörn University. The study has a positivistic view and a deductive approach. Result & Conclusions: My study shows that Södertörn University should use marketing communication strategically by using the models. At the cognitive level the most important is to raise brand awareness. Total knowledge is 52% in Stockholm County which is too low. An increase is fatal to raise the number of applicants. At the affective level they have to increase brand attitude. At the Behavioural level they need to increase brand purchase intention and facilitate purchase. Suggestions for future research: It would be interesting to use other models of consumer responses too. Next step could be to make interviews with students to be to study how they first got to know the name, and what has affected them in order to choose or not to choose the university. Contribution of the thesis: The thesis has actually contributed a lot to Södertörn University. I have used the collected data to make a marketing plan. We now have worked a lot with awareness and seen a great increase in applications.

This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node to be covered by repeatedly applying the covering rule. In the second part, we provide some results on the packing of Steiner trees. In the Propagation problem we are given a graph $G$ and the goal is to find a minimum-sized set of nodes $S$ that covers all of the nodes, where a node $v$ is covered if (1) $v$ is in $S$, or (2) $v$ has a neighbor $u$ such that $u$ and all of its neighbors except $v$ are covered. Rule (2) is called the propagation rule, and it is applied iteratively. Throughout, we use $n$ to denote the number of nodes in the input graph. We prove that the path-width parameter is a lower bound for the optimal value. We show that the Propagation problem is NP-hard in planar weighted graphs. We prove that it is NP-hard to approximate the optimal value to within a factor of $2^{\log^{1-\epsilon}{n}}$ in weighted (general) graphs. The second problem that we study is the Power Dominating Set problem. This problem has two covering rules. The first rule is the same as the domination rule as in the Dominating Set problem, and the second rule is the same propagation rule as in the Propagation problem. We show that it is hard to approximate the optimal value to within a factor of $2^{\log^{1-\epsilon}{n}}$ in general graphs. We design and analyze an approximation algorithm with a performance guarantee of $O(\sqrt{n})$ on planar graphs. We formulate a common generalization of the above two problems called the General Propagation problem. We reformulate this general problem as an orientation problem, and based on this reformulation we design a dynamic programming algorithm. The algorithm runs in linear time when the graph has tree-width $O(1)$. Motivated by applications, we introduce a restricted version of the problem that we call the $\ell$-round General Propagation problem. We give a PTAS for the $\ell$-round General Propagation problem on planar graphs, for small values of $\ell$. Our dynamic programming algorithms and the PTAS can be extended to other problems in networks with similar propagation rules. As an example we discuss the extension of our results to the Target Set Selection problem in the threshold model of the diffusion processes. In the second part of the thesis, we focus on the Steiner Tree Packing problem. In this problem, we are given a graph $G$ and a subset of terminal nodes $R\subseteq V(G)$. The goal in this problem is to find a maximum cardinality set of disjoint trees that each spans $R$, that is, each of the trees should contain all terminal nodes. In the edge-disjoint version of this problem, the trees have to be edge disjoint. In the element-disjoint version, the trees have to be node disjoint on non-terminal nodes and edge-disjoint on edges adjacent to terminals. We show that both problems are NP-hard when there are only $3$ terminals. Our main focus is on planar instances of these problems. We show that the edge-disjoint version of the problem is NP-hard even in planar graphs with $3$ terminals on the same face of the embedding. Next, we design an algorithm that achieves an approximation guarantee of $\frac{1}{2}-\frac{1}{k}$, given a planar graph that is $k$ element-connected on the terminals; in fact, given such a graph the algorithm returns $k/2-1$ element-disjoint Steiner trees. Using this algorithm we get an approximation algorithm with guarantee of (almost) $4$ for the edge-disjoint version of the problem in planar graphs. We also show that the natural LP relaxation of the edge-disjoint Steiner Tree Packing problem has an integrality ratio of $2-\epsilon$ in planar graphs.

This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node to be covered by repeatedly applying the covering rule. In the second part, we provide some results on the packing of Steiner trees. In the Propagation problem we are given a graph $G$ and the goal is to find a minimum-sized set of nodes $S$ that covers all of the nodes, where a node $v$ is covered if (1) $v$ is in $S$, or (2) $v$ has a neighbor $u$ such that $u$ and all of its neighbors except $v$ are covered. Rule (2) is called the propagation rule, and it is applied iteratively. Throughout, we use $n$ to denote the number of nodes in the input graph. We prove that the path-width parameter is a lower bound for the optimal value. We show that the Propagation problem is NP-hard in planar weighted graphs. We prove that it is NP-hard to approximate the optimal value to within a factor of $2^{\log^{1-\epsilon}{n}}$ in weighted (general) graphs. The second problem that we study is the Power Dominating Set problem. This problem has two covering rules. The first rule is the same as the domination rule as in the Dominating Set problem, and the second rule is the same propagation rule as in the Propagation problem. We show that it is hard to approximate the optimal value to within a factor of $2^{\log^{1-\epsilon}{n}}$ in general graphs. We design and analyze an approximation algorithm with a performance guarantee of $O(\sqrt{n})$ on planar graphs. We formulate a common generalization of the above two problems called the General Propagation problem. We reformulate this general problem as an orientation problem, and based on this reformulation we design a dynamic programming algorithm. The algorithm runs in linear time when the graph has tree-width $O(1)$. Motivated by applications, we introduce a restricted version of the problem that we call the $\ell$-round General Propagation problem. We give a PTAS for the $\ell$-round General Propagation problem on planar graphs, for small values of $\ell$. Our dynamic programming algorithms and the PTAS can be extended to other problems in networks with similar propagation rules. As an example we discuss the extension of our results to the Target Set Selection problem in the threshold model of the diffusion processes. In the second part of the thesis, we focus on the Steiner Tree Packing problem. In this problem, we are given a graph $G$ and a subset of terminal nodes $R\subseteq V(G)$. The goal in this problem is to find a maximum cardinality set of disjoint trees that each spans $R$, that is, each of the trees should contain all terminal nodes. In the edge-disjoint version of this problem, the trees have to be edge disjoint. In the element-disjoint version, the trees have to be node disjoint on non-terminal nodes and edge-disjoint on edges adjacent to terminals. We show that both problems are NP-hard when there are only $3$ terminals. Our main focus is on planar instances of these problems. We show that the edge-disjoint version of the problem is NP-hard even in planar graphs with $3$ terminals on the same face of the embedding. Next, we design an algorithm that achieves an approximation guarantee of $\frac{1}{2}-\frac{1}{k}$, given a planar graph that is $k$ element-connected on the terminals; in fact, given such a graph the algorithm returns $k/2-1$ element-disjoint Steiner trees. Using this algorithm we get an approximation algorithm with guarantee of (almost) $4$ for the edge-disjoint version of the problem in planar graphs. We also show that the natural LP relaxation of the edge-disjoint Steiner Tree Packing problem has an integrality ratio of $2-\epsilon$ in planar graphs.

The Steiner Tree problem is one of the most popular graph problems and has many application areas. The rectilinear version of this problem, introduced by Hanan, has taken special attention since it addresses a fundamental matter in &ldquo / Physical Design&rdquo / phase of the Very Large Scale Integrated (VLSI) Computer Aided Design (CAD) process. The Rectilinear Steiner Tree Problem asks for a minimum length tree that interconnects a given set of points by only horizontal and vertical line segments, enabling the use of extra points. There are various exact algorithms. However the problem is NP-complete hence approximation algorithms have to be used especially for large instances. In this thesis work, first a survey on heuristics for the Rectilinear Steiner Tree Problem is conducted and then two recently developed successful algorithms, BGA by Kahng et. al. and RST by Zhou have been studied and investigated deeply. Both algorithms have subproblems, most of which have individual backgrounds in literature. After an analysis of BGA and RST, the thesis proposes a modification on RST, which leads to a faster and non-recursive version. The efficiency of the modified algorithm has been validated by computational tests using both random and VLSI benchmark instances. A partially parallelized version of the modified algorithm is also proposed for distributed computing environments. It is implemented using MPI (message passing interface) middleware and the results of comparative tests conducted on a cluster of workstations are presented. The proposed distributed algorithm has also proved to be promising especially for large problem instances.

Scholarship on Dada and Surrealism has established that psychology was a major intellectual source for artists in both groups. However, a burgeoning amount of recent work in both the history of art and of science indicates that types of psychology other than psychoanalysis permeated the historical context of the avant-garde. In the late nineteenth and early twentieth century, physiological psychology, for example, was the dominant science of the body and mind, which grounded psychic phenomena in structures of conduction in the nervous system. Modern artists saw within this discourse a fascinating and new theory of experience. In my selective history of the avant-garde’s reception and response to physiological psychology, I will argue that artists worked within and partially according to the basic tenets of this discourse, but that they reshaped its superstructural projections away from formations and taxonomies of normalcy in consciousness and action. / text

Målet är att få en bättre förståelse för hur det abstrakta måleriet uppkommit och för att göra detta möjligt har jag valt att utgå ifrån en av de abstrakta pionjärerna, Piet Mondrian. I undersökningen finns ett fokus på att ta reda på vilka hans inspirationskällor var och hur de återspeglar sig i hans konst. En diskussion och bildanalys förs kring ett antal av Mondrians målningar samt ett par jämförelser görs med konstnären Toorop. Det finns en kortare förklaring av neoplasticismen, teosofin och en sammanfattning av teosofins roll för de abstrakta pionjärerna. Det jag kommit fram till är att teosofin hade en stor betydelse för Mondrian, men inte lika stor betydelse som personerna som förmedlade den och som kom att bli inspirationskällor för honom. Enligt mig är den mest betydande målningen Evolution från tidigt 1900-tal. Under denna tid sker mycket i Mondrians privata och professionella liv. I målningen kan vi utläsa både inspirationskällor och teknik. Det som betydde mest för Mondrian var färgen (före formen) samt de delar ur teosofin som han plockade efter att ha låtit sig inspireras av Toorop, Steiner och Schoenmaeker.

Random graph processes are most often used to investigate theoretical questions about random graphs. A randomised algorithm can be defined specifically for the purpose of finding some structure in a graph, such as a matching, a colouring or a particular kind of sub graph. Properties of the related random graph process then suggest properties, or bounds on properties, of the structure. In this thesis, we use a random graph process to analyse a particular load balancing algorithm from theoretical computer science. By doing so, we demonstrate that random graph processes may also be used to analyse other algorithms and systems of a random nature, from areas such as computer science, telecommunications and other areas of engineering and mathematics. Moreover, this approach can lead to theoretical results on the performance of algorithms that are difficult to obtain by other methods. In the course of our analysis we are also led to some results of the first kind, relating to the structure of the random graph. / The particular algorithm that we analyse is a randomised algorithm for an off-line load balancing problem with two choices. The load balancing algorithm, in an initial stage, mirrors an algorithm which finds the k-core of a graph. This latter algorithm and the related random graph process have been previously analysed by Pittel, Spencer and Wormald, using a differential equation method, to determine the thresholds for the existence of a k-core in a random graph. We modify their approach by using a random pseudograph model due to Bollobas and Frieze, and Chvatal, in place of the uniform random graph. This makes the analysis somewhat simpler, and leads to a shortened derivation of the thresholds and other properties of k-cores.(For complete abstract open document)

Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.

Made available in DSpace on 2014-12-17T15:48:12Z (GMT). No. of bitstreams: 1 CristineCS.pdf: 714473 bytes, checksum: 61f78bdfcd48bd6e64e25178e846e81b (MD5) Previous issue date: 2007-02-08 / Este trabalho apresenta um algoritmo transgen?tico h?brido para a solu??o de um Problema de Configura??o de uma Rede de Distribui??o de G?s Natural. O problema da configura??o dessas redes requer a defini??o de um tra?ado por onde os dutos devem ser colocados para atender aos clientes. ? estudada neste trabalho uma maneira de conectar os clientes em uma rede com arquitetura em forma de ?rvore. O objetivo ? minimizar o custo de constru??o da rede, mesmo que para isso alguns clientes que n?o proporcionam lucros deixem de ser atendidos. Esse problema pode ser formulado computacionalmente atrav?s do Problema de Steiner com Pr?mios. Este ? um problema de otimiza??o combinat?ria da classe dos NP?rduos. Este trabalho apresenta um algoritmo heur?stico para a solu??o do problema. A abordagem utilizada ? chamada de Algoritmos Transgen?ticos, que se enquadram na categoria dos algoritmos evolucion?rios. Para a gera??o de solu??es inicias ? utilizado um algoritmo primaldual, e pathrelinking ? usado como intensificador

Title: Parameterized Complexity Author: Ondřej Suchý Department: Department of Applied Mathematics Advisor: Prof. RNDr. Jan Kratochvíl, CSc. Advisor's e-mail address: honza@kam.mff.cuni.cz Abstract: This thesis deals with the parameterized complexity of NP-hard graph problems. We explore the complexity of the problems in various scenarios, with respect to miscellaneous parameters and their combina- tions. Our aim is rather to classify in this multivariate manner whether the particular parameters make the problem fixed-parameter tractable or intractable than to present the algorithm achieving the best running time. In the questions we study typically the first-choice parameter is unsuccessful, in which case we propose to use less standard ones. The first family of problems investigated provides a common general- ization of many well known and studied domination and independence problems. Here we suggest using the dual parameterization and show that, in contrast to the standard solution-size, it can confine the in- evitable combinatorial explosion. Further studied problems are ana- logues of the Steiner problem in directed graphs. Here the parameter- ization by the number of terminals to be connected seems to be previ- ously unexplored in the directed setting. Unfortunately, the problems are shown to be...