33 research outputs found

    On Characterizing the Data Access Complexity of Programs

    Full text link
    Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no longer be a sufficient metric for comparing algorithms, and a fundamental characterization of data access complexity will be increasingly important. The problem of developing lower bounds for data access complexity has been modeled using the formalism of Hong & Kung's red/blue pebble game for computational directed acyclic graphs (CDAGs). However, previously developed approaches to lower bounds analysis for the red/blue pebble game are very limited in effectiveness when applied to CDAGs of real programs, with computations comprised of multiple sub-computations with differing DAG structure. We address this problem by developing an approach for effectively composing lower bounds based on graph decomposition. We also develop a static analysis algorithm to derive the asymptotic data-access lower bounds of programs, as a function of the problem size and cache size

    A multi-center, real-life experience on liquid biopsy practice for EGFR testing in non-small cell lung cancer (NSCLC) patients

    Get PDF
    Background: circulating tumor DNA (ctDNA) is a source of tumor genetic material for EGFR testing in NSCLC. Real-word data about liquid biopsy (LB) clinical practice are lacking. The aim of the study was to describe the LB practice for EGFR detection in North Eastern Italy. Methods: we conducted a multi-regional survey on ctDNA testing practices in lung cancer patients. Results: Median time from blood collection to plasma separation was 50 min (20\u2013120 min), median time from plasma extraction to ctDNA analysis was 24 h (30 min\u20135 days) and median turnaround time was 24 h (6 h\u20135 days). Four hundred and seventy five patients and 654 samples were tested. One hundred and ninety-two patients were tested at diagnosis, with 16% EGFR mutation rate. Among the 283 patients tested at disease progression, 35% were T790M+. Main differences in LB results between 2017 and 2018 were the number of LBs performed for each patient at disease progression (2.88 vs. 1.2, respectively) and the percentage of T790M+ patients (61% vs. 26%)

    Tight bounds for parallel paging and green paging

    No full text
    In the parallel paging problem, there are p processors that share a cache of size k. The goal is to partition the cache among the processors over time in order to minimize their average completion time. For this long-standing open problem, we give tight upper and lower bounds of \u398(log p) on the competitive ratio with O(1) resource augmentation. A key idea in both our algorithms and lower bounds is to relate the problem of parallel paging to the seemingly unrelated problem of green paging. In green paging, there is an energy-optimized processor that can temporarily turn off one or more of its cache banks (thereby reducing power consumption), so that the cache size varies between a maximum size k and a minimum size k/p. The goal is to minimize the total energy consumed by the computation, which is proportional to the integral of the cache size over time. We show that any efficient solution to green paging can be converted into an efficient solution to parallel paging, and that any lower bound for green paging can be converted into a lower bound for parallel paging, in both cases in a black-box fashion. We then show that, with O(1) resource augmentation, the optimal competitive ratio for deterministic online green paging is \u398(log p), which, in turn, implies the same bounds for deterministic online parallel paging

    On Characterizing the Data Access Complexity of Programs

    No full text

    Hyperforin down-regulates effector function of activated T lymphocytes and shows efficacy against Th1-triggered CNS inflammatory-demyelinating disease

    No full text
    Hyperforin (Hyp) is an active compound contained in the extract of Hypericum perforatum, well known for its antidepressant activity. However, Hyp has been found to possess several other biological properties, including inhibitory effects on tumor invasion, angiogenesis, and inflammation. In this paper, we show that treatment with Hyp inhibited IFN-gamma production, with down-regulation of T-box (T-bet; marker of Th1 gene expression) and up-regulation of GATA-3 (marker gene of Th2) on IL-2/PHA-activated T cells. In parallel, we showed a strong down-regulation of the chemokine receptor CXCR3 expression on activated T cells. The latter effect and the down-modulation of matrix metalloproteinase 9 expression may eventually lead to the inhibition of migratory capability and matrix traversal toward the chemoattractant CXCL10 by activated lymphocytes that we observed in vitro. The effect of Hyp was thus evaluated on an animal model of experimental allergic encephalomyelitis (EAE), a classic, Th1-mediated autoimmune disease of the CNS, and we observed that Hyp attenuates the severity of the disease symptoms significantly. Together, these properties qualify Hyp as a putative, therapeutic molecule for the treatment of autoimmune inflammatory disease sustained by Th1 cells, including EAE
    corecore