On the Chacteristic Numbers of Voting Games

This paper deals with the non-emptiness of the stability set for any proper voting game. We present an upper bound on the number of alternatives which guarantees the non emptiness of this solution concept. We show that this bound is greater than or equal to the one given by Le Breton and Salles (1990) for quota games.voting game, core, stability set

CONFIGEN: A tool for managing configuration options

This paper introduces CONFIGEN, a tool that helps modularizing software. CONFIGEN allows the developer to select a set of elementary components for his software through an interactive interface. Configuration files for use by C/assembly code and Makefiles are then automatically generated, and we successfully used it as a helper tool for complex system software refactoring. CONFIGEN is based on propositional logic, and its implementation faces hard theoretical problems.Comment: In Proceedings LoCoCo 2010, arXiv:1007.083

Orbital and Maxillofacial Computer Aided Surgery: Patient-Specific Finite Element Models To Predict Surgical Outcomes

This paper addresses an important issue raised for the clinical relevance of Computer-Assisted Surgical applications, namely the methodology used to automatically build patient-specific Finite Element (FE) models of anatomical structures. From this perspective, a method is proposed, based on a technique called the Mesh-Matching method, followed by a process that corrects mesh irregularities. The Mesh-Matching algorithm generates patient-specific volume meshes from an existing generic model. The mesh regularization process is based on the Jacobian matrix transform related to the FE reference element and the current element. This method for generating patient-specific FE models is first applied to Computer-Assisted maxillofacial surgery, and more precisely to the FE elastic modelling of patient facial soft tissues. For each patient, the planned bone osteotomies (mandible, maxilla, chin) are used as boundary conditions to deform the FE face model, in order to predict the aesthetic outcome of the surgery. Seven FE patient-specific models were successfully generated by our method. For one patient, the prediction of the FE model is qualitatively compared with the patient's post-operative appearance, measured from a Computer Tomography scan. Then, our methodology is applied to Computer-Assisted orbital surgery. It is, therefore, evaluated for the generation of eleven patient-specific FE poroelastic models of the orbital soft tissues. These models are used to predict the consequences of the surgical decompression of the orbit. More precisely, an average law is extrapolated from the simulations carried out for each patient model. This law links the size of the osteotomy (i.e. the surgical gesture) and the backward displacement of the eyeball (the consequence of the surgical gesture)

On the Chacteristic Numbers of Voting Games

International audienceThis paper deals with the non-emptiness of the stability set for any proper voting game. We present an upper bound on the number of alternatives which guarantees the non emptiness of this solution concept. We show that this bound is greater than or equal to the one given by Le Breton and Salles (1990) for quota games

Paravirtualizing Linux in a real-time hypervisor

International audienceThis paper describes a new hypervisor built to run Linux in a virtual machine. This hypervisor is built inside Anaxagoros, a real-time microkernel designed to execute safely hard real-time and non real-time tasks. This allows the execution of hard real-time tasks in parallel with Linux virtual machines without interfering with the execution of the real-time tasks. We implemented this hypervisor and compared performances with other virtualization techniques. Our hypervisor does not yet provide high performance but gives correct results and we believe the design is solid enough to guarantee solid performances with its future implementation

Real-time computational attention model for dynamic scenes analysis: from implementation to evaluation.

International audienceProviding real time analysis of the huge amount of data generated by computer vision algorithms in interactive applications is still an open problem. It promises great advances across a wide variety of elds. When using dynamics scene analysis algorithms for computer vision, a trade-o must be found between the quality of the results expected, and the amount of computer resources allocated for each task. It is usually a design time decision, implemented through the choice of pre-de ned algorithms and parameters. However, this way of doing limits the generality of the system. Using an adaptive vision system provides a more exible solution as its analysis strategy can be changed according to the new information available. As a consequence, such a system requires some kind of guiding mechanism to explore the scene faster and more e ciently. We propose a visual attention system that it adapts its processing according to the interest (or salience) of each element of the dynamic scene. Somewhere in between hierarchical salience based and competitive distributed, we propose a hierarchical yet competitive and non salience based model. Our original approach allows the generation of attentional focus points without the need of neither saliency map nor explicit inhibition of return mechanism. This new real- time computational model is based on a preys / predators system. The use of this kind of dynamical system is justi ed by an adjustable trade-o between nondeterministic attentional behavior and properties of stability, reproducibility and reactiveness