Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

6

datasets available to search

ShareScore release 0.7.1

Reset

Dataset results

6 results for “continuous double auction”

Learn how ShareScore rates datasets ↗
zenodo40/100

BRAIN Journal-Intelligent Continuous Double Auction method For Service Allocation in Cloud Computing-Figure 6. Comparison on resource utilization.

<p>Figure 6 shows resource utilization in different system loads and as shown in it, in ICDA<br> resource utilization is more efficient than other methods especially in higher system load which is<br> due to tradeoff and sharing factors.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-Intelligent Continuous Double Auction method For Service Allocation in Cloud Computing-Figure 3. Sharing and merging effect on successful allocation

<p>Fig (3) shows the effect of merging and sharing resources by auctioneer in term of success<br> rate of allocation. As shown in it, these factors improve successful allocation rate especially in<br> higher system load.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-Intelligent Continuous Double Auction method For Service Allocation in Cloud Computing-Figure 2. bid value for time factor

<p>Each consumer is looking for utilizing its requested service with minimum price before its<br> deadline. To utilize a service all required resources should be allocated before deadline and<br> otherwise service failed to utilize and consumer must pay penalty to providers for all other<br> resources which is allocated to it. So Consumer should adjust its bid price rapidly to the acceptable<br> price of the market. Since consumers are generally sensitive to deadline in acquiring requested<br> service, it is intuitive to consider deadline time when formulating the bid price. Consumer agent<br> time dependent bid price formula is determined in.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-Intelligent Continuous Double Auction method For Service Allocation in Cloud Computing-Figure 5. Comparison on successful allocation

<p>Figure 5 illustrates comparison of successful allocation rate between ICDA and other<br> methods. In the proposed method, intelligent allocation and also time consideration enable<br> consumers to acquire more resources before the deadline and as a result, the number of successful<br> allocation is higher than other methods.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-Intelligent Continuous Double Auction method For Service Allocation in Cloud Computing-Figure 4. Sharing and tradeoff factor effect on resource utilization

<p>In Figure 4 we consider tradeoff and sharing factors in providers. The result illustrates that<br> by using these factors providers improve resource utilization. Higher resource utilization motivates<br> more providers to participate in the cloud and also enables the cloud market to handle more<br> consumers which influences market efficiency.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-Intelligent Continuous Double Auction method For Service Allocation in Cloud Computing-Figure 1. Resource allocation schema in proposed method

<p>We assume that the resources allocation satisfies the following conditions:<br> &bull; The quantity of a resource can be measured in arbitrary units (e.g. 60 units of resource<br> A).<br> &bull; A resource can be divided into an arbitrary fraction (e.g. a resource of 60 units is divided<br> into 20 units for consumer 1 and 40 units for consumer 2).<br> &bull; A resource request of a service can be divided into sub-requests and acquired from<br> multiple providers (e.g. a resource request of 40 units utilized as 10 units from provider<br> 1 and 30 units from provider 2).<br> Figure 1 shows a cloud computing environment with the proposed mechanism.</p>

opencc-by-4.0Oct 2013View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record