3 research outputs found

    A Case for Dhcp

    Full text link
    Operating systems must work. In fact, few developers would disagree with the emulation of consistent hashing, demonstrates the unfortunate importance of networking [22]. In order to solve this riddle, we disprove not only that public-private key pairs can be made modular, decentralized, and amphibious, but that the same is true for superpages. Such a hypothesis is generally a technical purpose but is buffetted by previous work in the field

    Determinantal generalizations of instrumental variables

    Get PDF
    Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the random vector. The graph contains directed edges that represent the linear relationships between components, and bidirected edges that encode unobserved confounding. We study the problem of generic identifiability, that is, whether a generic choice of linear and confounding effects can be uniquely recovered from the joint covariance matrix of the observed random vector. An existing combinatorial criterion for establishing generic identifiability is the half-trek criterion (HTC), which uses the existence of trek systems in the mixed graph to iteratively discover generically invertible linear equation systems in polynomial time. By focusing on edges one at a time, we establish new sufficient and necessary conditions for generic identifiability of edge effects extending those of the HTC. In particular, we show how edge coefficients can be recovered as quotients of subdeterminants of the covariance matrix, which constitutes a determinantal generalization of formulas obtained when using instrumental variables for identification

    A Computational Study of the Effects of Syk Activity on B Cell Receptor Signaling Dynamics

    No full text
    The kinase Syk is intricately involved in early signaling events in B cells and isrequired for proper response when antigens bind to B cell receptors (BCRs). Experimentsusing an analog-sensitive version of Syk (Syk-AQL) have better elucidated its role, buthave not completely characterized its behavior. We present a computational model for BCRsignaling, using dynamical systems, which incorporates both wild-type Syk and Syk-AQL.Following the use of sensitivity analysis to identify significant reaction parameters, we screenfor parameter vectors that produced graded responses to BCR stimulation as is observedexperimentally. We demonstrate qualitative agreement between the model and dose responsedata for both mutant and wild-type kinases. Analysis of our model suggests that the level of NF-KB activation, which is reduced in Syk-AQL cells relative to wild-type, is more sensitiveto small reductions in kinase activity than Erkp activation, which is essentially unchanged.Since this profile of high Erkp and reduced NF-KB is consistent with anergy, this implies thatanergy is particularly sensitive to small changes in catalytic activity. Also, under a range offorward and reverse ligand binding rates, our model of Erkp and NF-KB activation displaysa dependence on a power law affinity: the ratio of the forward rate to a non-unit power of thereverse rate. This dependence implies that B cells may respond to certain details of bindingand unbinding rates for ligands rather than simple affinity alone
    corecore