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.

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.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

The relationship between classification of multi-domain proteins using an alignment-free approach and their functions: a case study with immunoglobulins

Establishing functional relationships between multi-domain protein sequences is a non-trivial task. Traditionally, delineating functional assignment and relationships of proteins requires domain assignments as a prerequisite. This process is sensitive to alignment quality and domain definitions. In multi-domain proteins due to multiple reasons, the quality of alignments is poor. We report the correspondence between the classification of proteins represented as full-length gene products and their functions. Our approach differs fundamentally from traditional methods in not performing the classification at the level of domains. Our method is based on an alignment free local matching scores (LMS) computation at the amino-acid sequence level followed by hierarchical clustering. As there are no gold standards for full-length protein sequence classification, we resorted to Gene Ontology and domain-architecture based similarity measures to assess our classification. The final clusters obtained using LMS show high functional and domain architectural similarities. Comparison of the current method with alignment based approaches at both domain and full-length protein showed superiority of the LMS scores. Using this method we have recreated objective relationships among different protein kinase sub-families and also classified immunoglobulin containing proteins where sub-family definitions do not exist currently. This method can be applied to any set of protein sequences and hence will be instrumental in analysis of large numbers of full-length protein sequences.

Convex analysis for minimizing and learning submodular set functions

The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions.

First, we develop a novel method for minimizing a particular class of submodular functions, which can be expressed as a sum of concave functions composed with modular functions. The basic algorithm uses an accelerated first order method applied to a smoothed version of its convex extension. The smoothing algorithm is particularly novel as it allows us to treat general concave potentials without needing to construct a piecewise linear approximation as with graph-based techniques.

Second, we derive the general conditions under which it is possible to find a minimizer of a submodular function via a convex problem. This provides a framework for developing submodular minimization algorithms. The framework is then used to develop several algorithms that can be run in a distributed fashion. This is particularly useful for applications where the submodular objective function consists of a sum of many terms, each term dependent on a small part of a large data set.

Lastly, we approach the problem of learning set functions from an unorthodox perspective---sparse reconstruction. We demonstrate an explicit connection between the problem of learning set functions from random evaluations and that of sparse signals. Based on the observation that the Fourier transform for set functions satisfies exactly the conditions needed for sparse reconstruction algorithms to work, we examine some different function classes under which uniform reconstruction is possible.

A preliminary study of a new multi-objective optimization algorithm

This paper presents a preliminary study which describes and evaluates a multi-objective (MO) version of a recently created single objective (SO) optimization algorithm called the "Alliance Algorithm" (AA). The algorithm is based on the metaphorical idea that several tribes, with certain skills and resource needs, try to conquer an environment for their survival and to ally together to improve the likelihood of conquest. The AA has given promising results in several fields to which has been applied, thus the development of a MO variant (MOAA) is a natural extension. Here the MOAA's performance is compared with two well-known MO algorithms: NSGA-II and SPEA-2. The performance measures chosen for this study are the convergence and diversity metrics. The benchmark functions chosen for the comparison are from the ZDT and OKA families and the main classical MO problems. The results show that the three algorithms have similar overall performance. Thus, it is not possible to identify a best algorithm for all the problems; the three algorithms show a certain complementarity because they offer superior performance for different classes of problems. © 2012 IEEE.

Multi-objective optimisation of horizontal axis wind turbine structure and energy production using aerofoil and blade properties as design variables

The design of wind turbine blades is a true multi-objective engineering task. The aerodynamic effectiveness of the turbine needs to be balanced with the system loads introduced by the rotor. Moreover the problem is not dependent on a single geometric property, but besides other parameters on a combination of aerofoil family and various blade functions. The aim of this paper is therefore to present a tool which can help designers to get a deeper insight into the complexity of the design space and to find a blade design which is likely to have a low cost of energy. For the research we use a Computational Blade Optimisation and Load Deflation Tool (CoBOLDT) to investigate the three extreme point designs obtained from a multi-objective optimisation of turbine thrust, annual energy production as well as mass for a horizontal axis wind turbine blade. The optimisation algorithm utilised is based on Multi-Objective Tabu Search which constitutes the core of CoBOLDT. The methodology is capable to parametrise the spanning aerofoils with two-dimensional Free Form Deformation and blade functions with two tangentially connected cubic splines. After geometry generation we use a panel code to create aerofoil polars and a stationary Blade Element Momentum code to evaluate turbine performance. Finally, the obtained loads are fed into a structural layout module to estimate the mass and stiffness of the current blade by means of a fully stressed design. For the presented test case we chose post optimisation analysis with parallel coordinates to reveal geometrical features of the extreme point designs and to select a compromise design from the Pareto set. The research revealed that a blade with a feasible laminate layout can be obtained, that can increase the energy capture and lower steady state systems loads. The reduced aerofoil camber and an increased L/. D-ratio could be identified as the main drivers. This statement could not be made with other tools of the research community before. © 2013 Elsevier Ltd.

Role of the protein tyrosine phosphatase DEP-1 in Src activation and the mediation of biological cell functions of endothelial and breast cancer cells

L’implication des protéines tyrosines phosphatases (PTPs) dans la régulation de la signalisation et la médiation des fonctions cellulaires a été bien établie dans les dernières années. Cependant, les mécanismes moléculaires par lesquels les PTPs régulent les processus fondamentaux tels que l’angiogenèse demeurent méconnus. Il a été rapporté que l’expression de la PTP DEP-1 (Density-enhanced phosphatase 1) augmente avec la densité cellulaire et corrèle avec la déphosphorylation du récepteur VEGFR2. Cette déphosphorylation contribue à l’inhibition de contact dans les cellules endothéliales à confluence et diminue l’activité du VEGFR2 en déphosphorylant spécifiquement ses résidus catalytiques Y1054/1059. De plus, la plupart des voies de signalisation en aval du VEGFR2 sont diminuées sauf la voie Src-Gab1-AKT. DEP-1 déphosphoryle la Y529 de Src et contribue à la promotion de la survie dans les cellules endothéliales. L’objectif de cette thèse est de mieux définir le rôle de DEP-1 dans la régulation de l’activité de Src et les réponses biologiques dans les cellules endothéliales. Nous avons identifié les résidus Y1311 et Y1320 dans la queue C-terminale de DEP-1 comme sites majeurs de phosphorylation en réponse au VEGF. La phosphorylation de ces résidus est requise pour l’activation de Src et médie le remodelage des jonctions cellules-cellules dépendantes de Src. Ce remodelage induit la perméabilité, l’invasion et la formation de capillaires en réponse au VEGF. Nos résultats démontrent que la phosphorylation de DEP-1 sur résidu tyrosine est requise pour diriger la spécificité de DEP-1 vers son substrat Src. Les travaux révèlent pour la première fois un rôle positif de DEP-1 sur l’induction du programme angiogénique des cellules endothéliales. En plus de la phosphorylation sur tyrosine, DEP-1 est constitutivement phosphorylé sur la thréonine 1318 situé à proximité de la Y1320 en C-terminal. Cette localisation de la T1318 suggère que ce résidu pourrait être impliqué dans la régulation de la Y1320. En effet, nous avons observé que la T1318 de DEP-1 est phosphorylée potentiellement par CK2, et que cette phosphorylation régule la phosphorylation de DEP-1 sur tyrosine et sa capacité de lier et d’activer Src. En accord avec ces résultats, nos travaux révèlent que la surexpression du mutant DEP-1 T1318A diminue le remodelage des jonctions cellules-cellules et par conséquent la perméabilité. Nos résultats suggèrent donc que la T1318 de DEP-1 constitue un nouveau mécanisme de contrôle de la phosphorylation sur tyrosine et que ceci résulte en l’activation de Src et l’induction des fonctions biologiques des cellules endothéliales en réponse au VEGF. Suite à ces travaux dans les cellules endothéliales qui démontrent un rôle positif de DEP-1 dans la médiation des réponses angiogéniques, nous avons voulu approfondir nos connaissances sur l’implication potentielle de DEP-1 dans les cellules cancéreuses où l’activité de Src est requise pour la progression tumorale. Malgré le rôle connu de DEP-1 comme suppresseur tumoral dans différents types de cancer, nous avons émis l’hypothèse que DEP-1 pourrait promouvoir les fonctions biologiques dépendantes de Src telles que la migration et l’invasion dans les cellules cancéreuses. Ainsi, nous avons observé que l’expression de DEP-1 est plus élevée dans les lignées basales de cancer du sein qui sont plus invasives comparativement aux lignées luminales peu invasives. Dans les lignées basales, DEP-1 active Src, médie la motilité cellulaire dépendante de Src et régule la localisation des protéines impliquées dans l’organisation du cytosquelette. L’analyse d’un micro-étalage de tissu a révélé que l’expression de DEP-1 est associée avec une réduction tendencielle de survie des patients. Nos résultats proposent donc, un rôle de promoteur tumoral pour DEP-1 dans la progression du cancer du sein. Les travaux présentés dans cette thèse démontrent pour la première fois que DEP-1 peut agir comme promoteur des réponses angiogéniques et du phénotype pro-invasif des lignées basales du cancer du sein probablement du à sa capacité d’activer Src. Nos résultats suggèrent ainsi que l’expression de DEP-1 pourrait contribuer à la progression tumorale et la formation de métastases. Ces découvertes laissent donc entrevoir que DEP-1 représente une nouvelle cible thérapeutique potentielle pour contrer l’angiogenèse et le développement du cancer.

Objective neuropsychological deficits in post-traumatic stress disorder and mild traumatic brain injury: what remains beyond symptom similarity?

This exploratory study intends to characterize the neuropsychological profile in persons with post-traumatic stress disorder (PTSD) and mild traumatic brain injury (mTBI) using objective measures of cognitive performance. A neuropsychological battery of tests for attention, memory and executive functions was administered to four groups: PTSD (n = 25), mTBI (n = 19), subjects with two formal diagnoses: Post-traumatic Stress Disorder and Mild Traumatic Brain Injury (mTBI/PTSD) (n = 6) and controls (n = 25). Confounding variables, such as medical, developmental or neurological antecedents, were controlled and measures of co-morbid conditions, such as depression and anxiety, were considered. The PTSD and mTBI/PTSD groups reported more anxiety and depressive symptoms. They also presented more cognitive deficits than the mTBI group. Since the two PTSD groups differ in severity of PTSD symptoms but not in severity of depression and anxiety symptoms, the PTSD condition could not be considered as the unique factor affecting the results. The findings underline the importance of controlling for confounding medical and psychological co-morbidities in the evaluation and treatment of PTSD populations, especially when a concomitant mTBI is also suspected.

Multi-objective optimization scheme for static and dynamic multicast flows

Muchas de las nuevas aplicaciones emergentes de Internet tales como TV sobre Internet, Radio sobre Internet,Video Streamming multi-punto, entre otras, necesitan los siguientes requerimientos de recursos: ancho de banda consumido, retardo extremo-a-extremo, tasa de paquetes perdidos, etc. Por lo anterior, es necesario formular una propuesta que especifique y provea para este tipo de aplicaciones los recursos necesarios para su buen funcionamiento. En esta tesis, proponemos un esquema de ingeniería de tráfico multi-objetivo a través del uso de diferentes árboles de distribución para muchos flujos multicast. En este caso, estamos usando la aproximación de múltiples caminos para cada nodo egreso y de esta forma obtener la aproximación de múltiples árboles y a través de esta forma crear diferentes árboles multicast. Sin embargo, nuestra propuesta resuelve la fracción de la división del tráfico a través de múltiples árboles. La propuesta puede ser aplicada en redes MPLS estableciendo rutas explícitas en eventos multicast. En primera instancia, el objetivo es combinar los siguientes objetivos ponderados dentro de una métrica agregada: máxima utilización de los enlaces, cantidad de saltos, el ancho de banda total consumido y el retardo total extremo-a-extremo. Nosotros hemos formulado esta función multi-objetivo (modelo MHDB-S) y los resultados obtenidos muestran que varios objetivos ponderados son reducidos y la máxima utilización de los enlaces es minimizada. El problema es NP-duro, por lo tanto, un algoritmo es propuesto para optimizar los diferentes objetivos. El comportamiento que obtuvimos usando este algoritmo es similar al que obtuvimos con el modelo. Normalmente, durante la transmisión multicast los nodos egresos pueden salir o entrar del árbol y por esta razón en esta tesis proponemos un esquema de ingeniería de tráfico multi-objetivo usando diferentes árboles para grupos multicast dinámicos. (en el cual los nodos egresos pueden cambiar durante el tiempo de vida de la conexión). Si un árbol multicast es recomputado desde el principio, esto podría consumir un tiempo considerable de CPU y además todas las comuicaciones que están usando el árbol multicast serán temporalmente interrumpida. Para aliviar estos inconvenientes, proponemos un modelo de optimización (modelo dinámico MHDB-D) que utilice los árboles multicast previamente computados (modelo estático MHDB-S) adicionando nuevos nodos egreso. Usando el método de la suma ponderada para resolver el modelo analítico, no necesariamente es correcto, porque es posible tener un espacio de solución no convexo y por esta razón algunas soluciones pueden no ser encontradas. Adicionalmente, otros tipos de objetivos fueron encontrados en diferentes trabajos de investigación. Por las razones mencionadas anteriormente, un nuevo modelo llamado GMM es propuesto y para dar solución a este problema un nuevo algoritmo usando Algoritmos Evolutivos Multi-Objetivos es propuesto. Este algoritmo esta inspirado por el algoritmo Strength Pareto Evolutionary Algorithm (SPEA). Para dar una solución al caso dinámico con este modelo generalizado, nosotros hemos propuesto un nuevo modelo dinámico y una solución computacional usando Breadth First Search (BFS) probabilístico. Finalmente, para evaluar nuestro esquema de optimización propuesto, ejecutamos diferentes pruebas y simulaciones. Las principales contribuciones de esta tesis son la taxonomía, los modelos de optimización multi-objetivo para los casos estático y dinámico en transmisiones multicast (MHDB-S y MHDB-D), los algoritmos para dar solución computacional a los modelos. Finalmente, los modelos generalizados también para los casos estático y dinámico (GMM y GMM Dinámico) y las propuestas computacionales para dar slución usando MOEA y BFS probabilístico.

The functions of intermediaries in Swedish SMEs internationalization to the Nigerian market

Over the years so many academic literatures has revealed that increased number of firms have seen internationalization as a means to gain and sustain competitive advantage and even increase economic of scale, and this has led many western companies to emerging markets. In this paper we discovered that among the pool of Swedish firms, only the MNEs have seen Nigerian market attractive to internationalize to, but just a few of the Swedish SMEs has expanded to the Nigerian market. This research was conducted by doing a qualitative study with the use of phenomenological research approach, during our investigation on the functions of intermediaries in Swedish SMEs internationalization to Nigeria market.Furthermore, we were able to understand the importance and functions of the different marketing intermediaries’ in Swedish SMEs internationalization to Nigeria market. These intermediaries equip the Swedish firms with the required objective knowledge of the Nigerian market, updating them with recent development of the opportunities and threats involved in the Nigerian marketing environment, and linking these Swedish firms to the required government departments, distributors, agent/broker, customers, middle men etc, thereby impacting them with the experiential knowledge. Moreover, it is important for firms to have objective or pre-market knowledge of a particular market before entering that market, but this knowledge is regarded as non-helpful knowledge to firms. But the experiential knowledge is acquired over time in the market, which is regarded as the helpful knowledge. It is evident that the intermediaries equip these firms with both objective and experiential knowledge.Although the opportunities in some emerging markets are very attractive, but the threats in these markets are other factors firms also put into consideration before internationalizing to these markets. This is why thorough market research has to be done so that firms can create effective marketing strategies when they want to expand their marketing activities to emerging markets. Despite the risk and uncertainties involved in doing business in foreign countries, still yet companies selling global products do not have any choice than to internationalize their marketing operations.

PokerMapper: : mapping executive functions, poker playing ability and responsible gambling in online environments

Research objectives Poker and responsible gambling both entail the use of the executive functions (EF), which are higher-level cognitive abilities. The main objective of this work was to assess if online poker players of different ability show different performances in their EF and if so, which functions are the most discriminating ones. The secondary objective was to assess if the EF performance can predict the quality of gambling, according to the Gambling Related Cognition Scale (GRCS), the South Oaks Gambling Screen (SOGS) and the Problem Gambling Severity Index (PGSI). Sample and methods The study design consisted of two stages: 46 Italian active players (41m, 5f; age 32±7,1ys; education 14,8±3ys) fulfilled the PGSI in a secure IT web system and uploaded their own hand history files, which were anonymized and then evaluated by two poker experts. 36 of these players (31m, 5f; age 33±7,3ys; education 15±3ys) accepted to take part in the second stage: the administration of an extensive neuropsychological test battery by a blinded trained professional. To answer the main research question we collected all final and intermediate scores of the EF tests on each player together with the scoring on the playing ability. To answer the secondary research question, we referred to GRCS, PGSI and SOGS scores.  We determined which variables that are good predictors of the playing ability score using statistical techniques able to deal with many regressors and few observations (LASSO, best subset algorithms and CART). In this context information criteria and cross-validation errors play a key role for the selection of the relevant regressors, while significance testing and goodness-of-fit measures can lead to wrong conclusions.   Preliminary findings We found significant predictors of the poker ability score in various tests. In particular, there are good predictors 1) in some Wisconsin Card Sorting Test items that measure flexibility in choosing strategy of problem-solving, strategic planning, modulating impulsive responding, goal setting and self-monitoring, 2) in those Cognitive Estimates Test variables related to deductive reasoning, problem solving, development of an appropriate strategy and self-monitoring, 3) in the Emotional Quotient Inventory Short (EQ-i:S) Stress Management score, composed by the Stress Tolerance and Impulse Control scores, and in the Interpersonal score (Empathy, Social Responsibility, Interpersonal Relationship). As for the quality of gambling, some EQ-i:S scales scores provide the best predictors: General Mood for the PGSI; Intrapersonal (Self-Regard; Emotional Self-Awareness, Assertiveness, Independence, Self-Actualization) and Adaptability  (Reality Testing, Flexibility, Problem Solving) for the SOGS, Adaptability for the GRCS. Implications for the field Through PokerMapper we gathered knowledge and evaluated the feasibility of the construction of short tasks/card games in online poker environments for profiling users’ executive functions. These card games will be part of an IT system able to dynamically profile EF and provide players with a feedback on their expected performance and ability to gamble responsibly in that particular moment. The implementation of such system in existing gambling platforms could lead to an effective proactive tool for supporting responsible gambling. 

Conditional labour supply, quantile functions in Brazil

The estimation of labor supply elasticities has been an important issue m the economic literature. Yet all works have estimated conditional mean labor supply functions only. The objective of this paper is to obtain more information on labor supply, by estimating the conditional quantile labor supply function. vI/e use a sample of prime age urban males employees in Brazil. Two stage estimators are used as the net wage and virtual income are found to be endogenous to the model. Contrary to previous works using conditional mean estimators, it is found that labor supply elasticities vary significantly and asymmetrically across hours of work. vVhile the income and wage elasticities at the standard work week are zero, for those working longer hours the elasticities are negative.

Product functions: interfaces with ergonomic design

In addition to technical quality, increasing emphasis is being placed on the importance of elements such as the appearance and meaning of products. To be successful, therefore, attention must be paid to the aesthetic and symbolic functions of objects as well as to reliability and physical quality. Study of the interfaces of these functions may provide a theoretical basis for the ergonomic design of products. The objective of this review is to attempt to establish the nature of these interfaces.

Parametric correlation functions to model the structure of permanent environmental (co)variances in milk yield random regression models

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)