Getting started

Latest projects

  • archetypes (2017-07-12 13:21)

    Modelling and Formal Verification of Neuronal Archetypes Coupling

    Some specific neuronal graphs have biologically relevant structures and behaviors and we call them archetypes. Six of them (simple series, series with multiple outputs, parallel composition, negative loop, inhibition of a behavior, and contralateral inhibition) are characterized and validated using formal methods. Furthermore, we tackle the next logical step and proceed to the study of the properties of their couplings. For this purpose, we rely on Leaky Integrate and Fire neuron modeling and we use the synchronous programming language Lustre to implement the neuronal archetypes and to formalize their expected properties. Then, we exploit an associated model checker called kind2 to automatically validate these behaviors. We show that, when the archetypes are coupled, either these behaviors are slightly modulated or they give way to a brand new behavior. We can also observe that different archetype couplings can give rise to strictly identical behaviors....

  • consensus clustering (2015-05-09 21:54)
  • GRADES (Graph-based and RAndom DiscrEte-event Simulator) (2013-10-16 09:51)

    GRADES allows implementing in Java (non)deterministic network structures and dynamics with explicit timings. Graph structures (specific or usual: Erdös-Rényi, small-world...) can be generated providing usual metric outputs (min/max path lengths…). Random variables are simulated by replicable pseudorandom number generators. Discrete-events are used for modeling precise timed state changes of input-output systems. Simulation viewing tools allow observing and printing structures and dynamics. Simulations can be replicated and summarized through usual statistics (confidence intervals, averages…). Multithreaded simulation can be achieved for parallel process modeling or simple execution time reduction....

  • High Performance Graph for Java (2013-07-04 13:35) The Grph project proposes a Java library for the manipulation of graphs. The main design objectives of Grph are to make it:
    • computationally efficient (use of parallelism, caching, adequate data structures, native code, etc);
    • memory efficient (use of Java primitives: it handles "Grph" only)...
  • Vapor (2013-06-20 12:42)
Redmine Appliance - Powered by TurnKey Linux