Perioperative cardiac arrhythmias in digitalized patients with ischemic heart disease (author's transl)

The purpose of this study was to establish the incidence of pre-operative digitalization by intravenous digoxin on cardiac arrhythmias in 24 patients with ischemic heart disease who underwent abdominal surgery. Ambulatory electrocardiographic monitoring was performed for 12 hours before digitalization, for 12 hours during digitalization (before surgery), for the whole period of anesthesia. General anesthesia used thiopentone, phenoperidine, pancuronium and suxamethonium for endotracheal intubation. No more premature ventricular (PVC) and auricular contractions were detected after digitalization and during anesthesia and surgery. But PVC with begeminism or severe bradycardia were recorded in two patients and episodes of "torsades de pointes" occurred in two other patients during endotracheal intubation. "Torsades de pointes" have never been reported after suxamethonium and endotracheal intubation in digitalized patients. Digitalization, ischemic heart disease, cardiac effects of suxamethonium might be factors of the onset of these first reported "torsades de pointes". In conclusion, after a pre-operative digitalization in the coronary patients the frequency of arrhythmias is not exaggerated during the pre- or per-operative period except during induction and intubation. As the role of suxamethonium seems to be important as a trigger for severe arrhythmias endotracheal intubation in digitalized coronary patients should be performed without suxamethonium.     

Monitoring microbial population dynamics at low densities

We propose a new and simple method for the measurement of microbial concentrations in highly diluted cultures. This method is based on an analysis of the intensity fluctuations of light scattered by microbial cells under laser illumination. Two possible measurement strategies are identified and compared using simulations and measurements of the concentration of gold nanoparticles. Based on this comparison, we show that the concentration of Escherichia coli and Saccharomyces cerevisiae cultures can be easily measured in situ across a concentration range that spans five orders of magnitude. The lowest measurable concentration is three orders of magnitude (1000×) smaller than in current optical density measurements. We show further that this method can also be used to measure the concentration of fluorescent microbial cells. In practice, this new method is well suited to monitor the dynamics of population growth at early colonization of a liquid culture medium. The dynamic data thus obtained are particularly relevant for microbial ecology studies.     

Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization

Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing, hyperspectral data analysis, computational biology, and clustering. In this letter, we consider two well-known algorithms designed to solve NMF problems: the multiplicative updates of Lee and Seung and the hierarchical alternating least squares of Cichocki et al. We propose a simple way to significantly accelerate these schemes, based on a careful analysis of the computational cost needed at each iteration, while preserving their convergence properties. This acceleration technique can also be applied to other algorithms, which we illustrate on the projected gradient method of Lin. The efficiency of the accelerated algorithms is empirically demonstrated on image and text data sets and compares favorably with a state-of-the-art alternating nonnegative least squares algorithm.     

An Instantiation Scheme for Satisfiability Modulo Theories

State-of-the-art theory solvers generally rely on an instantiation of the axioms of the theory, and depending on the solvers, this instantiation is more or less explicit. This paper introduces a generic instantiation scheme for solving SMT problems, along with syntactic criteria to identify the classes of clauses for which it is complete. The instantiation scheme itself is simple to implement, and we have produced an implementation of the syntactic criteria that guarantee a given set of clauses can be safely instantiated. We used our implementation to test the completeness of our scheme for several theories of interest in the SMT community, some of which are listed in the last section of this paper.     

Intrinsic Images by Clustering

Decomposing an input image into its intrinsic shading and reflectance components is a long‐standing ill‐posed problem. We present a novel algorithm that requires no user strokes and works on a single image. Based on simple assumptions about its reflectance and luminance, we first find clusters of similar reflectance in the image, and build a linear system describing the connections and relations between them. Our assumptions are less restrictive than widely‐adopted Retinex‐based approaches, and can be further relaxed in conflicting situations. The resulting system is robust even in the presence of areas where our assumptions do not hold. We show a wide variety of results, including natural images, objects from the MIT dataset and texture images, along with several applications, proving the versatility of our method.     

An MDA approach to knowledge engineering

This paper proposes an MDA approach to knowledge engineering, centered on the CommonKADS knowledge model. The latter corresponds to the CIM level of MDA whereas PRR, which represents production rules and rulesets, corresponds to the PIM level. The paper explores the mapping between CommonKADS knowledge models and production rules and rulesets based on PRR. Mapping CommonKADS knowledge models into PRR is very useful, due to the fact that the CIM level remains relatively unexplored, despite its key role in MDA. This motivates our choice to focus on the CIM and PIM levels. Furthermore, the mapping between PIM and PSM (i.e. the implementation of production rules in specific rule-based systems) constitutes less of an issue. To map CommonKADS knowledge models into PRR production rules and rulesets, we propose and illustrate a set of transformations. To ease these transformations, we start by grouping elements of the CommonKADS knowledge models into so-called “inference groups”. We propose and illustrate an algorithm that defines these inference groups automatically. The definition of transformations between models (CIM to PIM levels) requires a specific metamodel for CommonKADS as well as a dedicated metamodel for PRR. Unlike PRR, there is no published CommonKADS metamodel. This paper proposes a comprehensive CommonKADS knowledge metamodel. We describe and discuss an example, applying the whole approach.     

Logic for improving integrity checking in relational data bases⋆

Summary When an updating operation occurs on the current state of a data base, one has to ensure the new state obeys the integrity constraints. So, some of them have to be evaluated on this new state. The evaluation of an integrity constraint can be time consuming, but one can improve such an evaluation by taking advantage from the fact that the integrity constraint is satisfied in the current state. Indeed, it is then possible to derive a simplified form of this integrity constraint which is sufficient to evaluate in the new state in order to determine whether the initial constraint is still satisfied in this new state. The purpose of this paper is to present a simplification method yielding such simplified forms for integrity constraints. These simplified forms depend on the nature of the updating operation which is the cause of the state change. The operations of inserting, deleting, updating a tuple in a relation as well as transactions of such operations are considered. The proposed method is based on syntactical criteria and is validated through first order logic. Examples are treated and some aspects of the method application are discussed.The work reported in this paper was supported by the D.R.E.T.