We explore the role of cooperativity and large deviations on a set of fundamental non-equilibrium many-body systems. In the cooperative asymmetric exclusion process, particles hop to the right at a constant rate only when the right neighboring site is vacant and hop at a faster rate when the left neighbor is occupied. In this model, a host of new heterogeneous density profile evolutions arise, including inverted shock waves and continuous compression waves. Cooperativity also drives the growth of complex networks via preferential attachment, where well-connected nodes are more likely to attract future connections. We introduce the mechanism of hindered redirection and show that it leads to network evolution by sublinear preferential attachment. We further show that no local growth rule can recreate superlinear preferential attachment. We also introduce enhanced redirection and show that the rule leads to networks with three unusual properties: (i) many macrohubs -- nodes whose degree is a finite fraction of the number of nodes in the network, (ii) a non-extensive degree distribution, and (iii) large fluctuations between different realizations of the growth process. We next examine large deviations in the diffusive capture model, where N diffusing predators initially all located at L 'chase' a diffusing prey initially at x<L. The prey survives if it reaches a haven at the origin without meeting any predator. We reduce the stochastic movement of the many predators to a deterministic trajectory of a single effective predator. Using optimized Monte Carlo techniques, we simulate up to 10^500 predators to confirm our analytic prediction that the prey survival probability S ~ N^-z^2, where z=x/L. Last, we quantify `survival of the scarcer' in two-species competition. In this model, individuals of two distinct species reproduce and engage in both intra-species and inter-species competition. Here a well-mixed population typically reaches a quasi steady state. We show that in this quasi-steady state the situation may arise where species A is less abundant than B but rare fluctuations make it more likely that species B first becomes extinct.

Nous nous intéressons dans cette thèse à l'organisation des systèmes distribués dynamiquesde grande taille : ensembles de machines capables de communiquer entre elles et pouvant à toutinstant se connecter ou se déconnecter. Nous proposons de partitionner le système en groupesconnexes, appelés clusters. Afin d'organiser des réseaux de grande taille, nous construisons unestructure hiérarchique imbriquée dans laquelle les clusters d'un niveau sont regroupés au seinde clusters du niveau supérieur. Pour mener à bien ce processus, nous mettons en place desmécanismes permettant aux clusters d'être les noeuds d'un nouveau système distribué exécutantl'algorithme de notre choix. Cela nécessite en particulier des mécanismes assurant la cohérence decomportement pour le niveau supérieur au sein de chaque cluster. En permettant aux clusters deconstituer un nouveau système distribué exécutant notre algorithme de clustering, nous construisonsune hiérarchie de clusters par une approche ascendante. Nous démontrons cet algorithme endéfinissant formellement le système distribué des clusters, et en démontrant que chaque exécutionde notre algorithme induit sur ce système une exécution de l'algorithme de niveau supérieur. Celanous permet, en particulier, de démontrer par récurrence que nous calculons bien un clusteringhiérarchique imbriqué. Enfin, nous appliquons cette démarche à la résolution des collisions dansles réseaux de capteurs. Pour éviter ce phénomène, nous proposons de calculer un clusteringadapté du système, qui nous permet de calculer un planning organisant les communications ausein du réseau et garantissant que deux messages ne seront jamais émis simultanément dans laportée de communication de l'un des capteurs / To manage and handle large scale distributed dynamic distributed systems, constitutedby communicating devices that can connect or disconnect at any time, we propose to computeconnected subgraphs of the system, called clusters. We propose to compute a hierarchical structure,in which clusters of a level are grouped into clusters of the higher level. To achieve this goal,we introduce mechanisms that allow clusters to be the nodes of a distinct distributed system,that executes an algorithm. In particular, we need mechanisms to maintain the coherence of thebehavior among the nodes of a cluster regarding the higher level. By allowing clusters to be nodesof a distributed system that executes a clustering algorithm, we compute a nested hierarchicalclustering by a bottom-up approach. We formally define the distributed system of clusters, andprove that any execution of our algorithm induces an execution of the higher level algorithm onthe distributed system of clusters. Then, we prove by induction that our algorithm computes anested hierarchical clustering of the system. Last, we use this approach to solve a problem thatappears in sensor networks : collision. To avoid collisions, we propose to compute a clusteringof the system. This clustering is then used to compute a communication schedule in which twomessages cannot be sent at the same time in the range of a sensor

No description available.

No description available.

Locomotion, the ability to walk freely in virtual environments, is a problem with no standardized solution. Walk-in-Place is one strand of solutions in which the user’s physical movement creates forward movement in the virtual environment. This technique is particularly useful for navigation in smartphone-based virtual reality without location detection. However, current mobile implementations use gaze-directed steering which limits the user’s ability to simultaneously scan the environment, which can reduce maneuverability. Additionally, step detection is triggered by head movement which shakes the head-mounted display and can therefore create discomfort and motion sickness. Detached Walk-in-place (dWIP) uses an external gyroscope attached to the body, or held in the hand, to track the user’s body rotation. This detaches the walking direction from gaze direction and removes step detection from the head-mounted-display. In this paper, I present a study of two different dWIP solutions (Torso- and Hand-directed). Both solutions are tested and compared with an existing mobile walk-in-place solution. Performance, user preference and simulator sickness were measured as the participants had to navigate a curved track using each method. The result shows that both dWIP methods required less steps compared with the current WIP, but the torso-directed dWIP is slower compared to the other two. There was no significant difference in user preference or simulator sickness. Overall, dWIP was well received and shows great potential as a mobile VR locomotion method. / Möjligheten att röra sig fritt i virtuella miljöer är ett problem utan en standardiserad lösning. Walk-in-place är en gren av lösningar som innebär att användarens fysiska rörelse skapar framåtrörelse i den virtuella miljön. Den här typen av lösning är speciellt användbar i smartphone-baserade virtuella miljöer utan platsregistrering. Nuvarande walk-in-place implementationer för smartphones använder huvudriktningen för styrning, vilket begränsar användarens förmåga att röra sig och samtidigt överblicka omgivningen, något som kan begränsa manövreringsförmågan. Dessutom triggas stegdetektering av huvudrörelser vilket kan skaka om headsetet och bidra till obehag och illamående. Frikopplad Walk-in-Place (dWIP) använder ett externt gyroskop som sätts fast på kroppen, eller hålls i handen, för att registrera användarens kroppsrotation. Detta frikopplar gångriktningen från huvudriktningen och tar bort stegdetekteringen från headsetet. I den här artikeln presenterar jag en studie av två olika dWIP-lösningar (Kropp- och Handriktad). Båda lösningarna är testade och jämförda med en existerade Walk-in-Place lösning för smartphones. Prestation, preferens och illamående mättes. Studiens deltagare navigerade igenom en böjd bana där de använde alla lösningarna varsin gång. Resultatet visar att deltagarna tog sig igenom banorna på färre steg med båda dWIP-lösningarna jämfört med den nuvarande WIP-lösningen, men att det tog längre tid med kroppsriktad dWIP. Det var ingen signifikant skillnad mellan deltagarnas preferenser eller upplevda illamående. Sammanfattningsvis blev dWIP väl mottaget av deltagarna och visade på en stor potential som navigationsmetod för VR till smartphones.

No description available.

In recent years, there has been a significant development in high performance computing, driven by advances in hardware and software technology. The performance of the computers to the present has improved in accordance with Moore’s law, on the other hand, it seems to be reaching the limits in the near future. The quantum computers, which have the potential to greatly exceed the capabilities of the classical computers, have been the focus of intense researches. In the present study, we investigate the difference of the classical random walk and the quantum walk based on theoretical point of view and the implementation in the simulation, and seek the applicability of the quantum walk in the future. We provide the overview of the fundamental theory in the classical random walk and the quantum walk, and compare the differences of the features, based on the behaviors between the classical random walk and the quantum walk, and the probability distributions. Also, we implement the quantum walk using the Qiskit as the quantum simulator. The quantum circuit representing the quantum walk is mainly composed of the three parts, the coin operator, the shift operator, and the quantum measurement. The coin operator represent the coin flip in the quantum walk, where we use the Hadamard operator. The shift operator indicates the movement of the quantum walk according to the result of the coin operator. The quantum measurement is the process of extracting the quantum state of qubits. In one-dimensional quantum walk, we prepare four cases, as the difference of the number of qubits for the position from two to five qubits. In all cases, the successful implementation of the quantum walk has been seen with respect to the number of qubits and the difference of the initial state. We then extensively investigate the implementation of the two-dimensional quantum walk. In two-dimensional quantum walk, three cases are prepared in terms of the number of qubits for the position in each x and y coordinates, from two to four qubits. Although the complexity of the problem setting is much increased compared to the one-dimensional case, the success of the quantum walk implementation can be seen. We also see that the behavior of the quantum walk and the spread of the probability distribution strongly depends on the initial condition in terms of both the initial coin state and the initial position. The present study has shown the applicability of the quantum walk as the tool for solving the complex problems in a wide range of future applications. In concluding remarks, we offer conceivable perspectives and future prospects of the present study.

No description available.

No description available.

Högdalen—Rågsved experiences a breakpoint of change which brings the definition of the ideal city and who is included or excluded to the negotiation table. Conflictual commons are the spaces used as common resources which becomes actualized for contestation.  With organized movements and walking experiences, I explore conflicts over commons and look into actors involved, what understanding of space they act from, where maintenance responsibility is put and which scales is perceived as relevant.