586 research outputs found
The K-Server Dual and Loose Competitiveness for Paging
This paper has two results. The first is based on the surprising observation
that the well-known ``least-recently-used'' paging algorithm and the
``balance'' algorithm for weighted caching are linear-programming primal-dual
algorithms. This observation leads to a strategy (called ``Greedy-Dual'') that
generalizes them both and has an optimal performance guarantee for weighted
caching.
For the second result, the paper presents empirical studies of paging
algorithms, documenting that in practice, on ``typical'' cache sizes and
sequences, the performance of paging strategies are much better than their
worst-case analyses in the standard model suggest. The paper then presents
theoretical results that support and explain this. For example: on any input
sequence, with almost all cache sizes, either the performance guarantee of
least-recently-used is O(log k) or the fault rate (in an absolute sense) is
insignificant.
Both of these results are strengthened and generalized in``On-line File
Caching'' (1998).Comment: conference version: "On-Line Caching as Cache Size Varies", SODA
(1991
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times
on m identical parallel machines. The objective is to minimize the average flow
time. We show that when all jobs have equal processing times then the problem
can be solved in polynomial time using linear programming. Our algorithm can
also be applied to the open-shop problem with release times and unit processing
times. For the general case (when processing times are arbitrary), we show that
the problem is unary NP-hard.Comment: Subsumes and replaces cs.DS/0412094 and "Complexity of mean flow time
scheduling problems with release dates" by P.B, S.
Nanoscale deformation of GaAs affected by silicon doping
Effect of silicon doping on the elastic–plastic transition of GaAs crystal is demonstrated by results of nanoindentations
and ab initio simulations. The performed experiments show that an increase of silicon concentration
causes a decrease of the contact pressure at the onset of permanent nanodeformation of GaAs crystal. Ab initio
calculations demonstrate that presence of Si atoms in the crystal lattice suppresses the shear modulus as well as
the pressure of equilibrium between zinc-blende and rock-salt phases of GaAs. Furthermore, it is argued that the
effect of dislocations pinning to Si dopants is essential for clarification of GaAs yielding
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
We study the problem of information gathering in ad-hoc radio networks
without collision detection, focussing on the case when the network forms a
tree, with edges directed towards the root. Initially, each node has a piece of
information that we refer to as a rumor. Our goal is to design protocols that
deliver all rumors to the root of the tree as quickly as possible. The protocol
must complete this task within its allotted time even though the actual tree
topology is unknown when the computation starts. In the deterministic case,
assuming that the nodes are labeled with small integers, we give an O(n)-time
protocol that uses unbounded messages, and an O(n log n)-time protocol using
bounded messages, where any message can include only one rumor. We also
consider fire-and-forward protocols, in which a node can only transmit its own
rumor or the rumor received in the previous step. We give a deterministic
fire-and- forward protocol with running time O(n^1.5), and we show that it is
asymptotically optimal. We then study randomized algorithms where the nodes are
not labelled. In this model, we give an O(n log n)-time protocol and we prove
that this bound is asymptotically optimal
On Packet Scheduling with Adversarial Jamming and Speedup
In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes
arrive over time to be transmitted over a channel in which instantaneous
jamming errors occur at times chosen by the adversary and not known to the
algorithm. The transmission taking place at the time of jamming is corrupt, and
the algorithm learns this fact immediately. An online algorithm maximizes the
total size of packets it successfully transmits and the goal is to develop an
algorithm with the lowest possible asymptotic competitive ratio, where the
additive constant may depend on packet sizes.
Our main contribution is a universal algorithm that works for any speedup and
packet sizes and, unlike previous algorithms for the problem, it does not need
to know these properties in advance. We show that this algorithm guarantees
1-competitiveness with speedup 4, making it the first known algorithm to
maintain 1-competitiveness with a moderate speedup in the general setting of
arbitrary packet sizes. We also prove a lower bound of on
the speedup of any 1-competitive deterministic algorithm, showing that our
algorithm is close to the optimum.
Additionally, we formulate a general framework for analyzing our algorithm
locally and use it to show upper bounds on its competitive ratio for speedups
in and for several special cases, recovering some previously known
results, each of which had a dedicated proof. In particular, our algorithm is
3-competitive without speedup, matching both the (worst-case) performance of
the algorithm by Jurdzinski et al. and the lower bound by Anta et al.Comment: Appeared in Proc. of the 15th Workshop on Approximation and Online
Algorithms (WAOA 2017
Remarks on separating words
The separating words problem asks for the size of the smallest DFA needed to
distinguish between two words of length <= n (by accepting one and rejecting
the other). In this paper we survey what is known and unknown about the
problem, consider some variations, and prove several new results
The Electronic and Magnetic Properties of YbxGd1-xNi5 Systems
The intermetallic compounds YbxGd1¡xNi5 crystallize in the hexagonal CaCu5-type structure. Based on
wide ranging SQUID-type magnetometer, it was shown that the saturation magnetization decreases with growing
concentration of ytterbium. The opposite tendency was observed for the Sommerfeld coefficient obtained in the
heat capacity measurements. These results are confirmed using ab initio band structure calculations
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains
It is known that the First-Fit algorithm for partitioning a poset P into
chains uses relatively few chains when P does not have two incomparable chains
each of size k. In particular, if P has width w then Bosek, Krawczyk, and
Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound
of ckw^{2} on the number of chains used by First-Fit for some constant c, while
Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this
paper we prove an upper bound of the form ckw. This is best possible up to the
value of c.Comment: v3: referees' comments incorporate
The Minimum Backlog Problem
We study the minimum backlog problem (MBP). This online problem arises, e.g.,
in the context of sensor networks. We focus on two main variants of MBP.
The discrete MBP is a 2-person game played on a graph . The player
is initially located at a vertex of the graph. In each time step, the adversary
pours a total of one unit of water into cups that are located on the vertices
of the graph, arbitrarily distributing the water among the cups. The player
then moves from her current vertex to an adjacent vertex and empties the cup at
that vertex. The player's objective is to minimize the backlog, i.e., the
maximum amount of water in any cup at any time.
The geometric MBP is a continuous-time version of the MBP: the cups are
points in the two-dimensional plane, the adversary pours water continuously at
a constant rate, and the player moves in the plane with unit speed. Again, the
player's objective is to minimize the backlog.
We show that the competitive ratio of any algorithm for the MBP has a lower
bound of , where is the diameter of the graph (for the discrete
MBP) or the diameter of the point set (for the geometric MBP). Therefore we
focus on determining a strategy for the player that guarantees a uniform upper
bound on the absolute value of the backlog.
For the absolute value of the backlog there is a trivial lower bound of
, and the deamortization analysis of Dietz and Sleator gives an
upper bound of for cups. Our main result is a tight upper
bound for the geometric MBP: we show that there is a strategy for the player
that guarantees a backlog of , independently of the number of cups.Comment: 1+16 pages, 3 figure
Temporal decorrelation of collective oscillations in neural networks with local inhibition and long-range excitation
We consider two neuronal networks coupled by long-range excitatory
interactions. Oscillations in the gamma frequency band are generated within
each network by local inhibition. When long-range excitation is weak, these
oscillations phase-lock with a phase-shift dependent on the strength of local
inhibition. Increasing the strength of long-range excitation induces a
transition to chaos via period-doubling or quasi-periodic scenarios. In the
chaotic regime oscillatory activity undergoes fast temporal decorrelation. The
generality of these dynamical properties is assessed in firing-rate models as
well as in large networks of conductance-based neurons.Comment: 4 pages, 5 figures. accepted for publication in Physical Review
Letter
- …