28 research outputs found

    The presenting symptom signatures of incident cancer: evidence from the English 2018 National Cancer Diagnosis Audit

    Get PDF
    BACKGROUND: Understanding relationships between presenting symptoms and subsequently diagnosed cancers can inform symptom awareness campaigns and investigation strategies. METHODS: We used English National Cancer Diagnosis Audit 2018 data for 55,122 newly diagnosed patients, and examined the relative frequency of presenting symptoms by cancer site, and of cancer sites by presenting symptom. RESULTS: Among 38 cancer sites (16 cancer groups), three classes were apparent: cancers with a dominant single presenting symptom (e.g. melanoma); cancers with diverse presenting symptoms (e.g. pancreatic); and cancers that are often asymptomatically detected (e.g. chronic lymphocytic leukaemia). Among 83 symptoms (13 symptom groups), two classes were apparent: symptoms chiefly relating to cancers of the same body system (e.g. certain respiratory symptoms mostly relating to respiratory cancers); and symptoms with a diverse cancer site case-mix (e.g. fatigue). The cancer site case-mix of certain symptoms varied by sex. CONCLUSION: We detailed associations between presenting symptoms and cancer sites in a large, representative population-based sample of cancer patients. The findings can guide choice of symptoms for inclusion in awareness campaigns, and diagnostic investigation strategies post-presentation when cancer is suspected. They can inform the updating of clinical practice recommendations for specialist referral encompassing a broader range of cancer sites per symptom

    DiSquawk

    Full text link

    JDMM

    Full text link

    JDMM

    Full text link
    As the number of cores continuously grows, processor designers are considering non coherent memories as more scalable and energy efficient alternatives to the current coherent ones. The Java Memory Model (JMM) requires that all cores can access the Java heap. It guarantees sequential consistency for data-race-free programs and no out-of-thin-air values for non data-race-free programs. To implement the Java Memory Model over non-cache-coherent and distributed architectures Java Virtual Machines (JVMs) are most likely to employ software caching. In this work, i) we provide a formalization of the Java Memory Model for non-cache-coherent and distributed memory architectures, ii) prove the adherence of our model with the Java Memory Model and iii) evaluate, regarding its compliance to the Java Memory Model, a state-of-the-art Java Virtual Machine implementation on a non-cache-coherent architecture.</jats:p

    Inference and Declaration of Independence in Task-Parallel Programs

    No full text
    Abstract. The inherent difficulty of thread-based shared-memory programming has recently motivated research in high-level, task-parallel programming models. Recent advances of Task-Parallel models add implicit synchronization, where the system automatically detects and satisfies data dependencies among spawned tasks. However, dynamic dependence analysis incurs significant runtime overheads, because the runtime must track task resources and use this information to schedule tasks while avoiding conflicts and races. We present SCOOP, a compiler that effectively integrates static and dynamic analysis in code generation. SCOOP combines context-sensitive points-to, controlflow, escape, and effect analyses to remove redundant dependence checks at runtime. Our static analysis can work in combination with existing dynamic analyses and task-parallel runtimes that use annotations to specify tasks and their memory footprints. We use our static dependence analysis to detect non-conflicting tasks and an existing dynamic analysis to handle the remaining dependencies. We evaluate the resulting hybrid dependence analysis on a set of task-parallel programs
    corecore