Attachment and temperament in early childhood; implications for later behavior problems.

In the context of a French validation study, the Child Behavior Checklist (CBCL) was administered to more than 3000 French speaking mothers of 5-year-old children. Scores were factor-analyzed. Principal components analysis revealed four dimensions: externalizing and internalizing behavior problems, immaturity and somatoform disorders. Another sample of 40 mothers participated in a longitudinal study, filling in the CBCL when their children were 5 years old. These children had been observed previously in the Strange Situation (SSP) at 21 months. Several dichotomous variables derived from the SSP (e.g. secure versus insecure, proximal versus distal interaction with the mother, avoidant behavior) have been used as predictors of the four dimensions extracted from the CBCL. Hierarchical regressions showed that proximal behaviors with the mother, which reflect temperamental characteristics independently of the quality of attachment, predicted internalizing problems, whereas avoidance of the mother, or insecure-avoidant attachment, predicted internalizing as well as externalizing problems at 5 years of age. These results show that attachment and temperament, as assessed by the SSP, may each have specific implications for later behavior problems.

Data-driven clustering : new methods and applications

Abstract : This work is concerned with the development and application of novel unsupervised learning methods, having in mind two target applications: the analysis of forensic case data and the classification of remote sensing images. First, a method based on a symbolic optimization of the inter-sample distance measure is proposed to improve the flexibility of spectral clustering algorithms, and applied to the problem of forensic case data. This distance is optimized using a loss function related to the preservation of neighborhood structure between the input space and the space of principal components, and solutions are found using genetic programming. Results are compared to a variety of state-of--the-art clustering algorithms. Subsequently, a new large-scale clustering method based on a joint optimization of feature extraction and classification is proposed and applied to various databases, including two hyperspectral remote sensing images. The algorithm makes uses of a functional model (e.g., a neural network) for clustering which is trained by stochastic gradient descent. Results indicate that such a technique can easily scale to huge databases, can avoid the so-called out-of-sample problem, and can compete with or even outperform existing clustering algorithms on both artificial data and real remote sensing images. This is verified on small databases as well as very large problems. Résumé : Ce travail de recherche porte sur le développement et l'application de méthodes d'apprentissage dites non supervisées. Les applications visées par ces méthodes sont l'analyse de données forensiques et la classification d'images hyperspectrales en télédétection. Dans un premier temps, une méthodologie de classification non supervisée fondée sur l'optimisation symbolique d'une mesure de distance inter-échantillons est proposée. Cette mesure est obtenue en optimisant une fonction de coût reliée à la préservation de la structure de voisinage d'un point entre l'espace des variables initiales et l'espace des composantes principales. Cette méthode est appliquée à l'analyse de données forensiques et comparée à un éventail de méthodes déjà existantes. En second lieu, une méthode fondée sur une optimisation conjointe des tâches de sélection de variables et de classification est implémentée dans un réseau de neurones et appliquée à diverses bases de données, dont deux images hyperspectrales. Le réseau de neurones est entraîné à l'aide d'un algorithme de gradient stochastique, ce qui rend cette technique applicable à des images de très haute résolution. Les résultats de l'application de cette dernière montrent que l'utilisation d'une telle technique permet de classifier de très grandes bases de données sans difficulté et donne des résultats avantageusement comparables aux méthodes existantes.

CT dose optimization when changing to CT multi-detector row technology

The purpose of this article was to review the strategies to control patient dose in adult and pediatric computed tomography (CT), taking into account the change of technology from single-detector row CT to multi-detector row CT. First the relationships between computed tomography dose index, dose length product, and effective dose in adult and pediatric CT are revised, along with the diagnostic reference level concept. Then the effect of image noise as a function of volume computed tomography dose index, reconstructed slice thickness, and the size of the patient are described. Finally, the potential of tube current modulation CT is discussed.

How Much Does It Cost? Optimization of Costs in Sequence Analysis of Social Science Data

One major methodological problem in analysis of sequence data is the determination of costs from which distances between sequences are derived. Although this problem is currently not optimally dealt with in the social sciences, it has some similarity with problems that have been solved in bioinformatics for three decades. In this article, the authors propose an optimization of substitution and deletion/insertion costs based on computational methods. The authors provide an empirical way of determining costs for cases, frequent in the social sciences, in which theory does not clearly promote one cost scheme over another. Using three distinct data sets, the authors tested the distances and cluster solutions produced by the new cost scheme in comparison with solutions based on cost schemes associated with other research strategies. The proposed method performs well compared with other cost-setting strategies, while it alleviates the justification problem of cost schemes.

Optimization Of Promoter Sequences In Order To Mimic Physiological Pde6b Expression

Purpose: Many retinal degenerations result from defective retina-specific gene expressions. Thus, it is important to understand how the expression of a photoreceptor-specific gene is regulated in vivo in order to achieve successful gene therapy. The present study aims to design an AAV2/8 vector that can regulate the transcript level in a physiological manner to replace missing PDE6b in Rd1 and Rd10 mice. In previous studies (Ogieta, et al., 2000), the short 5' flanking sequence of the human PDE6b gene (350 bp) was shown to be photoreceptor-specific in transgenic mice. However, the efficiency and specificity of the 5' flanking region of the human PDE6b was not investigated in the context of gene therapy during retinal degeneration. In this study, two different sequences of the 5' flanking region of the human PDE6b gene were studied as promoter elements and their expression will be tested in wild type and diseased retinas (Rd 10 mice).Methods: Two 5' flanking fragments of the human PDE6b gene: (-93 to +53 (150 bp) and -297 to +53 (350 bp)) were cloned in different plasmids in order to check their expression in vitro and in vivo by constructing an AAV2/8 vector. These elements drove the activity of either luciferase (pGL3 plasmids) or EGFP. jetPEI transfection in Y 79 cells was used to evaluate gene expression through luciferase activity. Constructs encoding EGFP under the control of the two promoters were performed in AAV2.1-93 (or 297)-EGFP plasmids to produce AAV2/8 vectors.Results: When pGL3-93 (150 bp) or pGL3-297 (350 bp) were transfected in the Y-79 cells, the smaller fragment (150 bp) showed higher gene expression compared to the 350 bp element and to the SV40 control, as previously reported. The 350 bp drove similar levels of expression when compared to the SV40 promoter. In view of these results, the fragments (150 bp or 350 bp) were integrated into the AAV2.1-EGFP plasmid to produce AAV2/8 vector, and we are currently evaluating the efficiency and specificity of the produced constructs in vivo in normal and diseased retinas.Conclusions: Comparisons of these vectors with vectors bearing ubiquitous promoters should reveal which construct is the most suitable to drive efficient and specific gene expression in diseased retinas in order to restore a normal function on the long term.

Optimization strategies for fast detection of positive selection on phylogenetic trees.

MOTIVATION: The detection of positive selection is widely used to study gene and genome evolution, but its application remains limited by the high computational cost of existing implementations. We present a series of computational optimizations for more efficient estimation of the likelihood function on large-scale phylogenetic problems. We illustrate our approach using the branch-site model of codon evolution. RESULTS: We introduce novel optimization techniques that substantially outperform both CodeML from the PAML package and our previously optimized sequential version SlimCodeML. These techniques can also be applied to other likelihood-based phylogeny software. Our implementation scales well for large numbers of codons and/or species. It can therefore analyse substantially larger datasets than CodeML. We evaluated FastCodeML on different platforms and measured average sequential speedups of FastCodeML (single-threaded) versus CodeML of up to 5.8, average speedups of FastCodeML (multi-threaded) versus CodeML on a single node (shared memory) of up to 36.9 for 12 CPU cores, and average speedups of the distributed FastCodeML versus CodeML of up to 170.9 on eight nodes (96 CPU cores in total).Availability and implementation: ftp://ftp.vital-it.ch/tools/FastCodeML/. CONTACT: selectome@unil.ch or nicolas.salamin@unil.ch.

On solving fair exchange and related distributed problems in Byzantine environments

Abstract The solvability of the problem of fair exchange in a synchronous system subject to Byzantine failures is investigated in this work. The fair exchange problem arises when a group of processes are required to exchange digital items in a fair manner, which means that either each process obtains the item it was expecting or no process obtains any information on, the inputs of others. After introducing a novel specification of fair exchange that clearly separates safety and liveness, we give an overview of the difficulty of solving such a problem in the context of a fully-connected topology. On one hand, we show that no solution to fair exchange exists in the absence of an identified process that every process can trust a priori; on the other, a well-known solution to fair exchange relying on a trusted third party is recalled. These two results lead us to complete our system model with a flexible representation of the notion of trust. We then show that fair exchange is solvable if and only if a connectivity condition, named the reachable majority condition, is satisfied. The necessity of the condition is proven by an impossibility result and its sufficiency by presenting a general solution to fair exchange relying on a set of trusted processes. The focus is then turned towards a specific network topology in order to provide a fully decentralized, yet realistic, solution to fair exchange. The general solution mentioned above is optimized by reducing the computational load assumed by trusted processes as far as possible. Accordingly, our fair exchange protocol relies on trusted tamperproof modules that have limited communication abilities and are only required in key steps of the algorithm. This modular solution is then implemented in the context of a pedagogical application developed for illustrating and apprehending the complexity of fair exchange. This application, which also includes the implementation of a wide range of Byzantine behaviors, allows executions of the algorithm to be set up and monitored through a graphical display. Surprisingly, some of our results on fair exchange seem contradictory with those found in the literature of secure multiparty computation, a problem from the field of modern cryptography, although the two problems have much in common. Both problems are closely related to the notion of trusted third party, but their approaches and descriptions differ greatly. By introducing a common specification framework, a comparison is proposed in order to clarify their differences and the possible origins of the confusion between them. This leads us to introduce the problem of generalized fair computation, a generalization of fair exchange. Finally, a solution to this new problem is given by generalizing our modular solution to fair exchange