Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. For this problem we present a decremental algorithm (that supports the deletion of a vertex, or weight increases on edges incident to a vertex). Our algorithm runs in amortized O(\vstar^2 \cdot \log n) time per update, where n=|V|, and \vstar bounds the number of edges that lie on shortest paths through any given vertex. Our APASP algorithm can be used for the decremental computation of betweenness centrality (BC), a graph parameter that is widely used in the analysis of large complex networks. No nontrivial decremental algorithm for either problem was known prior to our work. Our method is a generalization of the decremental algorithm of Demetrescu and Italiano [DI04] for unique shortest paths, and for graphs with \vstar =O(n), we match the bound in [DI04]. Thus for graphs with a constant number of shortest paths between any pair of vertices, our algorithm maintains APASP and BC scores in amortized time O(n^2 \log n) under decremental updates, regardless of the number of edges in the graph.Comment: An extended abstract of this paper will appear in Proc. ISAAC 201

Localized Entanglement in one-dimensional Anderson model

The entanglement in one-dimensional Anderson model is studied. We show that the pairwise entanglement measured by the average concurrence has a direct relation to the localization length. The numerical study indicates that the disorder significantly reduces the average entanglement, and entanglement distribution clearly displays the entanglement localization. The maximal pairwise entanglement exhibits a maximum as the disorder strength increases,experiencing a transition from increase to decrease. The entanglement between the center of localization and other site decreases exponentially along the spatial direction. Finally,we study effects of disorder on dynamical properties of entanglement.Comment: 5 pages, 6 figure

Influence of particle size and chemistry on the cloud nucleating properties of aerosols

International audienceThe ability of an aerosol particle to act as a cloud condensation nuclei (CCN) is a function of the size of the particle, its composition and mixing state, and the supersaturation of the cloud. In-situ data from field studies provide a means to assess the relative importance of these parameters. During the 2006 Texas Air Quality ? Gulf of Mexico Atmospheric Composition and Climate Study (TexAQS-GoMACCS), the NOAA RV Ronald~H.~Brown encountered a wide variety of aerosol types ranging from marine near the Florida panhandle to urban and industrial in the Houston-Galveston area. These varied sources provided an opportunity to investigate the role of aerosol sources, chemistry, and size in the activation of particles to form cloud droplets. Measurements were made of CCN concentrations, aerosol chemical composition in the size range relevant for particle activation, and aerosol size distributions. Variability in aerosol composition was parameterized by the mass fraction of Hydrocarbon-like Organic Aerosol (HOA) for particle diameters less than 200 nm (vacuum aerodynamic). The HOA mass fraction in this size range was lowest for marine aerosol and highest for aerosol sampled close to anthropogenic sources. Combining all data from the experiment reveals that composition (defined by HOA mass fraction) explains 40% of the variance in the critical diameter for particle activation at 0.44% supersaturation (S). Correlations between HOA mass fraction and aerosol mean diameter show that these two parameters are essentially independent of one another for this data set. We conclude that, based on the variability of the HOA mass fraction observed during TexAQS-GoMACCS, composition played a significant role in determining the fraction of particles that could activate to form cloud droplets. In addition, we estimate the error that results in calculated CCN concentrations if the HOA mass fraction is neglected (i.e., a fully soluble composition of (NH4)2SO4 is assumed) for the range of mass fractions and mean diameters observed during the experiment. This error is then related to the source of the aerosol. At 0.22 and 0.44% S, the error is considerable (>50%) for anthropogenic aerosol sampled near the source region as this aerosol had, on average, a high HOA mass fraction in the sub-200 nm diameter size range (vacuum aerodynamic). The error is lower for aerosol distant from anthropogenic source regions as it had a lower HOA mass fraction. Hence, the percent error in calculated CCN concentration is larger for organic-rich aerosol sampled near the source and smaller for aerosol sampled away from sources of anthropogenic particulate organic matter (POM)

Drawing Graphs within Restricted Area

We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) calculation graphs which are used to analyze the typical mistakes that high school students make when transforming mathematical expressions in the process of calculating, for example, sums of fractions

An extension of SPARQL for expressing qualitative preferences

In this paper we present SPREFQL, an extension of the SPARQL language that allows appending a PREFER clause that expresses "soft" preferences over the query results obtained by the main body of the query. The extension does not add expressivity and any SPREFQL query can be transformed to an equivalent standard SPARQL query. However, clearly separating preferences from the "hard" patterns and filters in the WHERE clause gives queries where the intention of the client is more cleanly expressed, an advantage for both human readability and machine optimization. In the paper we formally define the syntax and the semantics of the extension and we also provide empirical evidence that optimizations specific to SPREFQL improve run-time efficiency by comparison to the usually applied optimizations on the equivalent standard SPARQL query.Comment: Accepted to the 2017 International Semantic Web Conference, Vienna, October 201

Quantum Correlations in Multipartite Quantum Systems

We review some concepts and properties of quantum correlations, in particular multipartite measures, geometric measures and monogamy relations. We also discuss the relation between classical and total correlationsComment: to be published as a chapter of the book "Lectures on general quantum correlations and their applications" edited by F. Fanchini, D. Soares-Pinto, and G. Adesso (Springer, 2017

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games

In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\alpha$ through unilateral strategy changes. There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\alpha$-approximate pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for $\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold $\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard. We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum

A q-deformed nonlinear map

A scheme of q-deformation of nonlinear maps is introduced. As a specific example, a q-deformation procedure related to the Tsallis q-exponential function is applied to the logistic map. Compared to the canonical logistic map, the resulting family of q-logistic maps is shown to have a wider spectrum of interesting behaviours, including the co-existence of attractors -- a phenomenon rare in one dimensional maps.Comment: 17 pages, 19 figure

From critters to cancers: bridging comparative and clinical research on oxygen sensing, HIF signaling, and adaptations towards hypoxia

The objective of this symposium at the First International Congress of Respiratory Biology (ICRB) was to enhance communication between comparative biologists and cancer researchers working on O2 sensing via the HIF pathway. Representatives from both camps came together on August 13-16, 2006, in Bonn, Germany, to discuss molecular adaptations that occur after cells have been challenged by a reduced (hypoxia) or completely absent (anoxia) supply of oxygen. This brief "critters-to-cancer” survey discusses current projects and new directions aimed at improving understanding of hypoxic signaling and developing therapeutic intervention

Evolution of Th2 responses : Characterization of IL-4/13 in sea bass (Dicentrarchus labrax L.) and studies of expression and biological activity

Acknowledgements This research was funded by the European Commission under the 7th Framework Programme for Research and Technological Development (FP7) of the European Union (Grant Agreement 311993 TARGETFISH). T.W. received funding from the MASTS pooling initiative (The Marine Alliance for Science and Technology for Scotland). MASTS is funded by the Scottish Funding Council (grant reference number HR09011) and contributing institutions.Peer reviewedPublisher PD