The central idea of the Heterogeneous Tool Set (HETS) is to provide an open source general framework for formal methods integration and proof management. One can think of HETS acting like a motherboard where different expansion cards can be plugged in, the expansion cards here being individual logics (with their analysis and proof tools) as well as logic translations. Individual logics and thei...

BACKGROUND AND PURPOSE A reliable quantitative technique for measuring arteriovenous (AV) shunt in vascular malformations is not currently available. Here, we evaluated the hypothesis that continuous arterial spin-labeled (CASL) perfusion MR imaging can be used to detect and measure AV shunt in patients with arteriovenous malformations (AVMs). MATERIALS AND METHODS CASL perfusion MR imaging w...

Complex adaptive systems (CAS) exhibit properties beyond complex systems such as self-organization, adaptability and modularity. Designing models of CAS is typically a nontrivial task as many components are made up of subcomponents and rely on a large number of complex interactions. Studying features of these models also requires specific work for each system. Moreover, running these models as ...

A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization Paul Armand & Riadh Omheni To cite this article: Paul Armand & Riadh Omheni (2015): A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization, Optimization Methods and Software, DOI: 10.1080/10556788.2015.1025401 ...

The computation of Lagrangian invariant subspaces of a Hamiltonian matrix, or the closely related task of solving algebraic Riccati equations, is an important issue in linear optimal control, stochastic control and H∞-design. We propose a new class of Riemannian Newton methods that allows to compute isolated Lagrangian invariant subspaces of a Hamiltonian matrix. The algorithm implements a vari...

We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is further combined with an evolutionary algorithm to a sequential hybrid approach. Experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document the advant...

We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is further combined with an evolutionary algorithm to a sequential hybrid approach. Thorough experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document t...