A table-top laser-based source of short, collimated, ultra-relativistic positron beams

An ultra-relativistic electron beam passing through a thick, high-Z solid target triggers an electromagnetic cascade, whereby a large number of high energy photons and electron-positron pairs are produced. By exploiting this physical process, we present here the first experimental evidence of the generation of ultra-short, highly collimated and ultra-relativistic positron beams following the interaction of a laser-wake field accelerated electron beam with high-Z solid targets. Clear evidence has also been obtained of the generation of GeV electron-positron jets with variable composition depending on the solid target material and thickness. The percentage of positrons in the overall leptonic beam has been observed to vary from a few per cent up to almost fifty per cent, implying a quasi-neutral electron-positron beam. We anticipate that these beams will be of direct relevance to the laboratory study of astrophysical leptonic jets and their interaction with the interstellar medium.

Electron-acoustic solitons in an electron-beam plasma system with kappa-distributed electrons

Interaction of a stream of high-energy electrons with the background plasma plays an important role in the astrophysical phenomena such as interplanetary and stellar bow shock and Earth's foreshock emission. It is not yet fully understood how electrostatic solitary waves are produced at the bow shock. Interestingly, a population of energetic suprathermal electrons were also found to exist in those environments. Previously, we have studied the properties of negative electrostatic potential solitary structures exist in such a plasma with excess suprathermal electrons. In the present study, we investigate the existence conditions and propagation properties of electron-acoustic solitary waves in a plasma consisting of an electron beam fluid, a cold electron fluid, and hot suprathermal electrons modeled by a kappa-distribution function. The Sagdeev pseudopotential method was used to investigate the occurrence of stationary-profile solitary waves. We have determined how the electron-acoustic soliton characteristics depend on the electron beam parameters. It is found that the existence domain for solitons becomes narrower with an increase in the suprathermality of hot electrons, increasing the beam speed, decreasing the beam-to-cold electron population ratio. These results lead to a better understanding of the formation of electron-acoustic solitary waves observed in those space plasma systems characterized by kappa-distributed electrons and inertial drifting (beam) electrons.

Electron-acoustic solitons in an electron-beam plasma system with kappa-distributed electrons

We investigate the existence conditions and propagation properties of electron-acoustic solitary waves in a plasma consisting of an electron beam fluid, a cold electron fluid, and a hot suprathermal electron component modeled by a k-distribution function. The Sagdeev pseudopotential method was used to investigate the occurrence of stationary-profile solitary waves. We have determined how the soliton characteristics depend on the electron beam parameters. It is found that the existence domain for solitons becomes narrower with an increase in the suprathermality of hot electrons, increasing the beam speed, and decreasing the beam-to-cold electron population ratio.

Distributed Massive MIMO in Cellular Networks: Impact of Imperfect Hardware and Number of Oscillators

Distributed massive multiple-input multiple-output (MIMO) combines the array gain of coherent MIMO processing with the proximity gains of distributed antenna setups. In this paper, we analyze how transceiver hardware impairments affect the downlink with maximum ratio transmission. We derive closed-form spectral efficiencies expressions and study their asymptotic behavior as the number of the antennas increases. We prove a scaling law on the hardware quality, which reveals that massive MIMO is resilient to additive distortions, while multiplicative phase noise is a limiting factor. It is also better to have separate oscillators at each antenna than one per BS.

OpenFlow Multi-Table Lookup Architecture for Multi-Gigabit Software Defined Networking (SDN)

The proposed multi-table lookup architecture provides SDN-based, high-performance packet classification in an OpenFlow v1.1+ SDN switch. The objective of the demonstration is to show the functionality of the architecture deployed on the NetFPGA SUME Platform.

Synchrophasor-Based Islanding Detection for Distributed Generation Systems Using Systematic Principal Component Analysis Approaches

Systematic principal component analysis (PCA) methods are presented in this paper for reliable islanding detection for power systems with significant penetration of distributed generations (DGs), where synchrophasors recorded by Phasor Measurement Units (PMUs) are used for system monitoring. Existing islanding detection methods such as Rate-of-change-of frequency (ROCOF) and Vector Shift are fast for processing local information, however with the growth in installed capacity of DGs, they suffer from several drawbacks. Incumbent genset islanding detection cannot distinguish a system wide disturbance from an islanding event, leading to mal-operation. The problem is even more significant when the grid does not have sufficient inertia to limit frequency divergences in the system fault/stress due to the high penetration of DGs. To tackle such problems, this paper introduces PCA methods for islanding detection. Simple control chart is established for intuitive visualization of the transients. A Recursive PCA (RPCA) scheme is proposed as a reliable extension of the PCA method to reduce the false alarms for time-varying process. To further reduce the computational burden, the approximate linear dependence condition (ALDC) errors are calculated to update the associated PCA model. The proposed PCA and RPCA methods are verified by detecting abnormal transients occurring in the UK utility network.

Loss-of-Main Monitoring and Detection for Distributed Generations Using Dynamic Principal Component Analysis

In this paper, our previous work on Principal Component Analysis (PCA) based fault detection method is extended to the dynamic monitoring and detection of loss-of-main in power systems using wide-area synchrophasor measurements. In the previous work, a static PCA model was built and verified to be capable of detecting and extracting system faulty events; however the false alarm rate is high. To address this problem, this paper uses a well-known ‘time lag shift’ method to include dynamic behavior of the PCA model based on the synchronized measurements from Phasor Measurement Units (PMU), which is named as the Dynamic Principal Component Analysis (DPCA). Compared with the static PCA approach as well as the traditional passive mechanisms of loss-of-main detection, the proposed DPCA procedure describes how the synchrophasors are linearly
auto- and cross-correlated, based on conducting the singular value decomposition on the augmented time lagged synchrophasor matrix. Similar to the static PCA method, two statistics, namely T2 and Q with confidence limits are calculated to form intuitive charts for engineers or operators to monitor the loss-of-main situation in real time. The effectiveness of the proposed methodology is evaluated on the loss-of-main monitoring of a real system, where the historic data are recorded from PMUs installed in several locations in the UK/Ireland power system.

The Local and the Distributed in the Sonic Arts

This paper addresses the relationship between local and distributed strategies with reference to two recent participatory sound art projects in Belfast and Rio de Janeiro. The local concern for site and place is discussed and juxtaposed with distributed practices, which,by definition question and extend the very notion of site or locale. I refer to examples from ethnomusicology, anthropology and education in which participative horizontal research methodologies lead to a dynamic articulation of local conditions and allow for a reflection on how technology impacts on social interaction and relationships with place. The works of Samuel Araújo, Georgina Born and Brazilian pedagogue Paulo Freire provide a framework of reference in this context.

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.

Memory Cost Analysis for OpenFlow Multiple Table Lookup

Multiple Table Lookup architectures in Software Defined Networking (SDN) open the door for exciting new network applications. The development of the OpenFlow protocol supported the SDN paradigm. However, the first version of the OpenFlow protocol specified a single table lookup model with the associated constraints in flow entry numbers and search capabilities. With the introduction of multiple table lookup in OpenFlow v1.1, flexible and efficient search to support SDN application innovation became possible. However, implementation of multiple table lookup in hardware to meet high performance requirements is non-trivial. One possible approach involves the use of multi-dimensional lookup algorithms. A high lookup performance can be achieved by using embedded memory for flow entry storage. A detailed study of OpenFlow flow filters for multi-dimensional lookup is presented in this paper. Based on a proposed multiple table lookup architecture, the memory consumption and update performance using parallel single field searches are evaluated. The results demonstrate an efficient multi-table lookup implementation with minimum memory usage.

The BLAKE2 Cryptographic Hash and Message Authentication Code (MAC): IETF RFC 7693

This document describes the cryptographic hash function BLAKE2 and makes the algorithm specification and C source code conveniently available to the Internet community. BLAKE2 comes in two main flavors: BLAKE2b is optimized for 64-bit platforms and BLAKE2s for smaller architectures. BLAKE2 can be directly keyed, making it functionally equivalent to a Message Authentication Code (MAC).