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...

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...

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.

eukocytes have a better chance of sticking to neighboring cells with the right ligands if they rotate on their way by, based on results from Dwir et al. (page 649). Flowing leukocytes are captured via L-selectin interactions with carbohydrate ligands on vessel walls and subsets of other leukocytes. L-selectin is an unusual adhesive molecule—shear stress improves its adherance to ligands, wherea...

Sashka’s Technique applied to pFBP The key step in Sashka and Russel’s technique to prove lower bounds for pFBT was to prove that for each path p of length l, PrI [S(I) ⊢ PSp | I ⊢ PIp] ≤ 1 f . We extend this to a technique for pFBP. The key step is to prove that for each node v at depth l, PrI [S(I) ⊢ PSv | I ⊢ PIv] ≤ 1 f . My intuition was that PrI [S(I) ⊢ PSv | I ⊢ PIv] ≤ maxp∈v PrI [S(I) ⊢ ...

The BioSamples Database aggregates information for reference samples (such as cell lines or stock strains), as well as samples for which data exist in one of the EBI's other data resources (e.g. ArrayExpress [2], the European Nucleotide Archive [3], PRIDE [4]). Samples are described with a set of annotations. These annotations can be linked to ontology [5] (or controlled vocabulary [6]) terms, ...

In this paper, we present an improved version of recently proposed Quick Hypervolume algorithm for calculating exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used as a quality indicator in multiobjective evolutionary algorithms and other multiobjective metaheuristics and the efficiency of calculating this indicator is of crucial importance especia...

UniChem is a simple, large-scale, non-redundant database of pointers between chemical structure identifiers. Its purpose is to optimise the efficiency with which structure-based hyperlinks are built and maintained between chemistry databases. This is particularly suitable for creating links 'on the fly' by the use of REST web services. Primarily, this service has been designed to maintain cross...

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...

What is Europe PMC? Europe PMC [2] is a global, free, biomedical literature repository, providing access to worldwide life sciences articles, books, patents and clinical guidelines. The resource currently contains over 32 million abstracts and more than 4 million full-text articles (see Figure 1). A subset of the full-text information corpus is the open-access literature that can be downloaded ...