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,782
datasets available to search
ShareScore release 0.7.1
Dataset results
1,782 results for “algorithms”
Performance results of different scheduling algorithms used in the simulation of a modern game engine
<p><strong>Performance results of different scheduling algorithms used in the simulation of a modern game engine</strong></p> <p>These results are a companion to the paper entitled "<em>Exploring scheduling algorithms for parallel task graphs: a modern game engine case study</em>" by M. Regragui et al.</p> <p><strong>General information</strong></p> <p>This dataset contains raw outputs and scripts to visualize and analyze the scheduling results from our game engine simulator.<br> The result analysis can be directly reproduced using the script run_analysis.sh. A series of Jupyter Notebook files are also available to help visualize the results.</p> <p><strong>File information</strong></p> <p>- All Scenario*.ipynb files contain python scripts to visualize and analyze the simulation results.<br> - The Scenario*.py files contain python scripts that can be run directly with Jupyter Notebook.<br> - The requirements.txt file contains the names and versions of python packages necessary to reproduce the analysis.<br> - The run_analysis.sh file contains a bash script to install the required python packages and run the Scenario*.py scripts.</p> <p>The results are organized in five folders:</p> <p>1. Result_1 contains the results for Scenario 1 generated using file input_scenario_1.txt.<br> 2. Result_2 contains the results for Scenario 2 generated using file input_scenario_2.txt.<br> 3. Result_3 contains the results for Scenario 3 generated using file input_scenario_3.txt.<br> 4. Result_CP_1 contains the results for the critical path of Scenarios 1 and 2 generated using file input_CP_scenario_1.txt.<br> 5. Result_CP_3 contains the results for the critical path of Scenario 3 generated using file input_CP_scenario_3.txt.</p> <p>Each result file (e.g., HLF_NonSorted_Random_1_200_10.txt) contains 200 lines representing information of the 200 frames that were simulated. Each line contains four values: the frame number, the duration of the frame (in microseconds), a critical path estimation for the previous frame (in microseconds), and the load parameter (value between 0 and 1).</p> <p>The outputs of this analysis include some PDF files representing the figures in the paper (in order) and some CSV files representing the values shown in tables. The standard output shows the p-values computed in parts of the statistical analysis.</p> <p><strong>Software and hardware information</strong></p> <p>The simulation results were generated on an Intel Core i7-1185G7 processor, with 32 GB of LPDDR4 RAM (3200 MHz). The machine ran on Ubuntu 20.04.3 LTS (5.14.0-1034-oem), and g++ 9.4.0 was used for the simulator's compilation (-O3 flag).</p> <p>The results were analyzed using Python 3.8.10, pip 20.0.2 and jupyter-notebook 6.0.3. The following packages and their respective versions were used:</p> <p>- pandas 1.3.2<br> - numpy 1.21.2<br> - matplotlib 3.4.3<br> - seaborn 0.11.2<br> - scipy 1.7.1<br> - pytz 2019.3<br> - python-dateutil 2.7.3<br> - kiwisolver 1.3.2 <br> - pyparsing 2.4.7 <br> - cycler 0.10.0 <br> - Pillow 7.0.0<br> - six 1.14.0 </p> <p><strong>Simulation information</strong></p> <p>Simulation results were generated from 4 to 20 resources. Each configuration was run with 50 different RNG seeds (1 up to 50).</p> <p>Each simulation is composed of 200 frames. The load parameter (lag) starts at zero and increases by 0.01 with each frame up to a value equal to 100% in frame 101. After that, the load parameter starts to decrease in the same rhythm down to 0.01 in frame 200.</p> <p><strong>Algorithms abbreviation in presentation order</strong></p> <p>FIFO serves as the baseline for comparisons.</p> <p>1. FIFO: First In First Out.<br> 2. LPT: Longest Processing Time First.<br> 3. SPT: Shortest Processing Time First.<br> 4. SLPT: LPT at a subtask level.<br> 5. SSPT: SPT at a subtask level.<br> 6. HRRN: Highest Response Ratio Next. <br> 7. WT: Longest Waiting Time First.<br> 8. HLF: Hu's Level First with unitary processing time of each task.<br> 9. HLFET: HLF with estimated times.<br> 10. CG: Coffman-Graham's Algorithm.<br> 11. DCP: Dynamic Critical Path Priority.</p> <p><strong>Metrics</strong></p> <p>* SF: slowest frame (maximum frame execution time)<br> * DF: number of delayed frames (with 16.667 ms as the due date)<br> * CS: cumulative slowdown (with 16.667 ms as the due date)<br> </p>
Characterization data for the manuscript: "Using genetic algorithms to systematically improve the synthesis conditions of Al-PMOF"
<p>This entry contains characterization data for the manuscript "Using genetic algorithms to systematically improve the synthesis conditions of Al-PMOF", which we exported from the electronic lab notebook (ELN).</p> <p>To visualize the data in this dataset: <a href="https://www.cheminfo.org/flavor/zenodo/index.html?id=6620502">open entry</a></p>
Ship tracks detected using machine learning algorithm
<p>The filtered, vector ship tracks detected using the linked machine learning algorithm and derived from the linked segmentation masks. Each dataset contains the date and other related data for each shiptrack polygon. The `_geo` dataset contains the polygons on a lat/lon coordinate system while the other provides the polygons on the MODIS swath (pixel) indices.</p>
Sentiment Analysis of RUU PDP with Naive Bayes, Support Vector Machine, and Random Forest Classification Algorithm
<p>Dataset from the results of data crawling via Twitter which discusses the Rancangan Undang Undang Pelindungan Data Pribadi to be used in the sentiment analysis process. The dataset is divided into several parts according to the process executed on RapidMiner.</p>
Figure 5 in Evaluation of geostatistical method and hybrid Artificial Neural Network with imperialist competitive algorithm for predicting distribution pattern of Tetranychus urticae (Acari: Tetranychidae) in cucumber field of Behbahan, Iran
Figure 5. Moving colonies to imperialist in culture and language axes (AtashpazGargari et al. 2008).
Figure 2 in Evaluation of geostatistical method and hybrid Artificial Neural Network with imperialist competitive algorithm for predicting distribution pattern of Tetranychus urticae (Acari: Tetranychidae) in cucumber field of Behbahan, Iran
Figure 2. Generalized semivariogram showing the range of spatial dependence, nugget effect (C0) variability associated with spatial dependence (C), and sill (C + C0).
Figure 5 in Hybrid neural network with genetic algorithms for predicting distribution pattern of Tetranychus urticae (Acari: Tetranychidae) in cucumbers field of Ramhormoz, Iran
Figure 5. Tetranychus urticae distribution maps in actual (b, d and f) and classified conditions by MLPNN (c, e and a). The maps of a, c, e and b, d, f have been drawn according to economic threshold of 4, 8 and 12, respectively.
Assessing predictive performance of supervised machine learning algorithms for a diamond pricing model
<p>The diamond is 58 times harder than any other mineral in the world, and its elegance as a jewel has long been appreciated. Forecasting diamond prices is challenging due to nonlinearity in important features such as carat, cut, clarity, table, and depth. Against this backdrop, the study conducted a comparative analysis of the performance of multiple supervised machine learning models (regressors and classifiers) in predicting diamond prices. Eight supervised machine learning algorithms were evaluated in this work including Multiple Linear Regression, Linear Discriminant Analysis, eXtreme Gradient Boosting, Random Forest, k-Nearest Neighbors, Support Vector Machines, Boosted Regression and Classification Trees, and Multi-Layer Perceptron. The analysis is based on data preprocessing, exploratory data analysis (EDA), training the aforementioned models, assessing their accuracy, and interpreting their results. Based on the performance metrics values and analysis, it was discovered that eXtreme Gradient Boosting was the most optimal algorithm in both classification and regression, with a R<sup>2</sup> score of 97.45% and an Accuracy value of 74.28%. As a result, eXtreme Gradient Boosting was recommended as the optimal regressor and classifier for forecasting the price of a diamond specimen.</p>
BRAIN Journal - Lamport's algorithm - Figure 2 from paper "Optimization of Distributed Systems Using Multi-Agent Systems with Virtual Time"
<p>Figure 2. Lamport’s algorithm</p> <p>In order to synchronize logical clocks, Lamport [3] defined the relationship “happened before” (preceded) which implies that the expression 1 2 a → a means “ 1 a occurred before 2 a ”, and it means that all the processes coincide in the fact that 1 a took place first, and subsequently 2 a took place. This relation can be directly observed in two situations (figure 2): 1. If two events happen during the same process, the order of the happening is indicated by the common clock; 2. When two processes communicate through a message, the event that corresponds to sending the precise message always happens before the event of receiving it (i.e. the message). If two events, 1 a and 2 a , are produced in different processes that do not exchange messages (neither directly nor indirectly), then it is not certain if 1 2 a → a or 2 1 a → a . In this case it is said that these events are competitive, which means that it is not known which one happened first (and it is not a must-know thing either).</p>
Figure 2. Lamport's algorithm-Optimization of Distributed Systems Using Multi-Agent Systems with Virtual Time
<p>In order to synchronize logical clocks, Lamport [3] defined the relationship “happened<br> before” (preceded) which implies that the expression 1 2 a → a means “ 1 a occurred before 2 a ”, and it<br> means that all the processes coincide in the fact that 1 a took place first, and subsequently 2 a took<br> place. This relation can be directly observed in two situations (figure 2):<br> 1. If two events happen during the same process, the order of the happening is indicated by<br> the common clock;<br> 2. When two processes communicate through a message, the event that corresponds to<br> sending the precise message always happens before the event of receiving it (i.e. the<br> message).</p>
Figure 1. Cristian's Algorithm-Optimization of Distributed Systems Using Multi-Agent Systems with Virtual Time
<p>Cristian’s Algorithm (figure 1) is a method for clock synchronization which can be used in<br> many fields of distributive computer science. It suffers, though, in implementations using a single<br> server, making it unsuitable for many distributive applications where redundancy may be crucial.</p>
Figure 9. Path planning with algorithm of potential fields
<p>Since the motion trajectory of each robot is divided into several median points that the robot<br> should reach them one by one in a sequence the output obtained after the execution of AI will be a<br> set of position and velocity vectors. So the task of the trajectory will be to guide the robots through<br> the opponents to reach the destination. The routine used for this purpose is the potential field<br> method (also an alternative new method is in progress which models the robot motion through<br> opponents same as the flowing of a bulk of water through obstacles). In this method different<br> electrical charges are assigned to our robots, opponents and the ball. Then by calculating the<br> potential field of this system of charges a path will be suggested for the robot. At a higher level,<br> predictions can be used to anticipate the position of the opponents and make better decisions in<br> order to reach the desired vector.</p>
Figure 8. Artificial Intelligence Algorithm-Design and Implementation of an Autonomous Humanoid Robot Based on Fuzzy Rule-Based Motion Controller
<p>This module receives information from Artificial Intelligent unit. Total functions about<br> Robot Behavior such as stability motors actions, robot path planning, turn camera, walking,<br> shooting, dribbling; motion and etc are controlled in this section.</p>
Data format figures-DATA MINING LEARNING MODELS AND ALGORITHMS ON A SCADA SYSTEM DATA REPOSITORY
<p>The original data set included noisy, missing and inconsistent data. Data<br> preprocessing improved the quality of the data and facilitated e±cient data<br> mining tasks.<br> Before the experiment, we prepared data suitable to next operation as<br> following steps:<br> ² Delete or replace missing values;<br> ² Delete redundant properties (columns);<br> ² Data Transformation;<br> ² Data Discretization;<br> ² Export data to a required .ar® or .csv format ¯le [11].<br> The original and modi¯ed formats of data set are shown in Figure 1 and<br> Figure 2.<br> Data visualization is also a very useful technique because it helps to deter-<br> mine the di±culty of the learning problem. We visualized with Weka single<br> attributes (1-d) and pairs of attributes (2-d). The ¯gure 3 shows the variation<br> of the temperature in time.</p>
Figure 3. Data visualization-DATA MINING LEARNING MODELS AND ALGORITHMS ON A SCADA SYSTEM DATA REPOSITORY
<p>Data visualization is also a very useful technique because it helps to deter-<br> mine the di±culty of the learning problem. We visualized with Weka single<br> attributes (1-d) and pairs of attributes (2-d). The ¯gure 3 shows the variation<br> of the temperature in time.</p>
(c) simulation on Repast: after queen adaptive development-MODELING SELF-ORGANIZING SYSTEMS WITH SOCIAL INSECTS ALGORITHMS
<p>On figures (b) and (c), simulations on RePast [11, 16, 18] are<br> provided at successive times. The last figure shows the adaptive mechanism<br> of the queen which grows with time according to the material density around<br> it, like in natural observations.</p>
Figure 7: Cultural equipment dynamics modeling-MODELING SELF-ORGANIZING SYSTEMS WITH SOCIAL INSECTS ALGORITHMS
<p>The multi-template modelling can be used to model cultural equipment<br> dynamics as described in figure 7. On this figure, we associate a queen to each<br> cultural center (cinema, theatre, ...). Each queen will emit many pheromon<br> templates, each template is associated to a specific criterium (according to age,<br> sex, ...). Initially, we put the material in the residential place. Each material<br> has some characteristics, corresponding to the people living in this residential<br> area. The simulation shows the self-organization processus as the result of the<br> set of the attractive effect of all the centers and all the templates.</p>
Figure 4: Complexity of geographical space with respect of emergent organizations-MODELING SELF-ORGANIZING SYSTEMS WITH SOCIAL INSECTS ALGORITHMS
<p>The applications we focus on in the models that we will propose in the<br> following, concerns specifically the multi-center (or multi-organizational) phenomona<br> inside urban development. As an artificial ecosystem, the city development<br> has to deal with many challenges, specifically for sustainable development,<br> mixing economical, social and environmental aspects. The decentralized<br> methodology proposed in the following allows to deal with multi-criteria problems,<br> leading to propose a decision making assistance, based on simulation<br> analysis.</p>
Figure 3: AntCo2 algorithm for graph clustering: on the left the output of the computation on a communication network; on the right the output on a regular grid
<p>Social and human developments are typical complex systems. Urban development<br> and dynamics are the perfect illustration of systems where spatial<br> emergence, self-organization and structural interaction between the system<br> and its components occur [3, 4, 5, 6]. In figure 4, we concentrate on the emergence<br> of organizational systems from geographical systems.</p>
Figure 1: Complex spatial organizational model-MODELING SELF-ORGANIZING SYSTEMS WITH SOCIAL INSECTS ALGORITHMS
<p>On Figure 1, we describe a two-level model of spatial self-organizations with<br> interactions in both directions between these two levels: the emergence of organizations<br> from entities interactions but also the feed-back process describing<br> how organizations are regulating their own entities.</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.