An official website of the United States government
Paleobiology Database User Guide Version 1.0
The Paleobiology Database is an online, non-governmental, non-profit public resource for paleontological data. It is organized and operated by a multi-disciplinary, multi-institutional, international group of paleobiological researchers. This volume is designed to be a comprehensive guide for Pa-leobiology Database users, both General and Contributory. It covers most database uses from data retrieval and mapping to data contribution of all types. It contains numerous examples to illustrate database use as well as definitions of terms and additional links to numerous other sources. We hope that this user guide will help all users access the great volume of data in the Paleobiology Database and lead others to start and continue to add data to the system.
more »
« less
- Award ID(s):
- 1948831
- PAR ID:
- 10515068
- Publisher / Repository:
- University of California
- Date Published:
- Journal Name:
- PaleoBios
- Volume:
- 40
- Issue:
- 11
- ISSN:
- 0031-0298
- Subject(s) / Keyword(s):
- paleontology paleobiology database
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract For over 50 years, cores recovered from ocean basins have generated fossil, lithologic, and chemical archives that have revolutionized fields within the earth sciences. Although scientific ocean drilling (SOD) data are openly available following each expedition, the formats for these data are heterogeneous. Furthermore, lithological, chronological, and paleobiological data are typically separated into different repositories, limiting researchers' abilities to discover and analyze integrated SOD data sets. Emphasis within Earth Sciences on Findable, Accessible, Interoperable, and Reusable (FAIR) Data Principles and the establishment of community‐led databases provide a pathway to unite SOD data and further harness the scientific potential of the investments made in offshore drilling. Here, we describe a workflow for compiling, cleaning, and standardizing key SOD records, and importing them into the Paleobiology Database and Macrostrat, systems with versatile, open data distribution mechanisms. These efforts are being carried out by the extending Ocean Drilling Pursuits (eODP) project. eODP has processed all of the lithological, chronological, and paleobiological data from one SOD repository, along with numerous other data sets that were never deposited in a database; these were manually transcribed from original reports. This compiled data set contains over 79,899 lithological units from 1,125 drilling holes from 422 sites. Over 26,000 fossil‐bearing samples, with 5,378 taxonomic entries from 13 biological groups, are placed within this lithologic spatiotemporal framework. All information is available via GitHub and Macrostrat's application programming interface, which renders data retrievable by a variety of parameters, including age, site, and lithology.more » « less
-
We show that it is possible to achieve information theoretic location privacy for secondary users (SUs) in database-driven cognitive radio networks (CRNs) with an end-to-end delay less than a second, which is significantly better than that of the existing alternatives offering only a computational privacy. This is achieved based on a keen observation that, by the requirement of Federal Communications Commission (FCC), all certified spectrum databases synchronize their records. Hence, the same copy of spectrum database is available through multiple (distinct) providers. We harness the synergy between multi-server private information retrieval (PIR) and database-driven CRN architecture to offer an optimal level of privacy with high efficiency by exploiting this observation. We demonstrated, analytically and experimentally with deployments on actual cloud systems that, our adaptations of multi-server PIR outperform that of the (currently) fastest single-server PIR by a magnitude of times with information-theoretic security, collusion resiliency, and fault-tolerance features. Our analysis indicates that multi-server PIR is an ideal cryptographic tool to provide location privacy in database-driven CRNs, in which the requirement of replicated databases is a natural part of the system architecture, and therefore SUs can enjoy all advantages of multi-server PIR without any additional architectural and deployment costs.more » « less
-
Embedded database libraries provide developers with a com- mon and convenient data persistence layer. They have spread to many systems, including interactive devices like smart- phones, appearing in all major mobile systems. Their perfor- mance affects the response times and resource consumption of millions of phone apps and billions of phone users. It is thus critical that we better understand how they work, so they can be used more efficiently, and so developers can make faster libraries. Mobile databases differ significantly from server-class storage in terms of platform, usage, and measurement. Phones are multi-tenant, end-user devices that the database must share with other apps. Contrary to traditional database design goals, workloads on phones are single-app, bursty, and rarely saturate the CPU. We argue that mobile storage design should refocus on what matters on the mobile platform: latency and energy. As accurate per- formance measurement tools are necessary to evaluation of good database design, this uncovers another issue: Tradi- tional database benchmarking methods produce misleading results when applied to mobile devices, due to evaluating performance at saturation. Development of databases and measurements specifically designed for the mobile platform is necessary to optimize user experience of the most common database usage in the world.more » « less
-
Optimal surface segmentation is a state-of-the-art method used for segmentation of multiple globally optimal surfaces in volumetric datasets. The method is widely used in numerous medical image segmentation applications. However, nodes in the graph based optimal surface segmentation method typically encode uniformly distributed orthogonal voxels of the volume. Thus the segmentation cannot attain an accuracy greater than a single unit voxel, i.e. the distance between two adjoining nodes in graph space. Segmentation accuracy higher than a unit voxel is achievable by exploiting partial volume information in the voxels which shall result in non-equidistant spacing between adjoining graph nodes. This paper reports a generalized graph based multiple surface segmentation method with convex priors which can optimally segment the target surfaces in an irregularly sampled space. The proposed method allows non-equidistant spacing between the adjoining graph nodes to achieve subvoxel segmentation accuracy by utilizing the partial volume information in the voxels. The partial volume information in the voxels is exploited by computing a displacement field from the original volume data to identify the subvoxel-accurate centers within each voxel resulting in non-equidistant spacing between the adjoining graph nodes. The smoothness of each surface modeled as a convex constraint governs the connectivity and regularity of the surface. We employ an edge-based graph representation to incorporate the necessary constraints and the globally optimal solution is obtained by computing a minimum s-t cut. The proposed method was validated on 10 intravascular multi-frame ultrasound image datasets for subvoxel segmentation accuracy. In all cases, the approach yielded highly accurate results. Our approach can be readily extended to higher-dimensional segmentations.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.5070/P9401160531
