Fermion Electric Dipole Moments in R-parity violating Supersymmetry

In this talk I discuss some aspects of the study of electric dipole moments (EDMs) of the fermions, in the context of R-parity violating (\rpv) Supersymmetry (SUSY). I will start with a brief general discussion of how dipole moments, in general, serve as a probe of physics beyond the Standard Model (SM) and an even briefer summary of \rpv SUSY. I will follow by discussing a general method of analysis for obtaining the leading fermion mass dependence of the dipole moments and present its application to \rpv SUSY case. Then I will summarise the constraints that the analysis of $e,n$ and $Hg$ EDMs provide for the case of trilinear \rpv SUSY couplings and make a few comments on the case of bilinear \rpv, where the general method of analysis proposed by us does not work.

Closed form solutions for element equilibrium and flexibility matrices of eight node rectangular plate bending element using integrated force method

Closed form solutions for equilibrium and flexibility matrices of the Mindlin-Reissner theory based eight-node rectangular plate bending element (MRP8) using integrated Force Method (IFM) are presented in this paper. Though these closed form solutions of equilibrium and flexibility matrices are applicable to plate bending problems with square/rectangular boundaries, they reduce the computational time significantly and give more exact solutions. Presented closed form solutions are validated by solving large number of standard square/rectangular plate bending benchmark problems for deflections and moments and the results are compared with those of similar displacement-based eight-node quadrilateral plate bending elements available in the literature. The results are also compared with the exact solutions.

Accelerating Numerical Linear Algebra Kernels on a Scalable Run Time Reconfigurable Platform

Numerical Linear Algebra (NLA) kernels are at the heart of all computational problems. These kernels require hardware acceleration for increased throughput. NLA Solvers for dense and sparse matrices differ in the way the matrices are stored and operated upon although they exhibit similar computational properties. While ASIC solutions for NLA Solvers can deliver high performance, they are not scalable, and hence are not commercially viable. In this paper, we show how NLA kernels can be accelerated on REDEFINE, a scalable runtime reconfigurable hardware platform. Compared to a software implementation, Direct Solver (Modified Faddeev's algorithm) on REDEFINE shows a 29X improvement on an average and Iterative Solver (Conjugate Gradient algorithm) shows a 15-20% improvement. We further show that solution on REDEFINE is scalable over larger problem sizes without any notable degradation in performance.

Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.

The R-x, R2-x Planes; Some New Ideas for the Study of Nonlinear Systems

Use of some new planes such as the R-x, R2-x (where R represents in the n-dimensional phase space, the radius vector from the origin to any point on the trajectory described by the system) is suggested for analysis of nonlinear systems of any kind. The stability conditions in these planes are given. For easy understanding of the method, the transformation from the phase plane to the R-x, R2-x planes is brought out for second-order systems. In general, while these planes serve as useful as the phase plane, they have proved to be simpler in determining quickly the general behavior of certain classes of second-order nonlinear systems. A chart and a simple formula are suggested to evaluate time easily from the R-x and R2-x trajectories, respectively. A means of solving higher-order nonlinear systems is also illustrated. Finally, a comparative study of the trajectories near singular points on the phase plane and on the new planes is made.

Wrinkled and slack membranes: nonlinear 3D elasticity solutions via smooth DMS-FEM and experiment

The smooth DMS-FEM, recently proposed by the authors, is extended and applied to the geometrically nonlinear and ill-posed problem of a deformed and wrinkled/slack membrane. A key feature of this work is that three-dimensional nonlinear elasticity equations corresponding to linear momentum balance, without any dimensional reduction and the associated approximations, directly serve as the membrane governing equations. Domain discretization is performed with triangular prism elements and the higher order (C1 or more) interelement continuity of the shape functions ensures that the errors arising from possible jumps in the first derivatives of the conventional C0 shape functions do not propagate because the ill-conditioned tangent stiffness matrices are iteratively inverted. The present scheme employs no regularization and exhibits little sensitivity to h-refinement. Although the numerically computed deformed membrane profiles do show some sensitivity to initial imperfections (nonplanarity) in the membrane profile needed to initiate transverse deformations, the overall patterns of the wrinkles and the deformed shapes appear to be less so. Finally, the deformed profiles, computed through the DMS FEM-based weak formulation, are compared with those obtained through an experiment on an ultrathin Kapton membrane, wherein wrinkles form because of the applied boundary displacement conditions. Comparisons with a reported experiment on a rectangular membrane are also provided. These exercises lend credence to the feasibility of the DMS FEM-based numerical route to computing post-wrinkled membrane shapes. Copyright (c) 2012 John Wiley & Sons, Ltd.

Structural characterization of folded pentapeptides containing centrally positioned beta(R)Val, gamma(R)Val and gamma(S)Val residues

A cylindrical pore of similar to 7.5 angstrom diameter containing a one-dimensional water wire, within the confines of a hydrophobic channel lined with the valine side chain, has been observed in crystals of the peptide Boc-D-Pro-Aib-Val-Aib-Val-OMe (1) (Raghavender et al., 2009, 2010). The synthesis and structural characterization in crystals of three backbone homologated analogues Boc-D-Pro-Aib-beta(3)(R) Val-Aib-Val-OMe (2), Boc-D-Pro-Aib-gamma(4)(R)Val-Aib-Val-OMe (3), Boc-D-Pro-Aib-gamma(4)(S)Val-Aib-Val-OMe (4) are described. Crystal structures of peptides 2, 3 and 4 reveal close-packed arrangements in which no pore was formed. In peptides 2 and 3 the N-terminus D-Pro-Aib segment adopted conformations closely related to Type II' beta-turns, while residues 2-4 form one turn of an alpha beta right-handed C-11 helix in 2 and an alpha gamma C-12 helix in 3. In peptide 4, a continuous left-handed helical structure was observed with the D-Pro-Aib segment forming a Type III' beta-turn, followed by one turn of a left-handed alpha gamma C-12 helix. (C) 2012 Elsevier Ltd. All rights reserved.

High-pressure synchrotron x-ray diffraction study of RMnO3 (R=Eu, Gd, Tb and Dy) upto 50 GPa

We have carried out synchrotron based high-pressure x-ray diffraction study of orthorhombic EuMnO3, GdMnO3, TbMnO3 and DyMnO3 up to 54.4, 41.6, 47.0 and 50.2 GPa, respectively. The diffraction peaks of all the four manganites shift monotonically to higher diffraction angles and the crystals retain the orthorhombic structure till the highest pressure. We have fitted the observed volume versus pressure data with the Birch-Murnaghan equation of state and determined the bulk modulus to be 185 +/- 6 GPa, 190 +/- 16 GPa, 188 +/- 9 GPa and 192 +/- 8 GPa for EuMnO3, GdMnO3, TbMnO3 and DyMnO3, respectively. The bulk modulus of EuMnO3 is comparable to other manganites, in contrast to theoretical predictions.

Spectral analysis on SL(2, R)

Let G be the group . For this group we prove a version of Schwartz's theorem on spectral analysis for the group G. We find the sharp range of Lebesgue spaces L (p) (G) for which a smooth function is not mean periodic unless it is a cusp form. Failure of the Schwartz-like theorem is also proved when C (a)(G) is replaced by L (p) (G) with suitable p. We show that the last result is linked with the failure of the Wiener-tauberian theorem for G.

Efficient Methods for Robust Classification Under Uncertainty in Kernel Matrices

In this paper we study the problem of designing SVM classifiers when the kernel matrix, K, is affected by uncertainty. Specifically K is modeled as a positive affine combination of given positive semi definite kernels, with the coefficients ranging in a norm-bounded uncertainty set. We treat the problem using the Robust Optimization methodology. This reduces the uncertain SVM problem into a deterministic conic quadratic problem which can be solved in principle by a polynomial time Interior Point (IP) algorithm. However, for large-scale classification problems, IP methods become intractable and one has to resort to first-order gradient type methods. The strategy we use here is to reformulate the robust counterpart of the uncertain SVM problem as a saddle point problem and employ a special gradient scheme which works directly on the convex-concave saddle function. The algorithm is a simplified version of a general scheme due to Juditski and Nemirovski (2011). It achieves an O(1/T-2) reduction of the initial error after T iterations. A comprehensive empirical study on both synthetic data and real-world protein structure data sets show that the proposed formulations achieve the desired robustness, and the saddle point based algorithm outperforms the IP method significantly.

Digestive ripening: a synthetic method par excellence for core-shell, alloy, and composite nanostructured materials

The solvated metal atom dispersion (SMAD) method has been used for the synthesis of colloids of metal nanoparticles. It is a top-down approach involving condensation of metal atoms in low temperature solvent matrices in a SMAD reactor maintained at 77 K. Warming of the matrix results in a slurry of metal atoms that interact with one another to form particles that grow in size. The organic solvent solvates the particles and acts as a weak capping agent to halt/slow down the growth process to a certain extent. This as-prepared colloid consists of metal nanoparticles that are quite polydisperse. In a process termed as digestive ripening, addition of a capping agent to the as-prepared colloid which is polydisperse renders it highly monodisperse either under ambient or thermal conditions. In this, as yet not well-understood process, smaller particles grow and the larger ones diminish in size until the system attains uniformity in size and a dynamic equilibrium is established. Using the SMAD method in combination with digestive ripening process, highly monodisperse metal, core-shell, alloy, and composite nanoparticles have been synthesized. This article is a review of our contributions together with some literature reports on this methodology to realize various nanostructured materials.

Field extension code based dispersion matrices for coherently detected space-time shift keying

Motivated by the recent Coherent Space-Time Shift Keying (CSTSK) philosophy, we construct new dispersion matrices for rotationally invariant PSK signaling sets. Given a specific PSK signal constellation, the dispersion matrices of the existing CSTSK scheme were chosen by maximizing the mutual information over randomly generated sets of dispersion matrices. In this contribution we propose a general method for constructing a set of structured dispersion matrices for arbitrary PSK signaling sets using Field Extension (FE) codes and then study the attainable Symbol Error Rate (SER) performance of some example constructions. We demonstrate that the proposed dispersion scheme is capable of outperforming the existing dispersion arrangement at medium to high SNRs.