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.

Design of multiunit electronic exchanges through decomposition

In this paper, we exploit the idea of decomposition to match buyers and sellers in an electronic exchange for trading large volumes of homogeneous goods, where the buyers and sellers specify marginal-decreasing piecewise constant price curves to capture volume discounts. Such exchanges are relevant for automated trading in many e-business applications. The problem of determining winners and Vickrey prices in such exchanges is known to have a worst-case complexity equal to that of as many as (1 + m + n) NP-hard problems, where m is the number of buyers and n is the number of sellers. Our method proposes the overall exchange problem to be solved as two separate and simpler problems: 1) forward auction and 2) reverse auction, which turns out to be generalized knapsack problems. In the proposed approach, we first determine the quantity of units to be traded between the sellers and the buyers using fast heuristics developed by us. Next, we solve a forward auction and a reverse auction using fully polynomial time approximation schemes available in the literature. The proposed approach has worst-case polynomial time complexity. and our experimentation shows that the approach produces good quality solutions to the problem. Note to Practitioners- In recent times, electronic marketplaces have provided an efficient way for businesses and consumers to trade goods and services. The use of innovative mechanisms and algorithms has made it possible to improve the efficiency of electronic marketplaces by enabling optimization of revenues for the marketplace and of utilities for the buyers and sellers. In this paper, we look at single-item, multiunit electronic exchanges. These are electronic marketplaces where buyers submit bids and sellers ask for multiple units of a single item. We allow buyers and sellers to specify volume discounts using suitable functions. Such exchanges are relevant for high-volume business-to-business trading of standard products, such as silicon wafers, very large-scale integrated chips, desktops, telecommunications equipment, commoditized goods, etc. The problem of determining winners and prices in such exchanges is known to involve solving many NP-hard problems. Our paper exploits the familiar idea of decomposition, uses certain algorithms from the literature, and develops two fast heuristics to solve the problem in a near optimal way in worst-case polynomial time.

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.

Kernels for large margin time-series classification

In this paper we propose a novel family of kernels for multivariate time-series classification problems. Each time-series is approximated by a linear combination of piecewise polynomial functions in a Reproducing Kernel Hilbert Space by a novel kernel interpolation technique. Using the associated kernel function a large margin classification formulation is proposed which can discriminate between two classes. The formulation leads to kernels, between two multivariate time-series, which can be efficiently computed. The kernels have been successfully applied to writer independent handwritten character recognition.

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.

Constructing commutative semifields of square order

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semi-fields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187{196]. We generalize this idea to a projection construction using two twisted semifields to construct semifields of odd characteristic. Planar functions and semifields have a strong connection so this also constructs new planar functions.

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.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

Multi-Tone Testing of Linear and Nonlinear Analog Circuits using Polynomial Coefficients

A method of testing for parametric faults of analog circuits based on a polynomial representation of fault-free function of the circuit is presented. The response of the circuit under test (CUT) is estimated as a polynomial in the applied input voltage at relevant frequencies in addition to DC. Classification or Cur is based on a comparison of the estimated polynomial coefficients with those of the fault free circuit. This testing method requires no design for test hardware as might be added to the circuit fly some other methods. The proposed method is illustrated for a benchmark elliptic filter. It is shown to uncover several parametric faults causing deviations as small as 5% from the nominal values.

Stiff-String Basis Functions for Vibration Analysis of High Speed Rotating Beams

A new rotating beam finite element is developed in which the basis functions are obtained by the exact solution of the governing static homogenous differential equation of a stiff string, which results from an approximation in the rotating beam equation. These shape functions depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. Using this new element and the Hermite cubic finite element, a convergence study of natural frequencies is performed, and it is found that the new element converges much more rapidly than the conventional Hermite cubic element for the first two modes at higher rotation speeds. The new element is also applied for uniform and tapered rotating beams to determine the natural frequencies, and the results compare very well with the published results given in the literature.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.