60,516 research outputs found
Distributed Adaptive Networks: A Graphical Evolutionary Game-Theoretic View
Distributed adaptive filtering has been considered as an effective approach
for data processing and estimation over distributed networks. Most existing
distributed adaptive filtering algorithms focus on designing different
information diffusion rules, regardless of the nature evolutionary
characteristic of a distributed network. In this paper, we study the adaptive
network from the game theoretic perspective and formulate the distributed
adaptive filtering problem as a graphical evolutionary game. With the proposed
formulation, the nodes in the network are regarded as players and the local
combiner of estimation information from different neighbors is regarded as
different strategies selection. We show that this graphical evolutionary game
framework is very general and can unify the existing adaptive network
algorithms. Based on this framework, as examples, we further propose two
error-aware adaptive filtering algorithms. Moreover, we use graphical
evolutionary game theory to analyze the information diffusion process over the
adaptive networks and evolutionarily stable strategy of the system. Finally,
simulation results are shown to verify the effectiveness of our analysis and
proposed methods.Comment: Accepted by IEEE Transactions on Signal Processin
6 Batch Injection and Slipped Beam Tune Measurements in Fermilab's Main Injector
During Nova operations it is planned to run the Fermilab Recycler in a 12
batch slip stacking mode. In preparation for this, measurements of the tune
during a six batch injection and then as the beam is slipped by changing the RF
frequency, but without a 7th injection, have been carried out in the Main
Injector. The coherent tune shifts due to the changing beam intensity were
measured and compared well with the theoretically expected tune shift. The tune
shifts due to changing RF frequency, required for slip stacking, also compare
well with the linear theory, although some nonlinear affects are apparent at
large frequency changes. These results give us confidence that the expected
tunes shifts during 12 batch slip stacking Recycler operations can be
accommodated.Comment: 3 pp. 3rd International Particle Accelerator Conference (IPAC 2012)
20-25 May 2012, New Orleans, Louisian
Quantum computing on encrypted data
The ability to perform computations on encrypted data is a powerful tool for
protecting privacy. Recently, protocols to achieve this on classical computing
systems have been found. Here we present an efficient solution to the quantum
analogue of this problem that enables arbitrary quantum computations to be
carried out on encrypted quantum data. We prove that an untrusted server can
implement a universal set of quantum gates on encrypted quantum bits (qubits)
without learning any information about the inputs, while the client, knowing
the decryption key, can easily decrypt the results of the computation. We
experimentally demonstrate, using single photons and linear optics, the
encryption and decryption scheme on a set of gates sufficient for arbitrary
quantum computations. Because our protocol requires few extra resources
compared to other schemes it can be easily incorporated into the design of
future quantum servers. These results will play a key role in enabling the
development of secure distributed quantum systems
- …