10,701 research outputs found
Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic
The goal of the Sloan Digital Sky Survey is ``to map in detail one-quarter of
the entire sky, determining the positions and absolute brightnesses of more
than 100 million celestial objects''. The survey will be performed by taking
``snapshots'' through a large telescope. Each snapshot can capture up to 600
objects from a small circle of the sky. This paper describes the design and
implementation of the algorithm that is being used to determine the snapshots
so as to minimize their number. The problem is NP-hard in general; the
algorithm described is a heuristic, based on Lagriangian-relaxation and
min-cost network flow. It gets within 5-15% of a naive lower bound, whereas
using a ``uniform'' cover only gets within 25-35%.Comment: proceedings version appeared in ACM-SIAM Symposium on Discrete
Algorithms (1998
Spherical Location Under Restricted Distance
This paper deals with the problem of locating a new facility with respect to n given demand points on earth, with upper bounds imposed on distances between the new facility and each demand points. Distances are measured as the length of the shortest arc of great circle. The proposed algorithm makes use of a Lagrangean relaxation in which the distance constraints, which are not satisfied by the associated unconstrained solution, are incorporated in the economic function. Computational results of a limited number of test problems are presented
On the spherical convexity of quadratic functions
In this paper we study the spherical convexity of quadratic functions on
spherically convex sets. In particular, conditions characterizing the spherical
convexity of quadratic functions on spherical convex sets associated to the
positive orthants and Lorentz cones are given
GRChombo : Numerical Relativity with Adaptive Mesh Refinement
In this work, we introduce GRChombo: a new numerical relativity code which
incorporates full adaptive mesh refinement (AMR) using block structured
Berger-Rigoutsos grid generation. The code supports non-trivial
"many-boxes-in-many-boxes" mesh hierarchies and massive parallelism through the
Message Passing Interface (MPI). GRChombo evolves the Einstein equation using
the standard BSSN formalism, with an option to turn on CCZ4 constraint damping
if required. The AMR capability permits the study of a range of new physics
which has previously been computationally infeasible in a full 3+1 setting,
whilst also significantly simplifying the process of setting up the mesh for
these problems. We show that GRChombo can stably and accurately evolve standard
spacetimes such as binary black hole mergers and scalar collapses into black
holes, demonstrate the performance characteristics of our code, and discuss
various physics problems which stand to benefit from the AMR technique.Comment: 48 pages, 24 figure
Montage: a grid portal and software toolkit for science-grade astronomical image mosaicking
Montage is a portable software toolkit for constructing custom, science-grade
mosaics by composing multiple astronomical images. The mosaics constructed by
Montage preserve the astrometry (position) and photometry (intensity) of the
sources in the input images. The mosaic to be constructed is specified by the
user in terms of a set of parameters, including dataset and wavelength to be
used, location and size on the sky, coordinate system and projection, and
spatial sampling rate. Many astronomical datasets are massive, and are stored
in distributed archives that are, in most cases, remote with respect to the
available computational resources. Montage can be run on both single- and
multi-processor computers, including clusters and grids. Standard grid tools
are used to run Montage in the case where the data or computers used to
construct a mosaic are located remotely on the Internet. This paper describes
the architecture, algorithms, and usage of Montage as both a software toolkit
and as a grid portal. Timing results are provided to show how Montage
performance scales with number of processors on a cluster computer. In
addition, we compare the performance of two methods of running Montage in
parallel on a grid.Comment: 16 pages, 11 figure
- …