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.
1,063
datasets available to search
ShareScore release 0.9.0
Dataset results
1,063 results for “search”
Single-pulsar search for eccentric SMBHBs using NANOGrav 12.5-year data of PSR J1909--3744: Posterior samples
<p>This repository contains posterior samples for a Bayesian single-pulsar search for nanohertz gravitational waves originating from eccentric supermassive binaries, done using the NANOGrav 12.5-year dataset for PSR J1909-3744. The analysis is presented in Susobhanan 2023 [https://arxiv.org/abs/2210.11454].</p>
Replication package of "Search-based Crash Reproduction using Behavioral Model Seeding"
<p>Search-based crash reproduction approaches assist developers during debugging by generating a test case which reproduces a crash given its stack trace. One of the fundamental steps of this approach is creating objects needed to trigger the crash. One way to overcome this limitation is seeding: using information about the application during the search process. With seeding, the existing usages of classes can be used in the<br> search process to produce realistic sequences of method calls which create the required objects. In this study, we introduce behavioral model seeding: a new seeding method which learns class usages from both<br> the system under test and existing test cases. Learned usages are then synthesized in a behavioral model (state machine). Then, this model serves to guide the evolutionary process. To assess behavioral model-seeding, we evaluate it against test-seeding (the state-of-the-art technique for seeding realistic objects) and no-seeding (without seeding any class usage). For this evaluation, we use a benchmark of 122 hard-to-reproduce crashes stemming from six open-source projects. Our results indicate that behavioral model-seeding outperforms both test seeding and no-seeding by a minimum of 6% without any notable negative impact on efficiency.</p>
Inter-Chemical Correlation results for the study: HHEARx2017-1962 (SEARCH for Diabetes in Youth (SEARCH))
Title: SEARCH for Diabetes in Youth (SEARCH) <br>Species: Homo sapiens <br>Number of samples: 1796 <br>Number of named analytes: 4 <br>Datasource url: https://hheardatacenter.mssm.edu/PublicFile/ViewPublicFile?projectid=34 <br>
On the Effectiveness of Transfer Learning for Code Search - Replication Package
<p>This repository represents the replication package for the paper <em>On the Effectiveness of Transfer Learning for Code Search</em>.</p> <p>The paper is published in the journal <em>IEEE Transactions on Software Engineering (TSE)</em>.</p> <p>In this replication package, we provide all the data and scripts we used in our study.</p>
Dataset from: "Reward expectation facilitates context learning and attentional guidance in visual search"
<p>Dataset for Bergmann N, Koch D, Schubö A (2019). Reward expectation facilitates context learning and attentional guidance in visual search, <em>Journal of Vision</em>, 19(3). <a href="https://doi.org/10.1167/19.3.10">https://doi.org/10.1167/19.3.10</a></p>
Datasets for "The Search for Topographic Correlations within the Reiner Gamma Swirl"
<p>Topographic data at 0.8 m/pixel resolution with 16-bit integer values for the subregion are available as a GeoTiff file. Definition files for the K-Means and MLC algorithms in classifying swirl units for the subregion are available as ASCII text files. Masking definition files for the study region and subregion are available as shapefiles. See README file for further details.</p> <p>Data used in the research article:</p> <p>Weirich, J.R., D.L. Domingue, F.C. Chuang, A.A. Sickafoose, M.D. Richardson, Eric E. Palmer, and R.W. Gaskell, 2023. The Search for Topographic Correlations within the Reiner Gamma Swirl. The Planetary Science Journal, 4:212. DOI: 10.3847/PSJ/ace2b8</p>
EMBERSim: A Large-Scale Databank for Boosting Similarity Search in Malware Analysis
<p>In recent years there has been a shift from heuristics-based malware detection towards machine learning, which proves to be more robust in the current heavily adversarial threat landscape. While we acknowledge machine learning to be better equipped to mine for patterns in the increasingly high amounts of similar-looking files, we also note a remarkable scarcity of the data available for similarity-targeted research. Moreover, we observe that the focus in the few related works falls on quantifying similarity in malware, often overlooking the clean data. This one-sided quantification is especially dangerous in the context of detection bypass. We propose to address the deficiencies in the space of similarity research on binary files, starting from EMBER — one of the largest malware classification data sets. We enhance EMBER with similarity information as well as malware class tags, to enable further research in the similarity space. Our contribution is threefold: (1) we publish EMBERSim, an augmented version of EMBER, that includes similarity-informed tags; (2) we enrich EMBERSim with automatically determined malware class tags using the open-source tool AVClass on VirusTotal data and (3) we describe and share the implementation for our class scoring technique and leaf similarity method.</p>
Papers on Google Scholar using "sonification, auditory display, audification, sonify" as search terms
<p>Data set from a Google Scholar search in January 2023 on the terms "sonification, auditory display, audification, sonify" and added abstracts from various online ressources and keywords (automatically extracted from the abstracts only), containing:</p> <ul> <li>their title,</li> <li>a website/URL (as referenced by Google scholar),</li> <li>author(s),</li> <li>publisher information,</li> <li>their google rank in our search,</li> <li>publication year,</li> <li>the number of citations;</li> <li>paper abstracts;</li> <li>keywords generated from abstracts.</li> </ul>
Experimental data of the paper "Trial-based Heuristic Tree Search for MDPs with Factored Action Spaces"
<p>This data set contains the code of our planner and of the planner that was used as baseline, the benchmark set that was used to perform experiments as well as the parsed values and basic reports that are reported in the paper. More information can be found in the README that is also included.</p>
Replication package of "Good Things Come In Threes: Improving Search-based Crash Reproduction With Helper Objectives"
<p>The replication package for the study about using new helper objectives (MOHO) for crash reproduction. This study has been accepted at ASE 2020.</p> <p> </p> <p>Abstract:</p> <p>Evolutionary intelligence approaches have been successfully applied to assist developers during debugging by generating a test case reproducing reported crashes. These approaches use a single fitness function called <em>Crash Distance</em> to guide the search process toward reproducing a target crash. Despite the reported achievements, these approaches do not always successfully reproduce some crashes due to a lack of test diversity (premature convergence). In this study, we introduce a new approach, called <em>MO-HO</em>, that addresses this issue via multi-objectivization. In particular, we introduce two new Helper-Objectives for crash reproduction, namely <em>test length</em> (to minimize) and <em>method sequence diversity</em> (to maximize), in addition to <em>Crash Distance</em>.</p> <p>We assessed <em>MO-HO</em> using five multi-objective evolutionary algorithms (NSGA-II, SPEA2, PESA-II, MOEA/D, FEMO) on 124 hard-to-reproduce crashes stemming from open-source projects. Our results indicate that SPEA2 is the best-performing multi-objective algorithm for <em>MO-HO</em>.</p> <p>We evaluated this best-performing algorithm for <em>MO-HO</em> against the state-of-the-art: single-objective approach (Single-Objective Search) and decomposition-based multi-objectivization approach (<em>De-MO</em>). Our results show that <em>MO-HO</em> reproduces five crashes that cannot be reproduced by the current state-of-the-art. Besides, <em>MO-HO</em> improves the effectiveness (+10% and +8% in reproduction ratio) and the efficiency in 34.6% and 36% of crashes (i.e., significantly lower running time) compared to Single-Objective Search and <em>De-MO</em>, respectively. For some crashes, the improvements are very large, being up to +93.3% for reproduction ratio and -92% for the required running time. </p>
In search of a conditioned place preference test to assess the severity of experimental procedures
<p>This deposit contains the choice dataset belonging to the publication with the title "In search of a conditioned place preference test to assess the severity of experimental procedures". </p> <p>A preprint version of the paper will be published on bioRxiv.</p> <p>The data set contains:</p> <ul> <li>for the Conditioned Place Preference Tests 1-9: table of time stamps with the position of the mice during the habituation and the final test</li> <li>a txt-file containing a rough description of the columns and their meanings</li> <li>the R Script which was used to analyze the data tables, especially with regard to statistics</li> </ul> <p>For more details on methods and results please read the manuscript.</p>
User study data: Nudges to Mitigate Confirmation Bias during Web Search for Opinion Formation, automatic vs. reflective study
<p>Data of two user studies (282 and 307 participants), investigating the risks and benefits of warning labels with and without obfuscations to mitigate confirmation bias during web search on debated topics.</p> <p> </p> <p>Study Variables (study 1 and study 2)</p> <p> </p> <p> display_con: Search result display<br> - Study 1<br> - 1: targeted warning label with obfuscation<br> - 2: random warning label with obfuscation<br> - 3: regular (no intervention)<br> - Study 2<br> - 1: targeted warning label with obfuscation<br> - 2: targeted warning label without obfuscation<br> - 3: random warning label with obfuscation<br> - 4: random warning label without obfuscation<br> - 5: regular (no intervention)<br>- CRT_cat: Cognitive reflection<br> - 1: intuitive<br> - 2: analytic<br>- topic: Assigned debated topic<br> - 1: Is drinking milk healthy for humans? <br> - 2: Is homework beneficial?<br> - 3: Should people become vegetarian?<br> - 4: Should students have to wear school uniforms?<br>- clicksup_prop: Clicks on attitude-confirming (AC) search results (proportion of all clicks)<br>- clickwarn_prop: Clicks on warning label (WL) search results (proportion of all clicks)<br>- show_clicked: Clicks on show-button (number of clicks, only in conditions with obfuscation)<br>- accuracy_bias: Accuracy bias estimation (Difference between a) observed bias (as the proportion of attitude-confirming clicks) and b) perceived bias (reported in the post-interaction questionnaire and re-coded into values from 0 to 1), positive values indicate an overestimation of bias)<br>- att_change: Attitude change (Difference between attitude reported in the pre-interaction questionnaire and the post-interaction questionnaire. Negative values indicate an attitude change in the attitude-opposing direction, while positive values indicate an attitude strengthening in the attitude-supporting direction.)<br>- knowledge_1: Self-reported prior knowledge (Reported on a seven-point Likert scale ranging from non-existent to excellent as a response to how they would describe their knowledge on the topic they were assigned to)<br>- N_clicks: Cumulative clicks (Number of all clicks on search results)<br>- NFC: Need for Cognition (Mean response to 4-item subset of the NFC questionnaire)<br>- UX_usability: Usability (Mean of responses on a seven-point Likert scale to the module "usability"from the meCUE 2.0 questionnaire)<br>- UX_usefulness: Usefulness (Mean of responses on a seven-point Likert scale to the module "usefulness"from the meCUE 2.0 questionnaire)</p>
User study Data: Boosting Intellectual Humility During Search on Debated Topics
<pre><strong>User study data </strong> The following column headers correspond to the following study variables: Intervention = Intervention (CONTROL= control, DUMMYCONTROL = ATI control, PRIME = prime, QUESTIONNAIRE = remind, FULL = reinforce) DV1_AC_Clicks = Attitude confirming clicks DV2_Lowest_Rank = Lowest rank clicked DV3_Dwell_Time = Dwell time DV4_Task_Completion = Task completion time DV5_Cumulative_Clicks = Cumulative clicks IH = Intellectual Humility Ranking = Ranking Topic = Topic rationale = Rationale for behavior (free text) rationale_category = Rationale for behavior (category, one of IH_driven = driven by IH, ranking_driven = ranking, bias_driven = confirmation bias, content/form_driven = content/form, task_driven/unclear = task/unclear)) Att_change = Attitude change Knowledge = Knowledge gain (1 = no knowledge gain, 5 = substantial knowledge gain) NASA.Mental = Reflection on search task, mental demand NASA.Temporal = Reflection on search task, temporal demand NASA.Performance = Reflection on search task, performance NASA.Effort = Reflection on search task, effort NASA.Frustration = Reflection on search task, frustration</pre>
SANTOS Benchmark for Table Union Search
<p>This record contains the datasets released with <a href="https://2023.sigmod.org/">SIGMOD 2023</a> paper entitled "<a href="https://dl.acm.org/doi/10.1145/3588689">SANTOS: Relationship-based Semantic Table Union Search</a>". We release two new tabular benchmarks to evaluate the table union search problem over the data lakes. Furthermore, we also release relabeled ground truth for an existing <a href="https://github.com/RJMillerLab/table-union-search-benchmark">TUS benchmark</a> by taking the binary relationship between the columns into account. Please visit <a href="https://dl.acm.org/doi/10.1145/3588689">our paper</a> for further details.</p> <p>If you use our dataset for your work, please cite our paper as:</p> <p>Aamod Khatiwada, Grace Fan, Roee Shraga, Zixuan Chen, Wolfgang Gatterbauer, Renée J. Miller, and Mirek<br>Riedewald. 2023. SANTOS: Relationship-based Semantic Table Union Search. SIGMOD Conference 2023, ACM</p> <p>@article{DBLP:journals/pacmmod/KhatiwadaFSCGMR23,<br> author = {Aamod Khatiwada and<br> Grace Fan and<br> Roee Shraga and<br> Zixuan Chen and<br> Wolfgang Gatterbauer and<br> Ren{\'{e}}e J. Miller and<br> Mirek Riedewald},<br> title = {{SANTOS:} Relationship-based Semantic Table Union Search},<br> journal = {Proc. {ACM} Manag. Data},<br> volume = {1},<br> number = {1},<br> pages = {9:1--9:25},<br> year = {2023},<br> doi = {10.1145/3588689},<br>}</p> <p>You can find SANTOS implementation at: <a href="https://github.com/northeastern-datalab/santos">https://github.com/northeastern-datalab/santos</a></p> <p>You can find the original TUS benchmark at: <a href="https://github.com/RJMillerLab/table-union-search-benchmark">https://github.com/RJMillerLab/table-union-search-benchmark</a></p> <p>Abstract: Existing techniques for unionable table search define unionability using metadata (tables must have the same or similar schemas) or column-based metrics (for example, the values in a table should be drawn from the same domain). In this work, we introduce the use of semantic relationships between pairs of columns in a table to improve the accuracy of union search. Consequently, we introduce a new notion of unionability that considers relationships between columns, together with the semantics of columns, in a principled way. To do so, we present two new methods to discover semantic relationship between pairs of columns: The first uses an existing knowledge base (KB), the second (which we call a “synthesized KB”) uses knowledge from the data lake itself. We adopt an existing Table Union Search benchmark and present new (open) benchmarks that represent small and large real data lakes. We show that our new unionability search algorithm called SANTOS outperforms a state-of-the-art union search that uses a wide variety of column-based semantics, including word embeddings and regular expressions. We show empirically in all benchmarks that our synthesized KB improves the accuracy of union search by representing relationship semantics that may not be contained in an available KB. This result hints at a promising future of creating a synthesized KBs from data lakes with limited KB coverage and using them for union search.</p>
GWTC-3: Compact Binary Coalescences Observed by LIGO and Virgo During the Second Part of the Third Observing Run — Data Quality Products for GW Searches
<p>This material is part of several data products associated with GWTC-3, the third Gravitational-Wave Transient Catalog from the <a href="https://www.ligo.org/">LIGO</a> Scientific Collaboration, the <a href="https://www.virgo-gw.eu/">Virgo</a> Collaboration, and the <a href="https://gwcenter.icrr.u-tokyo.ac.jp/en/">KAGRA</a> Collaboration. For more information, see the paper (<a href="https://dcc.ligo.org/LIGO-P2000318/public">dcc.ligo.org/LIGO-P2000318/public</a>), the related material linked from this page, and the GWTC-3 data release documentation (<a href="https://www.gw-openscience.org/GWTC-3/">www.gw-openscience.org/GWTC-3/</a>).</p> <p>This release contains two data-quality products that are used by search analyses to help mitigate non-Gaussian noise in the detector data. Gating removes short-duration artifacts from the data by smoothly rolling the affected data to zero. The <a href="https://doi.org/10.1088/2632-2153/abab5f">iDQ glitch likelihood</a> uses machine learning to predict the probability that a non-Gaussian transient is present using information from auxiliary channels.</p> <p><br> <strong>Gating files used in analyses of O3 LIGO data</strong></p> <p>As a pre-processing step, the <a href="https://pycbc.org/">PyCBC</a> search pipeline uses an inverted-Tukey window to mitigate the effect of loud, non-Gaussian features in the data. This is further described in <a href="https://dx.doi.org/10.1088/0264-9381/33/21/215004">Usman <em>et al.</em> 2016</a>.</p> <p>A subset of these times are the times listed in the txt files</p> <ul> <li>H1-O3_GATES_1238166018-31197600.txt</li> <li>L1-O3_GATES_1238166018-31197600.txt</li> </ul> <p>These times in these files were chosen based on auxiliary monitors of overflows in the digital-to-analog converters used to control the positions of the test masses. The gated times (i.e. the time period where the data is zeroed) are time segments where these monitors recorded an overflow were. The central time and suggested half-width of zero time were chosen to fully cover these time seconds. The final gating parameter, the suggested taper time was chosen to be 0.5 to balance the cost of impacting more data with the window function versus introducing additional artifacts into the data.</p> <p>The syntax of the files themselves is</p> <p>{central time} {suggested half-width of zero time} {suggested taper time}</p> <p>with each row containing the parameters of a single gate.</p> <p>The included notebook provides an example of how to read in and apply one of the suggested gates.</p> <p><br> <strong>Renormalized iDQ timeseries</strong></p> <p>The renormalized iDQ timeseries data-quality product is used within the GstLAL search pipeline to generate results for GWTC-3. This data product was found to be statistically helpful in improving data quality within the <a href="https://lscsoft.docs.ligo.org/gstlal/">GstLAL</a> search pipeline. This is further described in <a href="https://arxiv.org/abs/2010.15282">Godwin <em>et al</em>. 2020</a>.</p> <p>This file contains a time series for each LIGO detector related to the probability of a glitch in the strain data given the behavior in analyzed auxiliary channels monitoring the behavior of the detectors and their environment.</p> <ul> <li>H1L1-IDQ_TIMESERIES-1256655642-12905976.h5</li> </ul> <p>The HDF5-formatted file contains two groups, H1 and L1, corresponding to LIGO Hanford and LIGO Livingston, respectively. Each group contains several datasets; the data dataset corresponds to the renormalized iDQ log-likelihoods, as described in <a href="http://doi.org/10.1088/2632-2153/abab5f">Godwin <em>et al</em>. 2020</a>, and the time dataset corresponds to the times associated with the renormalized iDQ log-likelihoods in the data dataset.</p> <p> </p> <p><strong>How to download all files from this page</strong></p> <p>If you would like to download all files on this page, we recommend <a href="https://gitlab.com/dvolgyes/zenodo_get">zenodo_get</a>:</p> <pre><code class="language-bash">pip install zenodo_get zenodo-get RECORD_ID_OR_DOI </code></pre> <p>where the record ID for the most recent version of this page is 5636795 and IDs for other versions can be found in the Versions section at the side of this page.</p> <p> </p> <p>For more general background on gravitational-wave data quality, try the materials from a <a href="https://www.gw-openscience.org/workshops/">GW Open Data Workshop</a> or the <a href="https://doi.org/10.1088/1361-6382/ab685e">guide to LIGO–Virgo data analysis</a>. </p>
Power forecasting literature search
<p>Dataset of metadata of documents returned from a search in Scopus database and saved in .csv format. This dataset is used for a bibliographic analysis (about electricity consumption forecasting) in the PhD thesis of the author.</p> <p>The Scopus search was done on 5th November 2021. The query corresponds to:</p> <p>TITLE-ABS-KEY ( ( *power* OR "*load consumption*" OR "*load forecast*" OR "*load predict*" OR *consumption* ) AND ( *predict* OR *forecast* ) ) AND ( LIMIT-TO ( SUBJAREA , "ENGI" ) OR LIMIT-TO ( SUBJAREA , "ENER" ) OR LIMIT-TO ( SUBJAREA , "COMP" ) )</p> <p>In total, 245421 documents were returned from the search. The dataset contains the metadata that was possible to export and download from these documents.</p>
2019 search and interaction log from the data catalogue: Research Data Australia
<p>In order to provide a better support to user's data discovery activity, we analysed a data search log in order to understand how data seekers interact with a data search system when they search for data. The data search log is from the research data discovery portal: <a href="https://researchdata.edu.au">Research Data Australia (RDA)</a>. RDA is the data discovery service of the Australian Research Data Commons (ARDC). ARDC is supported by the Australian Government through the National Collaborative Research Infrastructure Strategy Program.</p> <p>Please read the research paper "<a href="https://doi.org/10.1108/JD-12-2021-0245">Large-scale Analysis of Query Logs to Profile Users for Dataset Search</a>" for detailed description and analysis of the datasets, and the software "<a href="https://zenodo.org/record/6321621#.Yh79Tt9xUmA">Python code for processing and clustering a data search log</a>" for the data process and analysis.</p> <p>The search log consists of the entire user-front activity log data for the duration of January to December 2019. During this period, the catalogue contained about 150,000 metadata records of datasets.</p> <p>The dataset (2019_search_log_sessioned.txt) was generated from raw log data with following steps:</p> <ul> <li>Remove entries that were likely from machines instead of human users. Those recorded machine activities may result from downstream aggregators who harvested metadata from RDA by directly sending queries to the catalogue URL instead of using the API endpoint.</li> <li>Identify search sessions from a user - a search session includes all activities a user conducts with a search system in order to satisfy a (information/data) search needs. We followed the following steps to identify search sessions. First, we identified a user by IP address, where a unique IP address was considered a single user. We recognise the limitation of this approach, as several users may share the same IP address, however the IP address is the only information available for identifying a user. <br> Past research in log analysis usually apply the following two methods to identify a session: 30 minutes from the same IP address, and/or more than 30 minutes of inactivity between the current activity event and its immediate preceding event. We examined both methods carefully for our log data and concluded that both ended with large unwanted sessions from machine activities. Therefore, we take a brutal approach, by taking only a session from an IP address with a maximum 30 minutes duration.</li> <li>We also removed sessions whose 40% of activities resulted in ’page not found’ or whose activities were all about accessing grants. Within a session, we removed "duplicated" activities that were exactly as their precedent activity with less than one second time span (this could have been a result of reloading a page).</li> </ul> <p>The dataset (id_to_title_subject.csv) lists title and subject headings per record id.</p> <p> </p>
Code and data associated with: Searching the web builds fuller picture of arachnid trade
<p>Data and code used in the paper: Searching the web builds fuller picture of arachnid trade. Throughout the methods we have indicated the stage of analysis each data component was used and the code script connected. We have numbered to code and data supplements to reflect as closely as possible the order in which data generation and summary was undertaken. The following provide additional details linked to each of the data files.</p> <p>Data S1 - Website data: lang = language of the search engine used, ad hoc websites had language described after discovery; engine = the search engine used; page = the page on which the website appeared from the search engine; searchdate = search date in YYYY-mm-dd HH:MM:SS; link = link to the webpage, redacted to protect website identity; reviewdate = date revewied for arachnids being sold and search strategy; sells = whether the website sells arachnids (1 == sells); allow = whether the site explcicilt forbids automated searching (1 == allows, NA when search method was not fully automated, e.g., single page); type = the type of the website (e.g., trade, classified ads); order = whether arachnids where organised in a particular ways; target = a refined target URL to start search; method = the search method chosen, see methods for details; refine = any refinement or filter than could constrain the scope of the website to be searched; spages = the number of pages required to cycle through to cover the entire stock (also separated by ; if multiple cycles where needed or multiple single pages could be easily collected); prelimCheck = whether the website passed initial checks for arachnid selling; notes = any details that might need special attention during searches; webID = code used for subsequent data summary.</p> <p>Data S2 - Raw keyword searches outputs: species keywords. sp = the modern species or genus that a keyword is associated with; page = the number of the page the keyword was detected on; keyw = the exact keyword that was detected; spORgen = whether the keyword was a species binomial or just genus; termsSurrounding = the words surrounding a genus keyword detection (only applies to Data S3); webID = the website ID.</p> <p>Data S3 – Raw keyword searches outputs: genus keywords. sp = the modern species or genus that a keyword is associated with; page = the number of the page the keyword was detected on; keyw = the exact keyword that was detected; spORgen = whether the keyword was a species binomial or just genus; termsSurrounding = the words surrounding a genus keyword detection (multiple detections separated by ;); webID = the website ID.</p> <p>Data S4 - Raw keyword search outputs: temporal sample. sp = the modern species or genus that a keyword is associated with; page = the number of the page the keyword was detected on; keyw = the exact keyword that was detected; spORgen = whether the keyword was a species binomial or just genus; termsSurrounding = the words surrounding a genus keyword detection (multiple detections separated by ;); webID = the website ID; timestamp.parse = the timestamp extracted from the archived web page; year = a simplified timestamp including only the year.</p> <p>Data S5 - LEMIS data used. An arachnid filtered version of <sup>74,75</sup>.</p> <p>Data S6 - CITES trade database data used <sup>76</sup>.</p> <p>Data S7 - CITES appendices data used <sup>77</sup>.</p> <p>Data S8 - IUCN Redlist data used <sup>78</sup>.</p> <p>Data S9 - Compiled final dataset, with data deriving from WSC, Scorpion files, ITIS, WAM and the data collection process. speciesId = a numeric code, one per species; clade = the clade the species belongs to; family = the family the species belongs to; genus = the genus of the species; species = the species epithet; author = the species authority name; year = the species authority year; parentheses = whether parentheses are needed with the authority; distribution = WSC original distribution descriptions; invalid = whether the species is considered valid; source = the species source, either World Spider Catalogue, Scorpion files, ITIS or WAM; accName = the species binomial being used as our accepted name; allNames = the accepted species binomial and all synonyms; allGenera = the accepted genus, and all other genera the species has belonged to at one point; onlineTradeSnap = whether the species was detected via a match to the accName in the snapshot data; onlineTradeSnap_Any = whether the species was detected via any synonym in the snapshot data; onlineTradeSnap_genus = whether the genus was detected via a match to the genus in the snapshot data; onlineTradeSnap_genusAny = whether the genus was detected via any synonym in the snapshot data; onlineTradeTemp = whether the species was detected via a match to the accName in the temporal data; onlineTradeTemp_Any = whether the species was detected via any synonym in the temporal data; onlineTradeTemp_genus = whether the genus was detected via a match to the genus in the temporal data; onlineTradeTemp_genusAny = whether the genus was detected via any synonym in the temporal data; onlineTradeEither = whether the species was detected via a match to the accName in the temporal data or snapshot data; onlineTradeEither_Any = whether the species was detected via any synonym in the temporal data or snapshot data; LEMIStrade = whether the species was detected via a match to the accName in the LEMIS data; LEMIStrade_Any = whether the species was detected via any synonym in the LEMIS data; LEMIStrade_genus = whether the genus was detected via any synonym in the LEMIS data; LEMIStrade_genusAny = whether the genus was detected via any synonym in the LEMIS data; CITEStrade = whether the species was detected via a match to the accName in the CITES trade database data; CITEStrade_Any = whether the species was detected via any synonym in the CITES trade database data; CITEStrade_genus = whether the genus was detected via any synonym in the CITES trade database data; CITEStrade_genusAny = whether the genus was detected via any synonym in the CITES trade database data; CITESapp = the CITES appendix the species is listed under using an exact match to the accName; CITESapp_Any = the CITES appendix the species is listed under using any match to any of the species’ synonyms; redlist = the IUCN Redlist category the species is listed under using an exact match to the accName; redlist_Any = the IUCN Redlist category the species is listed under using any match to any of the species’ synonyms; extactMatchTraded = the species is detected in any of the trade sources via a match to the accName; anyMatchTraded = the species is detected in any of the trade sources via a match to any species’ synonym.</p> <p>Data S10 - Forum listings of “What species are you currently keeping” from an online fora posted between 9th September 2021 and 9th October 2021, to provide an idea of online discussions. Each user with a separate list is provided in a separate tab. Morph_collector is the same as poster1, but the potential cryptic species or morphs are noted separately to make them clearer.</p> <p>Data S11 – Distribution information for spiders. Only two columns used in summaries: accName = the accepted name used throughout summaries; NAME = the country name the spider occurs in.</p> <p>Data S12 - Distribution information for scorpions. species = the accepted name used throughout summaries; NAME = the country name the scorpions occurs in.</p> <p>Code S1 - Search URL Extract.R</p> <p>Code S2 - Retrieve web data.R</p> <p>Code S3 - Temporal Classified Ads.R</p> <p>Code S4 - Keyword Generation.R</p> <p>Code S5 - Keyword Search.R</p> <p>Code S6 - LEMIS filter and summary.R</p> <p>Code S7 - Compiling results.R</p> <p>Code S8 - Summary Figures.R</p> <p>Code S9 - Temporal Figures.R</p> <p>Code S10 - New description figure.R</p> <p>Code S11 - Term exploration.R</p> <p>Code S12 - LEMIS summary and mapping.R</p>
GWTC-2.1: Deep Extended Catalog of Compact Binary Coalescences Observed by LIGO and Virgo During the First Half of the Third Observing Run - Data Quality Products for GW Searches
<p>This material is part of several data products associated with GWTC-2.1, the deep extended catalog of compact binary coalescences observed by the <a href="https://www.ligo.org/">LIGO</a> Scientific Collaboration and the <a href="https://www.virgo-gw.eu/">Virgo</a> Collaboration during the first half of the third observing run. For further information, see the paper (<a href="https://dcc.ligo.org/LIGO-P2100063/public">dcc.ligo.org/LIGO-P2100063/public</a>), the related material linked from this page, and the GWTC-2.1 data release documentation (<a href="https://www.gw-openscience.org/GWTC-2.1/">www.gw-openscience.org/GWTC-2.1/</a>).</p> <p>This release contains data quality products that are used by search analyses to help mitigate non-Gaussian noise in the detector data.</p> <p><strong>Renormalized iDQ timeseries</strong></p> <p>This release contains the renormalized iDQ timeseries data quality product used within the GstLAL search to generate results for GWTC-2.1 as described in <a href="https://arxiv.org/abs/2010.15282">Goodwin <em>et al</em>. 2020</a>. This data product was found to be statistically helpful in improving data quality within the GstLAL search. For further information about iDQ see <a href="https://iopscience.iop.org/article/10.1088/2632-2153/abab5f">Essick <em>et al</em>. 2020</a>.</p> <p>The file </p> <ul> <li>H1L1-IDQ_TIMESERIES-1238166018-15843600.h5</li> </ul> <p>contains a time series for each LIGO detector related to the probability of a glitch in the strain data given the behavior in the analyzed auxiliary channels which monitor the behavior of the detectors and their environment.</p> <p>The HDF5-formatted file contains two groups, H1 and L1, corresponding to LIGO Hanford and LIGO Livingston, respectively. Each group contains several datasets; the data dataset corresponds to the renormalized iDQ log-likelihoods, as described in Godwin <em>et al</em>. 2020, and the time dataset corresponds to the times associated with the renormalized iDQ log-likelihoods in the data dataset.</p> <p> </p> <p>For more general background on gravitational-wave data quality, try the materials from a <a href="https://www.gw-openscience.org/workshops/">GW Open Data Workshop</a> or the guide to <a href="https://doi.org/10.1088/1361-6382/ab685e">LIGO-Virgo data analysis</a>.</p>
GERDAT011 Literature search for publication - Geriatric assessment in the management of older patients with cancer – a systematic review (update).xlsx
<p>Search data belonging to the publication Geriatric assessment in the management of older patients with cancer – a systematic review (update)</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.