A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.

The acquisition of pronouns by French children: A parallel study of production and comprehension

This study examines syntactic and morphological aspects of the production and comprehension of pronouns by 99 typically developing French-speaking children aged 3 years, 5 months to 6 years, 5 months. A fine structural analysis of subject, object, and reflexive clitics suggests that whereas the object clitic chain crosses the subject chain, the reflexive clitic chain is nested within it. We argue that this structural difference introduces differences in processing complexity, chain crossing being more complex than nesting. In support of this analysis, both production and comprehension experiments show that children have more difficulty with object than with reflexive clitics (with more omissions in production and more erroneous judgments in sentences involving Principle B in comprehension). Concerning the morphological aspect, French subject and object pronouns agree in gender with their referent. We report serious difficulties with pronoun gender both in production and comprehension in children around the age of 4 (with nearly 30% errors in production and chance level judgments in comprehension), which tend to disappear by age 6. The distribution of errors further suggests that the masculine gender is processed as the default value. These findings provide further insights into the relationship between comprehension and production in the acquisition process.

University admission marks in Catalonia: Some highlights from the empirical research

The results of the examinations taken by graduated high school studentswho want to enrol at a Catalan university are here studied. To do so,the authors address several issues related to the equity of the system:reliability of grading, difficulty and discrimination power of the exams.The general emphasis is put upon the concurrent research and empiricalevidence about the properties of the examination items and scores. Aftera discussion about the limitations of the exams' format and appropriatenessof the instruments used in the study, the article concludes with somesuggestions to improve such examinations.

MSISpIC: A Probabilistic Scan Matching Algorithm Using a Mechanical Scanned Imaging Sonar

This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results

An Efficient Nominal Unification Algorithm

Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently

Validation of a clinical algorithm to identify low-risk patients with pulmonary embolism.

Summary Background: We previously derived a clinical prognostic algorithm to identify patients with pulmonary embolism (PE) who are at low-risk of short-term mortality who could be safely discharged early or treated entirely in an outpatient setting. Objectives: To externally validate the clinical prognostic algorithm in an independent patient sample. Methods: We validated the algorithm in 983 consecutive patients prospectively diagnosed with PE at an emergency department of a university hospital. Patients with none of the algorithm's 10 prognostic variables (age >/= 70 years, cancer, heart failure, chronic lung disease, chronic renal disease, cerebrovascular disease, pulse >/= 110/min., systolic blood pressure < 100 mm Hg, oxygen saturation < 90%, and altered mental status) at baseline were defined as low-risk. We compared 30-day overall mortality among low-risk patients based on the algorithm between the validation and the original derivation sample. We also assessed the rate of PE-related and bleeding-related mortality among low-risk patients. Results: Overall, the algorithm classified 16.3% of patients with PE as low-risk. Mortality at 30 days was 1.9% among low-risk patients and did not differ between the validation and the original derivation sample. Among low-risk patients, only 0.6% died from definite or possible PE, and 0% died from bleeding. Conclusions: This study validates an easy-to-use, clinical prognostic algorithm for PE that accurately identifies patients with PE who are at low-risk of short-term mortality. Low-risk patients based on our algorithm are potential candidates for less costly outpatient treatment.

Anemia on admission predicts short- and long-term outcomes in patients with acute ischemic stroke.

BACKGROUND: It is still debatable whether anemia predicts stroke outcome. AIM: To describe the characteristics of patients with acute ischemic stroke (AIS) and anemia and identify whether hemoglobin status on admission is a prognostic factor of AIS outcome. METHODS: All 2439 patients of the Acute Stroke Registry and Analysis of Lausanne (ASTRAL) between January 2003 and June 2011 were selected. Demographics, risk factors, prestroke treatment, clinical, radiological and metabolic variables in patients with and without anemia according to the definition of the World Health Organization were compared. Functional disability and mortality were recorded up to 12 months from admission. RESULTS: Anemic patients (17.5%) were older, had lower body mass index, higher rates of coronary artery disease (CAD), atrial fibrillation, diabetes mellitus and peripheral artery disease. Anemia was associated with more severe stroke manifestations, lower systolic and diastolic blood pressure measurements, worse estimated glomerular filtration rate and elevated C-reactive protein concentrations upon admission and with increased modified Rankin scores during the follow-up. Anemic patients had higher 7-day, 3-month and 12-month mortality, which was associated with hemoglobin status and other factors, including age, CAD, stroke severity, and baseline C-reactive levels. Hemoglobin levels were inversely associated with recurrent stroke and mortality throughout the 12-month follow-up. CONCLUSION: Anemia is common among AIS patients and is associated with cardiovascular comorbidities. Low hemoglobin status independently predicts short and long-term mortality.

A fast Bayesian reconstruction algorithm for emission tomography with entropy prior converging to feasible images

The development and tests of an iterative reconstruction algorithm for emission tomography based on Bayesian statistical concepts are described. The algorithm uses the entropy of the generated image as a prior distribution, can be accelerated by the choice of an exponent, and converges uniformly to feasible images by the choice of one adjustable parameter. A feasible image has been defined as one that is consistent with the initial data (i.e. it is an image that, if truly a source of radiation in a patient, could have generated the initial data by the Poisson process that governs radioactive disintegration). The fundamental ideas of Bayesian reconstruction are discussed, along with the use of an entropy prior with an adjustable contrast parameter, the use of likelihood with data increment parameters as conditional probability, and the development of the new fast maximum a posteriori with entropy (FMAPE) Algorithm by the successive substitution method. It is shown that in the maximum likelihood estimator (MLE) and FMAPE algorithms, the only correct choice of initial image for the iterative procedure in the absence of a priori knowledge about the image configuration is a uniform field.

Treatment of suicide attempters prior to hospital admission

Résumé : De nombreux auteurs ont rapporté des sérieux problèmes dans le traitement des patients suicidaires. Cette étude a examiné le traitement que des patients, ayant commis une tentative de suicide avant leur admission à un hôpital psychiatrique en Suisse, ont eu avant leur tentamen. 31 patients ont été admis à l'hôpital pendant l'année 2000, ce qui représente 36 tentamen et cela correspond à 6,5 ci/0 du nombre annuel d'admissions. Trois de ces patients ont été admis deux fois, et un patient a été admis trois fois. Des entrevues personnelles ont permis de rassembler l'information sur le traitement précédent l'hospitalisation : la médication et son dosage, à un mois et à deux semaines avant la tentative de suicide, et si le patient avait bénéficié d'une psychothérapie. En outre, des détails sur l'aspect psychosocial du tentamen et les moyens utilisés pour la tentative de suicide ont été enregistrés. Des médicaments psychotropes avaient été prescrits dans 24 situations à 21 patients, mais seulement dans 17 événements qui concernent 15 patients, des antidépresseurs avaient été prescrits avant l'hospitalisation. Des antipsychotiques et des benzodiazépines ont été prescrits dans 6 et 21 situations (8 situations avec des hypnotiques). Aucun des patients n'avait été traité avec du lithium, pourtant connu pour diminuer la suicidalité chez des patients à risque. Dans 19 situations, 16 patients avaient reçu la psychothérapie avant l'admission. Dans 32 situations, des médicaments psychotropes ont été employés pour le tentamen. En conclusion, ces résultats confirment le sous-traitement de patients qui commettent une tentative de suicide, comme déjà rapporté par d'autres auteurs. Bien que la majorité de patients ait été soignée par un psychiatre, aucune pharmacothérapie adéquate n'avait été prescrite, en particulier pour des patients dépressifs.

BIO-INSPIRED COMPUTATIONAL TECHNIQUES APPLIED TO THE CLUSTERING AND VISUALIZATION OF SPATIO-TEMPORAL GEOSPATIAL DATA

The coverage and volume of geo-referenced datasets are extensive and incessantly¦growing. The systematic capture of geo-referenced information generates large volumes¦of spatio-temporal data to be analyzed. Clustering and visualization play a key¦role in the exploratory data analysis and the extraction of knowledge embedded in¦these data. However, new challenges in visualization and clustering are posed when¦dealing with the special characteristics of this data. For instance, its complex structures,¦large quantity of samples, variables involved in a temporal context, high dimensionality¦and large variability in cluster shapes.¦The central aim of my thesis is to propose new algorithms and methodologies for¦clustering and visualization, in order to assist the knowledge extraction from spatiotemporal¦geo-referenced data, thus improving making decision processes.¦I present two original algorithms, one for clustering: the Fuzzy Growing Hierarchical¦Self-Organizing Networks (FGHSON), and the second for exploratory visual data analysis:¦the Tree-structured Self-organizing Maps Component Planes. In addition, I present¦methodologies that combined with FGHSON and the Tree-structured SOM Component¦Planes allow the integration of space and time seamlessly and simultaneously in¦order to extract knowledge embedded in a temporal context.¦The originality of the FGHSON lies in its capability to reflect the underlying structure¦of a dataset in a hierarchical fuzzy way. A hierarchical fuzzy representation of¦clusters is crucial when data include complex structures with large variability of cluster¦shapes, variances, densities and number of clusters. The most important characteristics¦of the FGHSON include: (1) It does not require an a-priori setup of the number¦of clusters. (2) The algorithm executes several self-organizing processes in parallel.¦Hence, when dealing with large datasets the processes can be distributed reducing the¦computational cost. (3) Only three parameters are necessary to set up the algorithm.¦In the case of the Tree-structured SOM Component Planes, the novelty of this algorithm¦lies in its ability to create a structure that allows the visual exploratory data analysis¦of large high-dimensional datasets. This algorithm creates a hierarchical structure¦of Self-Organizing Map Component Planes, arranging similar variables' projections in¦the same branches of the tree. Hence, similarities on variables' behavior can be easily¦detected (e.g. local correlations, maximal and minimal values and outliers).¦Both FGHSON and the Tree-structured SOM Component Planes were applied in¦several agroecological problems proving to be very efficient in the exploratory analysis¦and clustering of spatio-temporal datasets.¦In this thesis I also tested three soft competitive learning algorithms. Two of them¦well-known non supervised soft competitive algorithms, namely the Self-Organizing¦Maps (SOMs) and the Growing Hierarchical Self-Organizing Maps (GHSOMs); and the¦third was our original contribution, the FGHSON. Although the algorithms presented¦here have been used in several areas, to my knowledge there is not any work applying¦and comparing the performance of those techniques when dealing with spatiotemporal¦geospatial data, as it is presented in this thesis.¦I propose original methodologies to explore spatio-temporal geo-referenced datasets¦through time. Our approach uses time windows to capture temporal similarities and¦variations by using the FGHSON clustering algorithm. The developed methodologies¦are used in two case studies. In the first, the objective was to find similar agroecozones¦through time and in the second one it was to find similar environmental patterns¦shifted in time.¦Several results presented in this thesis have led to new contributions to agroecological¦knowledge, for instance, in sugar cane, and blackberry production.¦Finally, in the framework of this thesis we developed several software tools: (1)¦a Matlab toolbox that implements the FGHSON algorithm, and (2) a program called¦BIS (Bio-inspired Identification of Similar agroecozones) an interactive graphical user¦interface tool which integrates the FGHSON algorithm with Google Earth in order to¦show zones with similar agroecological characteristics.

Numerical algorithm for Ginzburg-Landau equations with multiplicative noise: Application to domain growth

We consider stochastic partial differential equations with multiplicative noise. We derive an algorithm for the computer simulation of these equations. The algorithm is applied to study domain growth of a model with a conserved order parameter. The numerical results corroborate previous analytical predictions obtained by linear analysis.

Patterns of calcium-binding proteins in human inferior colliculus: identification of subdivisions and evidence for putative parallel systems.

The subdivisions of human inferior colliculus are currently based on Golgi and Nissl-stained preparations. We have investigated the distribution of calcium-binding protein immunoreactivity in the human inferior colliculus and found complementary or mutually exclusive localisations of parvalbumin versus calbindin D-28k and calretinin staining. The central nucleus of the inferior colliculus but not the surrounding regions contained parvalbumin-positive neuronal somata and fibres. Calbindin-positive neurons and fibres were concentrated in the dorsal aspect of the central nucleus and in structures surrounding it: the dorsal cortex, the lateral lemniscus, the ventrolateral nucleus, and the intercollicular region. In the dorsal cortex, labelling of calbindin and calretinin revealed four distinct layers.Thus, calcium-binding protein reactivity reveals in the human inferior colliculus distinct neuronal populations that are anatomically segregated. The different calcium-binding protein-defined subdivisions may belong to parallel auditory pathways that were previously demonstrated in non-human primates, and they may constitute a first indication of parallel processing in human subcortical auditory structures.