Housing shortage is an issue many young adults have to face when moving to Umeå as students, as well as the never ending queues to rent a below average apartment or dorm in the outskirts of the city. Anyone who moves to Umeå to study, should be able to find a safe and adequate place to live in proximity to the university and city center; not only because students in themselves are a diverse and valuable part of the population and the city’s growth, but because housing is a basic necessity that needs to be fulfilled. How can architecture improve students’ lives in Umeå? This project is located at Hamrinsberget, an underused hill that functions as a powerful tool for students to gain restitution as they rise above the city. The nature surrounding the apartment building provides a peaceful and calm environment for studying. As this young population is put in a vulnerable social position when moving to a new city, possibly all by their lonesome, a strong community has been prioritized during the design process. Shared spaces consisting of study areas on each floor have been implemented, as well as central social areas where parties and dinners can take place. This was intended to make the residents not only feel welcome and safe, but to learn and develop under ideal conditions. This is how the future way of living as a student is introduced.

No description available.

No description available.

Time-dependent queueing models are important since most of real-life problems are time-dependent. We develop a numerical approximation algorithm for the mean, variance and higher-order moments of the number of entities in the system at time t for the Ph(t)/Ph(t)/s/c queueing model. This model can be thought as a reparameterization to the G(t)/GI(t)/s. Our approach is to partition the state space into known and identifiable structures, such as the M(t)/M(t)/s/c or M(t)/M(t)/1 queueing models. We then use the Polya-Eggenberger distribution to approximate certain unknown probabilities via a two-moment matching algorithm. We describe the necessary steps to validate the approximation and measure the accuracy of the model. / Master of Science

A deterministic change to a time-varying queueing model is described as either changing the number of entities, the queue capacity, or the number of servers in the system at selected times. We use a surrogate distribution for N(t), the number of entities in the system at time t, to approximate deterministic changes to the Ph(t)/Ph(t)/1/c and the Ph(t)/M(t)/s/c queueing models. We develop a solution technique to minimize the number of state probabilities to be approximated. / Master of Science

The Quality of Service (QoS) is in converged systems an important parameter. The dissertation thesis deals with research of QoS implementation into a newly developed network element. There was designed and implemented new protocol, based on the IP. The dissertation thesis deals with proposal of a new network element – the switch controlled by a neural network. During the research have been measured switches cross a performance classes. On the base of the measurement was designed the new four-port switch with switch fabric build on crossbar switch with an external control. The switch was designed with maximum QoS support. The switch fabric is controlled by the feedforward backpropagation neural network. The designed switch was modeled in the MATLAB and Simulink. The simulations prove that developed solution is functional.

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.

Some oil and gas companies are drilling and developing fields in the Arctic Ocean, which has an environment with sea ice called ice floes. These companies must protect their platforms from ice floe collisions. One proposal is to use a system that consists of autonomous underwater vehicles (AUVs) and docking stations. The AUVs measure the under-water topography of the ice floes, while the docking stations launch the AUVs and recharge their batteries. Given resource constraints, we optimize quantities and locations for the docking stations and the AUVs, as well as the AUV scheduling policies, in order to provide the maximum protection level for the platform. We first use an queueing approach to model the problem as a queueing system with abandonments, with the objective to minimize the abandonment probability. Both M/M/k+M and M/G/k+G queueing approximations are applied and we also develop a detailed simulation model based on the queueing approximation. In a complementary approach, we model the system using a multi-stage stochastic facility location problem in order to optimize the docking station locations, the AUV allocations, and the scheduling policies of the AUVs. A two-stage stochastic facility location problem and several efficient online scheduling heuristics are developed to provide lower bounds and upper bounds for the multi-stage model, and also to solve large-scale instances of the optimization model. Even though the model is motivated by an oil industry project, most of the modeling and optimization methods apply more broadly to any radial detection problems with queueing dynamics. / text

[pt] O principal objetivo desta dissertação é enquadrar o atendimento rodoviário dos terminais de contêineres em um nível de serviço aceitável e ajudar a quebrar o paradigma de ineficiência que acompanha estas instituições. Este trabalho apresenta um estudo sobre Teoria das Filas e sua aplicação no processo de entrada das carretas em um Terminal de Contêineres. Assim, será possível calcular o desempenho deste sistema para a demanda e serviço atual, e projetar seu desempenho para o estado futuro. Primeiramente serão definidas as características da fila atual, taxa de atendimento, taxa de chegada, quantidade de postos de atendimento e nível de serviço. Após esta etapa, será possível definir o número de postos de atendimento necessários para o nível de serviço desejado, baseando se nas previsões existentes de aumento de demanda e melhoria da taxa de atendimento. / [en] The main reason for this work is to fit container terminal road access service on acceptable level of service and help to solve the paradigm of inefficiency that follows these institutions. This paper presents a study about Queueing Theory and a case with container terminal road access. In this way it will be possible to calculate the actual performance for the present demand and service level, then project the future performance. First will be defined the actual characteristics such as service rate, arrival rate, server numbers and service level. Then, it will be possible to define the number of servers needed to achieve desirable service of level, based on demand forecast and service level improvements.

<p>The increasing usage of information technology in military affairs raises the need for robust high capacity radio networks. The network will be used to provide several different types of services, for example group calls and situation awareness services. All services have specific demands on packet delays and packet losses in order to be fully functional, and therefore there is a need for a Quality of Service (QoS) mechanism in the network. </p><p>In this master thesis we examine the possibility to provide a QoS mechanism in Ad Hoc networks by using priority queues. The study includes two different queuing schemes, namely fixed priority queuing and weighted fair queuing. The performance of the two queuing schemes are evaluated and compared with respect to the ability to provide differentiation in network delay, i.e., provide high priority traffic with lower delays than low priority traffic. The study is mainly done by simulations, but for fixed priority queuing we also derive a analytical approximation of the network delay. </p><p>Our simulations show that fixed priority queuing provides a sharp delay differentiation between service classes, while weighted fair queuing gives the ability to control the delay differentiation. One of those queuing schemes alone might not be the best solution for providing QoS, instead we suggest that a combination of them is used.</p>