نتایج جستجو برای: quick

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

2004
Jing-Chao Chen

This means we cannot justify the correctness of the “Partition” subroutine by the Hoare’s axiom on program verification. This article is organized as follows. First, we present several fundamental properties of “while” program and finite sequence. Second, we define the “Partition” subroutine on SCMPDS, the task of which is to split a sequence into a smaller and a larger subsequence. The definit...

2016
Rachael Huntley

The Gene Ontology (GO [5]) is a dynamic controlled vocabulary [6] that details the biological processes, molecular functions and cellular components of a generic cell. The UniProt-Gene Ontology Annotation (UniProt-GOA [7]) project uses GO to describe proteins in UniProtKB [8]. The project has assigned GO terms to all complete and incomplete proteomes that exist in UniProtKB, using a combination...

Journal: :Current Biology 2001
Ignacio Arechaga Phil C. Jones

denotes the soluble catalytic headgroup where ATP synthesis and hydrolysis occur, and F o is the ion-translocating membrane domain (see Figure). What is it? An enzyme that uses energy from the transmembrane proton electrochemical gradient, generated by oxidative metabolism or photosynthesis, to produce ATP from ADP and P i. The enzyme can also act in reverse, hydrolysing ATP and pumping H + or ...

2017

Main library for Southern Illinois University Carbondale [2] Holds more than 2.6 million volumes, 200,000 e-books, 43,000 current periodicals and serials, and over 3.6 million microform units Provides access to I-Share [3] (the statewide automated library system) and to a comprehensive array of databases and other electronic data files Offers a wide range of services, including Reference assist...

2016
Emily Perry

Information such as gene sequence, splice variants and further annotation [3] can be retrieved at the genome, gene and protein level. This includes information on protein domains, genetic variation, homology, syntenic regions and regulatory elements. Coupled with analyses such as whole genome alignments and the effects of sequence variation on proteins, this powerful tool aims to describe a gen...

Journal: :نشریه مهندسی عمران و نقشه برداری 0
حبیب سامی دانشگاه تهران سیدمهدی زهرائی دانشگاه تهران

in this paper, acceptance criteria of steel building code, comprehensive and quick evaluation procedures for x-bracing, are compared to each other parametrically and numerically. for this purpose, it is assumed first that the sample building is designed to meet steel building code and then by introducing transform parameters and using stress ratio of the designed components, acceptance of the d...

1999
A. Keyton Weissinger

php in a nutshell a desktop quick reference sbzn php in a nutshell a desktop quick reference hsandc php in a nutshell a desktop quick reference rakf php in a nutshell a desktop quick reference khbd php in a nutshell a desktop quick reference ggda php in a nutshell a desktop quick reference amoso php in a nutshell: a desktop quick reference ebooks free php in a nutshell: a desktop quick referenc...

2018

Main library for Southern Illinois University Carbondale [2] Holds more than 2.6 million volumes, 200,000 e-books, 43,000 current periodicals and serials, and over 3.6 million microform units Provides access to I-Share [3] (the statewide automated library system) and to a comprehensive array of databases and other electronic data files Offers a wide range of services, including Reference assist...

2007
Nicola S. Clayton Lucie H. Salwiczek Anthony Dickinson

provide information ranging from the morphology and uses of plant species to the history of plant exploration and the European discovery of Africa. The RBG Kew has contributed historical material, including maps and papers from David Livingstone’s South East Africa Expedition Papers and over 2,000 sheets of Africa-related material from the Director’s Correspondence covering early botanical expl...

2008
Song Qin

Given an array with n elements, we want to rearrange them in ascending order. In this paper, we introduce Quick Sort, a divide-and-conquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity in best case and O(N) in worst case theoretically. We also introduce a way to approach the best case.

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

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