1,340 research outputs found
Capacity of Fading Gaussian Channel with an Energy Harvesting Sensor Node
Network life time maximization is becoming an important design goal in
wireless sensor networks. Energy harvesting has recently become a preferred
choice for achieving this goal as it provides near perpetual operation. We
study such a sensor node with an energy harvesting source and compare various
architectures by which the harvested energy is used. We find its Shannon
capacity when it is transmitting its observations over a fading AWGN channel
with perfect/no channel state information provided at the transmitter. We
obtain an achievable rate when there are inefficiencies in energy storage and
the capacity when energy is spent in activities other than transmission.Comment: 6 Pages, To be presented at IEEE GLOBECOM 201
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
Consider the following problem: given a set system (U,I) and an edge-weighted
graph G = (U, E) on the same universe U, find the set A in I such that the
Steiner tree cost with terminals A is as large as possible: "which set in I is
the most difficult to connect up?" This is an example of a max-min problem:
find the set A in I such that the value of some minimization (covering) problem
is as large as possible.
In this paper, we show that for certain covering problems which admit good
deterministic online algorithms, we can give good algorithms for max-min
optimization when the set system I is given by a p-system or q-knapsacks or
both. This result is similar to results for constrained maximization of
submodular functions. Although many natural covering problems are not even
approximately submodular, we show that one can use properties of the online
algorithm as a surrogate for submodularity.
Moreover, we give stronger connections between max-min optimization and
two-stage robust optimization, and hence give improved algorithms for robust
versions of various covering problems, for cases where the uncertainty sets are
given by p-systems and q-knapsacks.Comment: 17 pages. Preliminary version combining this paper and
http://arxiv.org/abs/0912.1045 appeared in ICALP 201
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial a ride problems consist of a metric space (denoting travel time between
vertices) and a set of m objects represented as source-destination pairs, where
each object requires to be moved from its source to destination vertex. We
consider the multi-vehicle Dial a ride problem, with each vehicle having
capacity k and its own depot-vertex, where the objective is to minimize the
maximum completion time (makespan) of the vehicles. We study the "preemptive"
version of the problem, where an object may be left at intermediate vertices
and transported by more than one vehicle, while being moved from source to
destination. Our main results are an O(log^3 n)-approximation algorithm for
preemptive multi-vehicle Dial a ride, and an improved O(log t)-approximation
for its special case when there is no capacity constraint. We also show that
the approximation ratios improve by a log-factor when the underlying metric is
induced by a fixed-minor-free graph.Comment: 22 pages, 1 figure. Preliminary version appeared in ESA 200
An experimental documentation of a separated trailing-edge flow at a transonic Mach number
A detailed experiment on the separated flow field at a sharp trailing edge is described and documented. The separated flow is a result of sustained adverse pressure gradients. The experiment was conducted using an elongated airfoil-like model at a transonic Mach number and at a high Reynolds number of practical interest. Measurements made include surface pressures and detailed mean and turbulence flow quantities in the region just upstream of separation to downstream into the near-wake, following wake closure. The data obtained are presented mostly in tabular form. These data are of sufficient quality and detail to be useful as a test case for evaluating turbulence models and calculation methods
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the
dense--subgraph problems. Formally, given a metric space on vertices
, with demand pairs and a ``target'' ,
the goal is to find a minimum cost subgraph that connects at least demand
pairs. In this paper, we give an -approximation
algorithm for -forest, improving on the previous best ratio of
by Segev & Segev.
We then apply our algorithm for k-forest to obtain approximation algorithms
for several Dial-a-Ride problems. The basic Dial-a-Ride problem is the
following: given an point metric space with objects each with its own
source and destination, and a vehicle capable of carrying at most objects
at any time, find the minimum length tour that uses this vehicle to move each
object from its source to destination. We prove that an -approximation
algorithm for the -forest problem implies an
-approximation algorithm for Dial-a-Ride. Using our
results for -forest, we get an -
approximation algorithm for Dial-a-Ride. The only previous result known for
Dial-a-Ride was an -approximation by Charikar &
Raghavachari; our results give a different proof of a similar approximation
guarantee--in fact, when the vehicle capacity is large, we give a slight
improvement on their results.Comment: Preliminary version in Proc. European Symposium on Algorithms, 200
Rigid vs. Flexible Pile Caps: Case Study for 235 m. Delhi T.V. Tower
Foundation for the prestigious 235m. Delhi television tower commissioned in 1988 in New Delhi consists of 279 reinforced concrete piles of 500 mm diameter with 1250 KN load carrying capacity. The tower is resting on a circular pile cap 32 m. diameter with an average thickness of 2.5 m. Pile cap was designed assuming full rigid conditions at site. When it was noticed that the pile reinforcement was predominantly anchored to the layers of the pile cap reinforcement, it was apprehended that this arrangement does not ensure complete rigidity as assumed, but it makes it only partially flexible. This paper deals with detailed analysis of same pile cap allowing flexibility for calculating the pile forces and moments under the service loads. It was finally concluded after comparing the results of flexible pile cap thus obtained, with that of rigid pile cap, with respect to pile forces and maximum radial moments with reduced global gust factor of 1.21 that reinforcement and the thickness for the pile cap provided, were O.K. and needed no corrective measures
- …