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.
9
datasets available to search
ShareScore release 0.9.0
Dataset results
9 results for “computational logic”
Computational Artifacts for the Paper "Are Noise-resilient Logical Timers useful for Performance Analysis?"
<p>This repository contains computational artifacts for the paper "Are Noise-resilient Logical Timers useful for Performance Analysis?" to be submitted to <a href="https://sc-protools-workshop.github.io/protools24/">ProTools@SC24.</a></p> <p>See also the <a href="https://sc24.supercomputing.org/program/papers/reproducibility-initiative/">SC24 reproducibility initiative.</a></p> <p> </p> <p>Contains</p> <ul> <li>Source code of <a href="https://doi.org/10.5281/zenodo.10822140">Score-P </a>, including implementation of the logical clock algorithm from the paper</li> <li>Software to post-process the Cube files generated by measurements</li> <li>Benchmarks <ul> <li>Source code</li> <li>Configuration skripts</li> <li>Measurement results, including output logs, Cube files</li> <li>Post-processing skripts and results</li> </ul> </li> </ul> <p> </p>
Supplementary materials for the paper "Computing with liquid crystal fingers: Models of geometric and logical computation." Physical Review E 84.6 (2011): 061702.
<p>When a voltage is applied across a thin layer of cholesteric liquid crystal, fingers of cholesteric alignment can form and propagate in the layer. In computer simulation, based on experimental laboratory results, we demonstrate that these cholesteric fingers can solve selected problems of computational geometry, logic, and arithmetics. We show that branching fingers approximate a planar Voronoi diagram, and nonbranching fingers produce a convex subdivision of concave polygons. We also provide a detailed blueprint and simulation of a one-bit half-adder functioning on the principles of collision-based computing, where the implementation is via collision of liquid crystal fingers with obstacles and other fingers.</p>
Data and code for "Programmable Trans-splicing Riboregulators for Complex Cellular Logic Computation"
<p>Split-intron ENabled Trans-splicing Riboregulators (SENTR) is a class of programmable riboregulators based on group I intron mediated trans-splicing. SENTR functions by seperating target mRNA into two strands, 5'RNA and 3'RNA, and rejoin them through RNA splicing. We fused de-novo designed external guide sequences (EGSs) to the intron halves, to improve the efficiency, programmability, predictability with machine-learning, and orthogonality of conventional split intron design. This repository deposits:</p> <ol> <li>The source data file for the paper "Programmable Trans-splicing Riboregulators for Complex Cellular Logic Computation"</li> <li>The NUPACK scripts to design the EGS library, orthogonal EGS library and other EGS structures for mRNA sensing and ribocomputing</li> <li>The sequences, performance data, and codes for machine-learning</li> </ol>
Comparison between Parma Polyhedra Library and ParetoLib for computing the validity domain of a parametric Signal Temporal Logic (STL) expression
<p>Comparison between Parma Polyhedra Library and ParetoLib for computing the validity domain of a parametric Signal Temporal Logic (STL) expression. The code and dataset in this folder is related to the example 5 in section 2 of paper "Mining of Extended Signal Temporal Logic Specifications with ParetoLib 2.0" in the journal Formal Methods and System Design.</p>
Computation Tree Logic guided Reactive Program Repair
<p>This is the supporting data for OOPSLA24 submission: Computation Tree Logic guided Reactive Program Repair. </p> <p>It includes the source code and benchmarks presented in the paper. </p>
Computational Logic with Square Rings of Nanomagnets
<p>Open access data set for manuscript " Computational Logic with Square Rings of Nanomagnets" published in Nanotechnology 2018.</p>
Data representing logical computations along four stages in the brain
<p>A key challenge in neuroimaging remains to understand where, when and now particularly how human brain networks compute over sensory inputs to achieve behavior. To study such dynamic algorithms from mass neural signals, we recorded the magnetoencephalographic (MEG) activity of participants who resolved the classic XOR, OR and AND functions as overt behavioral tasks (N = 10 participants/task, N-of-1 replications). Each function requires a different computation over the same inputs to produce the task- specific behavioral outputs. In each task, we found that source-localized MEG activity progresses through four computational stages identified within individual participants: (1) initial contra-lateral representation of each visual input in occipital cortex, (2) a joint linearly combined representation of both inputs in midline occipital cortex and right fusiform gyrus, followed by (3) nonlinear task-dependent input integration in temporal-parietal cortex and finally (4) behavioral response representation in post-central gyrus. We demonstrate the specific dynamics of each computation at the level of individual sources. The spatio-temporal patterns of the first two computations are similar across the three tasks; the last two computations are task specific. Our results therefore reveal where, when and how dynamic network algorithms perform different computations over the same inputs to produce different behaviors.</p>
Data representing logical computations along four stages in the brain
Open the record for dataset details and reuse information.
Computation Tree Logic guided Program Repair With Precise Loop Summaries
<div> <p>This is the supporting data for ICSE25 submission: Computation Tree Logic guided Program Repair With Precise Loop Summaries. </p> <p>It includes the source code and benchmarks presented in the paper. </p> <p> </p> </div>
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.