Extracting Hidden Context

Concept drift due to hidden changes in context complicates learning in many domains including financial prediction, medical diagnosis, and communication network performance. Existing machine learning approaches to this problem use an incremental learning, on-line paradigm. Batch, off-line learners tend to be ineffective in domains with hidden changes in context as they assume that the training set is homogeneous. An off-line, meta-learning approach for the identification of hidden context is presented. The new approach uses an existing batch learner and the process of contextual clustering to identify stable hidden contexts and the associated context specific, locally stable concepts. The approach is broadly applicable to the extraction of context reflected in time and spatial attributes. Several algorithms for the approach are presented and evaluated. A successful application of the approach to a complex flight simulator control task is also presented.     

Log-based mining techniques applied to Web service composition reengineering

Web service compositions are becoming more and more complex, involving numerous interacting ad-hoc services. These services are often implemented as business processes themselves. By analysing such complex web service compositions one is able to better understand, control and eventually re-design them. Our contribution to this problem is a mining algorithm, based on a statistical technique to discover composite web service patterns from execution logs. Our approach is characterised by a “local” pattern’s discovery that covers partial results through a dynamic programming algorithm. Those locally discovered patterns are then composed iteratively until the composite Web service is discovered. The analysis of the disparities between the discovered model and the initial ad-hoc composite model (delta-analysis) enables initial design gaps to be detected and thus to re-engineer the initial Web service composition.     

Radiosity for dynamic scenes in flatland with the visibility complex

The radiosity method is particularly suitable for global illumination calculations in static environments. Nonetheless, recent applications of image synthesis such as architectural simulation or lighting design require the ability to modify environments. Previous methods have attempted to deal with dynamic environments (environments where the geometry, the material properties, etc., can change)but still suffer some limitations in the case of moving objects. One of the main problems remaining is the efficient and accurate detection of which form factors must really be recomputed, since their calculation is the most time-consuming part of the radiosity method. To correctly understand and solve this problem, we start with a method in 2D for polygonal scenes using the visibility complex. It is a powerful data structure representing the visibility relationships between objects in the plane. We have developed and implemented an algorithm which uses this structure to efficiently compute the discontinuity mesh and the form factors for static scenes. We also propose an extension to our algorithm to efficiently update only the modified form factors when an object is moving. This approach enhances our understanding and will hopefully lead to efficient solutions in 3D.     

External Rewriting for Skeptical Proof Assistants

This paper presents the design, the implementation, and experiments of the integration of syntactic, conditional possibly associative-commutative term rewriting into proof assistants based on constructive type theory. Our approach is called external because it consists in performing term rewriting in a specific and efficient environment and checking the computations later in a proof assistant. Two typical systems are considered in this work: ELAN, based on the rewriting calculus, as the term rewriting-based environment, and Coq, based on the calculus of inductive constructions as the proof assistant. We first formalize the proof terms for deduction by rewriting and strategies in ELAN using the rewriting calculus with explicit substitutions. We then show how these proof terms can soundly be translated into Coq syntax where they can be directly type checked. For the method to be applicable for rewriting modulo associativity and commutativity, we provide an effective method to prove equalities modulo these axioms in Coq using ELAN. These results have been integrated into an ELAN-based rewriting tactic in Coq.     

Digital microfluidic design and optimization of classic and new fluidic functions for lab on a chip systems

This paper deals with microfluidic studies for lab-on-a-chip development. The first goal was to develop microsystems immediately usable by biologists for complex protocol integrations. All fluid operations are performed on nano-liter droplet independently handled solely by electrowetting on dielectric (EWOD) actuation. A bottom-up architecture was used for chip design due to the development and validation of elementary fluidic designs, which are then assembled. This approach speeds up development and industrialization while minimizing the effort in designing and simplifying chip-fluidic programming. Dispensing reproducibility for 64 nl droplets obtained a CV below 3% and mixing time was only a few seconds. Ease of the integration was demonstrated by performing on chip serial dilutions of 2.8-folds, four times. The second part of this paper concerns the development of new innovative fluidic functions in order to extend EWOD-actuated digital fluidics’ capabilities. Experiments of particle dispensing by EWOD droplet handling are reported. Finally, work is shown concerning the coupling of EWOD actuation and magnetic fields for magnetic bead manipulation.     

La référence informatique dans l'étude de l'esprit humain: Une mise au point épistémologique.

Comments on the nature and limitations of the "computational reference," or information processing approach, in cognitive psychology. Set in a Popperian epistemological context, these comments stress the diversity of roles that this reference can be called upon to play, from that of formal recourse for conceiving "languages" allowing clear and unambiguous conjectural or theoretical statements to be made, to that of technological recourse for optimizing the conception of conjectures or theories as such. (English abstract) (8 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Dissonance processes as self-affirmation.

Tested the hypothesis that an experience that simply affirms a valued aspect of the self can eliminate dissonance and its accompanying cognitive changes. Three experiments were conducted using the conventional forced-compliance procedure. In Study 1, some of the 76 college student Ss were allowed to affirm an important, self-relevant value (by completing a self-relevant value scale) immediately after having written unrelated dissonant essays and prior to recording their attitudes on the postmeasure. Other Ss underwent an identical procedure but were selected so that the value affirmed by the scale was not part of their self-concept. The value scale eliminated dissonance-reducing attitude change among Ss for whom it was self-relevant but not among Ss for whom it was not self-relevant. This occurred even though the value scale could not resolve or reduce the objective importance of the dissonance-provoking inconsistency. Study 2, conducted with 24 Ss with a strong economic and political value orientation, showed that the self-affirmation effect was strong enough to prevent the reinstatement of dissonance. Study 3, testing generalizability with 24 Ss, replicated the effect by using a different attitude issue, a different value for affirmation, and a different measure of dissonance reduction. Results imply that a need for psychological consistency is not part of dissonance motivation and that salient, self-affirming cognitions may help objectify reactions to self-threatening information. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Development of an atomic‐broadcast protocol using LOTOS

In this article we report on the development of a group‐communication service using the formal specification language LOTOS, and present our experience in using publicly available tools for this purpose. The service implements atomic broadcast through a Two‐Phase‐Commit protocol, providing at‐least‐once delivery semantics and with no restriction on message delivery order. First we wrote an informal specification describing the desired properties from the service, the interfaces with the underlying network layer and the upper user layer, and the protocol to be used by the service. Then we developed the formal specification of the protocol in LOTOS. After validating the formal specification and thus having a certain confidence in its adequacy with respect to the informal specification, we derived test cases from the formal specification and implemented the service using the Concert/C distributed programming language. While testing the implementation, we found that most errors were related to unspecified features or bugs in the execution environment. From this experience, we draw our conclusions on the usefulness of software development based on formal techniques. Copyright © 1999 John Wiley & Sons, Ltd.     

Subcontinuations

Continuations have proven to be useful for implementing a variety of control structures, including exception handling facilities and breadth-first searching algorithms. However, traditional continuations are not useful in the presence of concurrency, because the notion of the rest of the computation represented by a continuation does not in general make sense. Traditional continuations can also be difficult to use in nonconcurrent settings, since their global nature is sometimes problematic. This article presents a new type of continuation, called asubcontinuation. Just as a traditional continuation represents the rest of a computation ¿from a given point in the computation, a subcontinuation represents the rest of asubcomputation ¿from a given point in the subcomputation. Subcontinuations may be used to control tree-structured concurrency by allowing nonlocal exits to arbitrary points in a process tree and allowing the capture of a subtree of a computation as a composable continuation for later use. In the absence of concurrency the localized control achievable with subcontinuations makes them more useful than traditional continuations.     

TGV: theory, principles and algorithms

This paper presents the TGV tool, which allows for the automatic synthesis of conformance test cases from a formal specification of a (non-deterministic) reactive system. TGV was developed by Irisa Rennes and Verimag Grenoble, with the support of the Vasy team of Inria Rhônes-Alpes. The paper describes the main elements of the underlying testing theory, which is based on a model of transitions system which distinguishes inputs, outputs and internal actions, and is based on the concept of conformance relation. The principles of the test synthesis process, as well as the main algorithms, are explained. We then describe the main characteristics of the TGV tool and refer to some industrial experiments that have been conducted to validate the approach. As a conclusion, we describe some ongoing work on test synthesis.