Learn More
We study the problem of finding a maximummatching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This problem, which we call maximum submodular-function matching (MSM), is a natural generalization of maximum weight matching(More)
BACKGROUND Serine proteases promote inflammation and tissue remodeling by activating proteinase-activated receptors, urokinase, metalloproteinases and angiotensin. In the present study, 4-(2-Aminoethyl) benzenesulfonyl fluoride (AEBSF) a serine protease inhibitor was evaluated for prophylactic and therapeutic treatment in mouse model of airway allergy. (More)
BACKGROUND Protease activity of Per a 10 has been shown to modulate dendritic cells toward Th-2 polarization and to induce airway inflammation. OBJECTIVE To elucidate the role of serine protease activity of Per a 10 in inducing biochemical responses in epithelial cells. METHODS Per a 10 was inactivated by heat treatment (ΔPer a 10) or AEBSF (iPer a 10).(More)
Proteases are implicated in exacerbation of allergic diseases. In this study, the role of proteolytic activity of Per a 10 was evaluated on Th2 polarization. Intranasal administration of Per a 10 in mice led to allergic airway inflammation as seen by higher IgE levels, cellular infiltration, IL-17A, and Th2 cytokines, whereas, inactive (Δ)Per a 10 showed(More)
Protease allergens are known to enhance allergic inflammation but their exact role in initiation of allergic reactions at mucosal surfaces still remains elusive. This study was aimed at deciphering the role of serine protease activity of Per a 10, a major cockroach allergen in initiation of allergic inflammation at mucosal surfaces. We demonstrate that Per(More)
Mixing time of a Markov chain depends on the eigenvalues of its transition matrix. We give some examples and bounds on the mixing time in terms of the eigenvalue having second largest absolute value. This paper is based on Chapters 1, 4, and 12 of [1].
We develop a paradigm for studying multi-player deterministic communication, based on a novel combinatorial concept that we call a strong fooling set. Our paradigm leads to optimal lower bounds on the per-player communication required for solving multi-player EQUALITY problems in a private-message setting. This in turn gives a very strong - O(1) versus(More)