Rashbons: properties and their significance

In the presence of a synthetic non-Abelian gauge field that produces a Rashba-like spin-orbit interaction, a collection of weakly interacting fermions undergoes a crossover from a Bardeen-Cooper-Schrieffer (BCS) ground state to a Bose-Einstein condensate (BEC) ground state when the strength of the gauge field is increased (Vyasanakere et al 2011 Phys. Rev. B 84 014512). The BEC that is obtained at large gauge coupling strengths is a condensate of tightly bound bosonic fermion pairs. The properties of these bosons are solely determined by the Rashba gauge field-hence called rashbons. In this paper, we conduct a systematic study of the properties of rashbons and their dispersion. This study reveals a new qualitative aspect of the problem of interacting fermions in non-Abelian gauge fields, i.e. that the rashbon state ceases to exist when the center-of-mass momentum of the fermions exceeds a critical value that is of the order of the gauge coupling strength. The study allows us to estimate the transition temperature of the rashbon BEC and suggests a route to enhance the exponentially small transition temperature of the system with a fixed weak attraction to the order of the Fermi temperature by tuning the strength of the non-Abelian gauge field. The nature of the rashbon dispersion, and in particular the absence of the rashbon states at large momenta, suggests a regime in parameter space where the normal state of the system will be a dynamical mixture of uncondensed rashbons and unpaired helical fermions. Such a state should show many novel features including pseudogap physics.

Flavored co-annihilations

Neutralino dark matter in supersymmetric models is revisited in the presence of flavor violation in the soft supersymmetry breaking sector. We focus on flavor violation the sleptonic sector and study the implications for the co-annihilation regions. Flavor is introduced by a single (mu) over tilde (R) - (T) over tilde (R) insertion in the slepton mass matrix. Limits on insertion from BR(tau -> mu + gamma) are weak in some regions of the parameter space where happen within the amplitudes. We look for overlaps in parameter space where the co-annihilation condition as well as the cancellations within the amplitudes occur. mSUGRA, such overlap regions are not existent, whereas they are present in models non-universal Higgs boundary conditions (NUHM). The effect of flavor violation is fold: (a) it shifts the co-annihilation regions towards lighter neutralino masses (b) co-annihilation cross sections would be modified with the inclusion of flavor violating which can contribute significantly. Even if flavor violation is within the presently limits, this is sufficient to modify the thermally averaged cross-sections by about 15)% in mSUGRA and (20{30)% in NUHM, depending on the parameter space. In overlap regions, the flavor violating cross sections become comparable and in some even dominant to the flavor conserving ones. A comparative study of the channels is for mSUGRA and NUHM cases.

Mesh Simplification Based on Edge Collapsing Could Improve Computational Efficiency in Near Infrared Optical Tomographic Imaging

The diffusion equation-based modeling of near infrared light propagation in tissue is achieved by using finite-element mesh for imaging real-tissue types, such as breast and brain. The finite-element mesh size (number of nodes) dictates the parameter space in the optical tomographic imaging. Most commonly used finite-element meshing algorithms do not provide the flexibility of distinct nodal spacing in different regions of imaging domain to take the sensitivity of the problem into consideration. This study aims to present a computationally efficient mesh simplification method that can be used as a preprocessing step to iterative image reconstruction, where the finite-element mesh is simplified by using an edge collapsing algorithm to reduce the parameter space at regions where the sensitivity of the problem is relatively low. It is shown, using simulations and experimental phantom data for simple meshes/domains, that a significant reduction in parameter space could be achieved without compromising on the reconstructed image quality. The maximum errors observed by using the simplified meshes were less than 0.27% in the forward problem and 5% for inverse problem.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

A spring-mass-lever model, stiffness and inertia maps for single-input, single-output compliant mechanisms

A spring-mass-lever (SML) model is introduced in this paper for a single-input-single-output compliant mechanism to capture its static and dynamic behavior. The SML model is a reduced-order model, and its five parameters provide physical insight and quantify the stiffness and inertia(1) at the input and output ports as well as the transformation of force and displacement between the input and output. The model parameters can be determined with reasonable accuracy without performing dynamic or modal analysis. The paper describes two uses of the SML model: computationally efficient analysis of a system of which the compliant mechanism is a part; and design of compliant mechanisms for the given user-specifications. During design, the SML model enables determining the feasible parameter space of user-specified requirements, assessing the suitability of a compliant mechanism to meet the user-specifications and also selecting and/or re-designing compliant mechanisms from an existing database. Manufacturing constraints, material choice, and other practical considerations are incorporated into this methodology. A micromachined accelerometer and a valve mechanism are used as examples to show the effectiveness of the SML model in analysis and design. (C) 2012 Published by Elsevier Ltd.

Flavoured co-annihilation

In minimal supergravity (mSUGRA) or CMSSM, one of the main co-annihilating partners of the neutralino is the lightest stau, (tau) over tilde (1). In the presence of flavour violation in the right-handed sector, the co-annihilating partner would be a flavour mixed state. The flavour effect is two-fold: (a) It changes the mass of (tau) over tilde (1) thus modifying the parameter space of the co-annihilation and (b) flavour violating scatterings could now contribute to the cross-sections in the early Universe. In fact, it is shown that for large enough delta similar to 0.2, these processes would constitute the dominant channels in co-annihilation regions. The amount of flavour mixing permissible is constrained by flavour violating tau -> mu or tau -> e processes. For Delta(RR) mass insertions, the constraints from flavour violation are not strong enough in some regions of the parameter space due to partial cancellations in the amplitudes. In mSUGRA, the regions with cancelations within LFV amplitudes do not overlap with the regions of co-annihilations. In non-universal Higgs model (NUHM), however, these regions do overlap leading to significant flavoured co-annihilations. At the LHC and other colliders, these regions can constitute for interesting signals.

Engagement of CF3 Group in N-H center dot center dot center dot F-C Hydrogen Bond in the Solution State: NMR Spectroscopy and MD Simulation Studies

Unambiguous evidence for the engagement of CF3 group in N-H center dot center dot center dot F-C hydrogen bond in a low polarity solvent, the first observation of its kind, is reported. The presence of such weak molecular interactions in the solution state is convincingly established by one and two-dimensional H-1, F-19, and natural abundant N-15 NMR spectroscopic studies. The strong and direct evidence is derived by the observation of through-space couplings, such as, (1h)J(FH), (1h)J(FN), and (2h)J(FF), where the spin polarization is transmitted through hydrogen bond. In an interesting example of a molecule containing two CF3 groups getting simultaneously involved in hydrogen bond, where hydrogen bond mediated couplings are not reflected in the NMR spectrum, F-19-F-19 NOESY experiment yielded confirmatory evidence. Significant deviations in the strengths of (1)J(NH), variable temperature, and the solvent induced perturbations yielded additional support. The NMR results are corroborated by both DFT calculations and MD simulations, where the quantitative information on different ways of involvement of fluorine in two and three centered hydrogen bonds, their percentage of occurrences, and geometries have been obtained. The hydrogen bond interaction energies have also been calculated.

A Multilevel Inverter Scheme With Dodecagonal Voltage Space Vectors Based on Flying Capacitor Topology for Induction Motor Drives

This paper presents a multilevel inverter topology suitable for the generation of dodecagonal space vectors instead of hexagonal space vectors as in the case of conventional schemes. This feature eliminates all the 6n +/- 1 (n = odd) harmonics from the phase voltages and currents in the entire modulation range with an increase in the linear modulation range. The topology is realized by flying capacitor-based three-level inverters feeding from two ends of an open-end winding induction motor with asymmetric dc links. The flying capacitor voltages are tightly controlled throughout the modulation range using redundant switching states for any load power factor. A simple and fast carrier-based space-vector pulsewidth modulation (PWM) scheme is also proposed for the topology which utilizes only the sampled amplitudes of the reference wave for the PWM timing computation.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Characterization of Birkhoff-James orthogonality

The Birkhoff-James orthogonality is a generalization of Hilbert space orthogonality to Banach spaces. We investigate this notion of orthogonality when the Banach space has more structures. We start by doing so for the Banach space of square matrices moving gradually to all bounded operators on any Hilbert space, then to an arbitrary C*-algebra and finally a Hilbert C*-module.

Reversible shear-induced crystallization above equilibrium freezing temperature in a lyotropic surfactant system

We demonstrate a unique shear-induced crystallization phenomenon above the equilibrium freezing temperature (T-K(o)) in weakly swollen isotropic (L-i) and lamellar (L-alpha) mesophases with bilayers formed in a cationic-anionic mixed surfactant system. Synchrotron rheological X-ray diffraction study reveals the crystallization transition to be reversible under shear (i.e., on stopping the shear, the nonequilibrium crystalline phase L-c melts back to the equilibrium mesophase). This is different from the shear-driven crystallization below T-K(o), which is irreversible. Rheological optical observations show that the growth of the crystalline phase occurs through a preordering of the L-i phase to an L-alpha phase induced by shear flow, before the nucleation of the Lc phase. Shear diagram of the L-i phase constructed in the parameter space of shear rate ((gamma)) over dot vs. temperature exhibits L-i -> L-c and L-i -> L-alpha transitions above the equilibrium crystallization temperature (T-K(o)), in addition to the irreversible shear-driven nucleation of L-c in the L-i phase below T-K(o). In addition to revealing a unique class of nonequilibrium phase transition, the present study urges a unique approach toward understanding shear-induced phenomena in concentrated mesophases of mixed amphiphilic systems.

Feature Search in the Grassmanian in Online Reinforcement Learning

We consider the problem of finding the best features for value function approximation in reinforcement learning and develop an online algorithm to optimize the mean square Bellman error objective. For any given feature value, our algorithm performs gradient search in the parameter space via a residual gradient scheme and, on a slower timescale, also performs gradient search in the Grassman manifold of features. We present a proof of convergence of our algorithm. We show empirical results using our algorithm as well as a similar algorithm that uses temporal difference learning in place of the residual gradient scheme for the faster timescale updates.

On the unramified principal series of GL(3) over non-archimedean local fields

Let F be a non-archimedean local field and let O be its ring of integers. We give a complete description of the irreducible constituents of the restriction of the unramified principal series representations of GL(3)(F) to GL(3)(O). (C) 2013 Elsevier Inc. All rights reserved.

Fiber Bragg Grating Sensor Instrumentation for Parking Space Occupancy Management

This work aims at providing an effective parking management system by reducing the drivers' searching time for vacant car-parking space, in turn improving the traffic flow in the car park areas. This is achieved by the use of Fiber Bragg Grating Sensor (FBG) sensor instrumentation in vehicle parking management system. Present work involves embedding an array of FBG sensors underground in the parking space, then determining the strain changes on the FBG sensor due to load applied by the vehicle parked in the parking space, occupancy of the parking space is determined. To validate the FBG sensor parking management system, three most common cases have been considered. This closed loop FBG parking management system can give real-time feed-back to space-guidance display board helping the driver in maneuvering the vehicle to the appropriate parking space. The proposed technique offers optimized usage of parking space for the various segments of cars and also facilitates in a conjoined automated billing system, as compared to conventional method of parking systems.

Full-rate full-diversity finite feedback space-time schemes with minimum feedback and transmission duration

A Finite Feedback Scheme (FFS) for a quasi-static MIMO block fading channel with finite N-ary delay-free noise-free feedback consists of N Space-Time Block Codes (STBCs) at the transmitter, one corresponding to each possible value of feedback, and a function at the receiver that generates N-ary feedback. A number of FFSs are available in the literature that provably attain full-diversity. However, there is no known full-diversity criterion that universally applies to all FFSs. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, and based on this criterion the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs is introduced, which are schemes that use minimum amount of feedback N for the given transmission duration T, and minimum T for the given N to achieve full-diversity. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC, and the proposed condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity. Also, a sufficient criterion for full-diversity is given for FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen, using which full-rate (N-t complex symbols per channel use) full-diversity FT-optimal schemes are constructed for all N-t > 1. These are the first full-rate full-diversity FFSs reported in the literature for T < N-t. Simulation results show that the new schemes have the best error performance among all known FFSs.