A variant in the gene FUT9 is associated with susceptibility to placental malaria infection

Malaria in pregnancy forms a substantial part of the worldwide burden of malaria, with an estimated annual death toll of up to 200,000 infants, as well as increased maternal morbidity and mortality. Studies of genetic susceptibility to malaria have so far focused on infant malaria, with only a few studies investigating the genetic basis of placental malaria, focusing only on a limited number of candidate genes. The aim of this study therefore was to identify novel host genetic factors involved in placental malaria infection. To this end we carried out a nested case-control study on 180 Mozambican pregnant women with placental malaria infection, and 180 controls within an intervention trial of malaria prevention. We genotyped 880 SNPs in a set of 64 functionally related genes involved in glycosylation and innate immunity. A SNP located in the gene FUT9, rs3811070, was significantly associated with placental malaria infection (OR = 2.31, permutation p-value = 0.028). Haplotypic analysis revealed a similarly strong association of a common haplotype of four SNPs including rs3811070. FUT9 codes for a fucosyl-transferase that is catalyzing the last step in the biosynthesis of the Lewis-x antigen, which forms part of the Lewis blood group-related antigens. These results therefore suggest an involvement of this antigen in the pathogenesis of placental malaria infection.

Contrasting the form and use of reformulation markers

This paper deals with the form and use of reformulation markers in research papers written in English, Spanish and Catalan. Considering the form and frequency of themarkers, English papers tends to prefer simple fixed markers and includes less reformulators than Spanish and Catalan. On the contrary, formal Catalan and Spanish papers include more markers, some of which are complex and allow for some structural variability. As for use, reformulation markers establish dynamic relationships between portions of discourse which can be identified in our corpus with expansion, reduction, and permutation. The analysis of the corpus shows that English authors usually reformulate to add more information to the concept (expansion), whereas Catalan and Spanish authors reduce the contents or the implicatures of the previous formulation more frequently than English.

Applause identification and its relevance to archival of Carnatic music

A Carnatic music concert is made up of a sequence of pieces, where each piece corresponds to a particular genre and ra¯aga (melody). Unlike a western music concert, the artist may be applauded intra-performance inter-performance. Most Carnatic music that is archived today correspond to a single audio recordings of entire concerts.The purpose of this paper is to segment single audio recordings into a sequence of pieces using thecharacteristic features of applause and music. Spectral flux, spectral entropy change quite significantly from music to applause and vice-versa. The characteristics of these features for a subset of concerts was studied. A threshold based approach was used to segment the pieces into music fragments and applauses. Preliminary resultson recordings 19 concerts from matched microphones show that the EER is about 17% for a resolution of 0.25 seconds. Further, a parameter called CUSUM is estimatedfor the applause regions. The CUSUM values determine the strength of the applause. The CUSUM is used to characterise the highlights of a concert.

Generalized low-density codes with BCH constituents for full-diversity near-outage performance

A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. Aclassical GLD code for ergodic channels (e.g., the AWGN channel,the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

Exact and approximate stepdown methods for multiple hypothesis testing

Consider the problem of testing k hypotheses simultaneously. In this paper,we discuss finite and large sample theory of stepdown methods that providecontrol of the familywise error rate (FWE). In order to improve upon theBonferroni method or Holm's (1979) stepdown method, Westfall and Young(1993) make eective use of resampling to construct stepdown methods thatimplicitly estimate the dependence structure of the test statistics. However,their methods depend on an assumption called subset pivotality. The goalof this paper is to construct general stepdown methods that do not requiresuch an assumption. In order to accomplish this, we take a close look atwhat makes stepdown procedures work, and a key component is a monotonicityrequirement of critical values. By imposing such monotonicity on estimatedcritical values (which is not an assumption on the model but an assumptionon the method), it is demonstrated that the problem of constructing a validmultiple test procedure which controls the FWE can be reduced to the problemof contructing a single test which controls the usual probability of a Type 1error. This reduction allows us to draw upon an enormous resamplingliterature as a general means of test contruction.

Worst-case bounds for the logarithmic loss of predictors

We investigate on-line prediction of individual sequences. Given a class of predictors, the goal is to predict as well as the best predictor in the class, where the loss is measured by the self information (logarithmic) loss function. The excess loss (regret) is closely related to the redundancy of the associated lossless universal code. Using Shtarkov's theorem and tools from empirical process theory, we prove a general upper bound on the best possible (minimax) regret. The bound depends on certain metric properties of the class of predictors. We apply the bound to both parametric and nonparametric classes ofpredictors. Finally, we point out a suboptimal behavior of the popular Bayesian weighted average algorithm.

Model selection and error estimation

We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalization: any good error estimate may be converted into a data-based penalty function and the performance of the estimate is governed by the quality of the error estimate. We consider several penalty functions, involving error estimates on independent test data, empirical {\sc vc} dimension, empirical {\sc vc} entropy, andmargin-based quantities. We also consider the maximal difference between the error on the first half of the training data and the second half, and the expected maximal discrepancy, a closely related capacity estimate that can be calculated by Monte Carlo integration. Maximal discrepancy penalty functions are appealing for pattern classification problems, since their computation is equivalent to empirical risk minimization over the training data with some labels flipped.

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

Extremal climatic states simulated by a 2-dimensional model Part I: Sensitivity of the model and present state

The criterion, based on the thermodynamics theory, that the climatic system tends to extremizesome function has suggested several studies. In particular, special attention has been devoted to the possibility that the climate reaches an extremal rate of planetary entropy production.Due to both radiative and material effects contribute to total planetary entropy production,climatic simulations obtained at the extremal rates of total, radiative or material entropy production appear to be of interest in order to elucidate which of the three extremal assumptions behaves more similar to current data. In the present paper, these results have been obtainedby applying a 2-dimensional (2-Dim) horizontal energy balance box-model, with a few independent variables (surface temperature, cloud-cover and material heat fluxes). In addition, climatic simulations for current conditions by assuming a fixed cloud-cover have been obtained. Finally,sensitivity analyses for both variable and fixed cloud models have been carried out

Extremal climatic states simulated by a 2-dimensional model Part II: Different climatic scenarios

Different climatic simulations have been obtained by using a 2-Dim horizontal energy balancemodel (EBM), which has been constrained to satisfy several extremal principles on dissipationand convection. Moreover, 2 different versions of the model with fixed and variable cloud-coverhave been used. The assumption of an extremal type of behaviour for the climatic system canacquire additional support depending on the similarities found with measured data for pastconditions as well as with usual projections for possible future scenarios

Bayesian image reconstruction with space-variant noise suppression

In this paper we present a Bayesian image reconstruction algorithm with entropy prior (FMAPE) that uses a space-variant hyperparameter. The spatial variation of the hyperparameter allows different degrees of resolution in areas of different statistical characteristics, thus avoiding the large residuals resulting from algorithms that use a constant hyperparameter. In the first implementation of the algorithm, we begin by segmenting a Maximum Likelihood Estimator (MLE) reconstruction. The segmentation method is based on using a wavelet decomposition and a self-organizing neural network. The result is a predetermined number of extended regions plus a small region for each star or bright object. To assign a different value of the hyperparameter to each extended region and star, we use either feasibility tests or cross-validation methods. Once the set of hyperparameters is obtained, we carried out the final Bayesian reconstruction, leading to a reconstruction with decreased bias and excellent visual characteristics. The method has been applied to data from the non-refurbished Hubble Space Telescope. The method can be also applied to ground-based images.

Diffusionless first-order phase transitions in systems with frozen configurational degrees of freedom

We consider systems that can be described in terms of two kinds of degree of freedom. The corresponding ordering modes may, under certain conditions, be coupled to each other. We may thus assume that the primary ordering mode gives rise to a diffusionless first-order phase transition. The change of its thermodynamic properties as a function of the secondary-ordering-mode state is then analyzed. Two specific examples are discussed. First, we study a three-state Potts model in a binary system. Using mean-field techniques, we obtain the phase diagram and different properties of the system as a function of the distribution of atoms on the different lattice sites. In the second case, the properties of a displacive structural phase transition of martensitic type in a binary alloy are studied as a function of atomic order. Because of the directional character of the martensitic-transition mechanism, we find only a very weak dependence of the entropy on atomic order. Experimental results are found to be in quite good agreement with theoretical predictions.

Influence of configurational atomic order on the relative stability of bcc and close-packed structures in Cu-based alloys

We present a study of the influence of atomic order on the relative stability of the bcc and the 18R martensitic structures in a Cu2.96Al0.92Be0.12 crystal. Calorimetric measurements have shown that disorder increases the stability of the 18R phase, contrary to what happens in Cu-Zn-Al alloys for which it is the bcc phase that is stabilized by disordering the system. This different behavior has been explained in terms of a model recently reported. We have also proved that the entropy change at the martensitic transition is independent of the state of atomic order of the crystal, as predicted theoretically. Our results suggest that differences in the vibrational spectrum of the crystal due to different states of atomic order must be equal in the bcc and in the close-packed phases.

On the stability of the bcc phase in Cu-Al-Mn shape memory alloys

Measurements of the entropy change at the martensitic transition of two composition-related sets of Cu-Al-Mn shape-memory alloys are reported. It is found that most of the entropy change has a vibrational origin, and depends only on the particular close-packed structure of the low-temperature phase. Using data from the literature for other Cu-based alloys, this result is shown to be general. In addition, it is shown that the martensitic structure changes from 18R to 2H when the ratio of conduction electrons per atom reaches the same value as the eutectoid point in the equilibrium phase diagram. This finding indicates that the structure of the metastable low-temperature phase is reminiscent of the equilibrium structure.