• Research softwareclose
• Hal-Diderot close
• Hyper Article en Ligne - Sciences de l'Homme et de la Société close

Python code to simulate formose reaction in osmotically coupled droplets, and associated data, related to the article "Emergent fitness and ecological dynamics of compartmentalised autocatalytic chemical reactions" by Heng Lu, Alex Blokhuis, Rebecca Turk-MacLeod, Jayaprakash Karuppusamy, Andrea Franconi, Gabrielle Woronoff, Cyrille Jeancolas, Afshin Abrishamkar, Estelle Loire, Fabien Ferrage, Philippe Pelupessy, Ludovic Jullien, Eörs Szathmary, Philippe Nghe and Andrew. D. Griffiths This software is distributed under the Creative Commons International 4.0 License.

This repository contains the formalization of a transient stack and its iterator, as described in the CPP'22 paper "Specification and Verification of a Transient Stack".

KINEBEC is a simulation code developed in C dedicated to classical and quantum Boltzmann equations in 2D and 3D in velocity.This code is based on spectral methods in velocity and can uses MPI, OpenMP or CUDA tools for speeding up its execution and for managing large data.More details about the involved numerical methods can be found in the following papers:* Mouhot & Pareschi: *Fast algorithms for computing the Boltzmann collision operator*, Math. Comput. **256**-75 (2006), pp. 1833-1852* Filbet, Hu & Jin: *A numerical scheme for the quantum Boltzmann equation with stiff*, collision terms, Math. Model. Numer. Anal. **46** (2012), pp. 443-463

An Open Source System, Energy and Network Monitoring Tools at the O/S level

This is a generic C++ library that handles data dependence graphs (DDG) for optimising compilation. It is built on top of the LEDA graph library (from algorithmic-solutions company). Our graph library is specially though for research purposes where people are willing to make quick, robust and modular implementations of code optimisation techniques for basic blocks and simple innermost loops (modeled by regular mono-dimensional data dependences). We manage directed acyclic graphs (DAGs) for basic blocks and cyclic graphs for innermost loops. The user is able to take advantage of many standard algorithms for graphs. Also, numerous algorithms on data dependence graphs are implemented. It is also possible to configure the library for different instruction set architectures, and multiple register types.