487 research outputs found

    Helminths in the hygiene hypothesis:Sooner or later?

    Get PDF
    There is increasing recognition that exposures to infectious agents evoke fundamental effects on the development and behaviour of the immune system. Moreover, where infections (especially parasitic infections) have declined, immune responses appear to be increasingly prone to hyperactivity. For example, epidemiological studies of parasite-endemic areas indicate that prenatal or early-life experience of infections can imprint an individual's immunological reactivity. However, the ability of helminths to dampen pathology in established inflammatory diseases implies that they can have therapeutic effects even if the immune system has developed in a low-infection setting. With recent investigations of how parasites are able to modulate host immune pathology at the level of individual parasite molecules and host cell populations, we are now able to dissect the nature of the host–parasite interaction at both the initiation and recall phases of the immune response. Thus the question remains – is the influence of parasites on immunity one that acts primarily in early life, and at initiation of the immune response, or in adulthood and when recall responses occur? In short, parasite immunosuppression – sooner or later

    Neighborhood Champions in Regular Graphs

    Get PDF
    For a vertex x in a graph G we define Ψ1(x) to be the number of edges in the closed neighborhood of x. Vertex x∗ is a neighborhood champion if Ψ1(x∗)\u3eΨ1(x) for all x≠x∗. We also refer to such an x∗ as a unique champion. For d≥4 let n0(1,d) be the smallest number such that for every n≥n0(1,d) there exists a n vertex d-regular graph with a unique champion. Our main result is that n0(1,d) satisfies d+3≤n0(1,d)≤3d+1. We also observe that there can be no unique champion vertex when d=3

    Attitudes of surgeons to the use of postoperative markers of the systemic inflammatory response following elective surgery

    Get PDF
    Background: Cancer is responsible for 7.6 million deaths worldwide and surgery is the primary modality of a curative outcome. Postoperative care is of considerable importance and it is against this backdrop that a questionnaire based study assessing the attitudes of surgeons to monitoring postoperative systemic inflammation was carried out. Method: A Web based survey including 10 questions on the “attitudes of surgeons to the use of postoperative markers of the systemic inflammatory response following elective surgery” was distributed via email. Two cohorts were approached to participate in the survey. Cohort 1 consisted of 1092 surgeons on the “Association of Coloproctology of Great Britain and Ireland (ACPGBI)” membership list. Cohort 2 consisted of 270 surgeons who had published in this field in the past as identified by two recent reviews. A reminder email was sent out 21 days after the initial email in both cases and the survey was closed after 42 days in both cases. Result: In total 29 surgeons (2.7%) from cohort 1 and 40 surgeons (14.8%) from cohort 2 responded to the survey. The majority of responders were from Europe (77%), were colorectal specialists (64%) and were consultants (84%) and worked in teaching hospitals (54%) and used minimally invasive techniques (87%). The majority of responders measured CRP routinely in the post-operative period (85%) and used CRP to guide their decision making (91%) and believed that CRP monitoring should be incorporated into postoperative guidelines (81%). Conclusion: Although there was a limited response the majority of surgeons surveyed measure the systemic inflammatory response following elective surgery and use CRP measurements together with clinical findings to guide postoperative care. The present results provide a baseline against which future surveys can be compared

    Generating Sequences of Clique-Symmetric Graphs via Eulerian Digraphs

    Get PDF
    Let {Gp1,Gp2, . . .} be an infinite sequence of graphs with Gpn having pn vertices. This sequence is called Kp-removable if Gp1 ≅ Kp, and Gpn − S ≅ Gp(n−1) for every n ≥ 2 and every vertex subset S of Gpn that induces a Kp. Each graph in such a sequence has a high degree of symmetry: every way of removing the vertices of any fixed number of disjoint Kp’s yields the same subgraph. Here we construct such sequences using componentwise Eulerian digraphs as generators. The case in which each Gpn is regular is also studied, where Cayley digraphs based on a finite group are used

    How and why systemic inflammation worsens quality of life in patients with advanced cancer

    Get PDF
    Introduction: The presence of an innate host systemic inflammatory response has been reported to be a negative prognostic factor in a wide group of solid tumour types in both the operable and advanced setting, both local and distant. In addition, this host systemic inflammatory response is associated with both clinician reported patient performance status and self-reported measures of quality of life in patients with cancer. Areas covered: A variety of mechanisms are thought to underlie this, including the influence of the host immune response on physical symptoms such as pain and fatigue, its effect on organ systems associated with physical ability and well being such as skeletal muscle, and bone marrow. Furthermore, this innate inflammatory response is thought to have a direct negative impact on mood through its action on the central nervous system. Expert commentary: It is clear that the host systemic inflammatory response represents a target for intervention in terms of both improving quality of life and prognosis in patients with advanced cancer. Based on this paradigm, future research should focus both on pathways which might be targeted by novel agents, but also on whether existing anti-inflammatory drugs might be of benefit

    Anomaly Graphs and Champions

    Get PDF

    Closed-Neighborhood Anti-Sperner Graphs

    Get PDF
    For a simple graph G let NG[u] denote the closed-neighborhood of vertex u ∈ V (G). Then G is closed-neighborhood anti-Sperner (CNAS) if for every u there is a v ∈ V (G)\{u} with NG [u] ⊆ NG [v] and a graph H is closed-neighborhood distinct (CND) if every closed-neighborhood is distinct, i.e., if NH[u] ≠ NH[v] when u ≠ v, for all u and v ∈ V (H). In this paper we are mainly concerned with constructing CNAS graphs. We construct a family of connected CNAS graphs with n vertices for each fixed n ≥ 2. We list all connected CNAS graphs with ≤ 6 vertices, and find the smallest connected CNAS graph that lies outside these families. We indicate how some CNAS graphs can be constructed from a related type of graph, called a NAS graph. Finally, we present an algorithm to construct all CNAS graphs on a fixed number of vertices from labelled CND graphs on fewer vertices

    Vertex-magic Labeling of Trees and Forests

    Get PDF
    A vertex-magic total labeling of a graph G(V,E) is a one-to-one map λ from E ∪ V onto the integers {1, 2, . . . , |E| + |V|} such that λ(x) + Σ λ(xy) where the sum is over all vertices y adjacent to x, is a constant, independent of the choice of vertex x. In this paper we examine the existence of vertex-magic total labelings of trees and forests. The situation is quite different from the conjectured behavior of edge-magic total labelings of these graphs. We pay special attention to the case of so-called galaxies, forests in which every component tree is a star

    Orthogonal Arrays of Strength Three from Regular 3-Wise Balanced Designs

    Get PDF
    The construction given in Kreher, J Combin Des 4 (1996) 67 is extended to obtain new infinite families of orthogonal arrays of strength 3. Regular 3-wise balanced designs play a central role in this construction
    corecore