Scan? Cure? Sure!

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scan? Cure? Sure!

PRESENTATION OF THE CASE A 61-year-old man undergoes a sigmoid colectomy for a T3N1 (two of 18 nodes) adenocarcinoma of the sigmoid colon. He recovers well and receives 6 months of adjuvant FOLFOX (5-fluorouracil, leucovorin, and oxaliplatin) uneventfully. At his first follow-up visit, the oncologist recommended every 3 month visits for a physical, liver function tests, and carcinoembryonic ant...

متن کامل

SURE : Shizuoka University REpository

23 In the present study, two LCYb genes (CitLCYb1 and CitLCYb2) were 24 isolated from Satsuma mandarin (Citrus unshiu Marc.), Valencia orange (Citrus 25 sinensis Osbeck) and Lisbon lemon (Citrus limon Burm.f.) and their functions 26 were analyzed by the color complementation assay in lycopene-accumulating E. 27 coli cells. The results showed that CitLCYb1 and CitLCYb2 shared high identity 28 at...

متن کامل

On Time – For Sure

When a computer takes forever to load a website, it may be annoying, but it is nothing more serious than that. If, however, the electronics in a car or a plane don’t process commands exactly when they are supposed to, the consequences can be fatal. Björn Brandenburg and his team at the Max Planck Institute for Software Systems in Kaiserslautern and Saarbrücken study how to construct real-time s...

متن کامل

Almost Sure Productivity

We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we i...

متن کامل

Sure Success Partial Search

Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Oncologist

سال: 2011

ISSN: 1083-7159,1549-490X

DOI: 10.1634/theoncologist.2011-0014