Intracellular concentrations of Ca2+ modulate the strength of signal and alter the outcomes of cytotoxic T-lymphocyte antigen-4 (CD152)-CD80/CD86 interactions in CD4(+) T lymphocytes

The costimulatory receptors CD28 and cytotoxic T-lymphocyte antigen (CTLA)-4 and their ligands, CD80 and CD86, are expressed on T lymphocytes; however, their functional roles during T cell-T cell interactions are not well known. The consequences of blocking CTLA-4-CD80/CD86 interactions on purified mouse CD4(+) T cells were studied in the context of the strength of signal (SOS). CD4(+) T cells were activated with phorbol 12-myristate 13-acetate (PMA) and different concentrations of a Ca2+ ionophore, Ionomycin (I), or a sarcoplasmic Ca2+ ATPase inhibitor, Thapsigargin (TG). Increasing concentrations of I or TG increased the amount of interleukin (IL)-2, reflecting the conversion of a low to a high SOS. During activation with PMA and low amounts of I, intracellular concentrations of calcium ([Ca2+](i)) were greatly reduced upon CTLA-4-CD80/CD86 blockade. Further experiments demonstrated that CTLA-4-CD80/CD86 interactions reduced cell cycling upon activation with PMA and high amounts of I or TG (high SOS) but the opposite occurred with PMA and low amounts of I or TG (low SOS). These results were confirmed by surface T-cell receptor (TCR)-CD3 signalling using a low SOS, for example soluble anti-CD3, or a high SOS, for example plate-bound anti-CD3. Also, CTLA-4-CD80/CD86 interactions enhanced the generation of reactive oxygen species (ROS). Studies with catalase revealed that H2O2 was required for IL-2 production and cell cycle progression during activation with a low SOS. However, the high amounts of ROS produced during activation with a high SOS reduced cell cycle progression. Taken together, these results indicate that [Ca2+](i) and ROS play important roles in the modulation of T-cell responses by CTLA-4-CD80/CD86 interactions.

Bicriterion differential games with qualitative outcomes

Combat games are studied as bicriterion differential games with qualitative outcomes determined by threshold values on the criterion functions. Survival and capture strategies of the players are defined using the notion of security levels. Closest approach survival strategies (CASS) and minimum risk capture strategies (MRCS) are important strategies for the players identified as solutions to four optimization problems involving security levels. These are used, in combination with the preference orderings of the qualitative outcomes by the players, to delineate the win regions and the secured draw and mutual kill regions for the players. It is shown that the secured draw regions and the secured mutual kill regions for the two players are not necessarily the same. Simple illustrative examples are given.

NETGEM: Network Embedded Temporal GEnerative Model for gene expression data

Background: Temporal analysis of gene expression data has been limited to identifying genes whose expression varies with time and/or correlation between genes that have similar temporal profiles. Often, the methods do not consider the underlying network constraints that connect the genes. It is becoming increasingly evident that interactions change substantially with time. Thus far, there is no systematic method to relate the temporal changes in gene expression to the dynamics of interactions between them. Information on interaction dynamics would open up possibilities for discovering new mechanisms of regulation by providing valuable insight into identifying time-sensitive interactions as well as permit studies on the effect of a genetic perturbation. Results: We present NETGEM, a tractable model rooted in Markov dynamics, for analyzing the dynamics of the interactions between proteins based on the dynamics of the expression changes of the genes that encode them. The model treats the interaction strengths as random variables which are modulated by suitable priors. This approach is necessitated by the extremely small sample size of the datasets, relative to the number of interactions. The model is amenable to a linear time algorithm for efficient inference. Using temporal gene expression data, NETGEM was successful in identifying (i) temporal interactions and determining their strength, (ii) functional categories of the actively interacting partners and (iii) dynamics of interactions in perturbed networks. Conclusions: NETGEM represents an optimal trade-off between model complexity and data requirement. It was able to deduce actively interacting genes and functional categories from temporal gene expression data. It permits inference by incorporating the information available in perturbed networks. Given that the inputs to NETGEM are only the network and the temporal variation of the nodes, this algorithm promises to have widespread applications, beyond biological systems. The source code for NETGEM is available from https://github.com/vjethava/NETGEM

Total Factor Productivity in Indian Electronic Sector after Liberalisation: Sources and Outcomes

This paper analyses the efficiency and productivity growth of the Electronic Sector of India in the liberalization era since 1991. The study gives an insight into the process of the growth of one of the most upcoming sector of this decade. This sector has experienced a vast structural change along with the changing economic structures in India after liberalisation. With the opening up of this sector to foreign market and incoming of multinational companies, the environment has become highly competitive. The law that operates is that of Darwin’s ‘Survival of the fittest’. Existing industries experience a continuous threat of exit due to entrance of new potential entrants. Thus, it becomes inevitable for the existing industries in this sector to improve productivity growth for their survival. It is thus important to analyze how the industries in this sector have performed over the years and what are the factors that have contributed to the overall output growth.

Comparison of the degree of creativity in the design outcomes using different design methods

This work analyses the influence of several design methods on the degree of creativity of the design outcome. A design experiment has been carried out in which the participants were divided into four teams of three members, and each team was asked to work applying different design methods. The selected methods were Brainstorming, Functional Analysis, and SCAMPER method. The `degree of creativity' of each design outcome is assessed by means of a questionnaire offered to a number of experts and by means of three different metrics: the metric of Moss, the metric of Sarkar and Chakrabarti, and the evaluation of innovative potential. The three metrics share the property of measuring the creativity as a combination of the degree of novelty and the degree of usefulness. The results show that Brainstorming provides more creative outcomes than when no method is applied, while this is not proved for SCAMPER and Functional Analysis.

Generative Maximum Entropy Learning for Multiclass Classification

Maximum entropy approach to classification is very well studied in applied statistics and machine learning and almost all the methods that exists in literature are discriminative in nature. In this paper, we introduce a maximum entropy classification method with feature selection for large dimensional data such as text datasets that is generative in nature. To tackle the curse of dimensionality of large data sets, we employ conditional independence assumption (Naive Bayes) and we perform feature selection simultaneously, by enforcing a `maximum discrimination' between estimated class conditional densities. For two class problems, in the proposed method, we use Jeffreys (J) divergence to discriminate the class conditional densities. To extend our method to the multi-class case, we propose a completely new approach by considering a multi-distribution divergence: we replace Jeffreys divergence by Jensen-Shannon (JS) divergence to discriminate conditional densities of multiple classes. In order to reduce computational complexity, we employ a modified Jensen-Shannon divergence (JS(GM)), based on AM-GM inequality. We show that the resulting divergence is a natural generalization of Jeffreys divergence to a multiple distributions case. As far as the theoretical justifications are concerned we show that when one intends to select the best features in a generative maximum entropy approach, maximum discrimination using J-divergence emerges naturally in binary classification. Performance and comparative study of the proposed algorithms have been demonstrated on large dimensional text and gene expression datasets that show our methods scale up very well with large dimensional datasets.