Dynamical entanglement transfer for quantum-information networks

A key element in the architecture of a quantum-information processing network is a reliable physical interface between fields and qubits. We study a process of entanglement transfer engineering, where two remote qubits respectively interact with an entangled two-mode continuous-variable (CV) field. We quantify the entanglement induced in the qubit state at the expenses of the loss of entanglement in the CV system. We discuss the range of mixed entangled states which can be obtained with this setup. Furthermore, we suggest a protocol to determine the residual entangling power of the light fields inferring, thus, the entanglement left in the field modes which, after the interaction, are no longer in a Gaussian state. Two different setups are proposed: a cavity-QED system and an interface between superconducting qubits and field modes. We address in detail the practical difficulties inherent in these two proposals, showing that the latter is promising in many aspects.

Empirical performance of RSSI-based Monte Carlo localisation for active RFID patient tracking systems

The range of potential applications for indoor and campus based personnel localisation has led researchers to create a wide spectrum of different algorithmic approaches and systems. However, the majority of the proposed systems overlook the unique radio environment presented by the human body leading to systematic errors and inaccuracies when deployed in this context. In this paper RSSI-based Monte Carlo Localisation was implemented using commercial 868 MHz off the shelf hardware and empirical data was gathered across a relatively large number of scenarios within a single indoor office environment. This data showed that the body shadowing effect caused by the human body introduced path skew into location estimates. It was also shown that, by using two body-worn nodes in concert, the effect of body shadowing can be mitigated by averaging the estimated position of the two nodes worn on either side of the body. © Springer Science+Business Media, LLC 2012.

Local versus nonlocal cloning in a noisy environment

We address the distribution of quantum information among many parties in the presence of noise. In particular, we consider how to optimally send to m receivers the information encoded into an unknown coherent state. On one hand, a local strategy is considered, consisting in a local cloning process followed by direct transmission. On the other hand, a telecloning protocol based on nonlocal quantum correlations is analysed. Both the strategies are optimized to minimize the detrimental effects due to losses and thermal noise during the propagation. The comparison between the local and the nonlocal protocol shows that telecloning is more effective than local cloning for a wide range of noise parameters. Our results indicate that nonlocal strategies can be more robust against noise than local ones, thus being suitable candidates for playing a major role in quantum information networks.

Tracking smart grid hackers

The next-generation smart grid will rely highly on telecommunications infrastructure for data transfer between various systems. Anywhere we have data transfer in a system is a potential security threat. When we consider the possibility of smart grid data being at the heart of our critical systems infrastructure it is imperative that we do all we can to ensure the confidentiality, availability and integrity of the data. A discussion on security itself is outside the scope of this paper, but if we assume the network to be as secure as possible we must consider what we can do to detect when that security fails, or when the attacks comes from the inside of the network. One way to do this is to setup a hacker-trap, or honeypot. A honeypot is a device or service on a network which appears legitimate, but is in-fact a trap setup to catch breech attempts. This paper identifies the different types of honeypot and describes where each may be used. The authors have setup a test honeypot system which has been live for some time. The test system has been setup to emulate a device on a utility network. The system has had many hits, which are described in detail by the authors. Finally, the authors discuss how larger-scale systems in utilities may benefit from honeypot placement.

Learning Bayesian networks from data: An information-theory based approach

This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop efficient algorithms that can effectively learn Bayesian networks, requiring only polynomial numbers of conditional independence (CI) tests in typical cases. We provide precise conditions that specify when these algorithms are guaranteed to be correct as well as empirical evidence (from real world applications and simulation tests) that demonstrates that these systems work efficiently and reliably in practice.

A decentralized model of information pricing in networks

We propose a recursive method of pricing an information good in a network of holders and demanders of this good. The prices are determined via a unique equilibrium outcome in a sequence of bilateral bargaining games that are played by connected agents. If the information is an homogenous, non-depreciating good without network effects we derive explicit formulae which elucidate the role of the link pattern among the players. Particularly, we find out that the equilibrium price is intimately related to the existence of cycles in the network: It is zero if a cycle covers the trading pair and it is proportional to the direct and indirect utility that the good generates otherwise.

Using time-to-contact information to assess potential collision modulates both visual and temporal prediction networks

Accurate estimates of the time-to-contact (TTC) of approaching objects are crucial for survival. We used an ecologically valid driving simulation to compare and contrast the neural substrates of egocentric (head-on approach) and allocentric (lateral approach) TTC tasks in a fully factorial, event-related fMRI design. Compared to colour control tasks, both egocentric and allocentric TTC tasks activated left ventral premotor cortex/frontal operculum and inferior parietal cortex, the same areas that have previously been implicated in temporal attentional orienting. Despite differences in visual and cognitive demands, both TTC and temporal orienting paradigms encourage the use of temporally predictive information to guide behaviour, suggesting these areas may form a core network for temporal prediction. We also demonstrated that the temporal derivative of the perceptual index tau (tau-dot) held predictive value for making collision judgements and varied inversely with activity in primary visual cortex (V1). Specifically, V1 activity increased with the increasing likelihood of reporting a collision, suggesting top-down attentional modulation of early visual processing areas as a function of subjective collision. Finally, egocentric viewpoints provoked a response bias for reporting collisions, rather than no-collisions, reflecting increased caution for head-on approaches. Associated increases in SMA activity suggest motor preparation mechanisms were engaged, despite the perceptual nature of the task.

The structural information content of chemical networks

We present an information-theoretic method to measure the structural information content of networks and apply it to chemical graphs. As a result, we find that our entropy measure is more general than classical information indices known in mathematical and computational chemistry. Further, we demonstrate that our measure reflects the essence of molecular branching meaningfully by determining the structural information content of some chemical graphs numerically.

Structural information content of networks: Graph entropy based on local vertex functionals

In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss resulting properties. (C) 2007 Elsevier Ltd. All rights reserved.