4,063 research outputs found

    Stored Value Cards: Should We Know the Holder

    Get PDF

    Improved parallel integer sorting without concurrent writing

    No full text
    We show that nn integers in the range 1 \twodots n can be stably sorted on an \linebreak EREW PRAM using \nolinebreak O(t)O(t) time \linebreak and O(n(lognloglogn+(logn)2/t))O(n(\sqrt{\log n\log\log n}+{{(\log n)^2}/t})) operations, for arbitrary given \linebreak tlognloglognt\ge\log n\log\log n, and on a CREW PRAM using %O(lognloglogn)O(\log n\log\log n) time and O(nlogn)O(n\sqrt{\log n}) O(t)O(t) time and O(n(logn+logn/2t/logn))O(n(\sqrt{\log n}+{{\log n}/{2^{{t/{\log n}}}}})) operations, for arbitrary given tlognt\ge\log n. In addition, we are able to sort nn arbitrary integers on a randomized CREW PRAM % using %O(lognloglogn)O(\log n\log\log n) time and O(nlogn)O(n\sqrt{\log n}) operations within the same resource bounds with high probability. In each case our algorithm is a factor of almost Θ(logn)\Theta(\sqrt{\log n}) closer to optimality than all previous algorithms for the stated problem in the stated model, and our third result matches the operation count of the best known sequential algorithm. We also show that nn integers in the range 1 \twodots m can be sorted in O((logn)2)O((\log n)^2) time with O(n)O(n) operations on an EREW PRAM using a nonstandard word length of O(lognloglognlogm)O(\log n \log\log n \log m) bits, thereby greatly improving the upper bound on the word length necessary to sort integers with a linear time-processor product, even sequentially. Our algorithms were inspired by, and in one case directly use, the fusion trees of Fredman and Willard

    Micro-specific design flow for tool-based microtechnologies

    Get PDF

    Piracy Risk and Measure Analysis

    Get PDF

    Adipose Tissue Distribution and Survival Among Women with Nonmetastatic Breast Cancer.

    Get PDF
    ObjectivePrevious studies of breast cancer survival have not considered specific depots of adipose tissue such as subcutaneous adipose tissue (SAT) and visceral adipose tissue (VAT).MethodsThis study assessed these relationships among 3,235 women with stage II and III breast cancer diagnosed between 2005 and 2013 at Kaiser Permanente Northern California and between 2000 and 2012 at Dana Farber Cancer Institute. SAT and VAT areas (in centimeters squared) were calculated from routine computed tomography scans within 6 (median: 1.2) months of diagnosis, covariates were collected from electronic health records, and vital status was assessed by death records. Hazard ratios (HRs) and 95% CIs were estimated using Cox regression.ResultsSAT and VAT ranged from 19.0 to 891 cm2 and from 0.484 to 454 cm2 , respectively. SAT was related to increased risk of death (127-cm2 increase; HR [95% CI]: 1.13 [1.02-1.26]), but no relationship was found with VAT (78.18-cm2 increase; HR [95% CI]: 1.02 [0.91-1.14]). An association with VAT was noted among women with stage II cancer (stage II: HR: 1.17 [95% CI: 0.99-1.39]; stage III: HR: 0.90 [95% CI: 0.76-1.07]; P interaction < 0.01). Joint increases in SAT and VAT were associated with mortality above either alone (simultaneous 1-SD increase: HR 1.19 [95% CI: 1.05-1.34]).ConclusionsSAT may be an underappreciated risk factor for breast cancer-related death

    Proposing a specification structure for complex products in model-based systems engineering (MBSE)

    Get PDF
    This research work presents a methodological support for the specification of complex products. This is achieved by developing a specification structure in a MBSE environment. The new method draws on success factors of complex product specification, principles of MBSE and the explanatory model of PGE – Product Generation Engineering. For evaluation, the method is applied within a student development project. A high applicability and the realization of novel synergies for coping with continuously increasing product complexity is demonstrated
    corecore