Prevention of antigen-induced bronchial hyperreactivity and airway inflammation in sensitized guinea-pigs by tacrolimus.

We examined the effect of the immunosuppressive agent, tacrolimus (FK506), on antigen-induced bronchial hyperreactivity to acetylcholine and leukocyte infiltration into the airways of ovalbumin-challenged guinea-pigs. Subcutaneous injection of 0.5 mg/kg of FK506, 1 h before and 5 h after intra-nasal antigen challenge prevented bronchial hyperreactivity to aerosolized acetylcholine, eosinophilia in bronchoalveolar lavage (BAL) fluid and bronchial tissue and the invasion of the bronchial wall by CD4+ T-lymphocytes. FK506 also suppressed ovalbumin-induced increase in the number of leukocytes adhering to the pulmonary vascular endothelium and expressing alpha4-integrins. Inhibition by FK506 of antigen-induced bronchial hyperreactivity in sensitized guinea-pigs may thus relate to its ability to prevent the emergence of important inflammatory components of airway inflammation, such as eosinophil accumulation, as well as CD4+ T-lymphocyte infiltration into the bronchial tissue

On the complexity of strongly connected components in directed hypergraphs

We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure

A Propositional CONEstrip Algorithm

We present a variant of the CONEstrip algorithm for checking whether the origin lies in a finitely generated convex cone that can be open, closed, or neither. This variant is designed to deal efficiently with problems where the rays defining the cone are specified as linear combinations of propositional sentences. The variant differs from the original algorithm in that we apply row generation techniques. The generator problem is WPMaxSAT, an optimization variant of SAT; both can be solved with specialized solvers or integer linear programming techniques. We additionally show how optimization problems over the cone can be solved by using our propositional CONEstrip algorithm as a preprocessor. The algorithm is designed to support consistency and inference computations within the theory of sets of desirable gambles. We also make a link to similar computations in probabilistic logic, conditional probability assessments, and imprecise probability theory

Effects of countdown displays in public transport route choice under severe overcrowding

The paper presents a route choice model for dynamic assignment in congested, i.e. overcrowded, transit networks where it is assumed that passengers are supported with real-time information on carrier arrivals at stops. If the stop layout is such that passenger congestion results in First-In-First-Out (FIFO) queues, a new formulation is devised for calculating waiting times, total travel times and route splits. Numerical results for a simple example network show the effect of information on route choice when heavy congestion is observed. While the provision of information does not lead to a remarkable decrease in total travel time, with the exception of some particular instances, it changes the travel behaviour of passengers that seem to be more averse to queuing at later stages of their journey and, thus, prefer to interchange at less congested stations

No evidence of association between prothrombotic gene polymorphisms and the development of acute myocardial infarction at a young age

Background : we investigated the association between 9 polymorphisms of genes encoding hemostasis factors and myocardial infarction in a large sample of young patients chosen because they have less coronary atherosclerosis than older patients, and thus their disease is more likely to be related to a genetic predisposition to a prothrombotic state Methods and Results : this nationwide case-control study involved 1210 patients who had survived a first myocardial infarction at an age of 45 years who underwent coronary arteriography in 125 coronary care units and 1210 healthy subjects matched for age, sex, and geographical origin. None of the 9 polymorphisms of genes encoding proteins involved in coagulation (G-455A -fibrinogen: OR, 1.0; CI, 0.8 to 1.2; G1691A factor V: OR, 1.1; CI, 0.6 to 2.1; G20210A factor II: OR, 1.0; CI, 0.5 to 1.9; and G10976A factor VII: OR, 1.0; CI, 0.8 to 1.3), platelet function (C807T glycoprotein Ia: OR, 1.1; CI, 0.9 to 1.3; and C1565T glycoprotein IIIa: OR, 0.9; CI, 0.8 to 1.2), fibrinolysis (G185T factor XIII: OR, 1.2; CI, 0.9 to 1.6; and 4G/5G plasminogen activator inhibitor type 1: OR, 0.9; CI, 0.7 to 1.2), or homocysteine metabolism (C677T methylenetetrahydrofolate reductase: OR, 0.9; CI, 0.8 to 1.1) were associated with an increased or decreased risk of myocardial infarction Conclusions : this study provides no evidence supporting an association between 9 polymorphisms of genes encoding proteins involved in hemostasis and the occurrence of premature myocardial infarction or protection against it

Methyl methacrylate and respiratory sensitization: A Critical review

Methyl methacrylate (MMA) is a respiratory irritant and dermal sensitizer that has been associated with occupational asthma in a small number of case reports. Those reports have raised concern that it might be a respiratory sensitizer. To better understand that possibility, we reviewed the in silico, in chemico, in vitro, and in vivo toxicology literature, and also epidemiologic and occupational medicine reports related to the respiratory effects of MMA. Numerous in silico and in chemico studies indicate that MMA is unlikely to be a respiratory sensitizer. The few in vitro studies suggest that MMA has generally weak effects. In vivo studies have documented contact skin sensitization, nonspecific cytotoxicity, and weakly positive responses on local lymph node assay; guinea pig and mouse inhalation sensitization tests have not been performed. Cohort and cross-sectional worker studies reported irritation of eyes, nose, and upper respiratory tract associated with short-term peaks exposures, but little evidence for respiratory sensitization or asthma. Nineteen case reports described asthma, laryngitis, or hypersensitivity pneumonitis in MMA-exposed workers; however, exposures were either not well described or involved mixtures containing more reactive respiratory sensitizers and irritants.The weight of evidence, both experimental and observational, argues that MMA is not a respiratory sensitizer