67 resultados para Immune algorithm
em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain
Resumo:
The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.
Resumo:
S’investiga la resposta immune que té lloc en la infecció experimental de les vedelles gestants amb Neospora caninum a les 3, 6 i 9 setmanes postinfecció, amb especial interès en els teixits placentaris. Donada la importancia que tenen les citoquines en la resposta immune a la infecció, s’ha posat a punt les tècniques de RT-PCR a temps real per a l’estudi de l’expressió génica de citoquines del boví. En una fase posterior s’ha estudiat la dinàmica dels anticossos durant l’experiment, la transmissió transplacentària mitjançant l’anàlisi de la presència de DNA parasitari en teixits, la relació entre la producció de IFN-gamma en fluids fetals i, els avortaments i la trasmissió transplacentària i, finalment, el patró de citoquines, amb èmfasi en la interfase materno-fetal.
Resumo:
The harmful dinoflagellate Prorocentrum minimum has different effects upon various species of grazing bivalves, and these effects also vary with life-history stage. Possible effects of this dinoflagellate upon mussels have not been reported; therefore, experiments exposing adult blue mussels, Mytilus edulis, to P. minimum were conducted. Mussels were exposed to cultures of toxic P. minimum or benign Rhodomonas sp. in glass aquaria. After a short period of acclimation, samples were collected on day 0 (before the exposure) and after 3, 6, and 9 days of continuous-exposure experiment. Hemolymph was extracted for flow-cytometric analyses of hemocyte, immune-response functions, and soft tissues were excised for histopathology. Mussels responded to P. minimum exposure with diapedesis of hemocytes into the intestine, presumably to isolate P. minimum cells within the gut, thereby minimizing damage to other tissues. This immune response appeared to have been sustained throughout the 9-day exposure period, as circulating hemocytes retained hematological and functional properties. Bacteria proliferated in the intestines of the P. minimum-exposed mussels. Hemocytes within the intestine appeared to be either overwhelmed by the large number of bacteria or fully occupied in the encapsulating response to P. minimum cells; when hemocytes reached the intestine lumina, they underwent apoptosis and bacterial degradation. This experiment demonstrated that M. edulis is affected by ingestion of toxic P. minimum; however, the specific responses observed in the blue mussel differed from those reported for other bivalve species. This finding highlights the need to study effects of HABs on different bivalve species, rather than inferring that results from one species reflect the exposure responses of all bivalves.
Resumo:
Mussels (Mytilus edulis) were exposed to cultures of the toxic dinoflagellate Alexandrium fundyense or the non-toxic alga Rhodomonas sp. to evaluate the effects of the harmful alga on the mussels and to study recovery after discontinuation of the A. fundyense exposure. Mussels were exposed for 9 days to the different algae and then all were fed Rhodomonas sp. for 6 more days. Samples of hemolymph for hemocyte analyses and tissues for histology were collected before the exposure and periodically during exposure and recovery periods. Mussels filtered and ingested both microalgal cultures, producing fecal pellets containing degraded, partially degraded, and intact cells of both algae. Mussels exposed to A. fundyense had an inflammatory response consisting of degranulation and diapedesis of hemocytes into the alimentary canal and, as the exposure continued, hemocyte migration into the connective tissue between the gonadal follicles. Evidence of lipid peroxidation, similar to the detoxification pathway described for various xenobiotics, was found; insoluble lipofuchsin granules formed (ceroidosis), and hemocytes carried the granules to the alimentary canal, thus eliminating putative dinoflagellate toxins in feces. As the number of circulating hemocytes in A. fundyense-exposed mussels became depleted, mussels were immunocompromised, and pathological changes followed, i.e., increased prevalences of ceroidosis and trematodes after 9 days of exposure. Moreover, the total number of pathological changes increased from the beginning of the exposure until the last day (day 9). After 6 days of the exposure, mussels in one of the three tanks exposed to A. fundyense mass spawned; these mussels showed more severe effects of the toxic algae than non-spawning mussels exposed to A. fundyense. No significant differences were found between the two treatments during the recovery period, indicating rapid homeostatic processes in tissues and circulating hemocytes.
Resumo:
This paper examines whether human rights naming and shaming destabilizes the rule of authoritarian leaders. We argue that human rights shaming can destabilize autocratic leaders by signaling international disapproval to elites in the targeted country, increasing their capacity to replace the incumbent. In personalist regimes, shaming increases the risk of irregular exit because regime elite do not have a means to peacefully replace the incumbent. Shaming campaigns also decrease foreign aid and international trade in personalist regimes, denying the leader access to resources to pay his coalition – further destabilizing his rule. In non-personalist regimes where parties or the military allow elites to peacefully replace incumbents, human rights shaming increases the risk of regular turnover of power, but has little effect on the risk of irregular exit or international flows of aid and trade. These findings have implications for understanding when and where shaming campaigns are likely to reduce or deter repression.
Resumo:
A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt"
Resumo:
This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed
Resumo:
In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm
Resumo:
Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach
Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories
Resumo:
The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.
Resumo:
The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P