2,147 research outputs found

    Programmable telemetry system Patent

    Get PDF
    Time division multiplexed telemetry transmitting system controlled by programmed memor

    Impact of changing US cigarette smoking patterns on incident cancer: Risks of 20 smoking-related cancers among the women and men of the NIH-AARP cohort

    Get PDF
    Background: Historically, US women started smoking at a later age than men and had lower relative risks for smoking-related cancers. However, more recent birth cohorts of women and men have similar smoking histories and have now reached the high-risk age for cancer. The impact of these changes on cancer incidence has not been systematically examined. Methods: Relative risks (RR), 95% confidence intervals (CI) and attributable fractions were calculated for cigarette smoking and incidence of 20 smoking-related cancers in 186 057 women and 266 074 men of the National Institutes of Health-AARP cohort, aged 50 to 71 years in 1995 and followed for 11 years. Results: In the cohort, which included participants born between 1924 and 1945, most women and men started smoking as teenagers. RRs for current vs never smoking were similar in women and men for the following cancers: lung squamous-cell (RR women: 121.4, 95% CI: 57.3–257.4; RR men:114.6, 95% CI: 61.2–214.4), lung adenocarcinoma (RR women: 11.7, 95% CI: 9.8–14.0; RR men: 15.6, 95% CI: 12.5–19.6), laryngeal (RR women: 37.0, 95% CI: 14.9–92.3; RR men: 13.8, 95% CI: 9.3–20.2), oral cavity-pharyngeal (RR women:4.4, 95% CI: 3.3–6.0; RR men: 3.8, 95% CI: 3.0–4.7), oesophageal squamous cell (RR women: 7.3, 95% CI: 3.5–15.5; RR men: 6.2, 95% CI: 2.8–13.7), bladder (RR women: 4.7, 95% CI: 3.7–5.8; RR men: 4.0, 95% CI: 3.5–4.5), colon (RR women: 1.3, 95% CI: 1.2–1.5; RR men: 1.3, 95% CI: 1.1–1.4), and at other sites, with similar attributable fractions. Conclusions: RRs for current smoking and incidence of many smoking-related cancers are now similar in US women and men, likely reflecting converging smoking patterns

    Proliferative multifocal leukoplakia better name that proliferative verrucous leukoplakia

    Get PDF
    In this letter I propose the name "Proliferative Multifocal Leukoplakia" with the goal of reducing under-diagnosis of this disease, improve the early diagnosis, try to make an early therapy and control, and prevent its malignant transformation

    Delayed diagnosis of oral squamous cell carcinoma: a case series

    Get PDF
    <p>Abstract</p> <p>Introduction</p> <p>In malign neoplasms, oral cancer is one of the important causes of mortality and morbidity. Squamous cell carcinoma is the most common form of oral cancers in adults and is related to risk factors such as smoking and alcohol consumption.</p> <p>Case presentation</p> <p>In this article, we present three case reports of oral squamous cell carcinomas with delayed diagnosis. The first patient was a 52-year-old Turkish man, the second patient was a 61-year-old Turkish man and the third patient was a 60-year-old Turkish woman. All were referred to the Ankara University Faculty of Dentistry with pain, swelling and various complaints in their jaws.</p> <p>Conclusion</p> <p>Early diagnosis is of vital importance for the prognosis of the patients with oral squamous cell carcinomas. For this reason, dentists play a crucial role in the early detection and prevention of oral cancers.</p

    Quantum resource estimates for computing elliptic curve discrete logarithms

    Get PDF
    We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, implemented within the framework of the quantum computing software tool suite LIQUiUi|\rangle. We determine circuit implementations for reversible modular arithmetic, including modular addition, multiplication and inversion, as well as reversible elliptic curve point addition. We conclude that elliptic curve discrete logarithms on an elliptic curve defined over an nn-bit prime field can be computed on a quantum computer with at most 9n+2log2(n)+109n + 2\lceil\log_2(n)\rceil+10 qubits using a quantum circuit of at most 448n3log2(n)+4090n3448 n^3 \log_2(n) + 4090 n^3 Toffoli gates. We are able to classically simulate the Toffoli networks corresponding to the controlled elliptic curve point addition as the core piece of Shor's algorithm for the NIST standard curves P-192, P-224, P-256, P-384 and P-521. Our approach allows gate-level comparisons to recent resource estimates for Shor's factoring algorithm. The results also support estimates given earlier by Proos and Zalka and indicate that, for current parameters at comparable classical security levels, the number of qubits required to tackle elliptic curves is less than for attacking RSA, suggesting that indeed ECC is an easier target than RSA.Comment: 24 pages, 2 tables, 11 figures. v2: typos fixed and reference added. ASIACRYPT 201

    Correlation Effects in Nuclear Transparency

    Get PDF
    The Glauber approximation is used to calculate the contribution of nucleon correlations in high-energy A(e,eN)A(e,e'N) reactions. When the excitation energy of the residual nucleus is small, the increase of the nuclear transparency due to correlations between the struck nucleon and the other nucleons is mostly compensated by a decrease of the transparency due to the correlations between non detected nucleons. We derive Glauber model predictions for nuclear transparency for the differential cross section when nuclear shell level excitations are measured. The role of correlations in color transparency is briefly discussed.Comment: 24 pages revtex, 4 uuencoded PostScript Figures as separate fil

    Fast construction of irreducible polynomials over finite fields

    Get PDF
    International audienceWe present a randomized algorithm that on input a finite field KK with qq elements and a positive integer dd outputs a degree dd irreducible polynomial in K[x]K[x]. The running time is d1+o(1)×(logq)5+o(1)d^{1+o(1)} \times (\log q)^{5+o(1)} elementary operations. The o(1)o(1) in d1+o(1)d^{1+o(1)} is a function of dd that tends to zero when dd tends to infinity. And the o(1)o(1) in (logq)5+o(1)(\log q)^{5+o(1)} is a function of qq that tends to zero when qq tends to infinity. In particular, the complexity is quasi-linear in the degree dd

    Structure of the Afferent Terminals in Terminal Ganglion of a Cricket and Persistent Homology

    Get PDF
    We use topological data analysis to investigate the three dimensional spatial structure of the locus of afferent neuron terminals in crickets Acheta domesticus. Each afferent neuron innervates a filiform hair positioned on a cercus: a protruding appendage at the rear of the animal. The hairs transduce air motion to the neuron signal that is used by a cricket to respond to the environment. We stratify the hairs (and the corresponding afferent terminals) into classes depending on hair length, along with position. Our analysis uncovers significant structure in the relative position of these terminal classes and suggests the functional relevance of this structure. Our method is very robust to the presence of significant experimental and developmental noise. It can be used to analyze a wide range of other point cloud data sets

    Processing and Transmission of Information

    Get PDF
    Contains reports on seven research projects
    corecore