13,033 research outputs found
Feedback algorithm for switch location : analysis of complexity and application to network design
An accelerated feedback algorithm to solve the single-facility minisum problem is studied with application to designing networks with the star topology. The algorithm, in which the acceleration with respect to the Weiszfeld procedure is achieved by multiplying the current Weiszfeld iterate by an accelerating feedback factor, is shown to converge faster than the accelerating procedures available in the literature. Singularities encountered in the algorithm are discussed in detail. A simple practical exception handling subroutine is developed. Several applications of the algorithm to designing computer networks with the star topology are demonstrated. Applications of the algorithm as a subroutine for multi-switch location problems are considered. Various engineering aspects involved in acquiring and processing coordinates for geographic locations are discussed. A complete algorithm in pseudocode along with the source code listing in Mathematica 4.1 is presented
Non-negative mixtures
This is the author's accepted pre-print of the article, first published as M. D. Plumbley, A. Cichocki and R. Bro. Non-negative mixtures. In P. Comon and C. Jutten (Ed), Handbook of Blind Source Separation: Independent Component Analysis and Applications. Chapter 13, pp. 515-547. Academic Press, Feb 2010. ISBN 978-0-12-374726-6 DOI: 10.1016/B978-0-12-374726-6.00018-7file: Proof:p\PlumbleyCichockiBro10-non-negative.pdf:PDF owner: markp timestamp: 2011.04.26file: Proof:p\PlumbleyCichockiBro10-non-negative.pdf:PDF owner: markp timestamp: 2011.04.2
Efficient Bayesian-based Multi-View Deconvolution
Light sheet fluorescence microscopy is able to image large specimen with high
resolution by imaging the sam- ples from multiple angles. Multi-view
deconvolution can significantly improve the resolution and contrast of the
images, but its application has been limited due to the large size of the
datasets. Here we present a Bayesian- based derivation of multi-view
deconvolution that drastically improves the convergence time and provide a fast
implementation utilizing graphics hardware.Comment: 48 pages, 20 figures, 1 table, under review at Nature Method
What kind of shock was it? Regional Integration and Structural Change in Germany after Unification
Eastern Germany’s recovery from the "unification shock" has been characterized by deep structural change – with apparent repercussions for the West as well – and an integration process involving both capital deepening (extensive and intensive investment) and labor thinning (net out-migration). I propose a constant-returns neoclassical model of economic integration which can account for these facts. Adjustment costs determine dynamics and steady state regional distribution of production factors. The model also explains persistent wage and capital rate-of-return differentials along the equilibrium path. Under competitive conditions, observed factor price differentials contain information on those adjustment costs.German Reunification, Regional Integration, Costs of Adjustment, Capital Mobility, Migration
Recommended from our members
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
Copyright @ 2000 INFORMSThe multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a), p-Median plus Weber (Hansen ct al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.This study was supported by the Department
of National Defence (Canada) Academic Research; Office of Naval Research Grant N00014-92-J-1194, Natural Sciences and Engineering Research Council of Canada Grant GPO 105574 and Fonds pour la Formation des Chercheurs et l’Aide a la Recherche Grant 32EQ 1048; and by an International Postdoctoral Fellowship of the Natural Sciences and Engineering Research Council
of Canada, Grant OGPOO 39682
An investigation of the performance portability of OpenCL
This paper reports on the development of an MPI/OpenCL implementation of LU, an application-level benchmark from the NAS Parallel Benchmark Suite. An account of the design decisions addressed during the development of this code is presented, demonstrating the importance of memory arrangement and work-item/work-group distribution strategies when applications are deployed on different device types. The resulting platform-agnostic, single source application is benchmarked on a number of different architectures, and is shown to be 1.3–1.5× slower than native FORTRAN 77 or CUDA implementations on a single node and 1.3–3.1× slower on multiple nodes. We also explore the potential performance gains of OpenCL’s device fissioning capability, demonstrating up to a 3× speed-up over our original OpenCL implementation
A minimalistic approach for fast computation of geodesic distances on triangular meshes
The computation of geodesic distances is an important research topic in
Geometry Processing and 3D Shape Analysis as it is a basic component of many
methods used in these areas. In this work, we present a minimalistic parallel
algorithm based on front propagation to compute approximate geodesic distances
on meshes. Our method is practical and simple to implement and does not require
any heavy pre-processing. The convergence of our algorithm depends on the
number of discrete level sets around the source points from which distance
information propagates. To appropriately implement our method on GPUs taking
into account memory coalescence problems, we take advantage of a graph
representation based on a breadth-first search traversal that works
harmoniously with our parallel front propagation approach. We report
experiments that show how our method scales with the size of the problem. We
compare the mean error and processing time obtained by our method with such
measures computed using other methods. Our method produces results in
competitive times with almost the same accuracy, especially for large meshes.
We also demonstrate its use for solving two classical geometry processing
problems: the regular sampling problem and the Voronoi tessellation on meshes.Comment: Preprint submitted to Computers & Graphic
Revisiting several problems and algorithms in continuous location with lp norms
This paper addresses the general continuous single facility location
problems in finite dimension spaces under possibly different â„“p norms
in the demand points. We analyze the difficulty of this family of problems
and revisit convergence properties of some well-known algorithms.
The ultimate goal is to provide a common approach to solve the family
of continuous â„“p ordered median location problems in dimension d (including
of course the â„“p minisum or Fermat-Weber location problem
for any p ≥ 1). We prove that this approach has a polynomial worse
case complexity for monotone lambda weights and can be also applied
to constrained and even non-convex problems.Junta de AndalucĂaFondo Europeo de Desarrollo RegionalMinisterio de Ciencia e InnovaciĂł
- …