نتایج جستجو برای: doubling time

تعداد نتایج: 1900123  

2015
Cody Kinneer Gregory M. Kapfhammer Chris J. Wright Phil McMinn

Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worst-case time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algorithm, or f(n). This relationship is often expressed in the “big-Oh” notation, where f(n) is O(g(n)) means that the time increases by no more than on order of g(n). Since...

Journal: :Chemosphere 2016
Valentin Dupraz Nathalie Coquillé Dominique Ménard Rossana Sussarellu Larissa Haugarreau Sabine Stachowski-Haberkorn

A wild strain of Chaetoceros calcitrans and wild and diuron-resistant strains of Tetraselmis suecica, were exposed to the PSII inhibitor herbicides diuron and irgarol, individually and in mixtures. The effects of three concentrations of diuron and irgarol and four binary mixtures were evaluated on doubling time, relative reactive oxygen species and lipid content by flow cytometry, and on photos...

2012
Tiexiang Li Eric King-wah Chu Wen-Wei Lin

We consider the solution of large-scale discrete-time algebraic Riccati equations with numerically low-ranked solutions. The structure-preserving doubling algorithm will be adapted, with the iterates for A not explicitly computed but in the recursive form Ak = A 2 k−1 − D (1) k S −1 k [D (2) k ] >, where D (1) k and D (2) k are low-ranked with S −1 k being small in dimension. With n being the d...

Journal: :Chest 1974
W Weiss

The relationship between tumor volume doubling time and survival was studied in 28 patients with histologically confirmed bronchogenic carcinoma with the following characteristics: the cancers presented radiographically as circumscribed peripheral nodules first observed at a diameter of 0.6 to 1.4 cm, and follow-up was maintained until death or for at least 8.5 years from the time the tumor was...

2016
Shuko Koizumi Mitsuhiro Kida Hiroshi Yamauchi Kosuke Okuwaki Tomohisa Iwai Shiro Miyazawa Miyoko Takezawa Hiroshi Imaizumi Wasaburo Koizumi

AIM To evaluate the efficacy of doubling time (DT) of gastrointestinal submucosal tumors (GIST). METHODS From April 1987 through November 2012, a total of 323 patients were given a final histopathological diagnosis of GISTs on surgical resection or endoscopic ultrasound-guided fine-needle aspiration (EUS-FNA) in Kitasato University East Hospital or Kitasato University Hospital. We studied 53 ...

عبدانی پور, علیرضا, مجدی, آرزو, نوری زاده, علی,

Introduction: For many years, bone marrow mesenchymal stem cells (BMSCs) was the main source for tissue engineering, though within recent years adipose tissue-derived stem cells (ADSC) has obtained a special place in this regard, since it seems easier to isolate these cells with fewer complications to the patients. Therefore, the purpose of this study was to compare two main sources of stem cel...

Ali Shams-Ara, Leila Zahmatkesh, Parvin Salehinejad, Seyed Hassan Eftekhar-Vaghefi, Shahin Totonchi,

Background: Retinoic acid as one of the most important regulators for cell differentiation was examined in this study for differentiation of human umbilical mesenchymal cells (hUCM). Methods: After isolation, hUCM were evaluated for mesenchymal stem cell properties by flow cytometry and alkaline phosphatase assay. Also, doubling time of the cells and their differentiation potential into adipoge...

2015
Marwan Ghosn Alain Dagher Fadi El-Karak

We report a case of metastatic castration-resistant prostate cancer, who received prior treatment with docetaxel and was then given cabazitaxel as salvage therapy. The patient was monitored by prostate-specific antigen doubling time and prostate-specific antigen absolute value. The prostate-specific antigen doubling time was found to be a good response predictor in the patient.

Journal: :J. Computational Applied Mathematics 2013
Tie-xiang Li Eric King-Wah Chu Wen-Wei Lin Peter Chang-Yi Weng

We consider the solution of large-scale algebraic Riccati equations with numerically lowranked solutions. For the discrete-time case, the structure-preserving doubling algorithm has been adapted, with the iterates for A not explicitly computed but in the recursive form Ak = A 2 k−1 −D (1) k S −1 k [D (2) k ] >, with D (1) k and D (2) k being low-ranked and S −1 k being small in dimension. For t...

2008
Sunil Arya David M. Mount Antoine Vigneron Jian Xia

We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound ε > 0. The objective is to build a data structure so that given any query point q in the space, it is possible to efficiently determine a point of S whose distance from q is within a factor of (1 + ε) of the distance between q and...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید