20,758 research outputs found
Streaming Facility Location in High Dimension via New Geometric Hashing
In Euclidean Uniform Facility Location, the input is a set of clients in
and the goal is to place facilities to serve them, so as to
minimize the total cost of opening facilities plus connecting the clients. We
study the classical setting of dynamic geometric streams, where the clients are
presented as a sequence of insertions and deletions of points in the grid
, and we focus on the high-dimensional regime, where the
algorithm's space complexity must be polynomial (and certainly not exponential)
in .
We present a new algorithmic framework, based on importance sampling from the
stream, for -approximation of the optimal cost using only
space. This framework is easy to implement in
two passes, one for sampling points and the other for estimating their
contribution. Over random-order streams, we can extend this to a one-pass
algorithm by using the two halves of the stream separately. Our main result,
for arbitrary-order streams, computes -approximation in one pass by
using the new framework but combining the two passes differently. This improves
upon previous algorithms that either need space exponential in or only
guarantee -approximation, and therefore our algorithms
for high-dimensional streams are the first to avoid the -factor
in approximation that is inherent to the widely-used quadtree decomposition.
Our improvement is achieved by introducing a novel geometric hashing scheme
that maps points in into buckets of bounded diameter, with the
key property that every point set of small-enough diameter is hashed into at
most distinct buckets.
Finally, we complement our results by showing -approximation requires
space exponential in , even for insertion-only
streams.Comment: The abstract is shortened to meet the length constraint of arXi
Free-jet acoustic investigation of high-radius-ratio coannular plug nozzles
The experimental and analytical results of a scale model simulated flight acoustic exploratory investigation of high radius ratio coannular plug nozzles with inverted velocity and temperature profiles are summarized. Six coannular plug nozzle configurations and a baseline convergent conical nozzle were tested for simulated flight acoustic evaluation. The nozzles were tested over a range of test conditions that are typical of a Variable Cycle Engine for application to advanced high speed aircraft. It was found that in simulate flight, the high radius ratio coannular plug nozzles maintain their jet noise and shock noise reduction features previously observed in static testing. The presence of nozzle bypass struts will not significantly affect the acousticn noise reduction features of a General Electric type nozzle design. A unique coannular plug nozzle flight acoustic spectral prediction method was identified and found to predict the measured results quite well. Special laser velocimeter and acoustic measurements were performed which have given new insights into the jet and shock noise reduction mechanisms of coannular plug nozzles with regard to identifying further benificial research efforts
Acoustic tests of duct-burning turbofan jet noise simulation: Comprehensive data report. Volume 2: Model design and aerodynamic test results
The selection procedure is described which was used to arrive at the configurations tested, and the performance characteristics of the test nozzles are given
Off-line processing of ERS-1 synthetic aperture radar data with high precision and high throughput
The first European remote sensing satellite ERS-1 will be launched by the European Space Agency (ESA) in 1989. The expected lifetime is two to three years. The spacecraft sensors will primarily support ocean investigations and to a limited extent also land applications. Prime sensor is the Active Microwave Instrumentation (AMI) operating in C-Band either as Synthetic Aperture Radar (SAR) or as Wave-Scatterometer and simultaneously as Wind-Scatterometer. In Europe there will be two distinct types of processing for ERS-1 SAR data, Fast Delivery Processing and Precision Processing. Fast Delivery Proceessing will be carried out at the ground stations and up to three Fast Delivery products per pass will be delivered to end users via satellite within three hours after data acquisition. Precision Processing will be carried out in delayed time and products will not be generated until several days or weeks after data acquisition. However, a wide range of products will be generated by several Processing and Archiving Facilities (PAF) in a joint effort coordinated by ESA. The German Remote Sensing Data Center (Deutsches Fernerkundungsdatenzentrum DFD) will develop and operate one of these facilities. The related activities include the acquisition, processing and evaluation of such data for scientific, public and commercial users. Based on this experience the German Remote Sensing Data Center is presently performing a Phase-B study regarding the development of a SAR processor for ERS-1. The conceptual design of this processing facility is briefly outlined
Fully Dynamic Consistent Facility Location
We consider classic clustering problems in fully dynamic data streams, where data elements can be both inserted and deleted. In this context, several parameters are of importance: (1) the quality of the solution after each insertion or deletion, (2) the time it takes to update the solution, and (3) how different consecutive solutions are. The question of obtaining efficient algorithms in this context for facility location, k-median and k-means has been raised in a recent paper by Hubert-Chan et al. [WWW'18] and also appears as a natural follow-up on the online model with recourse studied by Lattanzi and Vassilvitskii [ICML'17] (i.e.: in insertion-only streams). In this paper, we focus on general metric spaces and mainly on the facility location problem. We give an arguably simple algorithm that maintains a constant factor approximation, with O(n log n) update time, and total recourse O(n). This improves over the naive algorithm which consists in recomputing a solution at each time step and that can take up to O(n^2) update time, and O(n^2) total recourse. These bounds are nearly optimal: in general metric space, inserting a point take O(n) times to describe the distances to other points, and we give a simple lower bound of O(n) for the recourse. Moreover, we generalize this result for the k-medians and k-means problems: our algorithm maintains a constant factor approximation in time O˜(n+k^2). We complement our analysis with experiments showing that the cost of the solution maintained by our algorithm at any time t is very close to the cost of a solution obtained by quickly recomputing a solution from scratch at time t while having a much better running time
Fully Dynamic Consistent Facility Location
We consider classic clustering problems in fully dynamic data streams, where data elements can be both inserted and deleted. In this context, several parameters are of importance: (1) the quality of the solution after each insertion or deletion, (2) the time it takes to update the solution, and (3) how different consecutive solutions are. The question of obtaining efficient algorithms in this context for facility location, k-median and k-means has been raised in a recent paper by Hubert-Chan et al. [WWW'18] and also appears as a natural follow-up on the online model with recourse studied by Lattanzi and Vassilvitskii [ICML'17] (i.e.: in insertion-only streams). In this paper, we focus on general metric spaces and mainly on the facility location problem. We give an arguably simple algorithm that maintains a constant factor approximation, with O(n log n) update time, and total recourse O(n). This improves over the naive algorithm which consists in recomputing a solution at each time step and that can take up to O(n^2) update time, and O(n^2) total recourse. These bounds are nearly optimal: in general metric space, inserting a point take O(n) times to describe the distances to other points, and we give a simple lower bound of O(n) for the recourse. Moreover, we generalize this result for the k-medians and k-means problems: our algorithm maintains a constant factor approximation in time O˜(n+k^2). We complement our analysis with experiments showing that the cost of the solution maintained by our algorithm at any time t is very close to the cost of a solution obtained by quickly recomputing a solution from scratch at time t while having a much better running time
Online Facility Location with Deletions
In this paper we study three previously unstudied variants of the online Facility Location problem, considering an intrinsic scenario when the clients and facilities are not only allowed to arrive to the system, but they can also depart at any moment.
We begin with the study of a natural fully-dynamic online uncapacitated model where clients can be both added and removed. When a client arrives, then it has to be assigned either to an existing facility or to a new facility opened at the client\u27s location. However, when a client who has been also one of the open facilities is to be removed, then our model has to allow to reconnect all clients that have been connected to that removed facility. In this model, we present an optimal O(log(n_{act}) / log log(n_{act}))-competitive algorithm, where n_{act} is the number of active clients at the end of the input sequence.
Next, we turn our attention to the capacitated Facility Location problem. We first note that if no deletions are allowed, then one can achieve an optimal competitive ratio of O(log(n) / log(log n)), where n is the length of the sequence. However, when deletions are allowed, the capacitated version of the problem is significantly more challenging than the uncapacitated one. We show that still, using a more sophisticated algorithmic approach, one can obtain an online O(log N + log c log n)-competitive algorithm for the capacitated Facility Location problem in the fully dynamic model, where N is number of points in the input metric and c is the capacity of any open facility
- …