A semantics of introspection in a reflective prototype-based language

In Malenfant et al. [19], we have described a reflective model for a prototype-based language based on thelookup o apply reflective introspection protocol. In this paper, we augment our previous protocol by converting it to handle continuations reified as first-class objects. First-class continuations provide much more control over the current computation; during the introspection phase fired by message sending, they make it possible not only to change the behavior of the program for that message but also for the entire future computation. In this paper, we provide this introspection protocol with a formal semantics. This result is obtained by exhibiting a mapping from program configurations to priority rewrite systems (PRS) as well as a mapping from message expressions to ground first-order terms used to query the PRS. Other advantages of this approach are: to ensure the termination of the introspection using the smallest set of formally justified conditions and to provide a clear declarative account of this reflective protocol. The PRS also appears as a meta-level to the base language, independent of the implementation, but from which we derive fundamental clues to obtain an efficient language processor. By our new model, we finally highlight the link between reflection in object-oriented languages and the one originally proposed by 3-Lisp [24], although object-orientation provides reusability to reflection, making it easier to use.     

Matching and alpha-equivalence check for nominal terms

Nominal terms generalise first-order terms by including abstraction and name swapping constructs. α-equivalence can be easily axiomatised using name swappings and a freshness relation, which makes the nominal approach well adapted to the specification of systems that involve binders. Nominal matching is matching modulo α-equivalence and has applications in programming languages, rewriting, and theorem proving. In this paper, we describe efficient algorithms to check the validity of equations involving binders and to solve matching problems modulo α-equivalence, using the nominal approach.     

Efficient algorithms for singleton arc consistency

In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one, the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton. This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during the inference process. We present extensive experiments that show the benefit of our two approaches.     

Dealing with midair collisions in dense collective aerial systems

The idea of creating collective aerial systems is appealing because several rather simple flying vehicles could join forces to cover a large area in little time in applications such as monitoring, mapping, search and rescue, or airborne communication relays. In most of these scenarios, a fleet of cooperating vehicles is dispatched to a confined airspace area and requested to fly close to a nominal altitude. Moreover, depending on the task each vehicle is assigned to, individual flight trajectories in this essentially two‐dimensional space may interfere, resulting in disastrous collisions. This paper begins by introducing a probabilistic model to predict the rate of midair collisions that would occur if nothing is done to prevent them. In a second step, a control strategy for midair collision avoidance is proposed, which is interesting because it requires only local communication and information about flight altitudes. The proposed strategy is systematically analyzed in theory and simulation as well as in experiments with five physical aerial vehicles. A significant reduction in collision rates can be achieved. Statistically, values close to zero are possible when the swarm's density is below an application‐dependent threshold. Such low collision rates warrant an acceptable level of confidence in collision‐free operation of a physical swarm. © 2011 Wiley Periodicals, Inc.     

Stable splitting scheme for general form of associated plasticity including different scales of space and time

An efficient implementation of the operator split procedure for boundary value solution with plastic flow computation is presented for a general form of associated plasticity model. We start with the general form of phenomenological model of plasticity where the yield criterion is not restricted to a simple (quadratic) form, and the elasticity tensor does not have constant entries. We then turn to the multi-scale model of plasticity which employs the fine scale representation of the plastic deformation along with the homogenization procedure for stress computation. We also visit the plasticity model with rate sensitive plastic response where plastic flow computation is carried out at fine scale in time. We proved herein the sufficient and necessary conditions for the proposed operator split procedure to converge, for any such general form of associated plasticity. Moreover, we presented a systematic manner for constructing the main ingredients for the plastic flow computation and the global Newton’s iteration, such as the consistent elastoplastic tangent.     

Robust M-estimation of multivariate GARCH models

The Gaussian quasi-maximum likelihood estimator of Multivariate GARCH models is shown to be very sensitive to outliers in the data. A class of robust M-estimators for MGARCH models is developed. To increase the robustness of the estimators, the use of volatility models with the property of bounded innovation propagation is recommended. The Monte Carlo study and an empirical application to stock returns document the good robustness properties of the M-estimator with a fat-tailed Student t loss function.     

Combination of convex theories: Modularity,deduction completeness,and explanation

Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories.     

An Automatic Correction of Ma’s Thinning Algorithm Based on <Emphasis Type="Italic">P</Emphasis>-simple Points

The notion of P-simple points was introduced by Bertrand to conceive parallel thinning algorithms. In ‘A 3D fully parallel thinning algorithm for generating medial faces’ (Pattern Recogn. Lett. 16:83–87, 1995), Ma proposed an algorithm for which there are objects whose topology is not preserved. In this paper, we propose a new application of P-simple points: to automatically correct Ma’s algorithm.     

Co-constructing with stakeholders a role-playing game to initiate collective management of erosive runoff risks at the watershed scale

Erosive runoff is a recurring problem and is a source of sometimes deadly muddy floods in the Pays de Caux (France). The risk results from a conjunction of natural factors and human activity. Efficient actions against runoff in agricultural watersheds are well known. However they are still difficult to implement as they require co-operation between stakeholders. Local actors thus need tools to help them understand the collective consequences of their individual decisions and help to initiate a process of negotiation between them. We decided to use a participatory approach called companion modelling (ComMod), and, in close collaboration with one of the first group of local stakeholders, to create a role-playing game (RPG) to facilitate negotiations on the future management of erosive runoff. This paper describes and discusses the development of the RPG and its use with other groups of local stakeholders within the framework of two game sessions organized by two different watershed management committees. During the joint construction step, stakeholders shared their viewpoints about the environment, agents, rules, and how to model runoff in preparation for the creation of the RPG. During the RPG sessions, two groups of eight players, including farmers, mayors and watershed advisors, were confronted with disastrous runoff in a fictive agricultural watershed. Results showed that they managed to reduce runoff by 20–50% by engaging a dialogue about grass strips, storage ponds and management of the intercrop period. However, further progress is still needed to better control runoff through the implementation of better agricultural practices because, during the RPG sessions, the watershed advisors did not encourage farmers to do so. Because of the complexity of management problems, results of jointly constructing the game and the RPG sessions showed that modelling and simulation can be a very useful way of accompanying the collective learning process. This new way of working was welcomed by the participants who expressed their interest in organizing further RPG sessions.