Hospital costs and random demand

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Economics from the NOVA – School of Business and Economics

A random access MAC protocol for MPR satellite networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Identification and differentiation of Candida species from pediatric patients by random amplified polymorphic DNA

Thirty-four Candida isolates were analyzed by random amplified polymorphic DNA using the primer OPG-10:24 Candida albicans; 4 Candida tropicalis; 2 Candida parapsilosis; 2 Candida dubliniensis; 1 Candida glabrata and 1 Candida krusei. The UPGMA-Pearson correlation coefficient was used to calculate the genetic distance between the different Candida groupings. Samples were classified as identical (correlation of 100%); highly related samples (90%); moderately related samples (80%) and unrelated samples (< 70%). The results showed that the RAPD proposed was capable of classifying the isolates coherently (such that same species were in the same dendrogram), except for two isolates of Candida parapsilosis and the positive control (Netherlands, 1973), probably because they are now recognized as three different species. Concerning the only fluconazole-resistant Candida tropicalis isolate with a genotype that was different to the others, the data were insufficient to affirm that the only difference was the sensitivity to fluconazole. We concluded that the Random Amplified Polymorphic DNA proposed might be used to confirm Candida species identified by microbiological methods.

Do hospitals react to random demand pressure by early discharges?

This project tries to assess whether hospitals react to random demand pressure by discharging patients earlier than expected. As a matter of fact, combining an unpredictable demand for medical services with limited and, to some extent, fixed medical resources, generates strong incentives to discharge patients earlier than expected when demand is high − increasing the risk of readmission and decreasing the benefit from treatment. This work was conducted as a way to determine whether those incentives actually affect discharging decisions. Analysis of Portuguese hospitals data shows that hospital utilization levels at the time of admission, prior to the admission and post admission do have a negative impact over the length of stay in hospital, although this impact is quantitatively irrelevant. More than that, larger utilization levels have a positive impact over the probability of being discharged at certain days of the week, indicating that an early discharges problem may exist.

Random walk forecast of urban water in Iran under uncertainty

There are two significant reasons for the uncertainties of water demand. On one hand, an evolving technological world is plagued with accelerated change in lifestyles and consumption patterns; and on the other hand, intensifying climate change. Therefore, with an uncertain future, what enables policymakers to define the state of water resources, which are affected by withdrawals and demands? Through a case study based on thirteen years of observation data in the Zayandeh Rud River basin in Isfahan province located in Iran, this paper forecasts a wide range of urban water demand possibilities in order to create a portfolio of plans which could be utilized by different water managers. A comparison and contrast of two existing methods are discussed, demonstrating the Random Walk Methodology, which will be referred to as the â On uncertainty pathâ , because it takes the uncertainties into account and can be recommended to managers. This On Uncertainty Path is composed of both dynamic forecasting method and system simulation. The outcomes show the advantage of such methods particularly for places that climate change will aggravate their water scarcity, such as Iran.

Optimal design in the presence of random or fixed block effects

Magdeburg, Univ., Fak. für Mathematik, Diss., 2014

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

Optimal designs for the prediction in hierarchical random coefficient regression models

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

The complexity of random ordered structures

"Vegeu el resum a l'inici del document del fitxer adjunt."

Optimal monitoring to implement clean technologies when pollution is random

We analyze a model where firms chose a production technology which, together with some random event, determines the final emission level. We consider the coexistence of two alternative technologies: a "clean" technology, and a "dirty" technology. The environmental regulation is based on taxes over reported emissions, and on penalties over unreported emissions. We show that the optimal inspection policy is a cut-off strategy, for several scenarios concerning the observability of the adoption of the clean technology and the cost of adopting it. We also show that the optimal inspection policy induces the firm to adopt the clean technology if the adoption cost is not too high, but the cost levels for which the firm adopts it depend on the scenario.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Spectral analysis of random sparse matrices

"Vegeu el resum a l'inici del document del fitxer adjunt."

Propagation connectivity of random hypergraphs

We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is inspired by a simple linear time algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for the propagation connectivity threshold, and point out some algorithmic implications.