Traffic Network Optimum Principle - Minimum Probability of Congestion Occurrence

We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached, when link flow rates are assigned in the network in such a way that the probability for spontaneous occurrence of traffic breakdown at one of the network bottlenecks during a given observation time reaches the minimum possible value. Based on numerical simulations with a stochastic three-phase traffic flow model, we show that in comparison to the well-known Wardrop's principles the application of the BM principle permits considerably greater network inflow rates at which no traffic breakdown occurs and, therefore, free flow remains in the whole network.Comment: 22 pages, 6 figure

Characterising sand and gravel deposits using electrical resistivity tomography (ERT) : case histories from England and Wales

Electrical Resistivity Tomography (ERT) is a rapidly developing geophysical imaging technique that is now widely used to visualise subsurface geological structure, groundwater and lithological variations. It is being increasingly used in environmental and engineering site investigations, but despite its suitability and potential benefits, ERT has yet to be routinely applied by the minerals industry to sand and gravel deposit assessment and quarry planning. The principal advantages of ERT for this application are that it is a cost-effective non-invasive method, which can provide 2D or 3D spatial models of the subsurface throughout the full region of interest. This complements intrusive sampling methods, which typically provide information only at discrete locations. Provided that suitable resistivity contrasts are present, ERT has the potential to reveal mineral and overburden thickness and quality variations within the body of the deposit. Here we present a number of case studies from the UK illustrating the use of 2D and 3D ERT for sand and gravel deposit investigation in a variety of geological settings. We use these case studies to evaluate the performance of ERT, and to illustrate good practice in the application of ERT to deposit investigation. We propose an integrated approach to site investigation and quarry planning incorporating both conventional intrusive methods and ERT

The problem of shot selection in basketball

In basketball, every time the offense produces a shot opportunity the player with the ball must decide whether the shot is worth taking. In this paper, I explore the question of when a team should shoot and when they should pass up the shot by considering a simple theoretical model of the shot selection process, in which the quality of shot opportunities generated by the offense is assumed to fall randomly within a uniform distribution. I derive an answer to the question "how likely must the shot be to go in before the player should take it?", and show that this "lower cutoff" for shot quality $f$ depends crucially on the number $n$ of shot opportunities remaining (say, before the shot clock expires), with larger $n$ demanding that only higher-quality shots should be taken. The function $f(n)$ is also derived in the presence of a finite turnover rate and used to predict the shooting rate of an optimal-shooting team as a function of time. This prediction is compared to observed shooting rates from the National Basketball Association (NBA), and the comparison suggests that NBA players tend to wait too long before shooting and undervalue the probability of committing a turnover.Comment: 7 pages, 2 figures; comparison to NBA data adde

Changed concepts and definitions of myeloproliferative neoplasms (MPN), myelodysplastic syndromes (MDS) and myelodysplastic/myeloproliferative neoplasms (MDS/MPN) in the updated 2008 WHO classification

The purpose of this overview is to discuss the changes in the 2008 WHO classification of myeloid neoplasms, with exclusion of acute myeloid leukaemia. Specific mutations or rearrangements leading to constitutive activation of growth factor receptors or cytoplasmic tyrosine kinases are now recognised as recurrent genetic events characterising the group of myeloproliferative neoplasms (MPN). A newly introduced subgroup consists of patients with persistent eosinophilia and myeloid or lymphoid proliferations harbouring specific genetic changes involving platelet-derived growth factor receptors alpha and beta (PDGFRA and PDGFRB) or fibroblast growth factor receptor 1 (FGFR1). The clinical relevance of recognising myeloid neoplasms with aberrant tyrosine kinase activity is based in novel treatment options with tyrosine kinase inhibitors. The myelodysplastic syndromes (MDS) without increased blasts are further divided into subtypes of refractory cytopaenias with unilineage dysplasia. A new provisional entity is refractory cytopaenia of childhood. Down syndrome- and therapy-related myeloid neoplasms, including MDS, were moved to the section of acute myeloid leukaemia and related precursor neoplasms

On Unbounded Composition Operators in L2L^2-Spaces

Fundamental properties of unbounded composition operators in $L^2$-spaces are studied. Characterizations of normal and quasinormal composition operators are provided. Formally normal composition operators are shown to be normal. Composition operators generating Stieltjes moment sequences are completely characterized. The unbounded counterparts of the celebrated Lambert's characterizations of subnormality of bounded composition operators are shown to be false. Various illustrative examples are supplied

Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by a strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.Comment: 4 pages, 4 figures, final revised versio

The asymptotic price of anarchy for k-uniform congestion games

We consider the atomic version of congestion games with affine cost functions, and analyze the quality of worst case Nash equilibria when the strategy spaces of the players are the set of bases of a k-uniform matroid. In this setting, for some parameter k, each player is to choose k out of a finite set of resources, and the cost of a player for choosing a resource depends affine linearly on the number of players choosing the same resource. Earlier work shows that the price of anarchy for this class of games is larger than 1.34 but at most 2.15. We determine a tight bound on the asymptotic price of anarchy equal to ≈1.35188. Here, asymptotic refers to the fact that the bound holds for all instances with sufficiently many players. In particular, the asymptotic price of anarchy is bounded away from 4/3. Our analysis also yields an upper bound on the price of anarchy <1.4131, for all instances

Computation of Equilibrium Distributions of Markov Traffic-Assignment Models

Markov traffic-assignment models explicitly represent the day-to-day evolving interaction between traffic congestion and drivers' information acquisition and choice processes. Such models can, in principle, be used to investigate traffic flows in stochastic equilibrium, yielding estimates of the equilibrium mean and covariance matrix of link or route traffic flows. However, in general these equilibrium moments cannot be written down in closed form. While Monte Carlo simulations of the assignment process may be used to produce “empirical” estimates, this approach can be extremely computationally expensive if reliable results (relatively free of Monte Carlo error) are to be obtained. In this paper an alternative method of computing the equilibrium distribution is proposed, applicable to the class of Markov models with linear exponential learning filters. Based on asymptotic results, this equilibrium distribution may be approximated by a Gaussian process, meaning that the problem reduces to determining the first two multivariate moments in equilibrium. The first of these moments, the mean flow vector, may be estimated by a conventional traffic-assignment model. The second, the flow covariance matrix, is estimated through various linear approximations, yielding an explicit expression. The proposed approximations are seen to operate well in a number of illustrative examples. The robustness of the approximations (in terms of network input data) is discussed, and shown to be connected with the “volatility” of the traffic assignment process

Nash Equilibria in Discrete Routing Games with Convex Latency Functions

In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant and convex latency function φ. In a Nash equilibrium, each user alone is minimizing her (Expected) Individual Cost, which is the (expected) latency on the link she chooses. To evaluate Nash equilibria, we formulate Social Cost as the sum of the users ’ (Expected) Individual Costs. The Price of Anarchy is the worst-case ratio of Social Cost for a Nash equilibrium over the least possible Social Cost. A Nash equilibrium is pure if each user deterministically chooses a single link; a Nash equilibrium is fully mixed if each user chooses each link with non-zero probability. We obtain: For the case of identical users, the Social Cost of any Nash equilibrium is no more than the Social Cost of the fully mixed Nash equilibrium, which may exist only uniquely. Moreover, instances admitting a fully mixed Nash equilibrium enjoy an efficient characterization. For the case of identical users, we derive two upper bounds on the Price of Anarchy: For the case of identical links with a monomial latency function φ(x) = x d, the Price of Anarchy is the Bell number of order d + 1. For pure Nash equilibria, a generic upper bound from the Wardrop model can be transfered to discrete routing games. For polynomial latency functions with non-negative coefficients and degree d, this yields an upper bound of d + 1. For th