Immunogenic properties of a recombinant fusion protein containing the C-terminal 19 kDa of Plasmodium falciparum merozoite surface protein-1 and the innate immunity agonist FliC flagellin of Salmonella Typhimurium

In a recent study, we demonstrated the immunogenic properties of a new malaria vaccine polypeptide based on a 19 kDa C-terminal fragment of the merozoite surface protein-1 (MSP1(19)) from Plasmodium vivax and an innate immunity agonist, the Salmonella enterica serovar Typhimurium flagellin (FliC). Herein, we tested whether the same strategy, based on the MSP1(19) component of the deadly malaria parasite Plasmodium falciparum, could also generate a fusion polypeptide with enhanced immunogenicity. The His(6)FliC-MSP1(19) fusion protein was expressed from a recombinant Escherichia coil and showed preserved in vitro TLR5-binding activity. In contrast to animals injected with His(6)MSP1(19), mice subcutaneously immunised with the recombinant His6FliC-MSP1(19) developed strong MSP1(19)-specific systemic antibody responses with a prevailing IgG1 subclass. Incorporation of other adjuvants, such as CpG ODN 1826, complete and incomplete Freund`s adjuvants or Quil-A, improved the IgG responses after the second, but not the third, immunising dose. It also resulted in a more balanced IgG subclass response, as evaluated by the IgG1/IgG2c ratio, and higher cell-mediated immune response, as determined by the detection of antigen-specific interferon-gamma secretion by immune spleen cells. MSP(19)-specific antibodies recognised not only the recombinant protein, but also the native protein expressed on the surface of P. falciparum parasites. Finally, sera from rabbits immunised with the fusion protein alone inhibited the in vitro growth of three different P. falciparum strains. In summary, these results extend our previous observations and further demonstrate that fusion of the innate immunity agonist FliC to Plasmodium antigens is a promising alternative to improve their immunogenicity. (c) 2010 Elsevier Ltd. All rights reserved.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.

A Mass-Conserving Algorithm for Dynamical Lubrication Problems With Cavitation

A numerical algorithm for fully dynamical lubrication problems based on the Elrod-Adams formulation of the Reynolds equation with mass-conserving boundary conditions is described. A simple but effective relaxation scheme is used to update the solution maintaining the complementarity conditions on the variables that represent the pressure and fluid fraction. The equations of motion are discretized in time using Newmark`s scheme, and the dynamical variables are updated within the same relaxation process just mentioned. The good behavior of the proposed algorithm is illustrated in two examples: an oscillatory squeeze flow (for which the exact solution is available) and a dynamically loaded journal bearing. This article is accompanied by the ready-to-compile source code with the implementation of the proposed algorithm. [DOI: 10.1115/1.3142903]

Improvements on the Porter`s Stemming Algorithm for Portuguese

The amount of textual information digitally stored is growing every day. However, our capability of processing and analyzing that information is not growing at the same pace. To overcome this limitation, it is important to develop semiautomatic processes to extract relevant knowledge from textual information, such as the text mining process. One of the main and most expensive stages of the text mining process is the text pre-processing stage, where the unstructured text should be transformed to structured format such as an attribute-value table. The stemming process, i.e. linguistics normalization, is usually used to find the attributes of this table. However, the stemming process is strongly dependent on the language in which the original textual information is given. Furthermore, for most languages, the stemming algorithms proposed in the literature are computationally expensive. In this work, several improvements of the well know Porter stemming algorithm for the Portuguese language, which explore the characteristics of this language, are proposed. Experimental results show that the proposed algorithm executes in far less time without affecting the quality of the generated stems.

Genetic Algorithm for the Determination of Linear Viscoelastic Relaxation Spectrum from Experimental Data

Conventional procedures employed in the modeling of viscoelastic properties of polymer rely on the determination of the polymer`s discrete relaxation spectrum from experimentally obtained data. In the past decades, several analytical regression techniques have been proposed to determine an explicit equation which describes the measured spectra. With a diverse approach, the procedure herein introduced constitutes a simulation-based computational optimization technique based on non-deterministic search method arisen from the field of evolutionary computation. Instead of comparing numerical results, this purpose of this paper is to highlight some Subtle differences between both strategies and focus on what properties of the exploited technique emerge as new possibilities for the field, In oder to illustrate this, essayed cases show how the employed technique can outperform conventional approaches in terms of fitting quality. Moreover, in some instances, it produces equivalent results With much fewer fitting parameters, which is convenient for computational simulation applications. I-lie problem formulation and the rationale of the highlighted method are herein discussed and constitute the main intended contribution. (C) 2009 Wiley Periodicals, Inc. J Appl Polym Sci 113: 122-135, 2009

Grid job scheduling using Route with Genetic Algorithm support

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

An unstructured CVFEM and moving interface algorithm for non-Newtonian Hele-Shaw flows in injection molding

Purpose - The purpose of this paper is to develop a novel unstructured simulation approach for injection molding processes described by the Hele-Shaw model. Design/methodology/approach - The scheme involves dual dynamic meshes with active and inactive cells determined from an initial background pointset. The quasi-static pressure solution in each timestep for this evolving unstructured mesh system is approximated using a control volume finite element method formulation coupled to a corresponding modified volume of fluid method. The flow is considered to be isothermal and non-Newtonian. Findings - Supporting numerical tests and performance studies for polystyrene described by Carreau, Cross, Ellis and Power-law fluid models are conducted. Results for the present method are shown to be comparable to those from other methods for both Newtonian fluid and polystyrene fluid injected in different mold geometries. Research limitations/implications - With respect to the methodology, the background pointset infers a mesh that is dynamically reconstructed here, and there are a number of efficiency issues and improvements that would be relevant to industrial applications. For instance, one can use the pointset to construct special bases and invoke a so-called ""meshless"" scheme using the basis. This would require some interesting strategies to deal with the dynamic point enrichment of the moving front that could benefit from the present front treatment strategy. There are also issues related to mass conservation and fill-time errors that might be addressed by introducing suitable projections. The general question of ""rate of convergence"" of these schemes requires analysis. Numerical results here suggest first-order accuracy and are consistent with the approximations made, but theoretical results are not available yet for these methods. Originality/value - This novel unstructured simulation approach involves dual meshes with active and inactive cells determined from an initial background pointset: local active dual patches are constructed ""on-the-fly"" for each ""active point"" to form a dynamic virtual mesh of active elements that evolves with the moving interface.

Transport control in fusion plasmas by changing electric and magnetic field spatial profiles

For magnetically confined plasmas in tokamaks, we have numerically investigated how Lagrangian chaos at the plasma edge affects the plasma confinement. Initially, we have considered the chaotic motion of particles in an equilibrium electric field with a monotonic radial profile perturbed by drift waves. We have showed that an effective transport barrier may be created at the plasma edge by modifying the electric field radial profile. In the second place, we have obtained escape patterns and magnetic footprints of chaotic magnetic field lines in the region near a tokamak wall with resonant modes due to the action of an ergodic magnetic limiter. For monotonic plasma current density profiles we have obtained distributions of field line connections to the wall and line escape channels with the same spatial pattern as the magnetic footprints on the tokamak walls. (c) 2008 Elsevier B.V. All rights reserved.

Recurrence quantification analysis of electrostatic fluctuations in fusion plasmas

We have investigated plasma turbulence at the edge of a tokamak plasma using data from electrostatic potential fluctuations measured in the Brazilian tokamak TCABR. Recurrence quantification analysis has been used to provide diagnostics of the deterministic content of the series. We have focused our analysis on the radial dependence of potential fluctuations and their characterization by recurrence-based diagnostics. Our main result is that the deterministic content of the experimental signals is most pronounced at the external part of the plasma column just before the plasma radius. Since the chaoticity of the signals follows the same trend, we have concluded that the electrostatic plasma turbulence at the tokamak plasma edge can be partially explained by means of a deterministic nonlinear system. (C) 2007 Elsevier B.V. All rights reserved.

Sub-barrier fusion of two-neutron halo nuclei

The tunneling of composite systems, where breakup may occur during the barrier penetration process, is considered in connection with the fusion of halo-like radioactive, neutron- and proton-rich nuclei, on heavy targets. The large amount of recent and new data clearly indicates that breakup hinders the fusion at energies near and below the Coulomb barrier. However, clear evidence for enhancement due to halo properties seems to over ride the breakup hindrance at lower energies, owing, to a large extent, to the extended matter density distribution. In particular we report here that at sub-barrier energies the fusion cross section of the Borromean two-neutron halo nucleus (6)He with the actinide nucleus (238)U is significantly enhanced as compared to the fusion of a similar projectile with no halo. This conclusion differs from that of the original work, where it was claimed that no such enhancement ensues. This sub-barrier fusion enhancement is also observed in the (6)He + (209)Bi system. (C) 2010 Elsevier B.V. All rights reserved.

FUSION ENHANCEMENT/SUPPRESSION AND IRREVERSIBILITY IN REACTIONS INDUCED BY WEAKLY BOUND NUCLEI

We show that halo effects enhance fusion cross sections of weakly bound systems, comparing with the situation when there is no-halo. We introduce dimensionless fusion functions and energy variable quantity to investigate systematical trends in the fusion cross sections of weakly bound nuclei at near-barrier energies. We observe very clearly complete fusion suppression at energies above the barrier due to dynamic effects of the breakup on fusion. We explain this suppression in terms of the repulsive polarization potential produced by the breakup.

Astrophysical S factors for fusion reactions involving C, O, Ne, and Mg isotopes

Using the Sao Paulo potential and the barrier penetration formalism we have calculated the astrophysical factor S(E) for 946 fusion reactions involving stable and neutron-rich isotopes of C, O, Ne, and Mg for center-of-mass energies E varying from 2 to approximate to 18-30 MeV (covering the range below and above the Coulomb barrier). We have parameterized the energy dependence, S(E), by an accurate universal 9-parameter analytic expression and present tables of fit parameters for all the reactions. We also discuss the reduced 3-parameter version of our fit which is highly accurate at energies below the Coulomb barrier, and outline the procedure for calculating the reaction rates. The results can be easily converted to thermonuclear or pycnonuclear reaction rates to simulate various nuclear burning phenomena, in particular, stellar burning at high temperatures and nucleosynthesis in high density environments. (C) 2010 Elsevier Inc. All rights reserved

Breakup effects in fusion and total reaction cross sections of weakly bound systems

We use a new technique to investigate the systematic behavior of near barrier complete fusion, total fusion and total reaction cross sections of weakly bound systems. A dimensionless fusion excitation function is used as a benchmark to which renormalized fusion data are compared and dynamic breakup effects can be disentangled from static effects. The same reduction procedure is used to study the effect of the direct reaction mechanisms on the total reaction cross section.