Sliding mode control based guidance law with impact time constraints

In this paper, the sliding mode control based guidance laws to intercept stationary targets at a desired impact time are proposed. Then, it is extended to constant velocity targets using the notion of predicted interception. The desired impact time is achieved by selecting the interceptor's lateral acceleration to enforce a sliding mode on a switching surface designed using non-linear engagement dynamics. Numerical simulation results are presented to validate the proposed guidance law for different initial engagement geometries, impact times and salvo attack scenarios

LHC constraints on light neutralino dark matter in the MSSM

Light neutralino dark matter can be achieved in the Minimal Supersymmetric Standard Model if staus are rather light, with mass around 100 GeV. We perform a detailed analysis of the relevant supersymmetric parameter space, including also the possibility of light selectons and smuons, and of light higgsino- or wino-like charginos. In addition to the latest limits from direct and indirect detection of dark matter, ATLAS and CMS constraints on electroweak-inos and on sleptons are taken into account using a ``simplified models'' framework. Measurements of the properties of the Higgs boson at 125 GeV, which constrain amongst others the invisible decay of the Higgs boson into a pair of neutralinos, are also implemented in the analysis. We show that viable neutralino dark matter can be achieved for masses as low as 15 GeV. In this case, light charginos close to the LEP bound are required in addition to light right-chiral staus. Significant deviations are observed in the couplings of the 125 GeV Higgs boson. These constitute a promising way to probe the light neutralino dark matter scenario in the next run of the LHC. (C) 2013 Elsevier B.V. All rights reserved.

Non-singular terminal sliding mode guidance and control with terminal angle constraints for non-maneuvering targets

In this paper guidance laws to intercept stationary and constant velocity targets at a desired impact angle, based on sliding mode control theory, are proposed. The desired impact angle, which is defined in terms of a desired line-of-sight (LOS) angle, is achieved in finite time by selecting the missile's lateral acceleration (latax) to enforce non-singular terminal sliding mode on a switching surface designed using this desired LOS angle and based on non-linear engagement dynamics. Numerical simulation results are presented to validate the proposed guidance laws for different initial engagement geometries and impact angles.

Charge and color breaking constraints in MSSM after the Higgs discovery at LHC

We revisit the constraints on the parameter space of the Minimal Supersymmetric Standard Model (MSSM), from charge and color breaking minima in the light of information on the Higgs from the LHC so far. We study the behavior of the scalar potential keeping two light sfermion fields along with the Higgs in the pMSSM framework and analyze the stability of the vacuum. We find that for lightest stops a parts per thousand(2) 1 TeV and small mu a parts per thousand(2) 500 GeV, the absolute stability of the potential can be attained only for . The bounds become stronger for larger values of the mu parameter. Note that this is approximately the value of Xt which maximizes the Higgs mass. Our bounds on the low scale MSSM parameters are more stringent than those reported earlier in literature. We reanalyze the stau sector as well, keeping both staus. We study the connections between the observed Higgs rates and vacuum (meta)stability. We show how a precision study of the ratio of signal strengths, (mu (gamma gamma) /mu (ZZ) ) can shed further light.

Residue specific contributions to stability and activity inferred from saturation mutagenesis and deep sequencing

Multiple methods currently exist for rapid construction and screening of single-site saturation mutagenesis (SSM) libraries in which every codon or nucleotide in a DNA fragment is individually randomized. Nucleotide sequences of each library member before and after screening or selection can be obtained through deep sequencing. The relative enrichment of each mutant at each position provides information on its contribution to protein activity or ligand-binding under the conditions of the screen. Such saturation scans have been applied to diverse proteins to delineate hot-spot residues, stability determinants, and for comprehensive fitness estimates. The data have been used to design proteins with enhanced stability, activity and altered specificity relative to wild-type, to test computational predictions of binding affinity, and for protein model discrimination. Future improvements in deep sequencing read lengths and accuracy should allow comprehensive studies of epistatic effects, of combinational variation at multiple sites, and identification of spatially proximate residues.

Nonsingular Terminal Sliding Mode Guidance with Impact Angle Constraints

Guidance laws based on a conventional sliding mode ensures only asymptotic convergence. However, convergence to the desired impact angle within a finite time is important in most practical guidance applications. These finite time convergent guidance laws suffer from singularity leading to control saturation. In this paper, guidance laws to intercept targets at a desired impact angle, from any initial heading angle, without exhibiting any singularity, are presented. The desired impact angle, which is defined in terms of a desired line-of-sight angle, is achieved in finite time by selecting the interceptor's lateral acceleration to enforce nonsingular terminal sliding mode on a switching surface designed using nonlinear engagement dynamics. Numerical simulation results are presented to validate the proposed guidance laws for different initial engagement geometries and impact angles. Although the guidance laws are designed for constant speed interceptors, its robustness against the time-varying speed of interceptors is also evaluated through extensive simulation results.

Whole exome sequencing identifies a novel splice-site mutation in ADAMTS17 in an Indian family with Weill-Marchesani syndrome

Purpose: Weill-Marchesani syndrome (WMS) is a rare connective tissue disorder, characterized by short stature, micro-spherophakic lens, and stubby hands and feet (brachydactyly). WMS is caused by mutations in the FBN1, ADAMTS10, and LTBP2 genes. Mutations in the LTBP2 and ADAMTS17 genes cause a WMS-like syndrome, in which the affected individuals show major features of WMS but do not display brachydactyly and joint stiffness. The main purpose of our study was to determine the genetic cause of WMS in an Indian family. Methods: Whole exome sequencing (WES) was used to identify the genetic cause of WMS in the family. The cosegregation of the mutation was determined with Sanger sequencing. Reverse transcription (RT)-PCR analysis was used to assess the effect of a splice-site mutation on splicing of the ADAMTS17 transcript. Results: The WES analysis identified a homozygous novel splice-site mutation c.873+1G>T in a known WMS-like syndrome gene, ADAMTS17, in the family. RT-PCR analysis in the patient showed that exon 5 was skipped, which resulted in the deletion of 28 amino acids in the ADAMTS17 protein. Conclusions: The mutation in the WMS-like syndrome gene ADAMTS17 also causes WMS in an Indian family. The present study will be helpful in genetic diagnosis of this family and increases the number of mutations of this gene to six.

Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography

We address the problem of reconstructing a sparse signal from its DFT magnitude. We refer to this problem as the sparse phase retrieval (SPR) problem, which finds applications in tomography, digital holography, electron microscopy, etc. We develop a Fienup-type iterative algorithm, referred to as the Max-K algorithm, to enforce sparsity and successively refine the estimate of phase. We show that the Max-K algorithm possesses Cauchy convergence properties under certain conditions, that is, the MSE of reconstruction does not increase with iterations. We also formulate the problem of SPR as a feasibility problem, where the goal is to find a signal that is sparse in a known basis and whose Fourier transform magnitude is consistent with the measurement. Subsequently, we interpret the Max-K algorithm as alternating projections onto the object-domain and measurement-domain constraint sets and generalize it to a parameterized relaxation, known as the relaxed averaged alternating reflections (RAAR) algorithm. On the application front, we work with measurements acquired using a frequency-domain optical-coherence tomography (FDOCT) experimental setup. Experimental results on measured data show that the proposed algorithms exhibit good reconstruction performance compared with the direct inversion technique, homomorphic technique, and the classical Fienup algorithm without sparsity constraint; specifically, the autocorrelation artifacts and background noise are suppressed to a significant extent. We also demonstrate that the RAAR algorithm offers a broader framework for FDOCT reconstruction, of which the direct inversion technique and the proposed Max-K algorithm become special instances corresponding to specific values of the relaxation parameter.

Optimal Binary Power Control for Underlay CR With Different Interference Constraints and Impact of Channel Estimation Errors

Adapting the power of secondary users (SUs) while adhering to constraints on the interference caused to primary receivers (PRxs) is a critical issue in underlay cognitive radio (CR). This adaptation is driven by the interference and transmit power constraints imposed on the secondary transmitter (STx). Its performance also depends on the quality of channel state information (CSI) available at the STx of the links from the STx to the secondary receiver and to the PRxs. For a system in which an STx is subject to an average interference constraint or an interference outage probability constraint at each of the PRxs, we derive novel symbol error probability (SEP)-optimal, practically motivated binary transmit power control policies. As a reference, we also present the corresponding SEP-optimal continuous transmit power control policies for one PRx. We then analyze the robustness of the optimal policies when the STx knows noisy channel estimates of the links between the SU and the PRxs. Altogether, our work develops a holistic understanding of the critical role played by different transmit and interference constraints in driving power control in underlay CR and the impact of CSI on its performance.

TIME VARYING LINEAR PREDICTION USING SPARSITY CONSTRAINTS

Time-varying linear prediction has been studied in the context of speech signals, in which the auto-regressive (AR) coefficients of the system function are modeled as a linear combination of a set of known bases. Traditionally, least squares minimization is used for the estimation of model parameters of the system. Motivated by the sparse nature of the excitation signal for voiced sounds, we explore the time-varying linear prediction modeling of speech signals using sparsity constraints. Parameter estimation is posed as a 0-norm minimization problem. The re-weighted 1-norm minimization technique is used to estimate the model parameters. We show that for sparsely excited time-varying systems, the formulation models the underlying system function better than the least squares error minimization approach. Evaluation with synthetic and real speech examples show that the estimated model parameters track the formant trajectories closer than the least squares approach.

Constraints on the omega pi form factor from analyticity and unitarity

Motivated by the discrepancies noted recently between the theoretical calculations of the electromagnetic omega pi form factor and certain experimental data, we investigate this form factor using analyticity and unitarity in a framework known as the method of unitarity bounds. We use a QCD correlator computed on the spacelike axis by operator product expansion and perturbative QCD as input, and exploit unitarity and the positivity of its spectral function, including the two-pion contribution that can be reliably calculated using high-precision data on the pion form factor. From this information, we derive upper and lower bounds on the modulus of the omega pi form factor in the elastic region. The results provide a significant check on those obtained with standard dispersion relations, confirming the existence of a disagreement with experimental data in the region around 0.6 GeV.

Whole exome sequencing in an Indian family links Coats plus syndrome and dextrocardia with a homozygous novel CTC1 and a rare HES7 variation

Background: Coats plus syndrome is an autosomal recessive, pleiotropic, multisystem disorder characterized by retinal telangiectasia and exudates, intracranial calcification with leukoencephalopathy and brain cysts, osteopenia with predisposition to fractures, bone marrow suppression, gastrointestinal bleeding and portal hypertension. It is caused by compound heterozygous mutations in the CTC1 gene. Case presentation: We encountered a case of an eight-year old boy from an Indian family with manifestations of Coats plus syndrome along with an unusual occurrence of dextrocardia and situs inversus. Targeted resequencing of the CTC1 gene as well as whole exome sequencing (WES) were conducted in this family to identify the causal variations. The identified candidate variations were screened in ethnicity matched healthy controls. The effect of CTC1 variation on telomere length was assessed using Southern blot. A novel homozygous missense mutation c.1451A > C (p.H484P) in exon 9 of the CTC1 gene and a rare 3'UTR known dbSNP variation (c.*556 T > C) in HES7 were identified as the plausible candidates associated with this complex phenotype of Coats plus and dextrocardia. This CTC1 variation was absent in the controls and we also observed a reduced telomere length in the affected individual's DNA, suggesting its likely pathogenic nature. The reported p.H484P mutation is located in the N-terminal 700 amino acid regionthat is important for the binding of CTC1 to ssDNA through its two OB domains. WES data also showed a rare homozygous missense variation in the TEK gene in the affected individual. Both HES7 and TEK are targets of the Notch signaling pathway. Conclusions: This is the first report of a genetically confirmed case of Coats plus syndrome from India. By means of WES, the genetic variations in this family with unique and rare complex phenotype could be traced effectively. We speculate the important role of Notch signaling in this complex phenotypic presentation of Coats plus syndrome and dextrocardia. The present finding will be useful for genetic diagnosis and carrier detection in the family and for other patients with similar disease manifestations.

Nonlinear constraints on gravity from entanglement

Using the positivity of relative entropy arising from the Ryu-Takayanagi formula for spherical entangling surfaces, we obtain constraints at the nonlinear level for the gravitational dual. We calculate the Green's function necessary to compute the first order correction to the entangling surface and use this to find the relative entropy for non-constant stress tensors in a derivative expansion. We show that the Einstein value satisfies the positivity condition, while the multidimensional parameter space away from it gets constrained.

Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints

This article considers a semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC) defined as a semi-infinite mathematical programming problem with complementarity constraints. We establish necessary and sufficient optimality conditions for the (SIMPEC). We also formulate Wolfe- and Mond-Weir-type dual models for (SIMPEC) and establish weak, strong and strict converse duality theorems for (SIMPEC) and the corresponding dual problems under invexity assumptions.

A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints

We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation problems in wireless communication settings. It is also a special case of an optimization of a separable convex function over the bases of a specially structured polymatroid. We give an alternative proof of the correctness of the algorithm of Padakandla and Sundaresan. In the process we relax some of their restrictions placed on the objective function.