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.

275

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

275 results for “Data storage”

Learn how ShareScore rates datasets ↗
zenodo52/100

The Southern Ocean carbon cycle 1985-2018: Mean, seasonal cycle, trends and storage - Data

<p>Postprocessed data set used for RECCAP2 Southern Ocean chapter:</p><p>Hauck, Gregor, et al.: The Southern Ocean carbon cycle 1985-2018: Mean, seasonal cycle, trends and storage</p><p>The raw data is available at: Müller, Jens Daniel. (2023). RECCAP2-ocean data collection [Data set]. Zenodo. https://doi.org/10.5281/zenodo.7990823</p><p>Scripts for plotting are available at https://github.com/RECCAP2-ocean/Southern-Ocean and a frozen version of the scripts is deposited at:</p><p>Judith Hauck, Luke Gregor, Cara Nissen, Lavinia Patara, Mark Hague, &amp; Precious Mongwe. (2023). The Southern Ocean carbon cycle 1985-2018: Mean, seasonal cycle, trends and storage - Scripts. Zenodo. https://doi.org/10.5281/zenodo.10076121</p><p>&nbsp;</p>

opencc-by-4.0Sep 2023View details →
zenodo48/100

IPBES Data Management Tutorials - Session 3.7: Data management report details: Long-term storage details

<p>The&nbsp;<em>IPBES data management tutorials</em>&nbsp;are short videos to help experts implement the IPBES data management Policy. They cover topics ranging from data management policy, reports, active research data, tools, and examples.</p> <p>The&nbsp;<em>IPBES data management reports </em>chapter&nbsp;provides an overview and discussion of specific elements of IPBES data management reports.</p> <p>This session,&nbsp;<em>Data management report details: Long-term storage details</em>, explores the reasons why IPBES recommends Zenodo as a long-term repository.&nbsp;</p>

opencc-by-4.0Nov 2020View details →
zenodo48/100

Selected data(s) from : Five-dimensional optical data storage based on ellipse orientation and fluorescence intensity in a silver-sensitized commercial glass

<p>The data selected is based on the figures below, published in the linked article (see the doi).</p> <p>- <strong>Figure 1.</strong> (<strong>a</strong>) Femtosecond laser tight focusing in the silver-containing glass, leading to the production of fluorescent silver clusters at its periphery. (<strong>b</strong>) SLM holographic phase masks with an additional cylindrical profile leading to an elliptical pattern by DLW. (<strong>c</strong>) Oriented elliptical patterns obtained by SLM phase mask manipulation, corresponding to 2<sup>4</sup> = 16 orientation-encoded levels. <strong>(Only picture)</strong></p> <p>- <strong>Figure 2.</strong> Fabricated fluorescence calibration matrix. (<strong>a</strong>) Confocal image of all basic storage units composed by 16 intensity levels and 16 orientation levels. (<strong>b</strong>) Measured fluorescence intensity versus incident DLW intensity for the 5D decoding process. <strong>(Pictures, opj file, csv datas)</strong></p> <p><strong>- </strong> <strong>Figure 3.</strong> (<strong>a</strong>,<strong>b</strong>) are the encoded images of two Nobel laureates in 16 orientation levels and 16 intensity levels, respectively. (<strong>c</strong>) 100 &times; 100 entangled patterns among 16 &times; 16 intensity and orientation levels. (<strong>d</strong>) The fluorescence calibration matrix was fabricated for decoding (fluorescence excitation at 405 nm). <strong>(Pictures, cvs datas)</strong></p> <ol> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3_2020-10-21_V01 : Figure 3</li> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3a_2020-10-21_V01 : Original image oritentation</li> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3b_2020-10-21_V01 : Original image intensity</li> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3c_Figure3d_2020-10-21_V01 : DLW image</li> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3_datas_IICT4BF_2020-10-21_V01 : Intensity image converted to 4 bit format</li> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3_datas_OICT4BF_T2020-10-21_V01 : Orientation image converted to 4 bit format</li> <li>ANR_ ARCHIFLUO_ICMCB_Article_Micromachines_Figure3_datas_OICT4BFL_2020-10-21_V01 : Orientation image converted to 4 bit format level</li> </ol> <p><strong>- Figure 4.</strong> (<strong>a</strong>,<strong>b</strong>) Retrieved images from the initial images of Figure 3a,b, respectively. (<strong>c</strong>,<strong>d</strong>) Histograms of the level difference between original and decoded levels for the orientation direction and the fluorescence intensity, respectively. (<strong>Picture and csv datas</strong>)</p> <p>- <strong>Figure 5.</strong> (<strong>a</strong>) Confocal top-view image of one single elliptically-shaped storage unit fabricated by using type A DLW. (<strong>b</strong>) Fluorescence intensity profile along the horizontal and vertical cross section at focal plane. (<strong>c</strong>) Fluorescence intensity profile and Gaussian fitting along the z-axis (depth). (<strong>Picture, opj file, csv datas</strong>)</p> <p>&nbsp;</p> <p>&nbsp;</p>

opencc-by-4.0May 2022View details →
edi48/100

Factors Influencing Aboveground Carbon Storage in Mixed Oak-Pine Forests: USDA FIA Data from Southeastern U.S. (2009-2019)

This study explores factors affecting aboveground carbon (AGC) storage in mixed oak-pine forests across the Southeastern United States. Utilizing USDA Forest Inventory and Analysis (FIA) data from 2009 to 2019, the research spans nine states: Alabama, Mississippi, Florida, Georgia, North Carolina, South Carolina, Texas, Louisiana, and Virginia. Data processing in R included converting units to the metric system and calculating structural diversity using Shannon diversity indices. Climate data from the PRISM Climate Group were integrated with FIA data using longitude and latitude. The research aims to uncover how various factors influence AGC storage and contribute to informed forest management practices.

openCC (other)Sep 2024View details →
edi48/100

Organic and inorganic data for soil cores from Brazil and Florida Bay seagrasses to support Howard et al 2018, CO2 released by carbonate sediment production in some coastal areas may offset the benefits of seagrass “Blue Carbon” storage, Limnology and Oceanography, DOI: 10.1002/lno.10621

Using piston corers, soils from Florida Bay and Brazilian seagrass meadows were collected to complete organic and inorganic carbon inventories for the top 1 m of soil. Instrumental analyses and loss on ignition at 500C were used to measure C content of downcore slices.

openCC0Feb 2020View details →
zenodo44/100

Storage enhanced nonlinearities in a cold atomic Rydberg ensemble: experimental data

<p>The data show number of input/output photons under different conditions when coherent pulses of light undergo electromagnetically induced transparency (EIT) in a cold cloud of Rubidium 87 atoms via a ladder system connecting the ground state of 87-Rubidium and different Rydberg levels via (see more details in Distante et al. Phys. Rev. Lett. <strong>117</strong>, 113001 (2016)  or in the preprint https://arxiv.org/abs/1605.07478)</p> <p>This is the pre-analysed data from which the results in the paper are derived.</p> <p> </p> <ul> <li>The ODS file contains different sheets which correspond to Rydberg states with different principal quantum numbers</li> <li>The PDF contains useful information regarding the conditions of the experiment under which the data was obtained, such as the optical depth (OD) of the cloud, its dimensions, and the Rabi frequency of the coupling beam.</li> </ul>

opencc-by-4.0May 2016View details →
zenodo44/100

Data and Results of eELib Simulations for the User-Based Multi-Use of Battery Storage Systems

<p>The dataset contains the configuration for the eElib models (model_data.json) and computed simulation results (.hdf5-files). The following scenarios were computed:</p> <ul> <li>ave_A_static-eq</li> <li>ave_A_static</li> <li>ave_A_dynamic_charging</li> <li>ave_A_fully_dynamic</li> <li>ave_B_static-eq_bss</li> <li>ave_B_static_bss</li> <li>ave_B_dynamic_charging_bss</li> <li>ave_B_fully_dynamic_bss</li> <li>MELANI_static</li> <li>MELANI_static_equal</li> <li>MELANI_dynamic_charging</li> <li>MELANI_fully_dynamic</li> </ul> <p><strong>Description of syntax of simulation results:</strong></p> <ul> <li>average (ave_B is half the size of the BSS of ave_A) and MELANI describe the considered multi-family house</li> <li>static/ static / dynamic_charging / fully_dynamic are the three developed operating strategies for the user-based multi-use</li> <li>static-equal: the allocation keys are equally, i.e., the PVS and BSS capabilities are equally distributed among the households of the multi-family house</li> </ul> <div> <div><strong>As part of the publication:</strong></div> <div>Henrik Wagner, Constantin von L&uuml;tzow, Marcel L&uuml;decke, Michel Meinert, Bernd Engel "Empowering Collective Self-Consumption in Multi-Family Houses: User-Based Multi-Use of Residential Battery Storage Systems", 23rd Wind &amp; Solar Integration Workshop 2024, Helsinki, Finland, doi: 10.1049/icp.2024.3901</div> <div>&nbsp;</div> <div><strong>Changelog:</strong></div> <div>v2: Added doi for WIW 2024 conference paper to improve citation possibilities</div> </div>

opencc-by-4.0Oct 2024View details →
zenodo44/100

Data for: Multi-year field measurements of home storage systems and their use in capacity estimation

<p>The dataset accompanies the Nature Energy publication by Figgener et al. (2024), Multi-year field measurements of home storage systems and their use in capacity estimation, <a href="https://doi.org/10.1038/s41560-024-01620-9">DOI 10.1038/s41560-024-01620-9</a>.&nbsp;<br><br>In addition, we use the dataset in Figgener et al. (2024), Degradation mode estimation using reconstructed open circuit voltage curves from multi-year home storage field data, <a href="https://doi.org/10.48550/arXiv.2411.08025">DOI 10.48550/arXiv.2411.08025</a></p> <p>The ISEA / CARL of RWTH Aachen University measured 21 private home storage systems in Germany over up to eight years from 2015 to 2022. All these storage systems are combined with residential photovoltaic systems to increase self-consumption. The measured quantities published are system-level battery current, voltage, power, battery pack housing temperature, and room temperature. The sample rate is one second. The dataset consists of 106 system years, 14 billion data points, and 1,270 monthly files stored in 21 system folders.&nbsp;</p> <p>Use the data as follows:<br><br>1. Download the data (Data_ID_01.zip to Data_ID_21.zip) and the belonging repository (Metadata_and_Code.zip)</p> <p>2. Uncompress the files so that the uncompressed folders have the same name as the .zip files.</p> <p>3. Copy all data folders in folder "Metadata_and_Code/00_Data/01_Operational_Data". Read and execute the file "StartUp_Read_and_Execute.m" and stay in this folder for any script you execute.&nbsp;</p> <p>In addition, a detailed description of the dataset and how to use it can be found in the supplementary information of the publication.</p>

opencc-by-4.0Aug 2024View details →
zenodo44/100

Data from: Microplastic and organic carbon storage in sediments of intertidal and subtidal seagrass meadows

<p>This datasets support the scientific article (submitted) " Microplastic and organic carbon storage in sediments of intertidal and subtidal seagrass meadows." It contains detailed data on sedimentary organic carbon content and the abundance of microplastics in both intertidal and subtidal seagrass meadows within the Ria Formosa lagoon (Southern Portugal). The datasets are accompanied by analysis code, available at GitHub repository, allowing for reproducibility and further exploration of the data.</p> <p>The data is composed by 4 datasets with the following variables:</p> <p><strong>data_cores.csv. </strong>Contains properties related to the sampling of the sediment cores.</p> <ul> <li>core_id [character] - unique core identification code used in the field.</li> <li>core_id_new [character] - unique core identification code used in the article.</li> <li>species [character] - species of the seagrass meadow.</li> <li>replicate [character] - replicate number of the core in each seagrass meadow.</li> <li>core_depth [numeric] - depth sampled with the core (in centimeters).</li> <li>sample_length [numeric] - length of the sampled core measured in the laboratory (in centimeters).</li> <li>compaction_factor [numeric] - fraction of the sample depth interval reduced due to compaction. It is calculated by dividing the core length by the core depth.</li> <li>compaction_perc [numeric] - core compaction in percentage (%). It is calculated as 100*(1 - compaction_factor).</li> </ul> <p><br><strong>data_samples.csv. </strong>Contains properties of the sediment samples.</p> <ul> <li>core_id [character] - unique core identification code used in the field.</li> <li>sample_id [character] - unique sample identification code (obtained by concatenating the core id and the minimum non-corrected depth of the sample).</li> <li>depth_middle [numeric] - middle depth of a sampling increment, calculating as the average of depth_min and depth_max (in centimeters).</li> <li>depth_min [numeric] - minimum depth of a sampling increment, corrected for compaction (in centimeters).</li> <li>depth_max [numeric] - maximum depth of a sampling increment, corrected for compaction (in centimeters).</li> <li>sample_volume [numeric] - volume of the sediment sample, corrected for compaction (in cubic centimeters).</li> <li>sample_dw [numeric] - dry mass of the sample (in grams of dry weight).</li> <li>percentage_organic_matter [numeric] - mass of organic matter relative to sample dry mass, obtained by loss-on-ignition (in percentage of dry weight).</li> <li>percentage_organic_carbon [numeric] - mass of organic carbon relative to sample dry mass, obtained by a local organic carbon to organic carbon ratio (as a percentage of dry weight).</li> <li>bag_id [character] - identification code for the aluminium envelope containing the sample.</li> <li>weight_sample_mp [numeric] - dry mass of the sample used for the microplastic extraction (in grams of dry weight).</li> <li>dry_bulk_density [numeric] - dry mass per unit volume of the sample. This is calculated as the sample_dw divided by the sample_dw (in grams of dry weight per cubic centimeter).&nbsp;</li> </ul> <p><br><strong>data_particles_visual.csv. </strong>Contains properties of the suspected microplastic particles found in the sediment samples and the negative controls, based on visual inspection.</p> <ul> <li>core_id [character] - unique core identification code used in the field.</li> <li>core_id_new [character] - unique core identification code used in the article.</li> <li>species [character] - species of the seagrass meadow.</li> <li>habitat_label [character] - text for labelling purposes regarding the habitat.</li> <li>type [factor] - whether the particle comes from a sediment sample ("sediment") or a control sample ("control").&nbsp;</li> <li>cycle [character] - cycle in which samples were analysed.</li> <li>sample_id [character] - unique sample identification code (obtained by concatenating the core id and the minimum non-corrected depth of the sample).</li> <li>bag_id [character] - identification code for the aluminium envelope containing the sample.</li> <li>filter_id [character] - identification code of the filter used for the particle extraction.</li> <li>filter_area [numeric] - area of the filter that was screened for microplastics (in fraction of total).</li> <li>visual_id [character] - unique particle identification code based on visual identification.</li> <li>colour [factor] - particle colour category: black_grey, blue_green, brown_tan, opaque, orange_pink_red, transparent, white_cream, yellow.</li> <li>shape [factor] - particle shape category: film, foam, fragment, line, pellet.</li> <li>major [numeric] - longest dimension of the particle, analysed in ImageJ (in micrometers).</li> <li>minor [numeric] - Longest dimension perpendicular to major, analysed in ImageJ (in micrometers).</li> </ul> <p><br><strong>data_particles_ftir.csv. </strong>Contains properties of the suspected microplastic particles found in the sediment samples and the negative controls, based on the FTIR analysis.</p> <ul> <li>species [character] - species of the seagrass meadow.</li> <li>habitat_label [character] - text for labelling purposes regarding the habitat.</li> <li>core_id [character] - unique core identification code used in the field.</li> <li>core_id_new [character] - unique core identification code used in the article.</li> <li>filter_id [character] - identification code of the filter used for the particle extraction.</li> <li>filter_area [numeric] - area of the filter that was screened for microplastics (in fraction of total).</li> <li>cycle [character] - cycle in which samples were analysed.</li> <li>type [factor] - whether the particle comes from a sediment sample ("sediment") or a control sample ("control").&nbsp;</li> <li>sample_id [character] - unique sample identification code (obtained by concatenating the core id and the minimum non-corrected depth of the sample).</li> <li>num_ftir [numeric] - numerical order in which particles were identified within a filter.</li> <li>colour [factor] - particle colour category: black_grey, blue_green, brown_tan, opaque, orange_pink_red, transparent, white_cream, yellow.</li> <li>shape [factor] - particle shape category: film, foam, fragment, line, pellet.</li> <li>ref_analysis [boolean] - whether the reflection analysis was preformed or not.</li> <li>atr_analysis [boolean] - whether the ATR analysis was preformed or not.</li> <li>ftir_match_ref [character] - name of the polymer with the highest match found using &micro;FTIR for reflection analysis.</li> <li>match_ref [numeric] - percentage of match corresponding to highest match for reflection analysis.</li> <li>ftir_match_atr [character] - name of the polymer with the highest match found using &micro;FTIR for ATR analysis.</li> <li>match_atr [numeric] - percentage of match corresponding to highest match for ATR analysis.</li> <li>plastic_ref [boolean] - whether the particle is classified as having a plastic composition or not, based on the reflection analysis.</li> <li>polymer_group_ref [factor] - polymer group based on the reflection analysis: Non-plastic, Nylon-polyamides, Poluacrylamides, Polyacrylates, Polyesters, Polyethylene, Polyglycols, Polyhaloolefins, Polymethylmethacrylate, Polypropylene, Polystyrene, Polyurethane, Polyvinylalcohol, Silicones, Others.</li> <li>plastic_atr [boolean] - whether the particle is classified as having a plastic composition or not, based on the ATR analysis.</li> <li>polymer_group_atr [factor] - polymer group based on the ATR analysis: Non-plastic, Nylon-polyamides, Poluacrylamides, Polyacrylates, Polyesters, Polyethylene, Polyglycols, Polyhaloolefins, Polymethylmethacrylate, Polypropylene, Polystyrene, Polyurethane, Polyvinylalcohol, Silicones, Others.</li> <li>ftir_match_final [character] - final decision on the polymer composition, including the option "unclear".</li> <li>plastic_final [factor] - whether the particle is classified as having a plastic composition or not, based on final decision "ftir_match_final", includes categories: yes, no, unclear.</li> <li>final_analysis [character] - the analysis performed and used for the final decision, includes categories: ref (reflection analysis), atr (ATR analysis), both-but-atr-more-conclusive, both-but-ref-more-conclusive, both-unclear.</li> <li>polymer_group_final [character] - polymer group based final decision: Non-plastic, Nylon-polyamides, Poluacrylamides, Polyacrylates, Polyesters, Polyethylene, Polyglycols, Polyhaloolefins, Polymethylmethacrylate, Polypropylene, Polystyrene, Polyurethane, Polyvinylalcohol, Silicones, Others.</li> </ul>

opencc-by-4.0Sep 2024View details →
zenodo44/100

Data supplement for "Global agricultural trade and land system sustainability: implications for ecosystem carbon storage, biodiversity and human nutrition"

<p>This data supplements the publication &quot;Global agricultural trade and land system sustainability: implications for ecosystem carbon storage, biodiversity and human nutrition&quot; by Thomas Kastner, Abhishek Chaudhary, Simone Gingrich, Alexandra Marques, U. Martin Persson, Giorgio Bidoglio, Ga&euml;tane Le Provost, Florian Schwarzm&uuml;ller, available here:</p> <p><a href="https://doi.org/10.1016/j.oneear.2021.09.006">https://doi.org/10.1016/j.oneear.2021.09.006</a></p> <p>For details, please refer to that publication.</p>

opencc-by-4.0Sep 2021View details →
zenodo44/100

Dataset of 20 energy prosumers with flexibility data, distributed generation and energy storage

<p>The dataset has 20 prosumers, each with three&nbsp;appliances to provide flexibility for DR events, two PV generation resources, and an energy storage system.&nbsp;The values represent a day using 15 minutes reading periods. All the values are expressed in W, and the matrixes were created as [&nbsp;time_period x info].</p> <p>&nbsp;</p> <p>We would be grateful if you could acknowledge the use of this dataset in your publications. Please use the Zenodo publication to cite this work.</p>

opencc-by-4.0Nov 2022View details →
zenodo44/100

Supplementary Data for Low-loss stable storage of 1.2 Angstrom X-ray pulses in a 14 m Bragg cavity

<p>Supplementary Data for Margraf, R. et al. &quot;Low-loss stable storage of 1.2 Angstrom&nbsp;X-ray pulses in a 14 m Bragg cavity,&quot; Nature Photonics, 2023.</p>

opencc-by-4.0Jul 2023View details →
zenodo44/100

Data of the INFORMS Journal on Computing paper: Routing replenishment workers: The prize collecting traveling salesman problem in scattered storage warehouses

<p>In what follows, you will find data of the paper:<br> &quot;Routing replenishment workers: The prize collecting traveling salesman problem in scattered storage warehouses&quot; published in INFORMS Journal on Computing</p> <p>List of files:<br> - Computational_results_BB_NN_RW_CPLEX.xlsx: Excel file that gives all results<br> - instance_gen.cc: Instance generator<br> - instances.zip: compressed file of all instances that are sorted by Sections. It additionally includes the generator<br> - Makefile: Makefile for compiling/debugging, i.e., &quot;make all&quot; or &quot;make debug&quot; do the jobs<br> - MersenneTwister.h: needed by schedule_finder.cc<br> - results_Section_5_1.zip: compressed file of all output files of Section 5.1<br> - results_Section_5_2.zip: compressed file of all output files of Section 5.2<br> - results_Section_5_3.zip: compressed file of all output files of Section 5.3<br> - schedule_finder.cc: Main program containing the B&amp;B, the S-shape, and Nearest Neighbor procedure (see details for customizing the parameters at the top of this file)<br> - valgrind_debug.txt: Only contains the used debug command</p> <p>instances/instance_gen.cc generates a problem instance in file problems.txt<br> The structure of the these problem files is the following:<br> /*<br> NE&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Total number of experiments given by the currently considered file<br> -2&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Separator<br> EXPGRP&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Index of the current experiment group the current experiment belong to<br> N&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Number of vacant positions in the warehouse<br> M&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Number of requests to be stored by the tour<br> P&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Number of pickers to be scheduled in the warehouse<br> A&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Number of vertical aisles<br> B&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Number of horizontal (cross) aisles<br> L_A&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Length of each vertical aisle<br> L_B&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Length of each cross aisle<br> UF_VA&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Up-factor of each vertical aisle (A values)<br> DF_VA&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Down- factor of each vertical aisle (A values)<br> UF_CA&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Up-factor of each cross aisle (B values)<br> DF_CA&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Down- factor of each cross aisle (B values)<br> x_pos_vertical_aisle&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; x-position of vertical aisle (A values)<br> y_pos_cross_aisle&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; y-position of cross aisle (B values)<br> warehouse_graph values&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For each node of the warehouse graph all entries (15 each) are given (total_number_of_warehouse_graph_nodes*15)<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].free_position &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].depot_node &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].vertical_aisle &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].cross_aisle &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].pred_cross_aisle &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].succ_cross_aisle &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].pred_vertical_aisle &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].succ_vertical_aisle &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].pred_cross_aisle_dist &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].succ_cross_aisle_dist &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].pred_vertical_aisle_dist &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].succ_vertical_aisle_dist &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].region &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].x_position &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> &nbsp;&nbsp; FS &lt;&lt; warehouse_graph[curr_node].y_position &lt;&lt; &quot; &quot; &lt;&lt; endl;<br> shortest_path_distance&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For each combination of nodes (i.e., for total_number_of_warehouse_graph_nodes_square combinations) the distance<br> shortest_path_length_including_start_and_end&nbsp;&nbsp;&nbsp; For each combination of nodes (i.e., for total_number_of_warehouse_graph_nodes_square combinations) the number of visited nodes<br> shortest_path_visited_nodes&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For each combination of nodes (i.e., for total_number_of_warehouse_graph_nodes_square combinations) the detailed path (length is respectively given by shortest_path_length_including_start_and_end)<br> dd_free_position&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For each free position and the depot (here with index N) the due date is transferred (N+1 values) (only relevant for the extended problem, is ignored here)<br> weight_of_free_position&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For each free position and the depot (here with index N) the weight is transferred (N+1 values) (only relevant for the extended problem, is ignored here)<br> capacity_of_free_position&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For each free position the storage capacity transferred (N values)<br> -2&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Separator indicating the end of an instances<br> -3&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Separator indicating the end of all experiments (i.e., indicating the end of the file)<br> */</p> <p>output files (results_Section_5_1.zip/results_Section_5_2.zip/results_Section_5_3.zip):<br> results_BB_NXXX_MYYY_A10_B05:&nbsp; Output file of applying B&amp;B<br> results_RW_NXXX_MYYY_A10_B05:&nbsp; Output file of applying s-shape random walk<br> results_NN_NXXX_MYYY_A10_B05:&nbsp; Output file of applying nearest neighbor</p> <p>In these files you find all outputs of schedule_finder.cc. &nbsp;<br> Among others, you will find the generated tour schedules (for Experiment with index I) in the output files by searching the phrase: &quot;Experiment I completed with result=&quot;<br> or for the next Experiment &quot; completed with result=&quot;</p> <p>Example (results_BB_N030_M150_A10_B05.txt, experiment 0, the tardiness values are to be ignored, see comments in schedule_finder.cc)<br> Pos 0 depot node with index 80 Number of stored items 0 CT 0&nbsp; No tardiness<br> Pos 1 position 27 Number of stored items 4 Current accumulated number of stored items 4 CT 163 DD 5629 No additional tardiness<br> Pos 2 position 28 Number of stored items 5 Current accumulated number of stored items 9 CT 399 DD 2962 No additional tardiness<br> Pos 3 position 29 Number of stored items 4 Current accumulated number of stored items 13 CT 670 DD 12631 No additional tardiness<br> Pos 4 position 26 Number of stored items 5 Current accumulated number of stored items 18 CT 840 DD 10142 No additional tardiness<br> Pos 5 position 23 Number of stored items 7 Current accumulated number of stored items 25 CT 1134 DD 6000 No additional tardiness<br> Pos 6 position 22 Number of stored items 4 Current accumulated number of stored items 29 CT 1170 DD 6396 No additional tardiness<br> Pos 7 position 16 Number of stored items 5 Current accumulated number of stored items 34 CT 1448 DD 8962 No additional tardiness<br> Pos 8 position 11 Number of stored items 10 Current accumulated number of stored items 44 CT 1674 DD 6336 No additional tardiness<br> Pos 9 position 0 Number of stored items 10 Current accumulated number of stored items 54 CT 2062 DD 1141 Additional tardiness 921<br> Pos 10 position 2 Number of stored items 9 Current accumulated number of stored items 63 CT 2201 DD 7742 No additional tardiness<br> Pos 11 position 4 Number of stored items 5 Current accumulated number of stored items 68 CT 2407 DD 4846 No additional tardiness<br> Pos 12 position 3 Number of stored items 5 Current accumulated number of stored items 73 CT 2717 DD 2316 Additional tardiness 401<br> Pos 13 position 1 Number of stored items 8 Current accumulated number of stored items 81 CT 2876 DD 9917 No additional tardiness<br> Pos 14 position 6 Number of stored items 3 Current accumulated number of stored items 84 CT 3073 DD 7299 No additional tardiness<br> Pos 15 position 5 Number of stored items 8 Current accumulated number of stored items 92 CT 3144 DD 6152 No additional tardiness<br> Pos 16 position 8 Number of stored items 6 Current accumulated number of stored items 98 CT 3337 DD 3705 No additional tardiness<br> Pos 17 position 12 Number of stored items 9 Current accumulated number of stored items 107 CT 3452 DD 7622 No additional tardiness<br> Pos 18 position 13 Number of stored items 4 Current accumulated number of stored items 111 CT 3522 DD 7833 No additional tardiness<br> Pos 19 position 14 Number of stored items 5 Current accumulated number of stored items 116 CT 3647 DD 9877 No additional tardiness<br> Pos 20 position 19 Number of stored items 1 Current accumulated number of stored items 117 CT 3922 DD 2905 Additional tardiness 1017<br> Pos 21 position 20 Number of stored items 5 Current accumulated number of stored items 122 CT 3923 DD 2538 Additional tardiness 1385<br> Pos 22 position 21 Number of stored items 7 Current accumulated number of stored items 129 CT 3976 DD 2769 Additional tardiness 1207<br> Pos 23 position 18 Number of stored items 10 Current accumulated number of stored items 139 CT 4173 DD 3552 Additional tardiness 621<br> Pos 24 position 25 Number of stored items 4 Current accumulated number of stored items 143 CT 4482 DD 11710 No additional tardiness<br> Pos 25 position 24 Number of stored items 7 Current accumulated number of stored items 150 CT 4509 DD 10599 No additional tardiness<br> Pos 26 visiting the node with index 80 Number of stored items 0 CT 4710 DD 10893 No additional tardiness<br> opt_makespan=4710 opt_total_tardiness=5552<br> TSP_procedure returned value 4710<br> Experiment 0 completed with result=3<br> BFS Branch&amp;Bound report: Consumed time: 1</p> <p>Copied from schedule_finder.cc:<br> Note that the procedure used as a solution procedure in the paper is int TSP_procedure(struct bb_node *curr_bb_node, int version)</p> <p>It is called by BB_procedure() as a subroutine for computing a lower bound value of an extended problem<br> (for instance, this extended problem additionally covers due dates. Therefore, due dates are also part of the problem instances, but can be ignored)<br> Specifically, TSP_procedure(struct bb_node *curr_bb_node, int version) is called once by lb_computation()</p>

opencc-by-4.0Aug 2023View details →
zenodo44/100

Daily opening stock gas storage data for Great Britain from 2010-10-01 in kWh

<p>version 1.0.3 has data to 2023-08-23, data values are in kWh</p> <p>Original data from:</p> <p>https://www.nationalgas.com/data-and-operations/transmission-operational-data</p> <p>under section Supplementary reports</p> <p>under link &lsquo;Daily storage and LNG operator information (1)&rsquo;</p> <p>Please check the licence conditions from National Gas - the data published here is merely combined from different files and parsed into a more useable format.</p>

opencc-by-4.0Aug 2023View details →
zenodo44/100

Low-energy Museum Storage Buildings: Climate, Energy Consumption and Air Quality. Data Set for Final Data Report

<p>The 43 txt-files included in this dataset relate to the report: Ryhl-Svendsen, Jensen, B&oslash;hm, and Klenz Larsen (2012): <em>Low-energy Museum Storage Buildings: Climate, Energy Consumption and Air Quality. UMTS Research Project 2007</em>&ndash;<em>2011: Final Data Report</em>, Kgs. Lyngby: National Museum of Denmark, 122&nbsp;pp.</p> <p>The document <a href="https://zenodo.org/api/files/145584b0-46b5-4341-8b02-7dfea90fa97c/00_List-of-data-files.pdf?versionId=a3e9691f-6e73-4a7b-aaab-c8ccee7c419b">00_List-of-data-files.pdf</a> contain a full list of the data files with&nbsp;a description of their structure and content, and&nbsp;is the key to how the individual data files relate to the report.&nbsp;</p> <p>The research project focussed on four modern museum storage facilities in Denmark, for which the indoor climate, air quality, and the energy consumption of the climate control systems was measured at several locations, typically for a period of between two and four years. The storage facilities were Museum of Southwest Jutland&rsquo;s storage building in Ribe (&lsquo;Ribe&rsquo;), The Shared Storage Facility at The Centre for Preservation of Cultural Heritage in Vejle (&lsquo;Vejle&rsquo;), The Joint Storage Facility for museums in East Jutland/ Museum &Oslash;stjylland (&lsquo;Randers&rsquo;), and from The National Museum of Denmark the storage building Hall P at the &Oslash;rholm Storage Facility (&lsquo;&Oslash;rholm&rsquo;). For description of the sites, monitoring campaigns, and graphed data, the report should be consulted.</p> <p>For completeness, the report is included with the dataset (<a href="https://zenodo.org/api/files/145584b0-46b5-4341-8b02-7dfea90fa97c/Report_low-energy-museum-storage-buildings.pdf?versionId=44097d39-775b-4031-9e07-6978c68912a9">Report_low-energy-museum-storage-buildings.pdf</a>).</p>

opencc-by-4.0Oct 2023View details →
edi44/100

Climate Change Across Seasons Experiment (CCASE) at the Hubbard Brook Experimental Forest: Tree Growth Data in support of "Declining Winter Snowpack Offsets Carbon Storage Enhancement from Growing Season Warming in Northern Temperate Forest Ecosystems", Conrad-Rooney et al. PNAS 2025

Data associated with the publication: Conrad-Rooney E, AB Reinmann, PH Templer. Declining Winter Snowpack Offsets Carbon Storage Enhancement from Growing Season Warming in Northern Temperate Forest Ecosystems. Proceedings of the National Academy of Sciences, 2025. This dataset includes cumulative stem biomass carbon data (from pre-treatment in 2012 until 2022) and annual stem biomass growth rates (not cumulative) for 2015-2022 for the red maple trees at the Climate Change Across Seasons Experiment. These data were gathered as part of the Hubbard Brook Ecosystem Study (HBES). The HBES is a collaborative effort at the Hubbard Brook Experimental Forest, which is operated and maintained by the USDA Forest Service, Northern Research Station.

openCC (other)Jun 2025View details →
edi44/100

Climate Change Across Seasons Experiment (CCASE) at the Hubbard Brook Experimental Forest: Soil Temperature, Soil Frost, and Snow Depth Data in support of "Declining Winter Snowpack Offsets Carbon Storage Enhancement from Growing Season Warming in Northern Temperate Forest Ecosystems", Conrad-Rooney et al. PNAS 2025

Data associated with the publication: Conrad-Rooney E, AB Reinmann, PH Templer. Declining Winter Snowpack Offsets Carbon Storage Enhancement from Growing Season Warming in Northern Temperate Forest Ecosystems. Proceedings of the National Academy of Sciences, 2025. This dataset includes soil temperature (winter 2021-2022) and snow depth and frost depth (winter 2022-2023) at the Climate Change Across Seasons Experiment. These data were gathered as part of the Hubbard Brook Ecosystem Study (HBES). The HBES is a collaborative effort at the Hubbard Brook Experimental Forest, which is operated and maintained by the USDA Forest Service, Northern Research Station.

openCC (other)Jun 2025View details →
zenodo40/100

Data for: Improving Kieker's Scalability by Employing Linked Read-Optimized and Write-Optimized NoSQL Storage

<p>We show, how polyglot persistence increase Kieker&#39;s scalability by employing separate read-optimized and write-optimized noSQL storage. For this purpose we extended Kieker to store its monitoring output in Apache Cassandra , which is a write-optimized wide-column noSQL database. For the analysis of the generated monitoring output we are using ElasticSearch, a read-optimized document store noSQL storage. We are interlinking read-optimized and write-optimized noSQL storage within our Regression Benchmarking Execution Environment (RBEE). To ensure scalability we are employing a container infrastructure. The mentioned noSQL storages and the linker are operating within one single Docker container which scales horizontally.</p> <p>For generating reference values, we instrumented a Java SE application with Kieker&#39;s file system writer and measured throughput and method&#39;s execution times. Consecutively, we instrumented the same Java SE application with our Apache Cassandra writer and measured throughput and method&#39;s execution time. Finally, we compared measurement results of Kieker&#39;s file system writer with the measurement results of our Apache Cassandra writer.</p>

opencc-by-4.0Aug 2016View details →
zenodo40/100

Three-dimensional GNSS Time Series Data for Terrestrial Water Storage Changes Inversion in Yunnan, China

<p>The dataset includes three-dimensional GNSS time series data featured in the publication "Using the global navigation satellite system and precipitation data to establish the propagation characteristics of meteorological and hydrological drought in Yunnan, China", published in 'Water Resources Research'.</p> <p>Reference:<br>Zhu, H., Chen, K., Hu, S., Liu, J.,Shi, H., Wei, G., et al. (2023). Using the global navigation satellite system and precipitation data to establish the propagation characteristics of meteorological and hydrological drought in Yunnan, China. Water Resources Research, 59, e2022WR033126. https:// doi.org/10.1029/2022WR033126</p> <p><br>The sitelist file lists basic information about all the utilized stations, including their names and geographic coordinates.&nbsp;<br>The Time.mat file contains the time vectors of the data employed.&nbsp;<br>The Filter_time_series_N/E/U.mat files showcase the filtered time series, which have been processed using Independent Component Analysis (ICA) for the inversion of terrestrial water storage in Yunnan, after removing the effects of outliers, steps, and non-tidal atmospheric/oceanic loading.</p>

opencc-by-4.0Mar 2023View details →
zenodo40/100

Experimental data on "Sediment storage and fluvial sediment transport linkages across an experimental flood sequence"

<p>The repository contains data used in manuscript "Sediment storage and fluvial sediment transport linkages across an experimental flood sequence" by Hassan, Pierce, Chartrand.&nbsp;</p>

opencc-by-4.0Apr 2024View 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