2,252 research outputs found
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
A Stochastic Model of Fragmentation in Dynamic Storage Allocation
We study a model of dynamic storage allocation in which requests for single units of memory arrive in a Poisson stream at rate λ and are accommodated by the first available location found in a linear scan of memory. Immediately after this first-fit assignment, an occupied location commences an exponential delay with rate parameter μ, after which the location again becomes available. The set of occupied locations (identified by their numbers) at time t forms a random subset St of {1,2, . . .}. The extent of the fragmentation in St, i.e. the alternating holes and occupied regions of memory, is measured by (St) - |St |. In equilibrium, the number of occupied locations, |S|, is known to be Poisson distributed with mean ρ = λ/μ. We obtain an explicit formula for the stationary distribution of max (S), the last occupied location, and by independent arguments we show that (E max (S) - E|S|)/E|S| → 0 as the traffic intensity ρ → ∞. Moreover, we verify numerically that for any ρ the expected number of wasted locations in equilibrium is never more than 1/3 the expected number of occupied locations.
Our model applies to studies of fragmentation in paged computer systems, and to containerization problems in industrial storage applications. Finally, our model can be regarded as a simple concrete model of interacting particles [Adv. Math., 5 (1970), pp. 246–290]
Gaussian limits for multidimensional random sequential packing at saturation (extended version)
Consider the random sequential packing model with infinite input and in any
dimension. When the input consists of non-zero volume convex solids we show
that the total number of solids accepted over cubes of volume is
asymptotically normal as . We provide a rate of
approximation to the normal and show that the finite dimensional distributions
of the packing measures converge to those of a mean zero generalized Gaussian
field. The method of proof involves showing that the collection of accepted
solids satisfies the weak spatial dependence condition known as stabilization.Comment: 31 page
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
On-line construction of position heaps
We propose a simple linear-time on-line algorithm for constructing a position
heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap
differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it
considers the suffixes ordered from left to right. Our construction is based on
classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees
[Ukkonen, 1995]. Using suffix pointers, the position heap can be extended into
the augmented position heap that allows for a linear-time string matching
algorithm [Ehrenfeucht et al, 2011].Comment: to appear in Journal of Discrete Algorithm
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
Clean heating and heating poverty: A perspective based on cost-benefit analysis
To improve the air quality in winter, clean heating policy was implemented in “2 + 26” cities of China in 2016, which mainly included replacing coal with gas or electricity. Tremendous financial subsidies have been provided by city and central governments. This new heating mode changed the heating fee-cost to residents. This paper estimates the economic costs to both governments and residents, and evaluates the environmental and public health benefits by combining a difference-in-differences model with an exposure-response function. Results show that the total costs of clean heating were up to 43.1 billion yuan. Governments and residents account for 44% and 56% of the total costs, respectively. In terms of benefits, the clean heating project is effective for air pollution control and brings health economic benefits of about 109.85 billion yuan (95% CI: 22.40–159.83). The clean heating policy was identified as a net-positive benefit program with environmental and public health improvements. However, the inequality in subsidies from different cities governments increases the heating burden on low-income households and leads to heating poverty for households in the less developed regions. We provide suggestions for implementation in future clean heating campaigns and in subsidy mechanism design in China and for other developing countries
Ant colony optimisation and local search for bin-packing and cutting stock problems
The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO
- …