60 resultados para Immune algorithm
Resumo:
Original antigenic sin is failure to mount effective immunity to virus variants in a previously virus infected host. We have previously shown that prior immunity to a virus capsid protein inhibits induction from naive CD8 T cells of an IFN-g response to a MHC class I restricted epitope linked to the capsid protein, following immunisation with a capsid expressing the class I restricted epitope. The inhibition is independent of pre-existing antibody to the viral capsid, and the inhibition is observed in animal lacking B cells. CD8 restricted viral capsid specific T cell responses are also not required, but the inhibition is not observed in IL10 knockout mice. We now demonstrate that capsid antigen primed CD4+ T cells secrete IL10 in response to capsid antigen presented by DC, and deviate CD8 cells specific for the linked MHC Class I restricted epitope from IFN-g production to IL-5 production. Neutralizing IL10, either in vitro or in vivo, restores induction following immunisation of an antigen specific IFN-g response to an MHC Class I restricted epitope. This finding demonstrates a strategy for overcoming bias towards a Tc2 response to MHC Class I epitopes upon immunisation of a host already primed to antigen, facilitating immunotherapy for chronic viral infection or cancer
Resumo:
Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.
Resumo:
Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.
Resumo:
The classification rules of linear discriminant analysis are defined by the true mean vectors and the common covariance matrix of the populations from which the data come. Because these true parameters are generally unknown, they are commonly estimated by the sample mean vector and covariance matrix of the data in a training sample randomly drawn from each population. However, these sample statistics are notoriously susceptible to contamination by outliers, a problem compounded by the fact that the outliers may be invisible to conventional diagnostics. High-breakdown estimation is a procedure designed to remove this cause for concern by producing estimates that are immune to serious distortion by a minority of outliers, regardless of their severity. In this article we motivate and develop a high-breakdown criterion for linear discriminant analysis and give an algorithm for its implementation. The procedure is intended to supplement rather than replace the usual sample-moment methodology of discriminant analysis either by providing indications that the dataset is not seriously affected by outliers (supporting the usual analysis) or by identifying apparently aberrant points and giving resistant estimators that are not affected by them.
Resumo:
A line of FVB (H-2(q)) mice transgenic for the E6/E7 open reading frames of Human Papillomavirus type 16 driven from the alpha-A crystallin promoter expresses E7 mRNA in lens and skin epithelium. E7 protein is detectable in adult skin, coinciding with the development or inflammatory skin disease, which progresses to papillomata and squamous carcinomata in some mice. By examining the outcome of parenteral immunization with E7 protein, we sought to determine whether endogenous expression of E7 in skin had induced a preexisting immune outcome, i.e., specific immunity or tolerance, or whether the mice remain naive (''ignorant'') to E7. Our data show that the antibody response to defined E7 B-epitopes, the proliferative response to Th epitopes, and the delayed-type hypersensitivity (DTH) response to whole E7 did not differ between groups or young and old E6/E7 transgenic mice (likely having different degrees of lifetime exposure to E7 protein) or between E6/E7-transgenic and nontransgenic parental strain control mice. Although an E7-specific CTL response could not be induced in the H-2(q) background of these mice, incorporation of a D-b allele into the genome allowed comparison of D-b-restricted CTL responses in E6/E7 transgenic and nontransgenic mice. Experiments indicated that the E7-immunization-induced CTL response did not differ significantly between E6/E7 transgenic and nontransgenic mice. We interpret these results to indicate that in spite of expression of E7 protein in adult skin, E6/E7 transgenic mice remain immunologically naive (ignorant) of E7 epitopes presented by immunization. (C) 1997 Academic Press.
Resumo:
An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.
Resumo:
The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.
Resumo:
We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.
Resumo:
The molecular mechanism by which polydnaviruses of endoparasitoid wasps disrupt cell-mediated encapsulation reactions of host insects is largely unknown. Here we show that a polydnavirus-encoded protein, produced from baculovirus and plasmid expression vectors, prevents cell surface exposure of lectin-binding sites and microparticle formation during immune stimulation of haemocytes. The inactivation of immune-related cellular processes by this protein was analysed using a specific lectin and annexin V and shown to be virtually identical to polydnavirus-mediated effects on haemocytes. Cytochalasin D application has similar effects on haemocytes, suggesting that the immune suppression by the polydnavirus protein is caused by the destabilization of actin filaments. Since the exposure of cell surface glycoproteins and the formation of microparticles are part of an immune response to foreign objects or microorganisms and a prerequisite for cell-mediated encapsulation of microorganisms and parasites, the virus-encoded protein may become an important tool for the inactivation of cellular immune reactions in insects and an essential component in understanding immune suppression in parasitized host insects.
Resumo:
A murine skin abscess model was used to study the immune response to an acute infection with Bacteroides forsythus. BALB/c mice were given subcutaneous injections of either viable or heat-killed B. forsythus, while a third sham-immunized control group received phosphate-buffered saline. Weights and lesion sizes were measured. Blood was collected from the heart and specific antibodies to B. forsythus measured by an ELISA. Swabs taken from the lesions and also from pooled blood were cultured anaerobically for viable B. forsythus. Viable B. forsythus-induced lesions reached maximum size at day 7. B. forsythus cells were recovered from lesions up to day 4 although none were cultured from blood samples. Heat-killed bacteria induced much smaller lesions. Serum antibody levels increased during the 9-day study period, being significantly higher in mice injected with viable compared with heat-killed B. forsythus. Antibody levels in sham control mice were significantly lower than those seen in the other two groups. These results showed that a subcutaneous injection of viable cells of B. forsythus elicited a pronounced abscess formation and induce higher levels of specific antibodies compared with that produced by an injection of dead bacteria. This suggests that, as with other periodontopathic organisms, this mouse model can be used to study the immune response to B. forsythus.