Malaria at Humaita county, Amazonas state, Brazil: XVII — immune response in patients with Plasmodium falciparum according to gametocytes

In August 1983 the Authors studied 36 patients with Plasmodium falciparum malaria and 14 normal individuals born in Humaita region who had never had malaria, had no spleen enlargement and had negative parasitemia as well as passive hemagglutination. Medical histories were obtained and complete physical examination were performed in all of them just as blood tests, parasite density and lymphocyte typing. The lymphocytes were separated and then frozen in liquid nitrogen for later typing by rosette formation. The patients were divided in two groups according to the presence (13 patients) or abscence (23 patients) of gametocytes before treatment. Severe malaria was predominant in the group without gametocytes. The results showed a decrease in the T-cell numbers in Plasmodium falciparum acute malaria patients both with or without gametocytes before the treatment, while B-cell numbers were normal only in the patients with gametocytes. These observations as like as those previously reported by the Authors, permit to associate the presence of gametocytes in peripheral blood and normal number of B-cells in patients with mild Plasmodium falciparum malaria.

Dynamical modelling of a genetic algorithm

This work addresses the signal propagation and the fractional-order dynamics during the evolution of a genetic algorithm (GA). In order to investigate the phenomena involved in the GA population evolution, the mutation is exposed to excitation perturbations during some generations and the corresponding fitness variations are evaluated. Three distinct fitness functions are used to study their influence in the GA dynamics. The input and output signals are studied revealing a fractional-order dynamic evolution, characteristic of a long-term system memory.

Specific circulating immune complexes in acute chagas' disease

The presence of circulating immune complexes formed by IgM and IgG (CIC-IgM and CIC-IgG) was investigated, using antigen-specific enzyme-immunoassays (ELISA), in 30 patients with acute Chagas' disease who showed parasitemia and inoculation chagoma. Control population consisted of patients with chronic T. cruzi infection (30), acute toxoplasmosis 10), leishmaniasis (8), rheumatoid arthritis (3) and healthy individuals with negative serology for Chagas* disease (30). Acute chagasic patients were 100% CIC-IgG and 96.66% CIC-IgM positive whereas immunofluorescence tests yielded 90% and 86.66% of positivity for specific IgG and IgM antibodies, respectively. Chronic patients were 68% CIC-IgG and 0% CIC-IgM positive. The 30 negative and the 21 cross-reaction controls proved negative for ELISA (CIC-IgM and CIC-IgG). The high sensitivity of ELISA assays would allow early immunologic diagnosis, as well as prompt treatment, of acute T. cruzi infection, thus eliminating the problem of the false-positive and false-negative results which affects traditional methods for detection of circulating antibodies.

Cell mediated immune response in human antirabies revaccination

The occurrence of secondary cell mediated immune response (CMI) in human antirabies immunization was studied. The Puenzalida & Palácios vaccine was used because it is routinely used in Brazil. CMI was evaluated by lymphoblastic transformation indices obtained in whole blood culture in the presence of rabies and control (nervous tissue) antigens. Eleven volunteers submitted to revaccination constituted the group under study, while three other volunteers submitted primo vaccination were utilized as control group. A clear secondary CMI to rabies antigen was detected in all the revaccinated volunteers who showed earlier and more intense response than the control group. Response to the control antigen, however, present in all the components of the first group was not detectable in two out of the three primovaccinated and very low in the third one.

Optimization of multi-stage amplifiers in deep-submicron CMOS using a distributed/parallel genetic algorithm

IEEE International Symposium on Circuits and Systems, pp. 724 – 727, Seattle, EUA

Simplification of Immune Adherence Hemagglutination test for detection of rabies antibodies in human serum

In the present work the immune adherence hemagglutination test (IAHA) was standardized in a simplified procedure. This test showed good reproducibility, better than the classical mice serum neutralization test (SN). The tests showed high correlation degree: high titers in one test corresponded to high titers in the other one, and the same occured with low titers. The IAHA test is extremely simple, fast to perform, and of low cost when compared to tests such as SN or indirect immunofluorescense (IIF). It also proved to be useful in less sophisticated laboratories or even as a screening test for the titration of rabies antibodies.

Including context in a routing algorithm for the internet of things

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.

Detect and pointing algorithm's performance for a planar smart antenna array: a review

An adaptive antenna array combines the signal of each element, using some constraints to produce the radiation pattern of the antenna, while maximizing the performance of the system. Direction of arrival (DOA) algorithms are applied to determine the directions of impinging signals, whereas beamforming techniques are employed to determine the appropriate weights for the array elements, to create the desired pattern. In this paper, a detailed analysis of both categories of algorithms is made, when a planar antenna array is used. Several simulation results show that it is possible to point an antenna array in a desired direction based on the DOA estimation and on the beamforming algorithms. A comparison of the performance in terms of runtime and accuracy of the used algorithms is made. These characteristics are dependent on the SNR of the incoming signal.

Hepatitis B vaccine - proposal for a standardized assessment of immune response

The authors developed a comparative study of the various methods of assessment of immune response to Hepatitis B vaccine. Eighty-six health care professionals underwent a vaccination programme with three doses of plasma-derived vaccine against Hepatitis B (H-B-Vax, Merck, Sharp & Dohme) given intra-muscularly. Assessment of immune response was carried out three months after the end of the programme, by radioimmunoassay (RIA) and enzymeimmunoassay (EIA). The results showed that the semi-quantitative assessment of Anti-HBs antibodies by RIA or EIA was perfectly comparable to the reference method (quantitative determination of antibodies by RIA). In view of these findings, the authors suggest a standardization of assessment of immune response to the vaccine, thus permitting correct planning of booster doses and easier comparison between different studies

Immune response in mice immunized with acidic antigenic fractions from Trypanosoma cruzi cytosol

The humoral and cellular immune responses as well as the resistance to infection with bloodstream forms of T. cruzi were studied in mice immunized with acidic antigenic fractions from parasite cytosol, F III and F IV, plus Bordetella pertussis as adjuvant. The immunization with F III induced positive ITH and DTH responses to homologous antigens. In mice immunized with F IV, the ITH was negative and four out of six animals presented positive DTH reactions. In both groups of mice the analysis of IgG aginst T. cruzi showed that the major isotype elicited was IgG1. Specific IgE was also detected in sera from F III immunized mice, thus confirming the presence of homocytothropic antibodies. The parasitemias reached by F III and F IV immunized mice after challenge were lower than those of the controls showing in this way a partial protection against the acute infection. The histological studies of heart and skeletal muscle performed two months after the infection revealed variable mononuclear infiltration in all infected mice despite immunization.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

NoC contention analysis using a branch-and-prune algorithm

“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the traversal time of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.