Synthesis, structural order and magnetic behavior of self-assembled epsilon-Co nanocrystal arrays

The synthesis of magnetic nanoparticles with monodispere size distributions, their self assembly into ordered arrays and their magnetic behavior as a function of structural order (ferrofluids and 2D assemblies) are presented. Magnetic colloids of monodispersed, passivated, cobalt nanocrystals were produced by the rapid pyrolysis of cobalt carbonyl in solution. The size, size distribution (std. dev.< 5%) and the shape of the nanocrystals were controlled by varying the surfactant, its concentration, the reaction rate and the reaction temperature. The Co particles are defect-free single crystals with a complex cubic structure related to the beta phase of manganese (epsilon-Co). In the 2D assembly, a collective behavior was observed in the low-field susceptibility measurements where the magnetization of the zero field cooled process increases steadily and the magnetization of the field cooling process is independent the temperature. This was different from the observed behavior in a sample comprised of disordered interacting particles. A strong paramagnetic contribution appears at very low temperatures where the magnetization increases drastically after field cooling the sample. This has been attributed to the Co surfactant-particle interface since no magnetic atomic impurities are present in these samples.

Correlation between in vitro cytotoxicity and in vivo lethal activity in mice of epsilon toxin mutants from Clostridium perfringens

Epsilon toxin (Etx) from Clostridium perfringens is a pore-forming protein with a lethal effect on livestock, producing severe enterotoxemia characterized by general edema and neurological alterations. Site-specific mutations of the toxin are valuable tools to study the cellular and molecular mechanism of the toxin activity. In particular, mutants with paired cysteine substitutions that affect the membrane insertion domain behaved as dominant-negative inhibitors of toxin activity in MDCK cells. We produced similar mutants, together with a well-known non-toxic mutant (Etx-H106P), as green fluorescent protein (GFP) fusion proteins to perform in vivo studies in an acutely intoxicated mouse model. The mutant (GFP-Etx-I51C/A114C) had a lethal effect with generalized edema, and accumulated in the brain parenchyma due to its ability to cross the blood-brain barrier (BBB). In the renal system, this mutant had a cytotoxic effect on distal tubule epithelial cells. The other mutants studied (GFP-Etx-V56C/F118C and GFP-Etx-H106P) did not have a lethal effect or cross the BBB, and failed to induce a cytotoxic effect on renal epithelial cells. These data suggest a direct correlation between the lethal effect of the toxin, with its cytotoxic effect on the kidney distal tubule cells, and the ability to cross the BBB.

Minimax lower bounds for the two-armed bandit problem

We obtain minimax lower bounds on the regret for the classicaltwo--armed bandit problem. We provide a finite--sample minimax version of the well--known log $n$ asymptotic lower bound of Lai and Robbins. Also, in contrast to the log $n$ asymptotic results on the regret, we show that the minimax regret is achieved by mere random guessing under fairly mild conditions on the set of allowable configurations of the two arms. That is, we show that for {\sl every} allocation rule and for {\sl every} $n$, there is a configuration such that the regret at time $n$ is at least 1 -- $\epsilon$ times the regret of random guessing, where $\epsilon$ is any small positive constant.

Decision making in uncertain and changing environments

We consider an agent who has to repeatedly make choices in an uncertainand changing environment, who has full information of the past, who discountsfuture payoffs, but who has no prior. We provide a learning algorithm thatperforms almost as well as the best of a given finite number of experts orbenchmark strategies and does so at any point in time, provided the agentis sufficiently patient. The key is to find the appropriate degree of forgettingdistant past. Standard learning algorithms that treat recent and distant pastequally do not have the sequential epsilon optimality property.

Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and pareto filters

Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA) representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study that optimizes the ethanol production in the fermentation of Saccharomyces cerevisiae.