919 resultados para Conditional Logic
Resumo:
Background: Basophils constitute a rare leukocyte population known for their effector functions in inflammation and allergy, as well as more recently described immunoregulatory roles. Besides their low frequency, functional analysis of basophils is hindered by a short life span, inefficient ex vivo differentiation protocols, and lack of suitable cell models. A method to produce large quantities of basophils in vitro would facilitate basophil research and constitute a sought-after tool for diagnostic and drug testing purposes. Methods: A method is described to massively expand bone marrow–derived basophils in vitro. Myeloid progenitors are conditionally immortalized using Hoxb8 in the presence of interleukin-3 (IL-3) and outgrowing cell lines selected for their potential to differentiate into basophils upon shutdown of Hoxb8 expression. Results: IL-3-dependent, conditional Hoxb8-immortalized progenitor cell lines can be expanded and maintained in culture for prolonged periods. Upon shutdown of Hoxb8 expression, near-unlimited numbers of mature functional basophils can be differentiated in vitro within six days. The cells are end-differentiated and short-lived and express basophil-specific surface markers and proteases. Upon IgE- as well as C5a-mediated activation, differentiated basophils release granule enzymes and histamine and secrete Th2-type cytokines (IL-4, IL-13) and leukotriene C4. IL-3-deprivation induces apoptosis correlating with upregulation of the BH3-only proteins BCL-2-interacting mediator of cell death (BIM) and p53 upregulated modulator of apoptosis (PUMA) and downregulation of proviral integration site for Moloney murine leukemia virus 1 kinase (PIM-1). Conclusion: A novel method is presented to generate quantitative amounts of mouse basophils in vitro, which moreover allows genetic manipulation of conditionally immortalized progenitors. This approach may represent a useful alternative method to isolating primary basophils.
Resumo:
Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs. By convincing, we mean that (a) there should be a canonical function from sequent proofs to proof nets, (b) it should be possible to check the correctness of a net in polynomial time, (c) every correct net should be obtainable from a sequent calculus proof, and (d) there should be a cut-elimination procedure which preserves correctness. Previous attempts to give proof-net-like objects for propositional classical logic have failed at least one of the above conditions. In Richard McKinley (2010) [22], the author presented a calculus of proof nets (expansion nets) satisfying (a) and (b); the paper defined a sequent calculus corresponding to expansion nets but gave no explicit demonstration of (c). That sequent calculus, called LK∗ in this paper, is a novel one-sided sequent calculus with both additively and multiplicatively formulated disjunction rules. In this paper (a self-contained extended version of Richard McKinley (2010) [22]), we give a full proof of (c) for expansion nets with respect to LK∗, and in addition give a cut-elimination procedure internal to expansion nets – this makes expansion nets the first notion of proof-net for classical logic satisfying all four criteria.
Resumo:
This paper addresses the issue of matching statistical and non-rigid shapes, and introduces an Expectation Conditional Maximization-based deformable shape registration (ECM-DSR) algorithm. Similar to previous works, we cast the statistical and non-rigid shape registration problem into a missing data framework and handle the unknown correspondences with Gaussian Mixture Models (GMM). The registration problem is then solved by fitting the GMM centroids to the data. But unlike previous works where equal isotropic covariances are used, our new algorithm uses heteroscedastic covariances whose values are iteratively estimated from the data. A previously introduced virtual observation concept is adopted here to simplify the estimation of the registration parameters. Based on this concept, we derive closed-form solutions to estimate parameters for statistical or non-rigid shape registrations in each iteration. Our experiments conducted on synthesized and real data demonstrate that the ECM-DSR algorithm has various advantages over existing algorithms.
Resumo:
Cells infected with MuSVts110 express a viral RNA which contains an inherent conditional defect in RNA splicing. It has been shown previously that splicing of the MuSVts110 primary transcript is essential to morphological transformation of 6m2 cells in vitro. A growth temperature of 33$\sp\circ$C is permissive for viral RNA splicing,and, consequently, 6m2 cells appear morphologically transformed at this temperature. However, 6m2 cells appear phenotypically normal when incubated at 39$\sp\circ$C, the non-permissive temperature for viral RNA splicing.^ After a shift from 39$\sp\circ$C to 33$\sp\circ$C, the coordinate splicing of previously synthesized and newly transcribed MuSVts110 RNA was achieved. By S1 nuclease analysis of total RNA isolated at various times, 5$\sp\prime$ splice site cleavage of the MuSVts110 transcript appeared to occur 60 minutes after the shift to 33$\sp\circ$C, and 30 minutes prior to detectable exon ligation. In addition, consistent with the permissive temperatures and the kinetic timeframe of viral RNA splicing after a shift to 33$\sp\circ$C, four temperature sensitive blockades to primer extension were identified 26-75 bases upstream of the 3$\sp\prime$ splice site. These blockades likely reflect four branchpoint sequences utilized in the formation of MuSVts110 lariat splicing-intermediates.^ The 54-5A4 cell line is a spontaneous revertant of 6m2 cells and appears transformed at all growth temperatures. Primer extension sequence analysis has shown that a five base deletion occurred at the 3$\sp\prime$ splice site in MuSVts110 RNA allowing the expression of a viral transforming protein in 54-5A4 in the absence of RNA splicing, whereas in the parental 6m2 cell line, a splicing event is necessary to generate a similar transforming protein. As a consequence of this deletion, splicing cannot occur and the formation of the four MuSVts110 branched-intermediates were not observed at any temperature in 54-5A4 cells. However, 5$\sp\prime$ splice site cleavage was still detected at 33$\sp\circ$C.^ Finally, we have investigated the role of the 1488 bp deletion which occurred in the generation of MuSVts110 in the activation of temperature sensitive viral RNA splicing. This deletion appears solely responsible for splice site activation. Whether intron size is the crucial factor in MuSVts110 RNA splicing or whether inhibitory sequences were removed by the deletion is currently unknown. (Abstract shortened with permission of author.) ^
Resumo:
We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.