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,410
datasets available to search
ShareScore release 0.9.0
Dataset results
6,410 results for “results”
Results of Bet-and-Run Strategies with Different Decision Makers on the Traveling Salesman Problem and the Minimum Vertex Cover Problem
<p><em><strong>Results of Bet-and-Run Strategies with Different Decision Makers on the Traveling Salesman Problem and the Minimum Vertex Cover Problem</strong></em></p> <p><strong>1. Introduction</strong></p> <p>In this repository, we provide the implementation and results of an improved generic Bet-and-Run strategy for black-box optimization.<br> The goal our new Bet-and-Run method is to obtain the best possible results within a given time budget <em>T</em> using a given black-box optimization algorithm.<br> If no prior knowledge about problem features and algorithm behavior is available, the question about how to use the time budget most efficiently arises. We propose to first start <em>n>=1</em> independent runs of the algorithm during an initialization budget <em>T1<T</em>, pausing these runs, then apply a decision maker <em>D</em> to choose <em>1<=m<n</em> runs from them (consuming <em>T2>=0</em> time units in doing so), and then continuing these runs for the remaining <em>T3=T-T1-T2</em> time units.</p> <p>In previous bet-and-run strategies, the decision maker <em>currentBest</em> would simply select the run with the best-so-far results at negligible time.<br> We propose using more advanced methods and test several different approaches, including neural networks trained or polynomials fitted on the current trace of the algorithm to predict which run may yield the best results if granted the remaining budget.<br> Applying this implementation to run "virtual experiments," one can find that this approach can yield better results than the previous methods, but also find that the `currentBest` method is a very reliable and robust baseline approach.</p> <p>Here you can find the results of such experiments on the Traveling Salesman Problem and the Minimum Vertex Cover Problem. Both betAndRun_tsp.tar.xz and betAndRun_vertex_cover.tar.xz are extracted in the scale of 30 GiB of size.</p> <p><strong>2. Copyright</strong></p> <p>The source code in this repository is under MIT License and is published in the most recent version at http://github.com/thomasWeise/betAndRun, while the results are under the Creative Commons Attribution 4.0 License.</p> <p>The code on bet-and-run (mainly under cn.edu.hfuu.iao.betAndRun) is jointly developed by Dr. Thomas Weise (http://iao.hfuu.edu.cn), tweise@hfuu.edu.cn, tweise@gmx.de) and Dr. Markus Wagner (http://cs.adelaide.edu.au/~markus/, markus.wagner@adelaide.edu.au).</p> <p>The <em>jpack</em> (http://github.com/marmakoide/jpack) code for Artificial Neural Networks, Linear Algebra, and Evolution Strategies (e.g., CMA-ES) has originally been developed by Dr. Alexandre Devert (http://www.marmakoide.org, marmakoide@hotmail.fr, and http://github.com/marmakoide), who kindly granted us the permission to include it in our repository. The code published here is a slightly modified version of his code, but the copyright and authorship remains entirely with Dr. Devert, who provides it under the MIT license at GitHub under http://github.com/marmakoide/jpack. Please contact Dr. Devert for any questions, in particular regarding licensing and (re-)distribution.</p>
Results for Several Simple Algorithms on the W-Model for Black-Box Discrete Optimization Benchmarking
<p>The W-Model follows a layered approach, where each layer can either be omitted or introduce a different characteristic feature such as neutrality via redundancy, ruggedness and deceptiveness, epistasis, and multi-objectivity, in a tunable way. The model problem is defined over bit string representations, which allows for extracting some of its layers and stacking them on top of existing problems that use this representation, such as OneMax, the Maximum Satisfisiability or the Set Covering tasks, and the NK landscape. The ruggedness and deceptiveness layer can be stacked on top of any problem with integer-valued objectives.</p> <p>Here we provide some experimental results with several simple algorithms on the W-Model along with the algorithm and experiment executor implementation. The most recent version of the code can be found at <a href="http://www.github.com/thomasWeise/BBDOB_W_Model">http://www.github.com/thomasWeise/BBDOB_W_Model</a>, while the program used in the experiment are attached to this dataset. The implemented algorithms are</p> <ul> <li>1-flip hill climber with restarts,</li> <li>2-flip hill climber with restarts,</li> <li>μ+λ Evolutionary Algorithms (for different values of μ, λ, and different crossover rates),</li> <li>μ+λ Evolutionary Algorithms with Frequency Fitness Assignment (FFA) (for different values of μ, λ, and different crossover rates),</li> <li>exhaustive enumerate (EE), and</li> <li>random sampling (RS)</li> </ul> <p>These algorithms are applied to a range of different parametric setups of the W-Model for single-objective optimization and fixed-length bit string representations.</p> <p>The experiments are executed on a HP Z640 Work Station with 32 GB DDR4-2400 RAM and Intel Xeon E5-2609v4 CPU under Ubuntu Server Linux 16.04, Kernel 4.4.0-116-generic, and with Java 1.8.0_151. Each run was granted at most 1048576 function evaluations (FEs). The total amount of data collected is about 45 GB, with tar.xz compression down to about 1.2 GB. The text files containing the algorithm traces are fairly self-describing.</p> <p>Publications that describe the W-Model:</p> <ul> <li>Thomas Weise and Zijun Wu. Difficult Features of Combinatorial Optimization Problems and the Tunable W-Model Benchmark Problem for Simulating them. In Black Box Discrete Optimization Benchmarking (<a href="http://iao.hfuu.edu.cn/bbdob-gecco18">BB-DOB</a>) Workshop of <em>Companion Material Proceedings of the Genetic and Evolutionary Computation Conference (<a href="http://gecco-2018.sigevo.org/">GECCO 2018</a>)</em>, July 15th-19th 2018, Kyoto, Japan, ISBN: 978-1-4503-5764-7. ACM. doi:<a href="http://dx.doi.org/10.1145/3205651.3208240">10.1145/3205651.3208240</a> / <a href="http://github.com/thomasWeise/BBDOB_W_Model">source codes</a> [This paper contains some errata for the one below]</li> <li>Thomas Weise, Stefan Niemczyk, Hendrik Skubch, Roland Reichle, and Kurt Geihs. A Tunable Model for Multi-Objective, Epistatic, Rugged, and Neutral Fitness Landscapes. In Maarten Keijzer, Giuliano Antoniol, Clare Bates Congdon, Kalyanmoy Deb, Benjamin Doerr, Nikolaus Hansen, John H. Holmes, Gregory S. Hornby, Daniel Howard, James Kennedy, Sanjeev P. Kumar, Fernando G. Lobo, Julian Francis Miller, Jason H. Moore, Frank Neumann, Martin Pelikan, Jordan B. Pollack, Kumara Sastry, Kenneth Owen Stanley, Adrian Stoica, El-Ghazali, and Ingo Wegener, editors, <em>Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO'08)</em>, pages 795-802, July 12-16, 2008, Renaissance Atlanta Hotel Downtown: Atlanta, GA, USA. ISBN: 978-1-60558-130-9, New York, NY, USA: ACM Press. doi:<a href="http://dx.doi.org/10.1145/1389095.1389252">10.1145/1389095.1389252</a> / <a href="http://iao.hfuu.edu.cn/images/publications/WNSRG2008ATMFMOERANFL.pdf">pdf</a> [This paper has some deficits fixed in the paper above]</li> </ul>
Measurement Results of Single-Bit Sigma-Delta Modulator and Simulation Data for DFT Based RSSI Calculation
<p>Measurement of single-bit output data stream of an low-IF receiver with sigma-delta ADC. Inphase and Quadraturephase signals can be found in raw_rx_*.csv files. Simulation results of DFT based RSSI calculation are found in sim_RSSI_*.csv. Measurement results of the RSSI dynamic range are located in meas_RSSI_dynamicRange.csv.</p>
Evaluating changing patterns of herbivory as a result of habitat change
<b>Description: </b><p>Estimates of leaf herbivory from leaves collected in litter traps</p><p><b>Project: </b>This dataset was collected as part of the following SAFE research project: <a href="https://www.safeproject.net/projects/project_view/109"><b>Evaluating changing patterns of herbivory as a result of habitat change</b></a></p><p><b>XML metadata: </b>GEMINI compliant metadata for this dataset is available <a href="https://www.safeproject.net/datasets/xml_metadata?id=108">here</a></p><p><b>Files: </b>This consists of 1 file: template_Metcalfe.xlsx</p><p><b>template_Metcalfe.xlsx</b></p><p>This file contains dataset metadata and 1 data tables:</p><ol><li><p><b>Herbivory data</b> (described in worksheet Data)</p><p>Description: Estimates of leaf herbivory from leaves collected in litter traps</p><p>Number of fields: 8</p><p>Number of data rows: 4630</p><p>Fields: </p><ul><li><b>Date</b>: Date leaves were collected in the field (Field type: Date)</li><li><b>Site</b>: SAFE Project sample site (Field type: Location)</li><li><b>LeafNo</b>: Identifier for individual leaf within 'Site' (Field type: Replicate)</li><li><b>imageID</b>: Filename for the photograph of that leaf (Field type: ID)</li><li><b>WithDamage</b>: Area of leaf (excluding herbivory damage) (Field type: Numeric)</li><li><b>WithoutDamage</b>: Area of leaf assuming no herbivory (Field type: Numeric)</li><li><b>Herbivory</b>: Herbivory damage to leaf (Field type: Numeric)</li><li><b>Zherbivory</b>: Herbivory damage to leaf (Field type: Numeric)</li></ul></li></ol><p><b>Date range: </b>2011-04-07 to 2011-07-03</p><p><b>Latitudinal extent: </b>4.6642 to 4.7714</p><p><b>Longitudinal extent: </b>116.9477 to 117.7028</p>
GRB 070306: Observing log and results from photometry
<p>Observation log and photometric results of GRB 070306 from Jaunsen et al. (2008), Ap.J. 681, p.453-461</p> <p> </p>
Simulation results for PhD thesis
<p>This is the dataset used to generate the results for PhD thesis titled: "Source Location Privacy in Wireless Sensor Networks Under Practical Scenarios: Routing Protocols, Parameterisations and Trade-Offs".</p>
SEGUE-GaiaDR2 results from UniDAM
<p>Distances, ages and masses for SEGUE stars derived using UniDAM</p>
AMDADOS simulation results and scaling for IEEE Oceans paper
<p>Presents inputs datasets for the AMDADOS paper presented at IEEE Oceans 2018 (<a href="https://doi.org/10.5281/zenodo.1346168">10.5281/zenodo.1346168</a>) to enable replication of experiments</p>
Results of questionnaire on live plant health nematode collections
<p>In the framework of the Euphresco project 2016-F-186 'Inventory of living collections of cyst and root knot nematodes in Europe and their maintenance techniques (Cyst and Melo Collect)', a survey was organised during the Autumn 2017 with the aim to collect information on the live nematode collections in different countries. 32 (reference) collections in Austria, Belgium, Canada, Czech Republic, France, Germany, Italy, Latvia, Mexico, Netherlands, Portugal, Spain, United Kingdom, and United States of America participated in the survey.</p> <p>Of the 32 mentioned collections the preferred nematode populations are clearly different between the USA and Europe: the tropical <em>Meloidogyne</em> species are the most represented in North America while <em>Globodera</em> species are in Europe.</p> <p>The comparison of the protocols for live nematode storage for short and long periods of time showed high variability, although in general, <em>Globodera</em> spp. can be stored at 4 °C for longer time (>20 years) than <em>Meloidogyne</em> spp., whose optimal storage time is 8 months at 14 °C, when kept in soil.</p> <p>The need to verify the population for its trueness, with other words, the frequency of identification differs; various possibilities are mentioned between never and almost monthly to frequently, each time the nematodes are extracted from the soil (90 days for PCN, 16 weeks for <em>Meloidogyne</em>) to yearly or only upon arrival. The frequency depends on the amount of time people can afford to put into this work and the risk assessment for getting cross contamination.</p> <p>The conditions for rearing and maintaining were inventoried as well. For <em>Meloidogyne</em> spp., host differences for rearing and maintaining them are rarely observed (often <em>Solanum lycopersicum</em> -tomato- is used for both), although <em>Ficus carina</em> for long maintenance of <em>Meloidogyne</em> spp. and <em>Solanum dulcamara</em> for <em>M. fallax</em> have been used in France (pers. comm. Fabrice Ollivier, ANSES). For cyst nematode species their specific host is used for both rearing and maintenance purposes: <em>Solanum tuberosum</em> (potato), <em>Nicotiana tabacum</em> (tobacco), or <em>Glycine max</em> (soybean) are used respectively for the potato cyst nematodes (<em>Globodera rostochiensis</em> and <em>G. pallida</em>), <em>G. tabacum</em> and <em>G. glycines</em>.</p> <p>The project report is also available on Zenodo https://zenodo.org/record/1442881#.W7PaxmgzbIU</p>
Analysis results for association study of long-term kidney transplant rejection using whole-exome sequencing
<p>Association study results for long-term kidney transplant rejection. Single-variant association results are provided as Plink output files. Meta-analysis results are provided as METAL output files. FDR results are sorted lists of the top association result from random sample label permutations and are included with the plink and meta-analysis results. SKAT and GSEA results are provided for gene and pathway level analyses, respectively.</p>
Table of results from morphological assessment of Urocyon skulls and skeletons
<p>Catalog of skeletal pathologies observed in morphological assessment of island (<em>Urocyon littoralis</em>) and gray fox (<em>U. cinereoargenteus</em>) specimens from museum collections (LACNHM: Los Angeles County Museum of Natural History; SBMNH: Santa Barbara Museum of Natural History; Dickey: Donald Ryder Dickey Bird and Mammal Collection at University of California, Los Angeles).</p> <p>Please cite: Robinson, J. A., Brown, C., Kim, B. Y., Lohmueller, K. E., & Wayne, R. K. (2018). Purging of Strongly Deleterious Mutations Explains Long-Term Persistence and Absence of Inbreeding Depression in Island Foxes. <em>Current Biology</em>, <em>28</em>(21), 3487-3494.</p>
Simulation results for the earthquake cycle including huge SSEs.
<p>The damped data for the simulation results shown in the paper titled "Nucleation for characteristic earthquakes in simulated cycles involving huge slow slip events on the deeper estension"(now in under review), authored by Ohtani, Makiko, N. Kame, and M. Nakatani.</p> <p> </p> <p> </p>
data_set_ANN + results
<p><strong>Excel sheets:</strong></p> <p> </p> <p><strong>IN</strong> - input (independent) variable values for all 64 data points</p> <p> variable ID 1 = frequency of the 1<sup>st</sup> free vibration mode (Hz)</p> <p> variable ID 3 = frequency of the 2<sup>nd</sup> free vibration mode (Hz)</p> <p> variable ID 3 = frequency of the 3<sup>rd</sup> free vibration mode (Hz)</p> <p> </p> <p><strong>TARGET</strong> - target (dependent) variable values for all 64 data points</p> <p> variable ID 1 = damage location (m) = distance from beam edge</p> <p> </p> <p><strong>TARGET vs OUTPUT</strong> - target (expected) vs. output (yielded by the proposed ANN) values</p> <p> </p> <p> </p> <p><strong>Check reference below</strong> (to be added when the paper is published)</p> <p><a href="https://www.researchgate.net/publication/328870831_12_Neural_Networks_-_Structural_Damage_-_Localization">https://www.researchgate.net/publication/328870831_12_Neural_Networks_-_Structural_Damage_-_Localization</a></p>
MHD simulation results for the investigation of FTEs
<p>The unit of data:</p> <p>Length unit, like x, y z, is Re(the radius of the Earth).</p> <p>The unit of magnetic field data is nT.</p> <p>The unit of velocity is km/s.</p> <p>The unit of density is cm^-3.</p> <p>The unit of pressure is nPa.</p> <p><strong>1</strong>.'no2_bn_mp_betsuni_topo_halfopen_17_r0.dat ' contains the magnetic field and some plasma data on the surface of magnetopause in full time step(201 time steps) of case 2.</p> <p>This is a binary data, and you can read it as follows"</p> <p>read,ntht,nphi (ntht,nphi are integers)</p> <p>define xmp,ymp,zmp as the two dimension array (ntht,nphi)</p> <p>read,xmp,ymp,zmp (xmp,ymp,zmp is the coordinates of points, the unit is Re) </p> <p>define bn,bl,bm,p_1,b_mag,vx_1,d_1 (these are 2 dimensional arrays (ntht, nphi))</p> <p>begin the loops for i=0,200</p> <p>read,time(this is the time , you need to multiply 0.935 to get the physical time. For example, if the value of time you read is 680, then the physical time is 680*0.935)</p> <p>read, bn,bl,bm,p_1,b_mag,vx_1,d_1 (bn,bl,bm are the magnetic field data,p_1 is pressure, vx_1 is the magnitude of velocity,d_1 is the density)</p> <p>endfor</p> <p><strong> 2</strong>. 'S05D07V750B0013-13bt_cut_large_bipolar_bt119 ' , 'S05D07V750B0013-13bt_cut_large_bipolar_bt120' and 'S05D07V750B0013-13bt_cut_large_bipolar_bt121' are the data in 3d of case2 in 119th(2225.3s),120th(2244s) and 121th(2262.7s) time step separately.</p> <p>These are binary data, you can read as follows:</p> <p>read,m,n,l (m,n,l are integers)</p> <p>define, x,y,z as 1 dimensional array, x(m), y(n), z(l)</p> <p>read,,x,y,z</p> <p>define d,vx,vy,vz,bx,by,bz,p,tracer as 3 dimensional arrays, like d(m,n,l). d is density, vx is the velocity of x axis, vy is the velocity of y direction, vz is the velocity of z axis, bx, by and bz are the magnetic field in x, y, z, p is pressure. tracer is the percentage of solar wind particles. </p> <p>read,d,vx,vy,vz,bx,by,bz,p,tracer</p> <p><strong>3</strong>.S05D07V750B0013-13bt_cut_large_bipolar_bt121.silo is a 3 dimensional data which can be opened and plotted by Visit.</p> <p><strong>4</strong>.no1_bn_mp_betsuni_topo_half_r0_178.dat and no3_bn_mp_betsuni_topo_half_1120_34.dat contains the magnetic field and some plasma data on the surface of magnetopause in only one time step of case 1 and case3.</p> <p>The time step of case1' s data is 178th, that is 3328.6s.</p> <p>The time step of case3' s data is 34th, that is 635.8s.</p> <p>These are binary data, you can read the data as follows:</p> <p>read,ntht,nphi ( these are integers)</p> <p>define xmp,ymp,zmp as 2 dimensional arrays, like xmp(ntht,nphi)</p> <p>read, xmp,ymp,zmp</p> <p>read, time( if you want to get the physical time point, you should calculate 0.935*time)</p> <p>define bn,bl,bm,p_1,b_mag,vx_1,d_1 as 2 dimensional arrays, like bn(ntht,nphi)</p> <p>read,bn,bl,bm,p_1,b_mag,vx_1,d_1</p> <p><strong>5</strong>. S05D48V300B0033-33bt_cut_large_bipolar37 , S05D07V750B0013-13bt_cut_large_bipolar_bt37 and S05D03V1200B0008-08bt_cut_large_bipolar_bt37 are the data in 3 dimension of case1 ,2 and 3 in the 37th(691.9s) time step separately.</p> <p>These data are the binary data and you can read these as the steps shown in 2.</p>
Results of "Collaborative Spatial Reuse in Wireless Networks via Selfish Multi-Armed Bandits"
<p>This dataset contains the results obtained for the article "Collaborative Spatial Reuse in Wireless Networks via Selfish Multi-Armed Bandits", authored by Francesc Wilhelmi, Cristina Cano, Gergely Neu, Boris Bellalta, Anders Jonsson and Sergio Barrachina. The article has been sent to Elsevier Ad-hoc Networks.</p> <p>The content of this dataset has been obtained by means of the code allocated in the following GitHub repository: <a href="https://github.com/fwilhelmi/collaborative_sr_in_wns_via_selfish_mabs">https://github.com/fwilhelmi/collaborative_sr_in_wns_via_selfish_mabs</a></p> <p>Contact information: francisco.wilhelmi@upf.edu</p>
Benchmark results for Vellamo and AnTuTu from Google Play in Xiaomi Redmi Note 4
<p>The dataset contains the print screens of the execution of following benchmark: Vellamo Browser, Vellamo Metal, Vellamo Multicore, and AnTuTu General. The benchmark was repeated until the smartphone reaches a battery level below 20%. For each benchmark, we recorded the numerical results for each microbenchmark. Each benchmark was evaluated using different approaches for CPU frequency scaling: Ondemand, Performance, Interactive, HS, ZT, OUR-G-0.1, OUR-G-0.5 and OUR-G-0.9.</p> <p>Ondemand, Performance, and Interactive are native from Android OS.</p> <p>OUR-G-0.1, OUR-G-0.5 and OUR-G-0.9 referrers to our proposed method to save energy, executed in smartphone Xiaomi Redmi Note 4.</p> <p>The approaches HS is from:<br> @article{hshen2013,<br> author = "H. Shen and Y. Tan and J. Lu and Q. Wu and Q. Qiu",<br> title = "Achieving Autonomous Power Management Using Reinforcement Learning",<br> journal = "ACM Transactions on Design Automation of Electronic Systems (TODAES)",<br> volume = "18",<br> month = "",<br> number = "2",<br> year = "2013",<br> pages = "24-32"<br> }</p> <p>and ZT in from:<br> @inproceedings{ztian2018,<br> author = "Zhongyuan Tian and Zhe Wang and Haoran Li and Peng Yang and Rafael Kioji Vivas Maeda and Jiang Xu",<br> title = "Multi-device collaborative management through knowledge sharing",<br> booktitle = "Proc. 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)",<br> month = "" ,<br> year = "2018",<br> pages = "22-27"<br> }</p> <p>The energy.txt file contains the acquisition of voltage and current from smartphone fuel gauge.</p> <p>The other files are self-explained.</p> <p> </p> <p> </p>
Table with results of differential gene expression analysis in the controlled environment for fin tissues.
<p>Differences between transcriptomes of three Cottus fish lineages were assessed under controlled, laboratory conditions. Two tissues were investigated: fins and livers. Present table shows results of the differential gene expression analysis performed on fin tissues of Cottus fish. Base-mean, Log-2-fold change. standard error, statistics and associated p-values and FDR-corrected p-values are given for every contrast possible in our experimental design.</p>
Table with the results of the time series gene expression analysis for fins.
<p>Differences between transcriptomes of two Cottus fish lineages were assessed in the natural environment. Sampling was performed in a time series covering whole year. Two tissues were investigated: fins and livers. Present table shows results of a time series differential gene expression analysis performed on fin tissues.</p>
Table with results of differential gene expression analysis in the controlled environment for liver tissues.
<p>Differences between transcriptomes of three Cottus fish lineages were assessed under controlled, laboratory conditions. Two tissues were investigated: fins and livers. Present table shows results of the differential gene expression analysis performed on liver tissues of Cottus fish. Base-mean, Log-2-fold change. standard error, statistics and associated p-values and FDR-corrected p-values are given for every contrast possible in our experimental design.</p>
Structural coronary artery remodelling in the rabbit fetus as a result of intrauterine growth restriction
<p>Segmentation of the coronary arteries in synchrotron X-Ray Phase Contrast images from 8fetal rabbit hearts: 4 controls (healthy), and the other 4 with intrauterine growth restriction (IUGR).</p>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research 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.
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.
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.
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.
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.