Background Primary Ewing＇s sarcoma/primitive neuroectodermal tumor （ES/PNET） of urogenital tract is a rare condition with non-specific clinical presentations, which can make it difficult to diagnose. In this study,...Background Primary Ewing＇s sarcoma/primitive neuroectodermal tumor （ES/PNET） of urogenital tract is a rare condition with non-specific clinical presentations, which can make it difficult to diagnose. In this study, we summarize the clinical presentation, pathological features, therapeutic strategies, and prognosis of ES/PNET.展开更多
In this paper, we introduce a new type of feedback shift register based on words, called G-linear feedback shift register （σ-LFSR） which can make full use of the instructions of modern CPUs so that we can find good...In this paper, we introduce a new type of feedback shift register based on words, called G-linear feedback shift register （σ-LFSR） which can make full use of the instructions of modern CPUs so that we can find good σ-LFSR with simple structure and fast software implementation. After analysis, we find a class of simple σ-LFSR with maximal period and give an algorithm of searching for those σ-LFSRs. As a result, we provide a new optional fast component in the design of modern wordbased stream ciphers.展开更多
文摘Background Primary Ewing＇s sarcoma/primitive neuroectodermal tumor （ES/PNET） of urogenital tract is a rare condition with non-specific clinical presentations, which can make it difficult to diagnose. In this study, we summarize the clinical presentation, pathological features, therapeutic strategies, and prognosis of ES/PNET.
基金the National Natural Science Foundation of China (Grant No. 60503011)the National High-Tech Research and Development Program of China (863 Program) (Grant No. 2006AA01Z425)the National Basic Research Program of China (973 Program) (Grant No. 2007CB807902)
文摘In this paper, we introduce a new type of feedback shift register based on words, called G-linear feedback shift register （σ-LFSR） which can make full use of the instructions of modern CPUs so that we can find good σ-LFSR with simple structure and fast software implementation. After analysis, we find a class of simple σ-LFSR with maximal period and give an algorithm of searching for those σ-LFSRs. As a result, we provide a new optional fast component in the design of modern wordbased stream ciphers.
