Property preserving abstractions for the verification of concurrent systems

We study property preserving transformations for reactive systems. The main idea is the use of simulations parameterized by Galois connections (, ), relating the lattices of properties of two systems. We propose and study a notion of preservation of properties expressed by formulas of a logic, by a function mapping sets of states of a systemS into sets of states of a systemS'. We give results on the preservation of properties expressed in sublanguages of the branching time -calculus when two systemsS andS' are related via (, )-simulations. They can be used to verify a property for a system by verifying the same property on a simpler system which is an abstraction of it. We show also under which conditions abstraction of concurrent systems can be computed from the abstraction of their components. This allows a compositional application of the proposed verification method.This is a revised version of the papers [2] and [16]; the results are fully developed in [28].This work was partially supported by ESPRIT Basic Research Action REACT.Verimag is a joint laboratory of CNRS, Institut National Polytechnique de Grenoble, Université J. Fourier and Verilog SA associated with IMAG.     

On packing shortest cycles in graphs

We study the problems to find a maximum packing of shortest edge-disjoint cycles in a graph of given girth g (g-ESCP) and its vertex-disjoint analogue g-VSCP. In the case g=3, Caprara and Rizzi (2001) have shown that g-ESCP can be solved in polynomial time for graphs with maximum degree 4, but is APX-hard for graphs with maximum degree 5, while g-VSCP can be solved in polynomial time for graphs with maximum degree 3, but is APX-hard for graphs with maximum degree 4. For g∈{4,5}, we show that both problems allow polynomial time algorithms for instances with maximum degree 3, but are APX-hard for instances with maximum degree 4. For each g?6, both problems are APX-hard already for graphs with maximum degree 3.     

Betriebsinformatik und Wirtschaftsinformatik als notwendige anwendungsbezogene Ergänzung einer allgemeinen Informatik – Vorschläge zur Verbesserung der akademischen Ausbildung auf dem Gebiet der automatisierten Datenverarbeitung in der Bundesrepublik Deutschland

Zusammenfassung  Nachdruck eines Aufsatzes aus elektronische datenverarbeitung 11(11)1969:544–548. This article is also available in English via and : Grochla E (2008) Corporate Information Systems Engineering and Business and Information Systems Engineering as a Necessary Application-Oriented Extension of General Computer Science – Proposals for Enhancing Academic Education in the Field of Automated Data Processing in the Federal Republic of Germany. Bus Inf Syst Eng. doi .

---

     

Parsing human skeletons in an operating room

Multiple human pose estimation is an important yet challenging problem. In an operating room (OR) environment, the 3D body poses of surgeons and medical staff can provide important clues for surgical workflow analysis. For that purpose, we propose an algorithm for localizing and recovering body poses of multiple human in an OR environment under a multi-camera setup. Our model builds on 3D Pictorial Structures and 2D body part localization across all camera views, using convolutional neural networks (ConvNets). To evaluate our algorithm, we introduce a dataset captured in a real OR environment. Our dataset is unique, challenging and publicly available with annotated ground truths. Our proposed algorithm yields to promising pose estimation results on this dataset.     

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the various components through a regular control language. For the class of languages that are generated by RPCGSs with constant communication complexity we derive a characterisation in terms of a restricted type of freely rewriting restarting automaton. From this characterisation we obtain that these languages are semi-linear, and that for RPCGSs with constant communication complexity, the centralised variant has the same generative power as the non-centralised variant.     

Color image segmentation in HSI space for automotive applications

This article presents a method for classifying color points for automotive applications in the Hue Saturation Intensity (HSI) Space based on the distances between their projections onto the SI plane. Firstly the HSI Space is analyzed in detail. Secondly the projection of image points from a typical automotive scene onto the SI plane is shown. The minimal classes relevant for driver assistance applications are derived. The requirements for the classification of the points into those classes are obtained. Several weighting functions are proposed and a fast form of an euclidean metric is investigated in detail. In order to improve the sensitivity of the weighting function, dynamic coefficients are introduced. It is shown how to compute them automatically in order to get optimal results for the classification. Finally some results of applying the metric to the sample images are shown and the conclusions are drawn.

Polarized light imaging of white matter architecture

Polarized light imaging (PLI) is a method to image fiber orientation in gross histological brain sections based on the birefringent properties of the myelin sheaths. The method uses the transmission of polarized light to quantitatively estimate the fiber orientation and inclination angles at every point of the imaged section. Multiple sections can be assembled into a 3D volume, from which the 3D extent of fiber tracts can be extracted. This article describes the physical principles of PLI and describes two major applications of the method: the imaging of white matter orientation of the rat brain and the generation of fiber orientation maps of the human brain in white and gray matter. The strengths and weaknesses of the method are set out.