Effector functions of heparin-binding hemagglutinin-specific CD8+ T lymphocytes in latent human tuberculosis.

BACKGROUND: Most individuals infected with Mycobacterium tuberculosis do not develop tuberculosis (TB) and can be regarded as being protected by an appropriate immune response to the infection. The characterization of the immune responses of individuals with latent TB may thus be helpful in the definition of correlates of protection and the development of new vaccine strategies. The highly protective antigen heparin-binding hemagglutinin (HBHA) induces strong interferon (IFN)- gamma responses during latent, but not active, TB. Because of the recently recognized importance of CD8(+) T lymphocytes in anti-TB immunity, we characterized the CD8(+) T lymphocyte responses to HBHA in subjects with latent TB. RESULTS: HBHA-specific CD8(+) T lymphocytes expressed memory cell markers and synthesized HBHA-specific IFN- gamma .They also restricted mycobacterial growth and expressed cytotoxicity by a granule-dependent mechanism. This activity was associated with the intracellular expression of HBHA-induced perforin. Surprisingly, the perforin-producing CD8(+) T lymphocytes were distinct from the IFN- gamma -producing CD8(+) T lymphocytes. CONCLUSION: During latent TB, the HBHA-specific CD8(+) T lymphocyte population expresses all 3 effector functions associated with CD8(+) T lymphocyte-mediated protective immune mechanisms, which supports the notion that HBHA may be protective in humans and suggests that markers of HBHA-specific CD8(+) T lymphocyte responses may be useful in the monitoring of protection.

Cellular immune responses in human immunodeficiency virus (HIV)-1-infected children: Is immune restoration by highly active anti-retroviral therapy comparable to non-progression?

The objective of this study was to investigate whether the restored immune functions of vertically human immunodeficiency virus (HIV)-infected children who were severely immunodeficient before the initiation of highly active anti-retroviral therapy (HAART) are comparable to those of untreated slow progressors. We therefore assessed T cell proliferation and cytokine [interferon (IFN)-γ, interleukin (IL)-5 and IL-13] secretions after mitogen, recall antigens and HIV-1-specific stimulation in 12 untreated slow progressors, 16 untreated progressors and 18 treated patients. Treated children were profoundly immunodeficient before the initiation of HAART and had long-lasting suppression of viral replication on treatment. We demonstrated that slow progressors are characterized not only by the preservation of HIV-1-specific lymphoproliferative responses but also by the fact that these responses are clearly T helper type 1 (Th1)-polarized. Children on HAART had proliferative responses to HIV-1 p24 antigen, purified protein derivative (PPD) and tetanus antigen similar to slow progressors and higher than those of progressors. However, in contrast to slow progressors, most treated children exhibited a release of Th2 cytokines accompanying the IFN-γ secretion in response to the HIV-1 p24 antigen. Moreover, despite higher proliferative responses to phytohaemagglutinin (PHA) than the two groups of untreated children, treated children had lower levels of IFN-γ secretion in response to PHA than slow progressors. These data show that in severely immunodeficient vertically HIV-infected children, a long-lasting HAART allows recovering lymphoproliferative responses similar to untreated slow progressors. However, alterations in IFN-γ secretion in response to the mitogen PHA persisted, and their cytokine release after HIV-specific stimulation was biased towards a Th2 response. © 2011 The Authors. Clinical and Experimental Immunology © 2011 British Society for Immunology.

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.

Reified temporal logics: an overview

There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal temporal logics which are extensions ofthe propositional or predicate calculus with modal temporal operators; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview onthe temporal reified approach by looking closely atsome representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches.

Stochastic comparability and dual q-functions

In this paper we discuss the relationship and characterization of stochastic comparability, duality, and Feller–Reuter–Riley transition functions which are closely linked with each other for continuous time Markov chains. A necessary and sufficient condition for two Feller minimal transition functions to be stochastically comparable is given in terms of their density q-matrices only. Moreover, a necessary and sufficient condition under which a transition function is a dual for some stochastically monotone q-function is given in terms of, again, its density q-matrix. Finally, for a class of q-matrices, the necessary and sufficient condition for a transition function to be a Feller–Reuter–Riley transition function is also given.

Maximum curves and isolated points of entire functions

Given M(r; f) =maxjzj=r (jf(z)j) , curves belonging to the set of points M = fz : jf(z)j = M(jzj; f)g were de�ned by Hardy to be maximum curves. Clunie asked the question as to whether the set M could also contain isolated points. This paper shows that maximum curves consist of analytic arcs and determines a necessary condition for such curves to intersect. Given two entire functions f1(z) and f2(z), if the maximum curve of f1(z) is the real axis, conditions are found so that the real axis is also a maximum curve for the product function f1(z)f2(z). By means of these results an entire function of in�nite order is constructed for which the set M has an in�nite number of isolated points. A polynomial is also constructed with an isolated point.

Applications of Feller-Reuter-Riley transition functions

A Feller–Reuter–Riley function is a Markov transition function whose corresponding semigroup maps the set of the real-valued continuous functions vanishing at infinity into itself. The aim of this paper is to investigate applications of such functions in the dual problem, Markov branching processes, and the Williams-matrix. The remarkable property of a Feller–Reuter–Riley function is that it is a Feller minimal transition function with a stable q-matrix. By using this property we are able to prove that, in the theory of branching processes, the branching property is equivalent to the requirement that the corresponding transition function satisfies the Kolmogorov forward equations associated with a stable q-matrix. It follows that the probabilistic definition and the analytic definition for Markov branching processes are actually equivalent. Also, by using this property, together with the Resolvent Decomposition Theorem, a simple analytical proof of the Williams' existence theorem with respect to the Williams-matrix is obtained. The close link between the dual problem and the Feller–Reuter–Riley transition functions is revealed. It enables us to prove that a dual transition function must satisfy the Kolmogorov forward equations. A necessary and sufficient condition for a dual transition function satisfying the Kolmogorov backward equations is also provided.

Strong ergodicity of monotone transition functions

By revealing close links among strong ergodicity, monotone, and the Feller–Reuter–Riley (FRR) transition functions, we prove that a monotone ergodic transition function is strongly ergodic if and only if it is not FRR. An easy to check criterion for a Feller minimal monotone chain to be strongly ergodic is then obtained. We further prove that a non-minimal ergodic monotone chain is always strongly ergodic. The applications of our results are illustrated using birth-and-death processes and branching processes.

Feller transition functions, Resolvent Decomposition Theorems, and their application in unstable denumerable Markov processes

This paper surveys the recent progresses made in the field of unstable denumerable Markov processes. Emphases are laid upon methodology and applications. The important tools of Feller transition functions and Resolvent Decomposition Theorems are highlighted. Their applications particularly in unstable denumerable Markov processes with a single instantaneous state and Markov branching processes are illustrated.

Turbulence modelling and its effects on electronic systems

This paper presents simulated computational fluid dynamics (CFD) results for comparison against experimental data. The performance of four turbulence models has been assessed for electronic application areas considering both fluid flow and heat transfer phenomenon. CFD is vast becoming a powerful and almost essential tool for design, development and optimization in engineering problems. However turbulence models remain to be the key problem issue when tackling such flow phenomena. The reliability of CFD analysis depends heavily on the performance of the turbulence model employed together with the wall functions implemented. To be able to resolve the abrupt changes in the turbulent energy and other parameters near the wall a particularly fine mesh is necessary which unfortunately increases the computer storage capacity requirements. The objective of turbulence modelling is to enhance computational procdures of sufficient acccuracy and generality for engineers to anticipate the Reynolds stresses and the scalar transport terms.

Investigation into the performance of turbulence models for fluid flow and heat transfer phenomena in electronic applications

Computational Fluid Dynamics (CFD) is gradually becoming a powerful and almost essential tool for the design, development and optimization of engineering applications. However the mathematical modelling of the erratic turbulent motion remains the key issue when tackling such flow phenomena. The reliability of CFD analysis depends heavily on the turbulence model employed together with the wall functions implemented. In order to resolve the abrupt changes in the turbulent energy and other parameters situated at near wall regions a particularly fine mesh is necessary which inevitably increases the computer storage and run-time requirements. Turbulence modelling can be considered to be one of the three key elements in CFD. Precise mathematical theories have evolved for the other two key elements, grid generation and algorithm development. The principal objective of turbulence modelling is to enhance computational procedures of efficient accuracy to reproduce the main structures of three dimensional fluid flows. The flow within an electronic system can be characterized as being in a transitional state due to the low velocities and relatively small dimensions encountered. This paper presents simulated CFD results for an investigation into the predictive capability of turbulence models when considering both fluid flow and heat transfer phenomena. Also a new two-layer hybrid kε / kl turbulence model for electronic application areas will be presented which holds the advantages of being cheap in terms of the computational mesh required and is also economical with regards to run-time.

Hemolymph Functions In Mytilus-Californianus - Cytochemistry Of Hemocytes And Their Responses To Foreign Implants And Hemolymph Factors In Phagocytosis

The hemocytes of Mytilus californianus are of three types: small and large basophils and large granular acidophils. The basophils contain lysosomal enzymes and phagocytose colloidal carbon. Agglutinins for yeast and human A Rh+ve erythrocytes are present in plasma, but are not needed for effective phagocytosis; in vitro both acidophilic and basophilic hemocytes rapidly phagocytose these particles. Plasma proteins, analyzed electrophoretically, are under strong homeostatic control. When Mya arenaria mantle is placed orthotopically on M. californianus mantle, the implant is invaded by host hemocytes in a manner consistent with that described in other published reports on molluscan graft rejection. Steady state is achieved by 26 days postimplant. Second- and third-set implants are rejected more rapidly than are first-set implants, but this is not a specific response. Third-set implants elicit a host cellular response that is more localized than the response to first-set implants. These data do not permit conclusions with respect to memory in these molluscan immune responses, but do imply a qualitative “improvement” in this quasi-immune response of M. californianus.