835 research outputs found
Buyback Problem - Approximate matroid intersection with cancellation costs
In the buyback problem, an algorithm observes a sequence of bids and must
decide whether to accept each bid at the moment it arrives, subject to some
constraints on the set of accepted bids. Decisions to reject bids are
irrevocable, whereas decisions to accept bids may be canceled at a cost that is
a fixed fraction of the bid value. Previous to our work, deterministic and
randomized algorithms were known when the constraint is a matroid constraint.
We extend this and give a deterministic algorithm for the case when the
constraint is an intersection of matroid constraints. We further prove a
matching lower bound on the competitive ratio for this problem and extend our
results to arbitrary downward closed set systems. This problem has applications
to banner advertisement, semi-streaming, routing, load balancing and other
problems where preemption or cancellation of previous allocations is allowed
Bifurcations and Chaos in the Six-Dimensional Turbulence Model of Gledzer
The cascade-shell model of turbulence with six real variables originated by
Gledzer is studied numerically using Mathematica 5.1. Periodic, doubly-periodic
and chaotic solutions and the routes to chaos via both frequency-locking and
period-doubling are found by the Poincar\'e plot of the first mode . The
circle map on the torus is well approximated by the summation of several
sinusoidal functions. The dependence of the rotation number on the viscosity
parameter is in accordance with that of the sine-circle map. The complicated
bifurcation structure and the revival of a stable periodic solution at the
smaller viscosity parameter in the present model indicates that the turbulent
state may be very sensitive to the Reynolds number.Comment: 19 pages, 12 figures submitted to JPS
Unconditionally verifiable blind computation
Blind Quantum Computing (BQC) allows a client to have a server carry out a
quantum computation for them such that the client's input, output and
computation remain private. A desirable property for any BQC protocol is
verification, whereby the client can verify with high probability whether the
server has followed the instructions of the protocol, or if there has been some
deviation resulting in a corrupted output state. A verifiable BQC protocol can
be viewed as an interactive proof system leading to consequences for complexity
theory. The authors, together with Broadbent, previously proposed a universal
and unconditionally secure BQC scheme where the client only needs to be able to
prepare single qubits in separable states randomly chosen from a finite set and
send them to the server, who has the balance of the required quantum
computational resources. In this paper we extend that protocol with new
functionality allowing blind computational basis measurements, which we use to
construct a new verifiable BQC protocol based on a new class of resource
states. We rigorously prove that the probability of failing to detect an
incorrect output is exponentially small in a security parameter, while resource
overhead remains polynomial in this parameter. The new resource state allows
entangling gates to be performed between arbitrary pairs of logical qubits with
only constant overhead. This is a significant improvement on the original
scheme, which required that all computations to be performed must first be put
into a nearest neighbour form, incurring linear overhead in the number of
qubits. Such an improvement has important consequences for efficiency and
fault-tolerance thresholds.Comment: 46 pages, 10 figures. Additional protocol added which allows
arbitrary circuits to be verified with polynomial securit
Multifractality in Time Series
We apply the concepts of multifractal physics to financial time series in
order to characterize the onset of crash for the Standard & Poor's 500 stock
index x(t). It is found that within the framework of multifractality, the
"analogous" specific heat of the S&P500 discrete price index displays a
shoulder to the right of the main peak for low values of time lags. On
decreasing T, the presence of the shoulder is a consequence of the peaked,
temporal x(t+T)-x(t) fluctuations in this regime. For large time lags (T>80),
we have found that C_{q} displays typical features of a classical phase
transition at a critical point. An example of such dynamic phase transition in
a simple economic model system, based on a mapping with multifractality
phenomena in random multiplicative processes, is also presented by applying
former results obtained with a continuous probability theory for describing
scaling measures.Comment: 22 pages, Revtex, 4 ps figures - To appear J. Phys. A (2000
Universality in Turbulence: an Exactly Soluble Model
The present note contains the text of lectures discussing the problem of
universality in fully developed turbulence. After a brief description of
Kolmogorov's 1941 scaling theory of turbulence and a comparison between the
statistical approach to turbulence and field theory, we discuss a simple model
of turbulent advection which is exactly soluble but whose exact solution is
still difficult to analyze. The model exhibits a restricted universality. Its
correlation functions contain terms with universal but anomalous scaling but
with non-universal amplitudes typically diverging with the growing size of the
system. Strict universality applies only after such terms have been removed
leaving renormalized correlators with normal scaling. We expect that the
necessity of such an infrared renormalization is a characteristic feature of
universality in turbulence.Comment: 31 pages, late
Iterated maps for clarinet-like systems
The dynamical equations of clarinet-like systems are known to be reducible to
a non-linear iterated map within reasonable approximations. This leads to time
oscillations that are represented by square signals, analogous to the Raman
regime for string instruments. In this article, we study in more detail the
properties of the corresponding non-linear iterations, with emphasis on the
geometrical constructions that can be used to classify the various solutions
(for instance with or without reed beating) as well as on the periodicity
windows that occur within the chaotic region. In particular, we find a regime
where period tripling occurs and examine the conditions for intermittency. We
also show that, while the direct observation of the iteration function does not
reveal much on the oscillation regime of the instrument, the graph of the high
order iterates directly gives visible information on the oscillation regime
(characterization of the number of period doubligs, chaotic behaviour, etc.)
Precision W-boson and top-quark mass determinations at a muon collider
Precise determinations of the masses of the boson and of the top quark
could stringently test the radiative structure of the Standard Model (SM) or
provide evidence for new physics. We analyze the excellent prospects at a muon
collider for measuring and in the and threshold
regions. With an integrated luminosity of 10 (100) fb, the -boson
mass could be measured to a precision of 20 (6) MeV, and the top-quark mass to
a precision of 200 (70) MeV, provided that theoretical and experimental
systematics are understood. A measurement of MeV for fixed
would constrain a 100 GeV SM Higgs mass within about GeV, while
MeV for fixed would constrain to about GeV.Comment: 27 pages, 11 figures, postscript file available via anonymous
ftp://ucdhep.ucdavis.edu/han/mumu/mwmt.p
Renormalisation scheme for vector fields on T2 with a diophantine frequency
We construct a rigorous renormalisation scheme for analytic vector fields on
the 2-torus of Poincare type. We show that iterating this procedure there is
convergence to a limit set with a ``Gauss map'' dynamics on it, related to the
continued fraction expansion of the slope of the frequencies. This is valid for
diophantine frequency vectors.Comment: final versio
Inequality and the safety net throughout the income distribution, 1929-1940
We explored two measures of inequality that described the full income distribution in cities. One
measure is an income gini based on family incomes in 1929 for 33 cities and in 1933 for up to 48
cities in 1933 were spread throughout the country. We also estimated gini coefficients that made
use of contract rents for renters and implicit rents for home owners for up to 955 cities throughout
the country. We were able to expand to all counties when looking at a top-end inequality
measure, the number of taxpayers per family. All three measures varied substantially across the
country. We show the correlations between the various measures and also estimate the
relationship between the measures and various relief programs developed by governments at all
levels during the period.First author draf
A New View on Worst-Case to Average-Case Reductions for NP Problems
We study the result by Bogdanov and Trevisan (FOCS, 2003), who show that
under reasonable assumptions, there is no non-adaptive worst-case to
average-case reduction that bases the average-case hardness of an NP-problem on
the worst-case complexity of an NP-complete problem. We replace the hiding and
the heavy samples protocol in [BT03] by employing the histogram verification
protocol of Haitner, Mahmoody and Xiao (CCC, 2010), which proves to be very
useful in this context. Once the histogram is verified, our hiding protocol is
directly public-coin, whereas the intuition behind the original protocol
inherently relies on private coins
- …