New Lepton Family Symmetry and Neutrino Tribimaximal Mixing

The newly proposed finite symmetry Sigma(81) is applied to the problem of neutrino tribimaximal mixing. The result is more satisfactory than those of previous models based on A_4 in that the use of auxiliary symmetries (or mechanisms) may be avoided. Deviations from the tribimaximal pattern are expected, but because of its basic structure, only tan^2 (theta_12) may differ significantly from 0.5 (say 0.45) with sin^2 (2 theta_23) remaining very close to one, and theta_13 very nearly zero.Comment: 8 pages, no figur

Dynamics of ultra-intense circularly polarized solitons under inhomogeneous plasmas

The dynamics of the ultra-intense circularly polarized solitons under inhomogeneous plasmas are examined. The interaction is modeled by the Maxwell and relativistic hydrodynamic equations and is solved with fully implicit energy-conserving numerical scheme. It is shown that a propagating weak soliton can be decreased and reflected by increasing plasma background, which is consistent with the existing studies based on hypothesis of weak density response. However it is found that ultra-intense soliton is well trapped and kept still when encountering increasing background. Probably, this founding can be applied for trapping and amplifying high-intensity laser-fields.Comment: 4 pages, 3 figures, submitted to Phys. Plasma

A Template for Implementing Fast Lock-free Trees Using HTM

Algorithms that use hardware transactional memory (HTM) must provide a software-only fallback path to guarantee progress. The design of the fallback path can have a profound impact on performance. If the fallback path is allowed to run concurrently with hardware transactions, then hardware transactions must be instrumented, adding significant overhead. Otherwise, hardware transactions must wait for any processes on the fallback path, causing concurrency bottlenecks, or move to the fallback path. We introduce an approach that combines the best of both worlds. The key idea is to use three execution paths: an HTM fast path, an HTM middle path, and a software fallback path, such that the middle path can run concurrently with each of the other two. The fast path and fallback path do not run concurrently, so the fast path incurs no instrumentation overhead. Furthermore, fast path transactions can move to the middle path instead of waiting or moving to the software path. We demonstrate our approach by producing an accelerated version of the tree update template of Brown et al., which can be used to implement fast lock-free data structures based on down-trees. We used the accelerated template to implement two lock-free trees: a binary search tree (BST), and an (a,b)-tree (a generalization of a B-tree). Experiments show that, with 72 concurrent processes, our accelerated (a,b)-tree performs between 4.0x and 4.2x as many operations per second as an implementation obtained using the original tree update template

Fast network configuration in Software Defined Networking

Software Defined Networking (SDN) provides a framework to dynamically adjust and re-program the data plane with the use of flow rules. The realization of highly adaptive SDNs with the ability to respond to changing demands or recover after a network failure in a short period of time, hinges on efficient updates of flow rules. We model the time to deploy a set of flow rules by the update time at the bottleneck switch, and formulate the problem of selecting paths to minimize the deployment time under feasibility constraints as a mixed integer linear program (MILP). To reduce the computation time of determining flow rules, we propose efficient heuristics designed to approximate the minimum-deployment-time solution by relaxing the MILP or selecting the paths sequentially. Through extensive simulations we show that our algorithms outperform current, shortest path based solutions by reducing the total network configuration time up to 55% while having similar packet loss, in the considered scenarios. We also demonstrate that in a networked environment with a certain fraction of failed links, our algorithms are able to reduce the average time to reestablish disrupted flows by 40%

Non-unitarity effects in a realistic low-scale seesaw model

We analyze the structure of the non-unitary leptonic mixing matrix in the inverse seesaw model with heavy singlets accessible at the LHC. In this model, unlike in the usual TeV seesaw scenarios, thelow-scale right-handed neutrinos do not suffer from naturalness issues. Underlying correlations among various parameters governing the non-unitarity effects are established, which leads to a considerable improvement of the generic non-unitarity bounds. In view of this, we study the discovery potential of the non-unitarity effects at future experiments, focusing on the sensitivity limits at a neutrino factory.Comment: 6 pages, 2 figures, numerical results updated, references adde

Selective Equal-Spin Andreev Reflections Induced by Majorana Fermions

In this work, we find that Majorana fermions induce selective equal spin Andreev reflections (SESARs), in which incoming electrons with certain spin polarization in the lead are reflected as counter propagating holes with the same spin. The spin polarization direction of the electrons of this Andreev reflected channel is selected by the Majorana fermions. Moreover, electrons with opposite spin polarization are always reflected as electrons with unchanged spin. As a result, the charge current in the lead is spin-polarized. Therefore, a topological superconductor which supports Majorana fermions can be used as a novel device to create fully spin-polarized currents in paramagnetic leads. We point out that SESARs can also be used to detect Majorana fermions in topological superconductors.Comment: 5 pages, 3 figures. Comments are welcome. Title changed to match published versio