Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called View the MathML source’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of View the MathML source’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].

The alpha method for solving differential algebraic inequality (DAI) systems

This paper describes an algorithm for ``direct numerical integration'' of the initial value Differential-Algebraic Inequalities (DAI) in a time stepping fashion using a sequential quadratic programming (SQP) method solver for detecting and satisfying active path constraints at each time step. The activation of a path constraint generally increases the condition number of the active discretized differential algebraic equation's (DAE) Jacobian and this difficulty is addressed by a regularization property of the alpha method. The algorithm is locally stable when index 1 and index 2 active path constraints and bounds are active. Subject to available regularization it is seen to be stable for active index 3 active path constraints in the numerical examples. For the high index active path constraints, the algorithm uses a user-selectable parameter to perturb the smaller singular values of the Jacobian with a view to reducing the condition number so that the simulation can proceed. The algorithm can be used as a relatively cheaper estimation tool for trajectory and control planning and in the context of model predictive control solutions. It can also be used to generate initial guess values of optimization variables used as input to inequality path constrained dynamic optimization problems. The method is illustrated with examples from space vehicle trajectory and robot path planning.

Neuromagnetic studies on cortical somatosensory functions in infants and children : Normal development and effect of early brain lesions

Until recently, objective investigation of the functional development of the human brain in vivo was challenged by the lack of noninvasive research methods. Consequently, fairly little is known about cortical processing of sensory information even in healthy infants and children. Furthermore, mechanisms by which early brain insults affect brain development and function are poorly understood. In this thesis, we used magnetoencephalography (MEG) to investigate development of cortical somatosensory functions in healthy infants, very premature infants at risk for neurological disorders, and adolescents with hemiplegic cerebral palsy (CP). In newborns, stimulation of the hand activated both the contralateral primary (SIc) and secondary somatosensory cortices (SIIc). The activation patterns differed from those of adults, however. Some of the earliest SIc responses, constantly present in adults, were completely lacking in newborns and the effect of sleep stage on SIIc responses differed. These discrepancies between newborns and adults reflect the still developmental stage of the newborns’ somatosensory system. Its further maturation was demonstrated by a systematic transformation of the SIc response pattern with age. The main early adult­like components were present by age two. In very preterm infants, at term age, the SIc and SIIc were activated at similar latencies as in healthy fullterm newborns, but the SIc activity was weaker in the preterm group. The SIIc response was absent in four out of the six infants with brain lesions of the underlying hemisphere. Determining the prognostic value of this finding remains a subject for future studies, however. In the CP adolescents with pure subcortical lesions, contrasting their unilateral symptoms, the SIc responses of both hemispheres differed from those of controls: For example the distance between SIc representation areas for digits II and V was shorter bilaterally. In four of the five CP patients with cortico­subcortical brain lesions, no normal early SIc responses were evoked by stimulation of the palsied hand. The varying differences in neuronal functions, underlying the common clinical symptoms, call for investigation of more precisely designed rehabilitation strategies resting on knowledge about individual functional alterations in the sensorimotor networks.

Algebraic Cryptanalysis of CTRU Cryptosystem

CTRU, a public key cryptosystem was proposed by Gaborit, Ohler and Sole. It is analogue of NTRU, the ring of integers replaced by the ring of polynomials $\mathbb{F}_2[T]$ . It attracted attention as the attacks based on either LLL algorithm or the Chinese Remainder Theorem are avoided on it, which is most common on NTRU. In this paper we presents a polynomial-time algorithm that breaks CTRU for all recommended parameter choices that were derived to make CTRU secure against popov normal form attack. The paper shows if we ascertain the constraints for perfect decryption then either plaintext or private key can be achieved by polynomial time linear algebra attack.

An algebraic formulation of static isotropy and design of statically isotropic 6-6 Stewart platform manipulators

In this paper, we present an algebraic method to study and design spatial parallel manipulators that demonstrate isotropy in the force and moment distributions. We use the force and moment transformation matrices separately, and derive conditions for their isotropy individually as well as in combination. The isotropy conditions are derived in closed-form in terms of the invariants of the quadratic forms associated with these matrices. The formulation is applied to a class of Stewart platform manipulator, and a multi-parameter family of isotropic manipulators is identified analytically. We show that it is impossible to obtain a spatially isotropic configuration within this family. We also compute the isotropic configurations of an existing manipulator and demonstrate a procedure for designing the manipulator for isotropy at a given configuration. (C) 2008 Elsevier Ltd. All rights reserved.

Algebraic distributed space-time codes with low ML decoding complexity

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Characterization of LRRTM and NGR gene families: Expression and functions

Some leucine-rich repeat (LRR) -containing membrane proteins are known regulators of neuronal growth and synapse formation. In this work I characterize two gene families encoding neuronal LRR membrane proteins, namely the LRRTM (leucine-rich repeat, transmembrane neuronal) and NGR (Nogo-66 receptor) families. I studied LRRTM and NGR family member's mRNA tissue distribution by RT-PCR and by in situ hybridization. Subcellular localization of LRRTM1 protein was studied in neurons and in non-neuronal cells. I discovered that LRRTM and NGR family mRNAs are predominantly expressed in the nervous system, and that each gene possesses a specific expression pattern. I also established that LRRTM and NGR family mRNAs are expressed by neurons, and not by glial cells. Within neurons, LRRTM1 protein is not transported to the plasma membrane; rather it localizes to endoplasmic reticulum. Nogo-A (RTN4), MAG, and OMgp are myelin-associated proteins that bind to NgR1 to limit axonal regeneration after central nervous system injury. To better understand the functions of NgR2 and NgR3, and to explore the possible redundancy in the signaling of myelin inhibitors of neurite growth, I mapped the interactions between NgR family and the known and candidate NgR1 ligands. I identified high-affinity interactions between RTN2-66, RTN3-66 and NgR1. I also demonstrate that Rtn3 mRNA is expressed in the same glial cell population of mouse spinal cord white matter as Nogo-A mRNA, and thus it could have a role in myelin inhibition of axonal growth. To understand how NgR1 interacts with multiple structurally divergent ligands, I aimed first to map in more detail the nature of Nogo-A:NgR1 interactions, and then to systematically map the binding sites of multiple myelin ligands in NgR1 by using a library of NgR1 expression constructs encoding proteins with one or multiple surface residues mutated to alanine. My analysis of the Nogo-A:NgR1 -interactions revealed a novel interaction site between the proteins, suggesting a trivalent Nogo-A:NgR1-interaction. Our analysis also defined a central binding region on the concave side of NgR1's LRR domain that is required for the binding of all known ligands, and a surrounding region critical for binding MAG and OMgp. To better understand the biological role of LRRTMs, I generated Lrrtm1 and Lrrtm3 knock out mice. I show here that reporter genes expressed from the targeted loci can be used for maping the neuronal connections of Lrrtm1 and Lrrtm3 expressing neurons in finer detail. With regard to LRRTM1's role in humans, we found a strong association between a 70 kb-spanning haplotype in the proposed promoter region of LRRTM1 gene and two possibly related phenotypes: left-handedness and schizophrenia. Interestingly, the responsible haplotype was linked to phenotypic variability only when paternally inherited. In summary, I identified two families of neuronal receptor-like proteins, and mapped their expression and certain protein-protein interactions. The identification of a central binding region in NgR1 shared by multiple ligands may facilitate the design and development of small molecule therapeutics blocking binding of all NgR1 ligands. Additionally, the genetic association data suggests that allelic variation upstream of LRRTM1 may play a role in the development of left-right brain asymmetry in humans. Lrrtm1 and Lrrtm3 knock out mice developed as a part of this study will likely be useful for schizophrenia and Alzheimer s disease research.

Exploring the post-genomic world: Differing explanatory and manipulatory functions of post-genomic sciences

Richard Lewontin proposed that the ability of a scientific field to create a narrative for public understanding garners it social relevance. This article applies Lewontin's conceptual framework of the functions of science (manipulatory and explanatory) to compare and explain the current differences in perceived societal relevance of genetics/genomics and proteomics. We provide three examples to illustrate the social relevance and strong cultural narrative of genetics/genomics for which no counterpart exists for proteomics. We argue that the major difference between genetics/genomics and proteomics is that genomics has a strong explanatory function, due to the strong cultural narrative of heredity. Based on qualitative interviews and observations of proteomics conferences, we suggest that the nature of proteins, lack of public understanding, and theoretical complexity exacerbates this difference for proteomics. Lewontin's framework suggests that social scientists may find that omics sciences affect social relations in different ways than past analyses of genetics.

Guessing based on length functions

Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.

New rational interpolation functions for finite element analysis of rotating beams

A rotating beam finite element in which the interpolating shape functions are obtained by satisfying the governing static homogenous differential equation of Euler–Bernoulli rotating beams is developed in this work. The shape functions turn out to be rational functions which also depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. These rational functions yield the Hermite cubic when rotation speed becomes zero. The new element is applied for static and dynamic analysis of rotating beams. In the static case, a cantilever beam having a tip load is considered, with a radially varying axial force. It is found that this new element gives a very good approximation of the tip deflection to the analytical series solution value, as compared to the classical finite element given by the Hermite cubic shape functions. In the dynamic analysis, the new element is applied for uniform, and tapered rotating beams with cantilever and hinged boundary conditions to determine the natural frequencies, and the results compare very well with the published results given in the literature.

Novel window functions for digital filters

Window technique is one of the simplest methods to design Finite Impulse Response (FIR) filters. It uses special functions to truncate an infinite sequence to a finite one. In this paper, we propose window techniques based on integer sequences. The striking feature of the proposed work is that it overcomes all the problems posed by floating point numbers and inaccuracy, as the sequences are made of only integers. Some of these integer window sequences, yield sharp transition, while some of them result in zero ripple in passband and stopband.