Higgs boson in the MSSM in light of the LHC

We investigate the expectations for the light Higgs signal in the minimal supersymmetric standard model in different search channels at the LHC. After taking into account dark matter and flavor constraints in the minimal supersymmetric standard model with 11 free parameters as well as LHC results on the Higgs sector, we show that the light Higgs signal in the gamma channel is expected to be at most at the level of the standard model Higgs, while the h -> b (b) over bar from W fusion and/or the h -> tau(tau) over bar can be enhanced. For the main discovery mode, we show that a strong suppression of the signal occurs in two different cases: low M-A or large invisible width. The former is however strongly constrained by the recent LHC results. A more modest suppression is associated with the effect of light supersymmetric particles. Looking for such modification of the Higgs properties and searching directly for supersymmetric partners and pseudoscalar Higgs offer two complementary probes of supersymmetry at the LHC.

On maximum entropy and minimum KL-divergence optimization by Grobner basis methods

In this paper we study constrained maximum entropy and minimum divergence optimization problems, in the cases where integer valued sufficient statistics exists, using tools from computational commutative algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. We give an implicit description of maximum entropy models by embedding them in algebraic varieties for which we give a Grobner basis method to compute it. In the cases of minimum KL-divergence models we show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner basis method to embed minimum KL-divergence models in algebraic varieties. (C) 2012 Elsevier Inc. All rights reserved.

Two-User Gaussian Interference Channel with Finite Constellation Input and FDMA

In the two-user Gaussian Strong Interference Channel (GSIC) with finite constellation inputs, it is known that relative rotation between the constellations of the two users enlarges the Constellation Constrained (CC) capacity region. In this paper, a metric for finding the approximate angle of rotation to maximally enlarge the CC capacity is presented. It is shown that for some portion of the Strong Interference (SI) regime, with Gaussian input alphabets, the FDMA rate curve touches the capacity curve of the GSIC. Even as the Gaussian alphabet FDMA rate curve touches the capacity curve of the GSIC, at high powers, with both the users using the same finite constellation, we show that the CC FDMA rate curve lies strictly inside the CC capacity curve for the constellations BPSK, QPSK, 8-PSK, 16-QAM and 64-QAM. It is known that, with Gaussian input alphabets, the FDMA inner-bound at the optimum sum-rate point is always better than the simultaneous-decoding inner-bound throughout the Weak Interference (WI) regime. For a portion of the WI regime, it is shown that, with identical finite constellation inputs for both the users, the simultaneous-decoding inner-bound enlarged by relative rotation between the constellations can be strictly better than the FDMA inner-bound.

Monsoon sensitivity to aerosol direct radiative forcing in the community atmosphere model

Aerosol forcing remains a dominant uncertainty in climate studies. The impact of aerosol direct radiative forcing on Indian monsoon is extremely complex and is strongly dependent on the model, aerosol distribution and characteristics specified in the model, modelling strategy employed as well as on spatial and temporal scales. The present study investigates (i) the aerosol direct radiative forcing impact on mean Indian summer monsoon when a combination of quasi-realistic mean annual cycles of scattering and absorbing aerosols derived from an aerosol transport model constrained with satellite observed Aerosol Optical Depth (AOD) is prescribed, (ii) the dominant feedback mechanism behind the simulated impact of all-aerosol direct radiative forcing on monsoon and (iii) the relative impacts of absorbing and scattering aerosols on mean Indian summer monsoon. We have used CAM3, an atmospheric GCM (AGCM) that has a comprehensive treatment of the aerosol-radiation interaction. This AGCM has been used to perform climate simulations with three different representations of aerosol direct radiative forcing due to the total, scattering aerosols and black carbon aerosols. We have also conducted experiments without any aerosol forcing. Aerosol direct impact due to scattering aerosols causes significant reduction in summer monsoon precipitation over India with a tendency for southward shift of Tropical Convergence Zones (TCZs) over the Indian region. Aerosol forcing reduces surface solar absorption over the primary rainbelt region of India and reduces the surface and lower tropospheric temperatures. Concurrent warming of the lower atmosphere over the warm oceanic region in the south reduces the land-ocean temperature contrast and weakens the monsoon overturning circulation and the advection of moisture into the landmass. This increases atmospheric convective stability, and decreases convection, clouds, precipitation and associated latent heat release. Our analysis reveals a defining negative moisture-advection feedback that acts as an internal damping mechanism spinning down the regional hydrological cycle and leading to significant circulation changes in response to external radiative forcing perturbations. When total aerosol loading (both absorbing and scattering aerosols) is prescribed, dust and black carbon aerosols are found to cause significant atmospheric heating over the monsoon region but the aerosol-induced weakening of meridional lower tropospheric temperature gradient (leading to weaker summer monsoon rainfall) more than offsets the increase in summer-time rainfall resulting from the atmospheric heating effect of absorbing aerosols, leading to a net decrease of summer monsoon rainfall. Further, we have carried out climate simulations with globally constant AODs and also with the constant AODs over the extended Indian region replaced by realistic AODs. Regional aerosol radiative forcing perturbations over the Indian region is found to have impact not only over the region of loading but over remote tropical regions as well. This warrants the need to prescribe realistic aerosol properties in strategic regions such as India in order to accurately assess the aerosol impact.

The antibodies against the computationally designed mimic of the glycoprotein hormone receptor transmembrane domain provide insights into receptor activation and suppress the constitutively activated receptor Mutants

The exoloops of glycoprotein hormone receptors (GpHRs) transduce the signal generated by the ligand-ectodomain interactions to the transmembrane helices either through direct hormonal contact and/or by modulating the interdomain interactions between the hinge region (HinR) and the transmembrane domain (TMD). The ligand-induced conformational alterations in the HinRs and the interhelical loops of luteinizing hormone receptor/follicle stimulating hormone receptor/thyroid stimulating hormone receptor were mapped using exoloop-specific antibodies generated against a mini-TMD protein designed to mimic the native exoloop conformations that were created by joining the thyroid stimulating hormone receptor exoloops constrained through helical tethers and library-derived linkers. The antibody against the mini-TMD specifically recognized all three GpHRs and inhibited the basal and hormone-stimulated cAMP production without affecting hormone binding. Interestingly, binding of the antibody to all three receptors was abolished by prior incubation of the receptors with the respective hormones, suggesting that the exoloops are buried in the hormone-receptor complexes. The antibody also suppressed the high basal activities of gain-of-function mutations in the HinRs, exoloops, and TMDs such as those involved in precocious puberty and thyroid toxic adenomas. Using the antibody and point/deletion/chimeric receptor mutants, we demonstrate that changes in the HinR-exoloop interactions play an important role in receptor activation. Computational analysis suggests that the mini-TMD antibodies act by conformationally locking the transmembrane helices by means of restraining the exoloops and the juxta-membrane regions. Using GpHRs as a model, we describe a novel computational approach of generating soluble TMD mimics that can be used to explain the role of exoloops during receptor activation and their interplay with TMDs.

Integrated parallelization of computations and visualization for large-scale applications

Critical applications like cyclone tracking and earthquake modeling require simultaneous high-performance simulations and online visualization for timely analysis. Faster simulations and simultaneous visualization enable scientists provide real-time guidance to decision makers. In this work, we have developed an integrated user-driven and automated steering framework that simultaneously performs numerical simulations and efficient online remote visualization of critical weather applications in resource-constrained environments. It considers application dynamics like the criticality of the application and resource dynamics like the storage space, network bandwidth and available number of processors to adapt various application and resource parameters like simulation resolution, simulation rate and the frequency of visualization. We formulate the problem of finding an optimal set of simulation parameters as a linear programming problem. This leads to 30% higher simulation rate and 25-50% lesser storage consumption than a naive greedy approach. The framework also provides the user control over various application parameters like region of interest and simulation resolution. We have also devised an adaptive algorithm to reduce the lag between the simulation and visualization times. Using experiments with different network bandwidths, we find that our adaptive algorithm is able to reduce lag as well as visualize the most representative frames.

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.

MPI-based parallel synchronous vector evaluated particle swarm optimization for multi-objective design optimization of composite structures

This paper presents a decentralized/peer-to-peer architecture-based parallel version of the vector evaluated particle swarm optimization (VEPSO) algorithm for multi-objective design optimization of laminated composite plates using message passing interface (MPI). The design optimization of laminated composite plates being a combinatorially explosive constrained non-linear optimization problem (CNOP), with many design variables and a vast solution space, warrants the use of non-parametric and heuristic optimization algorithms like PSO. Optimization requires minimizing both the weight and cost of these composite plates, simultaneously, which renders the problem multi-objective. Hence VEPSO, a multi-objective variant of the PSO algorithm, is used. Despite the use of such a heuristic, the application problem, being computationally intensive, suffers from long execution times due to sequential computation. Hence, a parallel version of the PSO algorithm for the problem has been developed to run on several nodes of an IBM P720 cluster. The proposed parallel algorithm, using MPI's collective communication directives, establishes a peer-to-peer relationship between the constituent parallel processes, deviating from the more common master-slave approach, in achieving reduction of computation time by factor of up to 10. Finally we show the effectiveness of the proposed parallel algorithm by comparing it with a serial implementation of VEPSO and a parallel implementation of the vector evaluated genetic algorithm (VEGA) for the same design problem. (c) 2012 Elsevier Ltd. All rights reserved.

Generalizing the Amplify-and-Forward Relay Gain Model: An Optimal SEP Perspective

Two models for AF relaying, namely, fixed gain and fixed power relaying, have been extensively studied in the literature given their ability to harness spatial diversity. In fixed gain relaying, the relay gain is fixed but its transmit power varies as a function of the source-relay channel gain. In fixed power relaying, the relay transmit power is fixed, but its gain varies. We revisit and generalize the fundamental two-hop AF relaying model. We present an optimal scheme in which an average power constrained AF relay adapts its gain and transmit power to minimize the symbol error probability (SEP) at the destination. Also derived are insightful and practically amenable closed-form bounds for the optimal relay gain. We then analyze the SEP of MPSK, derive tight bounds for it, and characterize the diversity order for Rayleigh fading. Also derived is an SEP approximation that is accurate to within 0.1 dB. Extensive results show that the scheme yields significant energy savings of 2.0-7.7 dB at the source and relay. Optimal relay placement for the proposed scheme is also characterized, and is different from fixed gain or power relaying. Generalizations to MQAM and other fading distributions are also discussed.

Stochastic optimization for adaptive labor staffing in service systems

Service systems are labor intensive. Further, the workload tends to vary greatly with time. Adapting the staffing levels to the workloads in such systems is nontrivial due to a large number of parameters and operational variations, but crucial for business objectives such as minimal labor inventory. One of the central challenges is to optimize the staffing while maintaining system steady-state and compliance to aggregate SLA constraints. We formulate this problem as a parametrized constrained Markov process and propose a novel stochastic optimization algorithm for solving it. Our algorithm is a multi-timescale stochastic approximation scheme that incorporates a SPSA based algorithm for ‘primal descent' and couples it with a ‘dual ascent' scheme for the Lagrange multipliers. We validate this optimization scheme on five real-life service systems and compare it with a state-of-the-art optimization tool-kit OptQuest. Being two orders of magnitude faster than OptQuest, our scheme is particularly suitable for adaptive labor staffing. Also, we observe that it guarantees convergence and finds better solutions than OptQuest in many cases.

Packet scheduling for priority based transmission in energy harvesting sensors

In this paper, we determine packet scheduling policies for efficient power management in Energy Harvesting Sensors (EHS) which have to transmit packets of high and low priorities over a fading channel. We assume that incoming packets are stored in a buffer and the quality of service for a particular type of message is determined by the expected waiting time of packets of that type of message. The sensors are constrained to work with the energy that they garner from the environment. We derive transmit policies which minimize the sum of expected waiting times of the two types of messages, weighted by penalties. First, we show that for schemes with a constant rate of transmission, under a decoupling approximation, a form of truncated channel inversion is optimal. Using this result, we derive optimal solutions that minimize the weighted sum of the waiting times in the different queues.

A constellation power allocation scheme for two-user Gaussian MAC

Constellation Constrained (CC) capacity regions of two-user Gaussian Multiple Access Channels (GMAC) have been recently reported, wherein introducing appropriate rotation between the constellations of the two users is shown to maximally enlarge the CC capacity region. Such a Non-Orthogonal Multiple Access (NO-MA) method of enlarging the CC capacity region is referred to as Constellation Rotation (CR) scheme. In this paper, we propose a novel NO-MA technique called Constellation Power Allocation (CPA) scheme to enlarge the CC capacity region of two-user GMAC. We show that the CPA scheme offers CC sum capacities equal (at low SNR values) or close (at high SNR values) to those offered by the CR scheme with reduced ML decoding complexity for some QAM constellations. For the CR scheme, code pairs approaching the CC sum capacity are known only for the class of PSK and PAM constellations but not for QAM constellations. In this paper, we design code pairs with the CPA scheme to approach the CC sum capacity for 16-QAM constellations. Further, the CPA scheme used for two-user GMAC with random phase offsets is shown to provide larger CC sum capacities at high SNR values compared to the CR scheme.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Joint data detection and dominant singular mode estimation in time varying reciprocal MIMO systems

This paper proposes an algorithm for joint data detection and tracking of the dominant singular mode of a time varying channel at the transmitter and receiver of a time division duplex multiple input multiple output beamforming system. The method proposed is a modified expectation maximization algorithm which utilizes an initial estimate to track the dominant modes of the channel at the transmitter and the receiver blindly; and simultaneously detects the un known data. Furthermore, the estimates are constrained to be within a confidence interval of the previous estimate in order to improve the tracking performance and mitigate the effect of error propagation. Monte-Carlo simulation results of the symbol error rate and the mean square inner product between the estimated and the true singular vector are plotted to show the performance benefits offered by the proposed method compared to existing techniques.

Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors

MATLAB is an array language, initially popular for rapid prototyping, but is now being increasingly used to develop production code for numerical and scientific applications. Typical MATLAB programs have abundant data parallelism. These programs also have control flow dominated scalar regions that have an impact on the program's execution time. Today's computer systems have tremendous computing power in the form of traditional CPU cores and throughput oriented accelerators such as graphics processing units(GPUs). Thus, an approach that maps the control flow dominated regions to the CPU and the data parallel regions to the GPU can significantly improve program performance. In this paper, we present the design and implementation of MEGHA, a compiler that automatically compiles MATLAB programs to enable synergistic execution on heterogeneous processors. Our solution is fully automated and does not require programmer input for identifying data parallel regions. We propose a set of compiler optimizations tailored for MATLAB. Our compiler identifies data parallel regions of the program and composes them into kernels. The problem of combining statements into kernels is formulated as a constrained graph clustering problem. Heuristics are presented to map identified kernels to either the CPU or GPU so that kernel execution on the CPU and the GPU happens synergistically and the amount of data transfer needed is minimized. In order to ensure required data movement for dependencies across basic blocks, we propose a data flow analysis and edge splitting strategy. Thus our compiler automatically handles composition of kernels, mapping of kernels to CPU and GPU, scheduling and insertion of required data transfer. The proposed compiler was implemented and experimental evaluation using a set of MATLAB benchmarks shows that our approach achieves a geometric mean speedup of 19.8X for data parallel benchmarks over native execution of MATLAB.