2,970 research outputs found

    QCD corrections to the R-parity violating processes ppˉ/pp→eμ+Xp\bar{p}/pp \to e\mu+X at hadron colliders

    Full text link
    We present the QCD corrections to the processes ppˉ/pp→eμ+Xp\bar{p}/pp \to e\mu+X at the Tevatron and the CERN large hadron collider(LHC). The numerical results show that variation of K factor is in the range between 1.28(1.32)1.28(1.32) and 1.79(1.58)1.79(1.58) at the Tevatron(LHC). We find that the QCD correction part from the one-loop gluon-gluon fusion subprocess is remarkable at the LHC and should be taken into account.Comment: 7 pages, 6 Postscript figures, to be appeared in Phy. Rev.

    Research Progress of Abnormal DNA Methylation in the Development, Diagnosis, and Treatment of Prostate Cancer

    Get PDF
    Prostate cancer (PCa) is one of the most common malignancy in men around the world. In recent years, studies have shown that the development of PCa is driven by epigenetic modifications to a great extent, mediated through abnormal DNA methylation. Aberrant methylation of DNA promoters leads to abnormal expression of genes that regulate the development and progression of PCa. In addition, the current diagnosis of PCa still relies on tissue invasiveness. Prostate biopsy is an invasive process whereas non-invasive liquid biopsy based measurement of abnormal DNA methylation is expected to become the future diagnostic method and may be established as a therapeutic target. This article reviews the progress on DNA methylation in the development, early diagnosis, prognosis, and treatment of PCa

    On Scalable Service Function Chaining with O(1) Flowtable Entries

    Get PDF
    The emergence of Network Function Virtualization (NFV) enables flexible and agile service function chaining in a Software Defined Network (SDN). While this virtualization technology efficiently offers customization capability, it however comes with a cost of consuming precious TCAM resources. Due to this, the number of service chains that an SDN can support is limited by the flowtable size of a switch. To break this limitation, this paper presents CRT-Chain, a service chain forwarding protocol that requires only constant flowtable entries, regardless of the number of service chain requests. The core of CRT-Chain is an encoding mechanism that leverages Chinese Remainder Theorem (CRT) to compress the forwarding information into small labels. A switch does not need to insert forwarding rules for every service chain request, but only needs to conduct very simple modular arithmetic to extract the forwarding rules directly from CRT-Chain's labels attached in the header. We further incorporate prime reuse and path segmentation in CRT-Chain to reduce the header size and, hence, save bandwidth consumption. Our evaluation results show that, when a chain consists of no more than 5 functions, CRT-Chain actually generates a header smaller than the legacy 32-bit header defined in IETF. By enabling prime reuse and segmentation, CRT-Chain further reduces the total signaling overhead to a level lower than the conventional scheme, showing that CRT-Chain not only enables scalable flowtable-free chaining but also improves network efficiency
    • …
    corecore