Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning

The classical Geiringer theorem addresses the limiting frequency of occurrence of various alleles after repeated application of crossover. It has been adopted to the setting of evolutionary algorithms and, a lot more recently, reinforcement learning and Monte-Carlo tree search methodology to cope with a rather challenging question of action evaluation at the chance nodes. The theorem motivates novel dynamic parallel algorithms that are explicitly described in the current paper for the first time. The algorithms involve independent agents traversing a dynamically constructed directed graph that possibly has loops and multiple edges. A rather elegant and profound category-theoretic model of cognition in biological neural networks developed by a well-known French mathematician, professor Andree Ehresmann jointly with a neurosurgeon, Jan Paul Vanbremeersch over the last thirty years provides a hint at the connection between such algorithms and Hebbian learning.     

Real-time crowd motion planning

Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et al. in Cyberworlds International Conference, pp. 144–151, 2007), we introduced a hybrid architecture to handle real-time motion planning of thousands of pedestrians. In this article, we present an extended version of our architecture, introducing two new features: an improved short-term collision avoidance algorithm, and simple efficient group behavior for crowds. Our approach allows the use of several motion planning algorithms of different precision for regions of varied interest. Pedestrian motion continuity is ensured when switching between such algorithms. To assess our architecture, several performance tests have been conducted, as well as a subjective test demonstrating the impact of using groups. Our results show that the architecture can plan motion in real time for several thousands of characters.

Differencing and merging of architectural views

Differencing and merging architectural views is an important activity in software engineering. However, existing approaches are still based on restrictive assumptions, such as requiring view elements to have unique identifiers or exactly matching types, which is often not the case in many application domains. We propose an approach based on structural information. We generalize a published polynomial-time tree-to-tree correction algorithm that detects inserts, renames and deletes, into a novel algorithm that additionally detects restricted moves. Our algorithm also supports forcing and preventing matches between view elements. We incorporate the algorithm into tools to compare and merge Component-and-Connector (C&C) architectural views. We provide an empirical evaluation of the algorithm. We illustrate the tools using extended examples, and use them to detect and reconcile interesting differences between real architectural views. This article is an expanded version of the following paper: Abi-Antoun, M., Aldrich, J., Nahas, N., Schmerl, B., and Garlan, D: 2006, ‘Differencing and Merging of Architectural Views’. In: Proceedings of the 21st IEEE International Conference on Automated Software Engineering, pp. 47–58.     

A closed-loop cross-correlation method for detecting model mismatch in MIMO model-based controllers

Correlation between a dithering signal and the prediction error has been used for detecting model mismatch in univariate model based control systems. This paper extends that approach to MIMO control systems. A closed-loop cross-correlation method is presented to detect which specific input-output pairings of a model-based controller are mismatched. This method may be used in screening the complete set of models and in selecting candidate models for re-identification. The method first finds the rows and columns of the transfer function matrix that contain mismatch, and then the candidates are found by the intersection of the said rows and columns. Placing the system under partial control, whereby one or more of the manipulated variables are held constant, can be used to further reduce the set of candidate models.     

Effectiveness of participatory ergonomic interventions on health outcomes: a systematic review

The objective of this study was to conduct a systematic review of the literature on the effectiveness of participatory ergonomic (PE) interventions for improving workers' health. The search strategy targeted six electronic databases and identified 442 potential articles. Each article was examined by pairs of reviewers for relevance (assessed a participative ergonomic workplace intervention, with at least one health outcome, published in English in peer reviewed literature). Twenty-three articles met relevance criteria and were then appraised for methodological strength. Using a best evidence synthesis approach, 12 studies that were rated as 'medium' or higher provided partial to moderate evidence that PE interventions have a positive impact on: musculoskeletal symptoms, reducing injuries and workers' compensation claims, and a reduction in lost days from work or sickness absence. However, the magnitude of the effect requires more precise definition.     

NMR microscopy of single neurons at 500 MHZ

Previous NMR microimaging studies at 360 MHz have demonstrated a clear differentiation between the nucleus and cytoplasm in isolated single neurons. In particular, theT ₂ of the cell nucleus is 2.5 times larger than that of the cytoplasm. In order to determine the magnitude of possibleT ₂ ^* influences on these observations, images of single cells have been obtained at 500 MHz using spin-echo and line-narrowing sequences. Comparison of the images acquired by the two sequences, and of the spin-echo images at 360 and 500 MHz, imply that anyT ₂ ^* contributions are relatively small. Consequently, the measuredT ₂ differences in spin-echo imaging represent a true difference in theT ₂ relaxation in the two cellular compartments.     

Rational wavelet decompositions of transfer functions in hardy-sobolev classes

The model approximation of transfer functions using rational wavelets (or molecular decompositions) is considered. By using techniques from Hardy-Sobolev spaces it is shown that Hilbert space methods such as a modified matching-pursuit algorithm and least-squares technique can be employed to obtain good approximations in bothH ² andH norms. Several theoretical results are given on rates of convergence when the methods are applied to delay systems and fractional filters.The research of the first author was supported by E.P.S.R.C.     

Algebraic approach to linking the semantics of web services

Web services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. We have considered the operational semantics and denotational semantics for BPEL, where a set of algebraic laws can be achieved via these two models, respectively. In this paper, we consider the inverse work, deriving the operational semantics and denotational semantics from algebraic semantics for BPEL. In our model, we introduce four types of typical programs, by which every program can be expressed as the summation of these four types. Based on the algebraic semantics, the strategy for deriving the operational semantics is provided and a transition system is derived by strict proof. This can be considered as the soundness exploration for the operational semantics based on the algebraic semantics. Further, the equivalence between the derivation strategy and the derived transition system is explored, which can be considered as the completeness of the operational semantics. Finally, the derivation of the denotational semantics from algebraic semantics is explored, which can support to reason about more program properties easily.