We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
The powerful yet conceptually simple notions of Finite-Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a powerful framework for the analysis and visualiza...
Christoph Garth, Alexander Wiebel, Xavier Tricoche...
Dynamic system reconfiguration techniques are presented that can enable the systematic evolution of software systems due to unanticipated changes in specification or requirements. ...
The use of DNA microarrays for the analysis of complex biological samples is becoming a mainstream part of biomedical research. One of the most commonly used methods compares the ...
Andrew B. Goryachev, Pascale F. Macgregor, Aled M....
A bioinformatics analysis pipeline is often highly elaborate, due to the inherent complexity of biological systems and the variety and size of laboratory publications would be high...
Marco Roos, Sean Bechhofer, Jun Zhao, Paolo Missie...