Application of Market Models to Network Equilibrium Problems

We present a general two-side market model with divisible commodities and price functions of participants. A general existence result on unbounded sets is obtained from its variational inequality re-formulation. We describe an extension of the network flow equilibrium problem with elastic demands and a new equilibrium type model for resource allocation problems in wireless communication networks, which appear to be particular cases of the general market model. This enables us to obtain new existence results for these models as some adjustments of that for the market model. Under certain additional conditions the general market model can be reduced to a decomposable optimization problem where the goal function is the sum of two functions and one of them is convex separable, whereas the feasible set is the corresponding Cartesian product. We discuss some versions of the partial linearization method, which can be applied to these network equilibrium problems.Comment: 18 pages, 3 table

Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms

We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou's network. We improve upon the value 4/3 by means of Coordination Mechanisms. We increase the latency functions of the edges in the network, i.e., if $\ell_e(x)$ is the latency function of an edge $e$, we replace it by $\hat{\ell}_e(x)$ with $\ell_e(x) \le \hat{\ell}_e(x)$ for all $x$. Then an adversary fixes a demand rate as input. The engineered Price of Anarchy of the mechanism is defined as the worst-case ratio of the Nash social cost in the modified network over the optimal social cost in the original network. Formally, if \CM(r) denotes the cost of the worst Nash flow in the modified network for rate $r$ and \Copt(r) denotes the cost of the optimal flow in the original network for the same rate then [\ePoA = \max_{r \ge 0} \frac{\CM(r)}{\Copt(r)}.] We first exhibit a simple coordination mechanism that achieves for any network of parallel links an engineered Price of Anarchy strictly less than 4/3. For the case of two parallel links our basic mechanism gives 5/4 = 1.25. Then, for the case of two parallel links, we describe an optimal mechanism; its engineered Price of Anarchy lies between 1.191 and 1.192.Comment: 17 pages, 2 figures, preliminary version appeared at ESA 201

On the Zwitterionic Nature of Gas-Phase Peptides and Protein Ions

Determining the total number of charged residues corresponding to a given value of net charge for peptides and proteins in gas phase is crucial for the interpretation of mass-spectrometry data, yet it is far from being understood. Here we show that a novel computational protocol based on force field and massive density functional calculations is able to reproduce the experimental facets of well investigated systems, such as angiotensin II, bradykinin, and tryptophan-cage. The protocol takes into account all of the possible protomers compatible with a given charge state. Our calculations predict that the low charge states are zwitterions, because the stabilization due to intramolecular hydrogen bonding and salt-bridges can compensate for the thermodynamic penalty deriving from deprotonation of acid residues. In contrast, high charge states may or may not be zwitterions because internal solvation might not compensate for the energy cost of charge separation

Models and algorithms for energy-efficient scheduling with immediate start of jobs

We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. Such a condition is typical for modern Cloud computing systems with abundant resources. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost of running. We demonstrate that the basic scheduling model to minimize the aggregated cost function with n jobs is solvable in O(nlogn) time in the single-machine case and in O(n²m) time in the case of m parallel machines. We also address additional features, e.g., the cost of job rejection or the cost of initiating a machine. In the case of a single machine, we present algorithms for minimizing one of the cost functions subject to an upper bound on the value of the other, as well as for finding a Pareto-optimal solution

Intrinsic Determinants of Aβ12–24 pH-Dependent Self-Assembly Revealed by Combined Computational and Experimental Studies

The propensity of amyloid- (A) peptide to self-assemble into highly ordered amyloid structures lies at the core of their accumulation in the brain during Alzheimer's disease. By using all-atom explicit solvent replica exchange molecular dynamics simulations, we elucidated at the atomic level the intrinsic determinants of the pH-dependent dimerization of the central hydrophobic segment A and related these with the propensity to form amyloid fibrils measured by experimental tools such as atomic force microscopy and fluorescence. The process of A dimerization was evaluated in terms of free energy landscape, side-chain two-dimensional contact probability maps, -sheet registries, potential mean force as a function of inter-chain distances, secondary structure development and radial solvation distributions. We showed that dimerization is a key event in A amyloid formation; it is highly prompted in the order of pH 5.02.98.4 and determines further amyloid growth. The dimerization is governed by a dynamic interplay of hydrophobic, electrostatic and solvation interactions permitting some variability of -sheets at each pH. These results provide atomistic insight into the complex process of molecular recognition detrimental for amyloid growth and pave the way for better understanding of the molecular basis of amyloid diseases

Football and social inclusion: evaluating social policy

Sport, particularly football, is increasingly recognized as a means for promoting social inclusion. Yet rigorous evaluations of football-based social inclusion projects are rarely carried out. This paper explains the importance of evaluation and proposes the use of realist evaluation as a framework for developing theory, informing social policy and improving project design. It also aims to develop a workable template for small-scale project evaluation. The paper draws a series of conclusions on how rigorous evaluation of football-based social inclusion projects can benefit participants, practitioners and policy makers, as well as football clubs and the communities they serve