CD4+ alpha beta T cell and gamma delta T cell responses to Mycobacterium tuberculosis. Similarities and differences in Ag recognition, cytotoxic effector function, and cytokine production.

CD4+ and gamma delta T cells are activated readily by Mycobacterium tuberculosis. To examine their role in the human immune response to M. tuberculosis, CD4+ and gamma delta T cells from healthy tuberculin-positive donor were studied for patterns of Ag recognition, cytotoxicity, and cytokine production in response to M. tuberculosis-infected mononuclear phagocytes. Both T cell subsets responded to intact M. tuberculosis and its cytosolic Ags. However, CD4+ and gamma delta T cells differed in the range of cytosolic Ags recognized: reactivity to a wide m.w. range of Ags for CD4+ T cells, and a restricted pattern for gamma delta T cells, with dominance of Ags of 10 to 15 kDa. Both T cell subsets were equally cytotoxic for M. tuberculosis-infected monocytes. Furthermore, both CD4+ and gamma delta T cells produced large amounts of IFN-gamma: mean pg/ml of IFN-gamma in supernatants was 2458 +/- 213 for CD4+ and 2349 +/- 245 for gamma delta T cells. By filter-spot ELISA (ELISPOT), the frequency of IFN-gamma-secreting gamma delta T cells was one-half of that of CD4+ T cells in response to M. tuberculosis, suggesting that gamma delta T cells on a per cell basis were more efficient producers of IFN-gamma than CD4+ T cells. In contrast, CD4+ T cells produced more IL-2 than gamma delta T cells, which correlated with diminished T cell proliferation of gamma delta T cells compared with CD4+ T cells. These results indicate that CD4+ and gamma delta T cell subsets have similar effector functions (cytotoxicity, IFN-gamma production) in response to M. tuberculosis-infected macrophages, despite differences in the Ags recognized, IL-2 production, and efficiency of IFN-gamma production.

Consistent quaternion interpolation for objective finite element approximation of geometrically exact beam

We explore an isoparametric interpolation of total quaternion for geometrically consistent, strain-objective and path-independent finite element solutions of the geometrically exact beam. This interpolation is a variant of the broader class known as slerp. The equivalence between the proposed interpolation and that of relative rotation is shown without any recourse to local bijection between quaternions and rotations. We show that, for a two-noded beam element, the use of relative rotation is not mandatory for attaining consistency cum objectivity and an appropriate interpolation of total rotation variables is sufficient. The interpolation of total quaternion, which is computationally more efficient than the one based on local rotations, converts nodal rotation vectors to quaternions and interpolates them in a manner consistent with the character of the rotation manifold. This interpolation, unlike the additive interpolation of total rotation, corresponds to a geodesic on the rotation manifold. For beam elements with more than two nodes, however, a consistent extension of the proposed quaternion interpolation is difficult. Alternatively, a quaternion-based procedure involving interpolation of relative rotations is proposed for such higher order elements. We also briefly discuss a strategy for the removal of possible singularity in the interpolation of quaternions, proposed in [I. Romero, The interpolation of rotations and its application to finite element models of geometrically exact rods, Comput. Mech. 34 (2004) 121–133]. The strain-objectivity and path-independence of solutions are justified theoretically and then demonstrated through numerical experiments. This study, being focused only on the interpolation of rotations, uses a standard finite element discretization, as adopted by Simo and Vu-Quoc [J.C. Simo, L. Vu-Quoc, A three-dimensional finite rod model part II: computational aspects, Comput. Methods Appl. Mech. Engrg. 58 (1986) 79–116]. The rotation update is achieved via quaternion multiplication followed by the extraction of the rotation vector. Nodal rotations are stored in terms of rotation vectors and no secondary storages are required.

Conservation law with the flux function discontinuous in the space variable- II - Convex-concave type fluxes and generalized entropy solutions

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

Inferring molecular function: contributions from functional linkages

In the current era of high-throughput sequencing and structure determination, functional annotation has become a bottleneck in biomedical science. Here, we show that automated inference of molecular function using functional linkages among genes increases the accuracy of functional assignments by >= 8% and enriches functional descriptions in >= 34% of top assignments. Furthermore, biochemical literature supports >80% of automated inferences for previously unannotated proteins. These results emphasize the benefit of incorporating functional linkages in protein annotation.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

THE BERGMAN KERNEL FUNCTION

In this note, we point out that a large family of n x n matrix valued kernel functions defined on the unit disc D subset of C, which were constructed recently in [9], behave like the familiar Bergman kernel function on ID in several different ways. We show that a number of questions involving the multiplication operator on the corresponding Hilbert space of holomorphic functions on D can be answered using this likeness.

Structural, ferroelectric and optical properties of Bi2VO5.5 thin films deposited on platinized silicon {(100) Pt/TiO2/SiO2/Si} substrates

Bismuth vanadate (Bi2VO5.5, BVO) thin films have been deposited by a pulsed laser ablation technique on platinized silicon substrates. The surface morphology of the BVO thin films has been studied by atomic force microscopy (AFM). The optical properties of the BVO thin films were investigated using spectroscopic ellipsometric measurements in the 300–820 nm wavelength range. The refractive index (n), extinction coefficient (k) and thickness of the BVO thin films have been obtained by fitting the ellipsometric experimental data in a four-phase model (air/BVOrough/BVO/Pt). The values of the optical constants n and k that were determined through multilayer analysis at 600 nm were 2.31 and 0.056, respectively. For fitting the ellipsometric data and to interpret the optical constants, the unknown dielectric function of the BVO films was constructed using a Lorentz model. The roughness of the films was modeled in the Brugmann effective medium approximation and the results were compared with the AFM observations.

Structural Studies on the Second Mycobacterium smegmatis Dps: Invariant and Variable Features of Structure, Assembly and Function

A second DNA binding protein from stationary-phase cells of Mycobacterium smegmatis (MsDps2) has been identified from the bacterial genome. It was cloned, expressed and characterised and its crystal structure was determined. The core dodecameric structure of MsDps2 is the same as that of the Dps from the organism described earlier (MsDps1). However, MsDps2 possesses a long N-terminal tail instead of the C-terminal tail in MsDps1. This tail appears to be involved in DNA binding. It is also intimately involved in stabilizing the dodecamer. Partly on account of this factor, MsDps2 assembles straightway into the dodecamer, while MsDps1 does so on incubation after going through an intermediate trimeric stage. The ferroxidation centre is similar in the two proteins, while the pores leading to it exhibit some difference. The mode of sequestration of DNA in the crystalline array of molecules, as evidenced by the crystal structures, appears to be different in MsDps1 and MsDps2, highlighting the variability in the mode of Dps–DNA complexation. A sequence search led to the identification of 300 Dps molecules in bacteria with known genome sequences. Fifty bacteria contain two or more types of Dps molecules each, while 195 contain only one type. Some bacteria, notably some pathogenic ones, do not contain Dps. A sequence signature for Dps could also be derived from the analysis.

The mixed black hole partition function for the STU model

We evaluate the mixed partition function for dyonic BPS black holes using the recently proposed degeneracy formula for the STU model. The result factorizes into the OSV mixed partition function times a proportionality factor. The latter is in agreement with the measure factor that was recently conjectured for a class of N = 2 black holes that contains the STU model.

Rotorcraft parameter estimation using radial basis function neural network

Increased emphasis on rotorcraft performance and perational capabilities has resulted in accurate computation of aerodynamic stability and control parameters. System identification is one such tool in which the model structure and parameters such as aerodynamic stability and control derivatives are derived. In the present work, the rotorcraft aerodynamic parameters are computed using radial basis function neural networks (RBFN) in the presence of both state and measurement noise. The effect of presence of outliers in the data is also considered. RBFN is found to give superior results compared to finite difference derivatives for noisy data. (C) 2010 Elsevier Inc. All rights reserved.

Asymmetric cross-coupled differential pair configuration to realize neuron activation function and its derivative

In this brief, we present a new circuit technique to generate the sigmoid neuron activation function (NAF) and its derivative (DNAF). The circuit makes use of transistor asymmetry in cross-coupled differential pair to obtain the derivative. The asymmetry is introduced through external control signal, as and when required. This results in the efficient utilization of the hard-ware by realizing NAF and DNAF using the same building blocks. The operation of the circuit is presented in the subthreshold region for ultra low-power applications. The proposed circuit has been experimentally prototyped and characterized as a proof of concept on the 1.5-mum AMI technology.