Filetype
Brief User-Controlled Admission (BUCA) refers to a set of crisis interventions in which the traditional gatekeeping role of the physician is bypassed, allowing service users to independently decide when to access short-term inpatient care through a pre-negotiated agreement. Examples include Brief Admission by self-referral, Patient-Initiated Brief Admission, Patient-Controlled Admission, and Self-
INTRODUCTION: Future physicians must develop the necessary knowledge and skills to effectively manage challenging patient communication. To design linked meaningful learning activities, perspectives from students and teachers need to be taken into account as well as students' previous knowledge. Aiming to better understand how this knowledge can be acquired through patient simulation, we examined
En stad är inte endast en fysisk bild av dess gator och hus. Vi människor har också en egen relation till en stad, ett slags djupare existentiellt förhållande. Därför finns heller inte en berättelse om staden, utan flera - samtida - och ofta djupt personliga.
Den 6 november 1881 höll skräddaren August Palm ett tal med titeln ”Hvad vilja socialdemokraterna?”. Platsen var Hotell Stockholm i Malmö och dagen – Gustav Adolfsdagen – var väl vald. Palms tal har betraktats som startskottet för den socialistiska rörelsen i Sverige. Efter talet färdades Palm landet runt för att agitera och organisera. Talet har därmed fått en närmast symbolisk betydelse inte min
Article about the phenomenon of chess boxing. A historical overview, and some swedish perspectives on the sport is put forward.
A review of Peter Carelli's book about how chess came to Scandinavia. The book is especially focusing archaeologically dug up medieval chess pieces in the Scandinavian countries.
Pulmonary arterial hypertension (PAH) is a life-threatening condition with no cure, making research into its underlying mechanisms critical. The platelet-derived growth factor (PDGF) signaling pathway plays a crucial role in vascular remodeling, a key factor in PAH progression. Anti-PDGF receptor therapies, such as imatinib, show promise but are associated with significant side effects. Recent res
We consider some generalizations of the germ-grain growing model studied by Daley, Mallows and Shepp (2000). In this model, a realization of a Poisson process on a line with points Xi is fixed. At time zero, simultaneously at each Xi, a circle (grain) starts growing at the same speed. It grows until it touches another grain, and then it stops. The question is whether the point zero is eventually c
We study the continuous time process on the vertices of the b-ary tree which jumps to each nearest neighbor vertex at the rate of the time already spent at that vertex times δ, plus 1, where δ is a positive constant. We show that for fixed b > 1, if δ is large enough the process is transient, and if δ is close enough to zero it is recurrent. Related results for some other graphs and trees are also
We consider the OK Corral model formulated by Williams and McIlroy and later studied by Kingman. In this paper we refine some of Kingman's results, by showing the connection between this model and Friedman's urn, and using Rubin's construction to decouple the urn. Also we obtain the exact expression for the probability of survival of exactly S gunmen given an initially fair configuration.
ESS, a European Research Infrastructure Consortium (ERIC), is getting ready to be a leading multidisciplinary facility with the world's most potent neutron source. Dedicated to scientific breakthroughs, ESS focuses on materials, energy, health, and environmental research to address key societal challenges. ESS will host 22 specialized scientific instruments selected to cover a broad range of exper
What is the effect of punching holes at random in an infinite tensed membrane? When will the membrane still support tension? This problem was introduced by Connelly in connection with applications of rigidity theory to natural sciences. The answer clearly depends on the shapes and the distribution of the holes. We briefly outline a mathematical theory of tension based on graph rigidity theory and
Det vaga begreppet barnets bästa är beroende av samhällets utveckling och hur vi ser på barn – ibland fortfarande som ägodelar. Detta är fortfarande särskilt framträdande i den sociala barnlagstiftningen.The nebolous concept of the best interests of the child is dependent of the development of society and how we view children - sometimes still as possessions. This is still particularly prominent in social children's welfare legislation.
We study the continuous time integer valued process Xt, t ≥ 0, which jumps to each of its two nearest neighbors at the rate of one plus the total time the process has previously spent at that neighbor. We show that the proportion of the time before t which this process spends at integers j converges to positive random variables Vj, which sum to one, and whose joint distribution is explicitly descr
We introduce a new class of bootstrap percolation models where the local rules are of a geometric nature as opposed to simple counts of standard bootstrap percolation. Our geometric bootstrap percolation comes from rigidity theory and convex geometry. We outline two percolation models: a Poisson model and a lattice model. Our Poisson model describes how defects - holes is one of the possible inter
We investigate individual packet delay in a model of data networks with table-free, partial table and full table routing. We present analytical estimation for the average packet delay in a network with small partial routing table. Dependence of the delay on the size of the network and on the size of the partial routing table is examined numerically. Consequences for network scalability are discuss
Vertex-reinforced random walk (VRRW), defined by Pemantle, is a random process in a continuously changing environment which is more likely to visit states it has visited before. We consider VRRW on arbitrary graphs and show that on almost all of them, VRRW visits only finitely many vertices with a positive probability. We conjecture that on all graphs of bounded degree, this happens with probabili
A stochastic process called vertex-reinforced random walk (VRRW) is defined in Pemantle [Ann. Probab. 16 1229-1241]. We consider this process in the case where the underlying graph is an infinite chain (i.e., the one-dimensional integer lattice). We show that the range is almost surely finite, that at least five points are visited infinitely often almost surely and that with positive probability t
