نتایج جستجو برای: corrected version
تعداد نتایج: 251744 فیلتر نتایج به سال:
We present a sufficient condition for groups to satisfy the FarrellJones Conjecture in algebraic K-theory and L-theory. The condition is formulated in terms of finite quotients of the group in question and is motivated by work of Farrell-Hsiang. This version is different from the published version. A number of typos and an incorrect formula for the transfer before Lemma 6.3 pointed out by Holge...
compared with sitagliptin for patients with type 2 diabetes who do not have adequate glycemic control with metformin plus sulfonylurea: a 52-week randomized trial. In the print version of the article listed above, the fasting plasma glucose (FPG) data in conventional units (mg/dL) are not correct in Fig. 2C. The FPG data in SI units are correct; therefore, the conclusions do not change. The cor...
The details for affiliation 1 were incorrect in the original HTML version of this Article. The affiliation was incorrectly listed as ‘‘Department of Neurology, Center for Neurological Diseases and Cancer, Nagoya University Graduate School of Medicine, Nagoya, Japan’’. The correct affiliation is listed above. This has now been corrected in the HTML version of the Article. SUBJECT AREAS: DEMENTIA...
This article was republished on February 3, 2015, to replace the missing Equation 5 in the online version and to correct errors in the legend of S1 Table in both the online and PDF versions. The publisher apologizes for the errors. The S1 Table legend has now been moved to within the file itself. Please download this article again to view the correct version. The originally published, uncorrect...
1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag syst...
The original version of this Article contained errors in the Supplementary Information files: Zircon U-Pb age results for sample 23, shown in Supplementary Fig. 3, are incorrect, and missing from Supplementary Data 1, while several identification labels relating to Yellow River Lanzhou terraces samples are missing from Supplementary Data 2. Supplementary Data 1 and 2 have now been updated to pr...
In the original version of this Article the authorM.Nakamura was incorrectly listed as having a current address of ‘‘National Institute for Basic Biology, Okazaki 444-8585, Japan’’. This is the current address for the author M. Nakamoto. This has been corrected in the HTML and PDF versions of this Article. In addition, the Supplementary Movies that accompany this study were omitted from the ori...
The index of a signed graph is the largest eigenvalue its adjacency matrix. For positive integers n and m ? 2 / 4 , we determine maximum complete graphs with vertices negative edges characterize achieving this maximum. This settles (the corrected version of) conjecture by Koledin Stani? (2017).
This text was originally published as an article in Semiotica 66-1/3 (1987), pp. 279-298. Copyright P Tagg (author, Liverpool) and Mouton de Gruyter (publishers, Amsterdam). This text is basically the same as that sent unedited to Mouton de Gruyter in 1986, except that bibliographical references have been corrected. Footnote numbers are not the same as in the Semiotica version. Starts of pages ...
1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag syst...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید