Corrosion behavior of pure titanium in artificial saliva solution

The biocompatibility of commercially pure (cp) titanium stems from its chemical stability within an organism, due to a fine film of impermeable titanium oxide covering the metal surface, which guarantees its resistance to corrosion. Despite its biocompatible characteristic, this material does not promote the formation of a hydroxyapatite layer, therefore, many research groups have sought to alter the material`s surface, introducing modifications that might influence corrosion resistance. The electrochemical behavior of cp Ti, with hydroxyapatite coating and without hydroxyapatite coating, commonly used in implant materials, was investigated using an artificial saliva solution at 25 degrees C and pH=7.4. In the conditions of the study it was observed that the hydroxyapatite layer influences the properties of corrosion resistance. This study of the behavior of cp Ti with and without hydroxyapatite coating, in naturally aerated artificial saliva solution at 25 degrees C, was based on open circuit potential measurements and potentiodynamic polarization curves. At approximately 1x10(-6) A/cm(2) the potential for cp Ti with and without hydroxyapatite coating begins to increase at a faster rate, but at -74mV (SCE) for coated cp Ti and at 180mV (SCE) for uncoated cp Ti the increase in potential begins to slow. This behavior, characterized by a partial stabilization of current density, indicates that in those potential ranges a protective passive film is formed.

Effect of agitation on the performance of an anaerobic sequencing batch biofilm reactor in the treatment of dairy effluents

Agitation rate is an important parameter in the operation of Anaerobic Sequencing Biofilm Batch Reactors (ASBBRs), and a proper agitation rate guarantees good mixing, improves mass transfer, and enhances the solubility of the particulate organic matter. Dairy effluents have a high amount of particulate organic matter, and their anaerobic digestion presents inhibitory intermediates (e. g., long-chain fatty acids). The importance of studying agitation in such batch systems is clear. The present study aimed to evaluate how agitation frequency influences the anaerobic treatment of dairy effluents. The ASBBR was fed with wastewater from milk pasteurisation process and cheese manufacture with no whey segregation. The organic matter concentration, measured as chemical oxygen demand (COD), was maintained at approximately 8,000 mg/L. The reactor was operated with four agitation frequencies: 500 rpm, 350 rpm, 200 rpm, and no agitation. In terms of COD removal efficiency, similar results were observed for 500 rpm and 350 rpm (around 90%) and for 200 rpm and no agitation (around 80%). Increasing the system`s agitation thus not only improved the global efficiency of organic matter removal but also influenced volatile acid production and consumption and clearly modified this balance in each experimental condition.

Biochemical characterization of serine transport in Leishmania (Leishmania) amazonensis

In addition to its role as a protein component in Leishmania, serine is also a precursor for the synthesis of both phosphatidylserine, which is a membrane molecule involved in parasite invasion and inactivation of macrophages, and sphingolipids, which are necessary for Leishmania to differentiate into its infective forms. We have characterized serine uptake in both promastigote and amastigote forms of Leishmania (Leishmania) amazonensis. In promastigotes, kinetic data show a single, saturable transport system, with a Km of 0.253 +/- 0.01 mM and a maximum velocity of 0.246 +/- 0.04 nmol/min per 107 cells. Serine transport increased linearly with temperature in the range from 20 degrees C to 45 degrees C, allowing the calculation of an activation energy of 7.09 kJ/mol. Alanine, cysteine, glycine, threonine, valine and ethanolamine competed with the substrate at a ten-fold excess concentration. Serine uptake was dependent on pH, with an optimum activity at pH 7.5. The characterization of the serine transport process in amastigotes revealed a transport system with a similar Km, energy of activation and pH response to that found in promastigotes, suggesting that the same transport system is active in both insect vector and mammalian host Leishmania stages. This could constitute an evolutionary mechanism that guarantees the provision of such an essential molecule during host change events, such as differentiation into amastigotes and macrophage invasion, as well as to ensure that the parasite maintains the infection in the mammalian host. (C) 2008 Elsevier B.V. All rights reserved.

Retinoic Acid and VEGF Delay Smooth Muscle Relative to Endothelial Differentiation to Coordinate Inner and Outer Coronary Vessel Wall Morphogenesis

Rationale: Major coronary vessels derive from the proepicardium, the cellular progenitor of the epicardium, coronary endothelium, and coronary smooth muscle cells (CoSMCs). CoSMCs are delayed in their differentiation relative to coronary endothelial cells (CoEs), such that CoSMCs mature only after CoEs have assembled into tubes. The mechanisms underlying this sequential CoE/CoSMC differentiation are unknown. Retinoic acid (RA) is crucial for vascular development and the main RA-synthesizing enzyme is progressively lost from epicardially derived cells as they differentiate into blood vessel types. In parallel, myocardial vascular endothelial growth factor (VEGF) expression also decreases along coronary vessel muscularization. Objective: We hypothesized that RA and VEGF act coordinately as physiological brakes to CoSMC differentiation. Methods and Results: In vitro assays (proepicardial cultures, cocultures, and RALDH2 [retinaldehyde dehydrogenase-2]/VEGF adenoviral overexpression) and in vivo inhibition of RA synthesis show that RA and VEGF act as repressors of CoSMC differentiation, whereas VEGF biases epicardially derived cell differentiation toward the endothelial phenotype. Conclusion: Experiments support a model in which early high levels of RA and VEGF prevent CoSMC differentiation from epicardially derived cells before RA and VEGF levels decline as an extensive endothelial network is established. We suggest this physiological delay guarantees the formation of a complex, hierarchical, tree of coronary vessels. (Circ Res. 2010;107:204-216.)

Black-box decomposition approach for computational hemodynamics: One-dimensional models

Increasing efforts exist in integrating different levels of detail in models of the cardiovascular system. For instance, one-dimensional representations are employed to model the systemic circulation. In this context, effective and black-box-type decomposition strategies for one-dimensional networks are needed, so as to: (i) employ domain decomposition strategies for large systemic models (1D-1D coupling) and (ii) provide the conceptual basis for dimensionally-heterogeneous representations (1D-3D coupling, among various possibilities). The strategy proposed in this article works for both of these two scenarios, though the several applications shown to illustrate its performance focus on the 1D-1D coupling case. A one-dimensional network is decomposed in such a way that each coupling point connects two (and not more) of the sub-networks. At each of the M connection points two unknowns are defined: the flow rate and pressure. These 2M unknowns are determined by 2M equations, since each sub-network provides one (non-linear) equation per coupling point. It is shown how to build the 2M x 2M non-linear system with arbitrary and independent choice of boundary conditions for each of the sub-networks. The idea is then to solve this non-linear system until convergence, which guarantees strong coupling of the complete network. In other words, if the non-linear solver converges at each time step, the solution coincides with what would be obtained by monolithically modeling the whole network. The decomposition thus imposes no stability restriction on the choice of the time step size. Effective iterative strategies for the non-linear system that preserve the black-box character of the decomposition are then explored. Several variants of matrix-free Broyden`s and Newton-GMRES algorithms are assessed as numerical solvers by comparing their performance on sub-critical wave propagation problems which range from academic test cases to realistic cardiovascular applications. A specific variant of Broyden`s algorithm is identified and recommended on the basis of its computer cost and reliability. (C) 2010 Elsevier B.V. All rights reserved.

Robust inference in an heteroscedastic measurement error model

In this paper we deal with robust inference in heteroscedastic measurement error models Rather than the normal distribution we postulate a Student t distribution for the observed variables Maximum likelihood estimates are computed numerically Consistent estimation of the asymptotic covariance matrices of the maximum likelihood and generalized least squares estimators is also discussed Three test statistics are proposed for testing hypotheses of interest with the asymptotic chi-square distribution which guarantees correct asymptotic significance levels Results of simulations and an application to a real data set are also reported (C) 2009 The Korean Statistical Society Published by Elsevier B V All rights reserved

Front tracking with moving-least-squares surfaces

The representation of interfaces by means of the algebraic moving-least-squares (AMLS) technique is addressed. This technique, in which the interface is represented by an unconnected set of points, is interesting for evolving fluid interfaces since there is]to surface connectivity. The position of the surface points can thus be updated without concerns about the quality of any surface triangulation. We introduce a novel AMLS technique especially designed for evolving-interfaces applications that we denote RAMLS (for Robust AMLS). The main advantages with respect to previous AMLS techniques are: increased robustness, computational efficiency, and being free of user-tuned parameters. Further, we propose a new front-tracking method based on the Lagrangian advection of the unconnected point set that defines the RAMLS surface. We assume that a background Eulerian grid is defined with some grid spacing h. The advection of the point set makes the surface evolve in time. The point cloud can be regenerated at any time (in particular, we regenerate it each time step) by intersecting the gridlines with the evolved surface, which guarantees that the density of points on the surface is always well balanced. The intersection algorithm is essentially a ray-tracing algorithm, well-studied in computer graphics, in which a line (ray) is traced so as to detect all intersections with a surface. Also, the tracing of each gridline is independent and can thus be performed in parallel. Several tests are reported assessing first the accuracy of the proposed RAMLS technique, and then of the front-tracking method based on it. Comparison with previous Eulerian, Lagrangian and hybrid techniques encourage further development of the proposed method for fluid mechanics applications. (C) 2008 Elsevier Inc. All rights reserved.

Topological triangle characterization with application to object detection from images

A novel mathematical framework inspired on Morse Theory for topological triangle characterization in 2D meshes is introduced that is useful for applications involving the creation of mesh models of objects whose geometry is not known a priori. The framework guarantees a precise control of topological changes introduced as a result of triangle insertion/removal operations and enables the definition of intuitive high-level operators for managing the mesh while keeping its topological integrity. An application is described in the implementation of an innovative approach for the detection of 2D objects from images that integrates the topological control enabled by geometric modeling with traditional image processing techniques. (C) 2008 Published by Elsevier B.V.

Package models and the information crisis of prebiotic evolution

The coexistence between different types of templates has been the choice solution to the information crisis of prebiotic evolution, triggered by the finding that a single RNA-like template cannot carry enough information to code for any useful replicase. In principle, confining d distinct templates of length L in a package or protocell, whose Survival depends on the coexistence of the templates it holds in, could resolve this crisis provided that d is made sufficiently large. Here we review the prototypical package model of Niesert et al. [1981. Origin of life between Scylla and Charybdis. J. Mol. Evol. 17, 348-353] which guarantees the greatest possible region of viability of the protocell population, and show that this model, and hence the entire package approach, does not resolve the information crisis. In particular, we show that the total information stored in a viable protocell (Ld) tends to a constant value that depends only on the spontaneous error rate per nucleotide of the template replication mechanism. As a result, an increase of d must be followed by a decrease of L, so that the net information gain is null. (C) 2008 Elsevier Ltd. All rights reserved.

Towards a maximal extension of Pelczynski`s decomposition method in Banach spaces

l Suppose that X, Y. A and B are Banach spaces such that X is isomorphic to Y E) A and Y is isomorphic to X circle plus B. Are X and Y necessarily isomorphic? In this generality. the answer is no, as proved by W.T. Cowers in 1996. In the present paper, we provide a very simple necessary and sufficient condition on the 10-tuples (k, l, m, n. p, q, r, s, u, v) in N with p+q+u >= 3, r+s+v >= 3, uv >= 1, (p,q)$(0,0), (r,s)not equal(0,0) and u=1 or v=1 or (p. q) = (1, 0) or (r, s) = (0, 1), which guarantees that X is isomorphic to Y whenever these Banach spaces satisfy X(u) similar to X(p)circle plus Y(q), Y(u) similar to X(r)circle plus Y(s), and A(k) circle plus B(l) similar to A(m) circle plus B(n). Namely, delta = +/- 1 or lozenge not equal 0, gcd(lozenge, delta (p + q - u)) divides p + q - u and gcd(lozenge, delta(r + s - v)) divides r + s - v, where 3 = k - I - in + n is the characteristic number of the 4-tuple (k, l, m, n) and lozenge = (p - u)(s - v) - rq is the discriminant of the 6-tuple (p, q, r, s, U, v). We conjecture that this result is in some sense a maximal extension of the classical Pelczynski`s decomposition method in Banach spaces: the case (1, 0. 1, 0, 2. 0, 0, 2. 1. 1). (C) 2009 Elsevier Inc. All rights reserved.