Discrete Fourier Transform in Nanostructures using Scattering

In this paper we show that the discrete Fourier transform can be performed by scattering a coherent particle or laser beam off a two-dimensional potential that has the shape of rings or peaks. After encoding the initial vector into the two-dimensional potential, the Fourier-transformed vector can be read out by detectors surrounding the potential. The wavelength of the laser beam determines the necessary accuracy of the 2D potential, which makes our method very fault-tolerant.Comment: 6 pages, 5 EPS figures, REVTe

An analysis of security issues in building automation systems

The purpose of Building Automation Systems (BAS) is to centralise the management of a wide range of building services, through the use of integrated protocol and communication media. Through the use of IP-based communication and encapsulated protocols, BAS are increasingly being connected to corporate networks and also being remotely accessed for management purposes, both for convenience and emergency purposes. These protocols, however, were not designed with security as a primary requirement, thus the majority of systems operate with sub-standard or non-existent security implementations, relying on security through obscurity. Research has been undertaken into addressing the shortfalls of security implementations in BAS, however defining the threats against BAS, and detection of these threats is an area that is particularly lacking. This paper presents an overview of the current security measures in BAS, outlining key issues, and methods that can be improved to protect cyber physical systems against the increasing threat of cyber terrorism and hacktivism. Future research aims to further evaluate and improve the detection systems used in BAS through first defining the threats and then applying and evaluating machine learning algorithms for traffic classification and IDS profiling capable of operating on resource constrained BAS

On NCQFT and dimensionless insertions

In these notes, we aim at a precise definition of the tree level action for the noncommutative scalar and gauge field theories on four-dimensional canonically deformed Euclidean space. As tools to achieve this goal we employ power counting and normalization conditions.Comment: 10 page

Speech Recognition by Composition of Weighted Finite Automata

We present a general framework based on weighted finite automata and weighted finite-state transducers for describing and implementing speech recognizers. The framework allows us to represent uniformly the information sources and data structures used in recognition, including context-dependent units, pronunciation dictionaries, language models and lattices. Furthermore, general but efficient algorithms can used for combining information sources in actual recognizers and for optimizing their application. In particular, a single composition algorithm is used both to combine in advance information sources such as language models and dictionaries, and to combine acoustic observations and information sources dynamically during recognition.Comment: 24 pages, uses psfig.st

Distributed Computing with Adaptive Heuristics

We use ideas from distributed computing to study dynamic environments in which computational nodes, or decision makers, follow adaptive heuristics (Hart 2005), i.e., simple and unsophisticated rules of behavior, e.g., repeatedly "best replying" to others' actions, and minimizing "regret", that have been extensively studied in game theory and economics. We explore when convergence of such simple dynamics to an equilibrium is guaranteed in asynchronous computational environments, where nodes can act at any time. Our research agenda, distributed computing with adaptive heuristics, lies on the borderline of computer science (including distributed computing and learning) and game theory (including game dynamics and adaptive heuristics). We exhibit a general non-termination result for a broad class of heuristics with bounded recall---that is, simple rules of behavior that depend only on recent history of interaction between nodes. We consider implications of our result across a wide variety of interesting and timely applications: game theory, circuit design, social networks, routing and congestion control. We also study the computational and communication complexity of asynchronous dynamics and present some basic observations regarding the effects of asynchrony on no-regret dynamics. We believe that our work opens a new avenue for research in both distributed computing and game theory.Comment: 36 pages, four figures. Expands both technical results and discussion of v1. Revised version will appear in the proceedings of Innovations in Computer Science 201

\u3cem\u3eEx Vivo\u3c/em\u3e Diffusion Tensor Imaging of Spinal Cord Injury in Rats of Varying Degrees of Severity

The aim of this study was to characterize magnetic resonance diffusion tensor imaging (DTI) in proximal regions of the spinal cord following a thoracic spinal cord injury (SCI). Sprague–Dawley rats (n = 40) were administered a control, mild, moderate, or severe contusion injury at the T8 vertebral level. Six direction diffusion weighted images (DWIs) were collected ex vivo along the length of the spinal cord, with an echo/repetition time of 31.6 ms/14 sec and b = 500 sec/mm2. Diffusion metrics were correlated to hindlimb motor function. Significant differences were found for whole cord region of interest (ROI) drawings for fractional anisotropy (FA), mean diffusivity (MD), longitudinal diffusion coefficient (LD), and radial diffusion coefficient (RD) at each of the cervical levels ( p \u3c 0.01). Motor function correlated with MD in the cervical segments of the spinal cord (r2 = 0.80). The diffusivity of water significantly decreased throughout ‘‘uninjured’’ portions of the spinal cord following a contusion injury ( p \u3c 0.05). Diffusivity metrics were found to be altered following SCI in both white and gray matter regions. Injury severity was associated with diffusion changes over the entire length of the cord. This study demonstrates that DTI is sensitive to SCI in regions remote from injury, suggesting that the diffusion metrics may be used as a biomarker for severity of injury

A signature of anisotropic bubble collisions

Our universe may have formed via bubble nucleation in an eternally-inflating background. Furthermore, the background may have a compact dimension---the modulus of which tunnels out of a metastable minimum during bubble nucleation---which subsequently grows to become one of our three large spatial dimensions. When in this scenario our bubble universe collides with other ones like it, the collision geometry is constrained by the reduced symmetry of the tunneling instanton. While the regions affected by such bubble collisions still appear (to leading order) as disks in an observer's sky, the centers of these disks all lie on a single great circle, providing a distinct signature of anisotropic bubble nucleation.Comment: 10 pages, 5 figures; v2: crucial error corrected, conclusions revise