533 research outputs found
Non-Preemptive Scheduling on Machines with Setup Times
Consider the problem in which n jobs that are classified into k types are to
be scheduled on m identical machines without preemption. A machine requires a
proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n, m and k
and computes a solution with an approximation factor that can be made
arbitrarily close to 3/2.Comment: A conference version of this paper has been accepted for publication
in the proceedings of the 14th Algorithms and Data Structures Symposium
(WADS
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
In the classical problem of scheduling on unrelated parallel machines, a set
of jobs has to be assigned to a set of machines. The jobs have a processing
time depending on the machine and the goal is to minimize the makespan, that is
the maximum machine load. It is well known that this problem is NP-hard and
does not allow polynomial time approximation algorithms with approximation
guarantees smaller than unless PNP. We consider the case that there
are only a constant number of machine types. Two machines have the same
type if all jobs have the same processing time for them. This variant of the
problem is strongly NP-hard already for . We present an efficient
polynomial time approximation scheme (EPTAS) for the problem, that is, for any
an assignment with makespan of length at most
times the optimum can be found in polynomial time in the
input length and the exponent is independent of . In particular
we achieve a running time of , where
denotes the input length. Furthermore, we study three other problem
variants and present an EPTAS for each of them: The Santa Claus problem, where
the minimum machine load has to be maximized; the case of scheduling on
unrelated parallel machines with a constant number of uniform types, where
machines of the same type behave like uniformly related machines; and the
multidimensional vector scheduling variant of the problem where both the
dimension and the number of machine types are constant. For the Santa Claus
problem we achieve the same running time. The results are achieved, using mixed
integer linear programming and rounding techniques
Phase transition and hyperscaling violation for scalar Black Branes
We investigate the thermodynamical behavior and the scaling symmetries of the
scalar dressed black brane (BB) solutions of a recently proposed, exactly
integrable Einstein-scalar gravity model [1], which also arises as
compactification of (p-1)-branes with a smeared charge. The extremal, zero
temperature, solution is a scalar soliton interpolating between a conformal
invariant AdS vacuum in the near-horizon region and a scale covariant metric
(generating hyperscaling violation on the boundary field theory)
asymptotically. We show explicitly that for the boundary field theory this
implies the emergence of an UV length scale (related to the size of the brane),
which decouples in the IR, where conformal invariance is restored. We also show
that at high temperatures the system undergoes a phase transition. Whereas at
small temperature the Schwarzschild-AdS BB is stable, above a critical
temperature the scale covariant, scalar-dressed BB solution, becomes
energetically preferred. We calculate the critical exponent z and the
hyperscaling violation parameter of the scalar-dressed phase. In particular we
show that the hyperscaling violation parameter is always negative. We also show
that the above features are not a peculiarity of the exact integrable model of
Ref.[1], but are a quite generic feature of Einstein-scalar and
Einstein-Maxwell-scalar gravity models for which the squared-mass of the scalar
field is positive and the potential vanishes exponentially as the scalar field
goes to minus infinity.Comment: 20 pages, 4 figures. In the revised version it has been pointed out
that the Einstein-scalar gravity model considered in the paper also arises as
compactification of black p-branes with smeared charge
Nernst branes from special geometry
We construct new black brane solutions in gauged
supergravity with a general cubic prepotential, which have entropy density
as and thus satisfy the Nernst Law. By using
the real formulation of special geometry, we are able to obtain analytical
solutions in closed form as functions of two parameters, the temperature
and the chemical potential . Our solutions interpolate between
hyperscaling violating Lifshitz geometries with at the
horizon and at infinity. In the zero temperature limit,
where the entropy density goes to zero, we recover the extremal Nernst branes
of Barisch et al, and the parameters of the near horizon geometry change to
.Comment: 37 pages. v2: numerical pre-factors of scalar fields q_A corrected in
Section 3. No changes to conclusions. References adde
Aspects of holography for theories with hyperscaling violation
We analyze various aspects of the recently proposed holographic theories with
general dynamical critical exponent z and hyperscaling violation exponent
. We first find the basic constraints on from the gravity
side, and compute the stress-energy tensor expectation values and scalar
two-point functions. Massive correlators exhibit a nontrivial exponential
behavior at long distances, controlled by . At short distance, the
two-point functions become power-law, with a universal form for .
Next, the calculation of the holographic entanglement entropy reveals the
existence of novel phases which violate the area law. The entropy in these
phases has a behavior that interpolates between that of a Fermi surface and
that exhibited by systems with extensive entanglement entropy. Finally, we
describe microscopic embeddings of some metrics into full
string theory models -- these metrics characterize large regions of the
parameter space of Dp-brane metrics for . For instance, the theory of
N D2-branes in IIA supergravity has z=1 and over a wide range
of scales, at large .Comment: 35 pages; v2: new references added; v3: proper reference [14] added;
v4: minor clarification
Stochastic Gravity: Theory and Applications
Whereas semiclassical gravity is based on the semiclassical Einstein equation
with sources given by the expectation value of the stress-energy tensor of
quantum fields, stochastic semiclassical gravity is based on the
Einstein-Langevin equation, which has in addition sources due to the noise
kernel.In the first part, we describe the fundamentals of this new theory via
two approaches: the axiomatic and the functional. In the second part, we
describe three applications of stochastic gravity theory. First, we consider
metric perturbations in a Minkowski spacetime: we compute the two-point
correlation functions for the linearized Einstein tensor and for the metric
perturbations. Second, we discuss structure formation from the stochastic
gravity viewpoint. Third, we discuss the backreaction of Hawking radiation in
the gravitational background of a quasi-static black hole.Comment: 75 pages, no figures, submitted to Living Reviews in Relativit
Stochastic Gravity: Theory and Applications
Whereas semiclassical gravity is based on the semiclassical Einstein equation
with sources given by the expectation value of the stress-energy tensor of
quantum fields, stochastic semiclassical gravity is based on the
Einstein-Langevin equation, which has in addition sources due to the noise
kernel. In the first part, we describe the fundamentals of this new theory via
two approaches: the axiomatic and the functional. In the second part, we
describe three applications of stochastic gravity theory. First, we consider
metric perturbations in a Minkowski spacetime, compute the two-point
correlation functions of these perturbations and prove that Minkowski spacetime
is a stable solution of semiclassical gravity. Second, we discuss structure
formation from the stochastic gravity viewpoint. Third, we discuss the
backreaction of Hawking radiation in the gravitational background of a black
hole and describe the metric fluctuations near the event horizon of an
evaporating black holeComment: 100 pages, no figures; an update of the 2003 review in Living Reviews
in Relativity gr-qc/0307032 ; it includes new sections on the Validity of
Semiclassical Gravity, the Stability of Minkowski Spacetime, and the Metric
Fluctuations of an Evaporating Black Hol
Nash Social Welfare in Selfish and Online Load Balancing
In load balancing problems there is a set of clients, each wishing to select
a resource from a set of permissible ones, in order to execute a certain task.
Each resource has a latency function, which depends on its workload, and a
client's cost is the completion time of her chosen resource. Two fundamental
variants of load balancing problems are {\em selfish load balancing} (aka. {\em
load balancing games}), where clients are non-cooperative selfish players aimed
at minimizing their own cost solely, and {\em online load balancing}, where
clients appear online and have to be irrevocably assigned to a resource without
any knowledge about future requests. We revisit both selfish and online load
balancing under the objective of minimizing the {\em Nash Social Welfare},
i.e., the geometric mean of the clients' costs. To the best of our knowledge,
despite being a celebrated welfare estimator in many social contexts, the Nash
Social Welfare has not been considered so far as a benchmarking quality measure
in load balancing problems. We provide tight bounds on the price of anarchy of
pure Nash equilibria and on the competitive ratio of the greedy algorithm under
very general latency functions, including polynomial ones. For this particular
class, we also prove that the greedy strategy is optimal as it matches the
performance of any possible online algorithm
Quality of life, depression and anxiety among pregnant women with previous adverse pregnancy outcomes
The long-term prediction of return to work following serious accidental injuries: A follow up study
Background Considerable indirect costs are incurred by time taken off work following accidental injuries. The aim of this study was to predict return to work following serious accidental injuries. Method 121 severely injured patients were included in the study. Complete follow-up data were available for 85 patients. Two weeks post trauma (T1), patients rated their appraisal of the injury severity and their ability to cope with the injury and its job-related consequences. Time off work was assessed at one (T2) and three years (T3) post accident. The main outcome was the number of days of sick leave taken due to the accidental injury. Results The patients' appraisals a) of the injury severity and b) of their coping abilities regarding the accidental injury and its job-related consequences were significant predictors of the number of sick-leave days taken. Injury severity (ISS), type of accident, age and gender did not contribute significantly to the prediction. Conclusions Return to work in the long term is best predicted by the patients' own appraisal of both their injury severity and the ability to cope with the accidental injury
- âŚ