Search results for "Rating system"
showing 10 items of 139 documents
Tuning Java to Run Interactive Multiagent Simulations over Jason
2010
Java-based simulation environments are currently used by many multiagent systems (MAS), since they mainly provide portability as well as an interesting reduction of the development cost. However, this kind of MAS are rarely considered when developing interactive applications with time response constraints. This paper analyses the performance provided by Jason, a well-known Java-based MAS platform, as a suitable framework for developing interactive multiagent simulations. We show how to tune both the heap size and the garbage collection of the Java Virtual Machine in order to achieve a good performance while executing a simple locomotion benchmark based on crowd simulations. Furthermore, the…
Compiler Driven Automatic Kernel Context Migration for Heterogeneous Computing
2014
Computer systems provide different heterogeneous resources (e.g., GPUs, DSPs and FPGAs) that accelerate applications and that can reduce the energy consumption by using them. Usually, these resources have an isolated memory and a require target specific code to be written. There exist tools that can automatically generate target specific codes for program parts, so-called kernels. The data objects required for a target kernel execution need to be moved to the target resource memory. It is the programmers' responsibility to serialize these data objects used in the kernel and to copy them to or from the resource's memory. Typically, the programmer writes his own serializing function or uses e…
FINDUS: An Open-Source 3D Printable Liquid-Handling Workstation for Laboratory Automation in Life Sciences
2020
3D-printed laboratory devices can enable ambitious research purposes even at a low-budget level. To follow this trend, here we describe the construction, calibration, and usage of the FINDUS (Fully Integrable Noncommercial Dispensing Utility System). We report the successful 3D printing and assembly of a liquid-handling workstation for less than $400. Using this setup, we achieve reliable and flexible liquid-dispensing automation with relative pipetting errors of less than 0.3%. We show our system is well suited for several showcase applications from both the biology and chemistry fields. In support of the open-source spirit, we make all 3D models, assembly instructions, and source code ava…
Increasing GP Computing Power for Free via Desktop GRID Computing and Virtualization
2009
This paper presents how it is possible to increase the Genetic Programming (GP) Computing Power (CP) for free, via Volunteer Computing (VC), using the well known framework BOINC plus a new ``virtualization'' layer which adds all the benefits from the virtualization paradigm. Two different experiments, employing a standard GP tool and a complex GP system, are performed --with distributed PCs over several cities-- to show the free achieved CP by means of VC, without the necessity of modifying or adapting the original GP source code. The methodology can be easily extended to Evolutionary Algorithms (EAs).
Lone Star Stack: Architecture of a Disk-Based Archival System
2014
The need for huge storage systems rises with the ever growing creation of data. With growing capacities and shrinking prices, "write once read sometimes" workloads become more common. New data is constantly added, rarely updated or deleted, and every stored byte might be read at any time - a common pattern for digital archives or big data scenarios. We present the Lone Star Stack, a disk based archival storage system building block that is optimized for high reliability and energy efficiency. It provides a POSIX file system interface that uses flash based storage for write-offloading and metadata and the disk-based Lone Star RAID for user data storage. The RAID attempts to spin down disks a…
LoneStar RAID
2016
The need for huge storage archives rises with the ever growing creation of data. With today’s big data and data analytics applications, some of these huge archives become active in the sense that all stored data can be accessed at any time. Running and evolving these archives is a constant tradeoff between performance, capacity, and price. We present the LoneStar RAID, a disk-based storage architecture, which focuses on high reliability, low energy consumption, and cheap reads. It is designed for MAID systems with up to hundreds of disk drives per server and is optimized for “write once, read sometimes” workloads. We use dedicated data and parity disks, and export the data disks as individu…
Simulation of BSDEs with jumps by Wiener Chaos Expansion
2016
International audience; We present an algorithm to solve BSDEs with jumps based on Wiener Chaos Expansion and Picard's iterations. This paper extends the results given in Briand-Labart (2014) to the case of BSDEs with jumps. We get a forward scheme where the conditional expectations are easily computed thanks to chaos decomposition formulas. Concerning the error, we derive explicit bounds with respect to the number of chaos, the discretization time step and the number of Monte Carlo simulations. We also present numerical experiments. We obtain very encouraging results in terms of speed and accuracy.
Additional file 4 of Development and validation of prediction model to estimate 10-year risk of all-cause mortality using modern statistical learning…
2021
Additional file 4. Distributions of the variables at baseline before and after multiple imputations.
Data for: Decorous Combinatorial Lower Bounds for Row Layout Problems
2021
Files of the new randomly generated instancesnlengths of the departmentsmatrix with the transport weights THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE
Deformation Quantization by Moyal Star-Product and Stratonovich Chaos
2012
We make a deformation quantization by Moyal star-product on a space of functions endowed with the normalized Wick product and where Stratonovich chaos are well defined.