Towards the main sequence: detailed analysis of weak line and post-T Tauri stars

A detailed study was performed for a sample of low-mass pre-main-sequence (PMS) stars, previously identified as weak-line T Tauri stars, which are compared to members of the Tucanae and Horologium Associations. Aiming to verify if there is any pattern of abundances when comparing the young stars at different phases, we selected objects in the range from 1 to 100 Myr, which covers most of PMS evolution. High-resolution optical spectra were acquired at European Southern Observatory and Observatorio do Pico dos Dias. The stellar fundamental parameters effective temperature and gravity were calculated by excitation and ionization equilibria of iron absorption lines. Chemical abundances were obtained via equivalent width calculations and spectral synthesis for 44 per cent of the sample, which shows metallicities within 0.5 dex solar. A classification was developed based on equivalent width of Li I 6708 angstrom and Ha lines and spectral types of the studied stars. This classification allowed a separation of the sample into categories that correspond to different evolutive stages in the PMS. The position of these stars in the Hertzsprung-Russell diagram was also inspected in order to estimate their ages and masses. Among the studied objects, it was verified that our sample actually contains seven weak-line T Tauri stars, three are Classical T Tauri, 12 are Fe/Ge PMS stars and 21 are post-T Tauri or young main-sequence stars. An estimation of circumstellar luminosity was obtained using a disc model to reproduce the observed spectral energy distribution. Most of the stars show low levels of circumstellar emission, corresponding to less than 30 per cent of the total emission.

Relation of pretreatment sequence diversity in NS5A region of HCV genotype 1 with immune response between pegylated-INF/ribavirin therapy outcomes

Hepatitis C virus (HCV) infection frequently persists despite substantial virus-specific immune responses and the combination of pegylated interferon (INF)-alpha and ribavirin therapy. Major histocompatibility complex class I restricted CD8+ T cells are responsible for the control of viraemia in HCV infection, and several studies suggest protection against viral infection associated with specific HLAs. The reason for low rates of sustained viral response (SVR) in HCV patients remains unknown. Escape mutations in response to cytotoxic T lymphocyte are widely described; however, its influence in the treatment outcome is ill understood. Here, we investigate the differences in CD8 epitopes frequencies from the Los Alamos database between groups of patients that showed distinct response to pegylated alpha-INF with ribavirin therapy and test evidence of natural selection on the virus in those who failed treatment, using five maximum likelihood evolutionary models from PAML package. The group of sustained virological responders showed three epitopes with frequencies higher than Non-responders group, all had statistical support, and we observed evidence of selection pressure in the last group. No escape mutation was observed. Interestingly, the epitope VLSDFKTWL was 100% conserved in SVR group. These results suggest that the response to treatment can be explained by the increase in immune pressure, induced by interferon therapy, and the presence of those epitopes may represent an important factor in determining the outcome of therapy.

Mitochondrial sequence data and Dipsacales phylogeny: Mixed models, partitioned Bayesian analyses, and model selection

Phylogenetic analyses of chloroplast DNA sequences, morphology, and combined data have provided consistent support for many of the major branches within the angiosperm, clade Dipsacales. Here we use sequences from three mitochondrial loci to test the existing broad scale phylogeny and in an attempt to resolve several relationships that have remained uncertain. Parsimony, maximum likelihood, and Bayesian analyses of a combined mitochondrial data set recover trees broadly consistent with previous studies, although resolution and support are lower than in the largest chloroplast analyses. Combining chloroplast and mitochondrial data results in a generally well-resolved and very strongly supported topology but the previously recognized problem areas remain. To investigate why these relationships have been difficult to resolve we conducted a series of experiments using different data partitions and heterogeneous substitution models. Usually more complex modeling schemes are favored regardless of the partitions recognized but model choice had little effect on topology or support values. In contrast there are consistent but weakly supported differences in the topologies recovered from coding and non-coding matrices. These conflicts directly correspond to relationships that were poorly resolved in analyses of the full combined chloroplast-mitochondrial data set. We suggest incongruent signal has contributed to our inability to confidently resolve these problem areas. (c) 2007 Elsevier Inc. All rights reserved.

Worldwide sequence conservation of transmission-blocking vaccine candidate Pvs230 in Plasmodium vivax

Pfs230, surface protein of gametocyte/gamete of the human malaria parasite, Plasmodium falciparum, is a prime candidate of malaria transmission-blocking vaccine. Plasmodium vivax has an ortholog of Pfs230 (Pvs230), however, there has been no study in any aspects on Pvs230 to date. To investigate whether Pvs230 can be a vivax malaria transmission-blocking vaccine, we performed evolutionary and population genetic analysis of the Pvs230 gene (pvs230: PVX_003905). Our analysis of Pvs230 and its orthologs in eight Plasmodium species revealed two distinctive parts: an interspecies variable part (IVP) containing species-specific oligopeptide repeats at the N-terminus and a 7.5 kb interspecies conserved part (ICP) containing 14 cysteine-rich domains. Pvs230 was closely related to its orthologs, Pks230 and Pcys230, in monkey malaria parasites. Analysis of 113 pvs230 sequences obtained from worldwide, showed that nucleotide diversity is remarkably low in the non-repeat 8-kb region of pvs230 (theta pi = 0.00118) with 77 polymorphic nucleotide sites, 40 of which results in amino acid replacements. A signature of purifying selection but not of balancing selection was seen on pvs230. Functional and/or structural constraints may limit the level of polymorphism in pvs230. The observed limited polymorphism in pvs230 should ground for utilization of Pvs230 as an effective transmission-blocking vaccine. (C) 2011 Elsevier Ltd. All rights reserved.

Building binary-tree-based multiclass classifiers using separability measures

Various popular machine learning techniques, like support vector machines, are originally conceived for the solution of two-class (binary) classification problems. However, a large number of real problems present more than two classes. A common approach to generalize binary learning techniques to solve problems with more than two classes, also known as multiclass classification problems, consists of hierarchically decomposing the multiclass problem into multiple binary sub-problems, whose outputs are combined to define the predicted class. This strategy results in a tree of binary classifiers, where each internal node corresponds to a binary classifier distinguishing two groups of classes and the leaf nodes correspond to the problem classes. This paper investigates how measures of the separability between classes can be employed in the construction of binary-tree-based multiclass classifiers, adapting the decompositions performed to each particular multiclass problem. (C) 2010 Elsevier B.V. All rights reserved.

A review on the combination of binary classifiers in multiclass problems

Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

Structural Characterization of Photopolymerizable Binary Liposomes Containing Diacetylenic and Saturated Phospholipids

The use of liposomes to encapsulate materials has received widespread attention for drug delivery, transfection, diagnostic reagent, and as immunoadjuvants. Phospholipid polymers form a new class of biomaterials with many potential applications in medicine and research. Of interest are polymeric phospholipids containing a diacetylene moiety along their acyl chain since these kinds of lipids can be polymerized by Ultra-Violet (UV) irradiation to form chains of covalently linked lipids in the bilayer. In particular the diacetylenic phosphatidylcholine 1,2-bis(10,12-tricosadiynoyl)- sn-glycero-3-phosphocholine (DC8,9PC) can form intermolecular cross-linking through the diacetylenic group to produce a conjugated polymer within the hydrocarbon region of the bilayer. As knowledge of liposome structures is certainly fundamental for system design improvement for new and better applications, this work focuses on the structural properties of polymerized DC8,9PC:1,2-dimyristoyl-sn-glycero-3-phusphocholine (DMPC) liposomes. Liposomes containing mixtures of DC8,9PC and DMPC, at different molar ratios, and exposed to different polymerization cycles, were studied through the analysis of the electron spin resonance (ESR) spectra of a spin label incorporated into the bilayer, and the calorimetric data obtained from differential scanning calorimetry (DSC) studies. Upon irradiation, if all lipids had been polymerized, no gel-fluid transition would be expected. However, even samples that went through 20 cycles of UV irradiation presented a DSC band, showing that around 80% of the DC8,9PC molecules were not polymerized. Both DSC and ESR indicated that the two different lipids scarcely mix at low temperatures, however few molecules of DMPC are present in DC8,9PC rich domains and vice versa. UV irradiation was found to affect the gel fluid transition of both DMPC and DC8,9PC rich regions, indicating the presence of polymeric units of DC8,9PC in both areas, A model explaining lipids rearrangement is proposed for this partially polymerized system.

Low-energy d plus d fusion reactions via the Trojan Horse Method

The bare nucleus S(E) factors for the (2)H(d, p)(3)H and (2)H(d.n)(3)He reactions have been measured for the first time via the Trojan Horse Method off the proton in (3)He from 1.5 MeV down to 2 key. This range overlaps with the relevant region for Standard Big Bang Nucleosynthesis as well as with the thermal energies of future fusion reactors and deuterium burning in the Pre-Main-Sequence phase of stellar evolution. This is the first pioneering experiment in quasi free regime where the charged spectator is detected. Both the energy dependence and the absolute value of the S(E) factors deviate by more than 15% from available direct data with new S(0) values of 57.4 +/- 1.8 MeVb for (3)H + p and 60.1 +/- 1.9 MeV b for (3)He + n. None of the existing fitting curves is able to provide the correct slope of the new data in the full range, thus calling for a revision of the theoretical description. This has consequences in the calculation of the reaction rates with more than a 25% increase at the temperatures of future fusion reactors. (C) 2011 Elsevier By. All rights reserved.

Multilevel Training of Binary Morphological Operators

The design of binary morphological operators that are translation-invariant and locally defined by a finite neighborhood window corresponds to the problem of designing Boolean functions. As in any supervised classification problem, morphological operators designed from a training sample also suffer from overfitting. Large neighborhood tends to lead to performance degradation of the designed operator. This work proposes a multilevel design approach to deal with the issue of designing large neighborhood-based operators. The main idea is inspired by stacked generalization (a multilevel classifier design approach) and consists of, at each training level, combining the outcomes of the previous level operators. The final operator is a multilevel operator that ultimately depends on a larger neighborhood than of the individual operators that have been combined. Experimental results show that two-level operators obtained by combining operators designed on subwindows of a large window consistently outperform the single-level operators designed on the full window. They also show that iterating two-level operators is an effective multilevel approach to obtain better results.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

A Bayesian Semiparametric Approach for Solving the Discrete Calibration Problem

In this article, we introduce a semi-parametric Bayesian approach based on Dirichlet process priors for the discrete calibration problem in binomial regression models. An interesting topic is the dosimetry problem related to the dose-response model. A hierarchical formulation is provided so that a Markov chain Monte Carlo approach is developed. The methodology is applied to simulated and real data.

ON SPECIALITY OF BINARY-LIE ALGEBRAS

In the present work, binary-Lie, assocyclic, and binary (-1,1) algebras are studied. We prove that, for every assocyclic algebra A, the algebra A(-) is binary-Lie. We find a simple non-Malcev binary-Lie superalgebra T that cannot be embedded in A(-s) for an assocyclic superalgebra A. We use the Grassmann envelope of T to prove the similar result for algebras. This solve negatively a problem by Filippov (see [1, Problem 2.108]). Finally, we prove that the superalgebra T is isomorphic to the commutator superalgebra A(-s) for a simple binary (-1,1) superalgebra A.

Braid groups of non-orientable surfaces and the Fadell-Neuwirth short exact sequence

Let M be a compact, connected non-orientable surface without boundary and of genus g >= 3. We investigate the pure braid groups P,(M) of M, and in particular the possible splitting of the Fadell-Neuwirth short exact sequence 1 -> P(m)(M \ {x(1), ..., x(n)}) hooked right arrow P(n+m)(M) (P*) under right arrow P(n)(M) -> 1, where m, n >= 1, and p* is the homomorphism which corresponds geometrically to forgetting the last m strings. This problem is equivalent to that of the existence of a section for the associated fibration p: F(n+m)(M) -> F(n)(M) of configuration spaces, defined by p((x(1), ..., x(n), x(n+1), ..., x(n+m))) = (x(1), ..., x(n)). We show that p and p* admit a section if and only if n = 1. Together with previous results, this completes the resolution of the splitting problem for surface pure braid groups. (C) 2009 Elsevier B.V. All rights reserved.