Non-Volatile Magnonic Logic Circuits Engineering

We propose a concept of magnetic logic circuits engineering, which takes an advantage of magnetization as a computational state variable and exploits spin waves for information transmission. The circuits consist of magneto-electric cells connected via spin wave buses. We present the result of numerical modeling showing the magneto-electric cell switching as a function of the amplitude as well as the phase of the spin wave. The phase-dependent switching makes it possible to engineer logic gates by exploiting spin wave buses as passive logic elements providing a certain phase-shift to the propagating spin waves. We present a library of logic gates consisting of magneto-electric cells and spin wave buses providing 0 or p phase shifts. The utilization of phases in addition to amplitudes is a powerful tool which let us construct logic circuits with a fewer number of elements than required for CMOS technology. As an example, we present the design of the magnonic Full Adder Circuit comprising only 5 magneto-electric cells. The proposed concept may provide a route to more functional wave-based logic circuitry with capabilities far beyond the limits of the traditional transistor-based approach

Pressure and isotope effect on the anisotropy of MgB2_{2}

We analyze the data for the pressure and boron isotope effect on the temperature dependence of the magnetization near $T_{c}$. Invoking the universal scaling relation for the magnetization at fixed magnetic field it is shown that the relative shift of $T_{c}$, induced by pressure or boron isotope exchange, mirrors essentially that of the anisotropy. This uncovers a novel generic property of anisotropic type II superconductors, inexistent in the isotropic case. For MgB$_{2}$ it implies that the renormalization of the Fermi surface topology due to pressure or isotope exchange is dominated by a mechanism controlling the anisotropy.Comment: 7 pages, 3 figure

New limits on "odderon" amplitudes from analyticity constraints

In studies of high energy $pp$ and $\bar pp$ scattering, the odd (under crossing) forward scattering amplitude accounts for the difference between the $pp$ and $\bar pp$ cross sections. Typically, it is taken as $f_-=-\frac{p}{4\pi}Ds^{\alpha-1}e^{i\pi(1-\alpha)/2}$ ($\alpha\sim 0.5$), which has $\Delta\sigma, \Delta\rho\to0$ as $s\to\infty$, where $\rho$ is the ratio of the real to the imaginary portion of the forward scattering amplitude. However, the odd-signatured amplitude can have in principle a strikingly different behavior, ranging from having $\Delta\sigma\to$non-zero constant to having $\Delta\sigma \to \ln s/s_0$ as $s\to\infty$, the maximal behavior allowed by analyticity and the Froissart bound. We reanalyze high energy $pp$ and $\bar pp$ scattering data, using new analyticity constraints, in order to put new and precise limits on the magnitude of ``odderon'' amplitudes.Comment: 13 pages LaTex, 6 figure

Possible Deviation from the Tri-bimaximal Neutrino Mixing in a Seesaw Model

We propose a simple but suggestive seesaw model with two phenomenological conjectures: three heavy (right-handed) Majorana neutrinos are degenerate in mass in the symmetry limit and three light Majorana neutrinos have the tri-bimaximal mixing pattern $V^{}_0$. We show that a small mass splitting between the first generation and the other two generations of heavy Majorana neutrinos is responsible for the deviation of the solar neutrino mixing angle $\theta^{}_{12}$ from its initial value $35.3^\circ$ given by $V^{}_0$, and the slight breaking of the mass degeneracy between the second and third generations of heavy Majorana neutrinos results in a small mixing angle $\theta^{}_{13}$ and a tiny departure of the atmospheric neutrino mixing angle $\theta^{}_{23}$ from $45^\circ$. It turns out that a normal hierarchy of the light neutrino mass spectrum is favored in this seesaw scenario.Comment: RevTex 12 pages (2 EPS figures included). More discussions and references adde

A General Optimization Technique for High Quality Community Detection in Complex Networks

Recent years have witnessed the development of a large body of algorithms for community detection in complex networks. Most of them are based upon the optimization of objective functions, among which modularity is the most common, though a number of alternatives have been suggested in the scientific literature. We present here an effective general search strategy for the optimization of various objective functions for community detection purposes. When applied to modularity, on both real-world and synthetic networks, our search strategy substantially outperforms the best existing algorithms in terms of final scores of the objective function; for description length, its performance is on par with the original Infomap algorithm. The execution time of our algorithm is on par with non-greedy alternatives present in literature, and networks of up to 10,000 nodes can be analyzed in time spans ranging from minutes to a few hours on average workstations, making our approach readily applicable to tasks which require the quality of partitioning to be as high as possible, and are not limited by strict time constraints. Finally, based on the most effective of the available optimization techniques, we compare the performance of modularity and code length as objective functions, in terms of the quality of the partitions one can achieve by optimizing them. To this end, we evaluated the ability of each objective function to reconstruct the underlying structure of a large set of synthetic and real-world networks.Comment: MAIN text: 14 pages, 4 figures, 1 table Supplementary information: 19 pages, 8 figures, 5 table