Speech prognosis and need of pharyngeal flap for non syndromic vs syndromic Pierre Robin Sequence

BACKGROUND: The aim of this retrospective study was to evaluate speech outcome and need of a pharyngeal flap in children born with nonsyndromic Pierre Robin Sequence (nsPRS) vs syndromic Pierre Robin Sequence (sPRS). METHODS: Pierre Robin Sequence was diagnosed when the triad microretrognathia, glossoptosis, and cleft palate were present. Children were classified at birth in 3 categories depending on respiratory and feeding problems. The Borel-Maisonny classification was used to score the velopharyngeal insufficiency. RESULTS: The study was based on 38 children followed from 1985 to 2006. For the 25 nsPRS, 9 (36%) pharyngeal flaps were performed with improvements of the phonatory score in the 3 categories. For the 13 sPRS, 3 (23%) pharyngeal flaps were performed with an improvement of the phonatory scores in the 3 children. There was no statistical difference between the nsPRS and sPRS groups (P = .3) even if we compared the children in the 3 categories (P = .2). CONCLUSIONS: Children born with nsPRS did not have a better prognosis of speech outcome than children born with sPRS. Respiratory and feeding problems at birth did not seem to be correlated with speech outcome. This is important when informing parents on the prognosis of long-term therapy

Strategies for sequential prediction of stationary time series

We present simple procedures for the prediction of a real valued sequence. The algorithms are based on a combinationof several simple predictors. We show that if the sequence is a realization of a bounded stationary and ergodic random process then the average of squared errors converges, almost surely, to that of the optimum, given by the Bayes predictor. We offer an analog result for the prediction of stationary gaussian processes.

A simple permutation test for clusteredness

Hierarchical clustering is a popular method for finding structure in multivariate data,resulting in a binary tree constructed on the particular objects of the study, usually samplingunits. The user faces the decision where to cut the binary tree in order to determine the numberof clusters to interpret and there are various ad hoc rules for arriving at a decision. A simplepermutation test is presented that diagnoses whether non-random levels of clustering are presentin the set of objects and, if so, indicates the specific level at which the tree can be cut. The test isvalidated against random matrices to verify the type I error probability and a power study isperformed on data sets with known clusteredness to study the type II error.

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

Infantile spasms is associated with deletion of the MAGI2 gene on chromosome 7q11.23-q21.11.

Infantile spasms (IS) is the most severe and common form of epilepsy occurring in the first year of life. At least half of IS cases are idiopathic in origin, with others presumed to arise because of brain insult or malformation. Here, we identify a locus for IS by high-resolution mapping of 7q11.23-q21.1 interstitial deletions in patients. The breakpoints delineate a 500 kb interval within the MAGI2 gene (1.4 Mb in size) that is hemizygously disrupted in 15 of 16 participants with IS or childhood epilepsy, but remains intact in 11 of 12 participants with no seizure history. MAGI2 encodes the synaptic scaffolding protein membrane-associated guanylate kinase inverted-2 that interacts with Stargazin, a protein also associated with epilepsy in the stargazer mouse.

Improving the sensitivity of the sequence profile method.

The sequence profile method (Gribskov M, McLachlan AD, Eisenberg D, 1987, Proc Natl Acad Sci USA 84:4355-4358) is a powerful tool to detect distant relationships between amino acid sequences. A profile is a table of position-specific scores and gap penalties, providing a generalized description of a protein motif, which can be used for sequence alignments and database searches instead of an individual sequence. A sequence profile is derived from a multiple sequence alignment. We have found 2 ways to improve the sensitivity of sequence profiles: (1) Sequence weights: Usage of individual weights for each sequence avoids bias toward closely related sequences. These weights are automatically assigned based on the distance of the sequences using a published procedure (Sibbald PR, Argos P, 1990, J Mol Biol 216:813-818). (2) Amino acid substitution table: In addition to the alignment, the construction of a profile also needs an amino acid substitution table. We have found that in some cases a new table, the BLOSUM45 table (Henikoff S, Henikoff JG, 1992, Proc Natl Acad Sci USA 89:10915-10919), is more sensitive than the original Dayhoff table or the modified Dayhoff table used in the current implementation. Profiles derived by the improved method are more sensitive and selective in a number of cases where previous methods have failed to completely separate true members from false positives.

Simple models for multi-attribute choice with many alternatives: When it does and does not pay to face tradeoffs with binary attributes

Working Paper no longer available. Please contact the author.

A simple adaptive procedure leading to correlated equilibrium

We propose a simple adaptive procedure for playing a game. In thisprocedure, players depart from their current play with probabilities thatare proportional to measures of regret for not having used other strategies(these measures are updated every period). It is shown that our adaptiveprocedure guaranties that with probability one, the sample distributionsof play converge to the set of correlated equilibria of the game. Tocompute these regret measures, a player needs to know his payoff functionand the history of play. We also offer a variation where every playerknows only his own realized payoff history (but not his payoff function).

Take-the-best and other simple strategies: Why and when they work 'well' in binary choice

The effectiveness of decision rules depends on characteristics of bothrules and environments. A theoretical analysis of environments specifiesthe relative predictive accuracies of the lexicographic rule 'take-the-best'(TTB) and other simple strategies for binary choice. We identify threefactors: how the environment weights variables; characteristics of choicesets; and error. For cases involving from three to five binary cues, TTBis effective across many environments. However, hybrids of equal weights(EW) and TTB models are more effective as environments become morecompensatory. In the presence of error, TTB and similar models do not predictmuch better than a naïve model that exploits dominance. We emphasizepsychological implications and the need for more complete theories of theenvironment that include the role of error.