Model‐based code generation for HLA federates

This paper addresses the problem of automated code generation for a High Level Architecture compliant federate application given its behavior model. The behavior model is a part of the architectural model of a federation that the federate can participate in. The federate behavior model is based on Live Sequence Charts, adopted as the behavioral specification formalism in the Federation Architecture Metamodel (FAMM). FAMM serves as a formal language for describing federation architectures. An objective is to help the testing of federation architecture by means of its prototype implementation early in the development lifecycle. A further objective is to help developers construct complete federate applications that are well modularized. The approach to achieve these objectives is aspect‐oriented in that the generated code, which handles the federate's interactions with a federation execution, serves as the base code, where the computation logic is to be weaved as an aspect. Copyright © 2009 John Wiley & Sons, Ltd.     

Robust MIMO disturbance observer analysis and design with application to active car steering

A multi‐input–multi‐output extension of the well‐known two control degrees‐of‐freedom disturbance observer architecture that decouples the problem into single‐input–single‐output disturbance observer loops is presented in this paper. Robust design based on mapping D‐stability and the frequency domain specifications of weighted sensitivity minimization and phase margin bound to a chosen controller parameter space is presented as a part of the proposed design approach. The effect of the choice of disturbance observer Q filter on performance is explained with a numerical example. This is followed by the use of structured singular values in the robustness analysis of disturbance observer controlled systems subject to structured, real parametric and mixed uncertainty in the plant. A design and simulation study based on a four wheel active car steering control example is used to illustrate the methods presented in the paper. Copyright © 2009 John Wiley & Sons, Ltd.     

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.     

Optimal synthesis of planar mechanisms via an extensible-link approach

This paper presents a novel approach to optimize the design of planar mechanisms with revolute joints for function generation or path synthesis. The proposed method is based on the use of an extensible-link mechanism model whose strain energy is minimized to find the optimal rigid design. This enables us to get rid of assembly constraints and the use of natural coordinates makes the objective function simpler. Two optimization strategies are developed and then discussed. The first one relies on alternate optimizations of design parameters and point coordinates. The second one uses multiple partial syntheses as starting point for a full synthesis process. The question of finding the global optimum is also addressed and developed. A simple algorithm is proposed to find several local optima among which the designer may choose the best one taking other criteria into account (e.g. stiffness, collision, size,...). Three applications are presented to illustrate the strategies while mentioning their limits.     

An integrated case-based reasoning and MCDM system for Web based tourism destination planning

The accelerating interaction between technology and tourism has changed radically the efficiency and effectiveness of tourism organizations, as well as how consumers interact with organizations. In this study, a Web based intelligent framework for travel agencies is proposed that offers customers a fast and reliable response service in a less costly manner. The proposed framework integrates case-based reasoning (CBR) system with a well-known multi criteria decision making (MCDM) technique, namely Analytic Hierarchy Process, to enhance the accuracy and speed in case matching in tourism destination planning. The integration of two techniques enables taking advantages of their strengths and complements each other’s weaknesses. A case study is performed to demonstrate how this framework can facilitate intelligent decision support by retrieving best-fitted responses for customers.     

Derivation of empirical equations for neutronic performance in a thorium fusion breeder with various coolants using regression analysis

In this paper, regression analyses (RA) are presented for the neutronic calculation of ThO₂ mixed ²⁴⁴CmO₂ fuel with different neutronic parameters for various coolants, natural lithium, Li₂₀Sn₈₀ and Flinabe, respectively. The tritium breeding ratio (TBR), energy multiplication factor (M), total fission rate (Σ_f) and ²³²Th(n, γ) reaction is computed by XSDRNPM. In addition, this numerical results are estimated by RA depends on neutronic parameters and the empirical equations for neutronic performance are acquired. The results obtained by using XSDRNPM and the results of the RA, obtained empirical equations, are compared. The empirical equations indicate that RA can successfully be used for the prediction of the neutronic performance parameters in the hybrid reactor with a high degree of accuracy. In addition, correlation matrix is calculated to determined statistical relationships between variables TBR, M, Σ_f, and ²³²Th(n, γ).     

Designing a sustainable supply chain using an integrated analytic network process and goal programming approach in quality function deployment

Sustainable supply chain management (SSCM) provides economic, social end environmental requirements in material and service flows occurring between suppliers, manufacturers and customers. SSCM structure is considered as a prerequisite for a sustainable success. Thus designing an effective SCM structure provides competitive advantages for the companies. In order to achieve an effective design of this structure, it is possible to apply quality function deployment (QFD) approach which is successfully applied as an effective product and system development tool. This study presents a decision framework where analytic network process (ANP) integrated QFD and zero-one goal programming (ZOGP) models are used in order to determine the design requirements which are more effective in achieving a sustainable supply chain (SSC). The first phase of the QFD is the house of quality (HOQ) which transforms customer requirements into product design requirements. In this study, after determining the sustainability requirements named customer requirements (CRs) and design requirements (DRs) of a SSC, ANP is employed to determine the importance levels in the HOQ considering the interrelationships among the DRs and CRs. Furthermore ZOGP approach is used to take into account different objectives of the problem. The proposed method is applied through a case study and obtained results are discussed.     

Effect of high-level content organizers on hypertext learning

This study investigates the cognitive abilities involved in hypertext learning and design approaches that can help users. We examined the effects of two types of high-level content organizers - a graphic spatial map and an alphabetical list - on readers’ memory for hypertext structure. In the control condition, a simple “home” page with no navigational aid was offered. Subjects were asked to read the hypertext with the purpose of learning the content, but in the post test phase they also had to recall the layout of nodes and links. Memory for links and page places varied as a function of condition. When a spatial map was available participants reconstructed more accurate formal structure then in the two other conditions. Participants’ memory about page places was the least accurate in the list condition. Results also indicate that participants use the content organizer when it is available in order to orientate during learning from hypertext documents.Our results prove that a content organizer showing the formal structure can facilitate the spatial mapping process. However, an organizer exposing a different structure than the real one would generate a conflict.     

On the composition of time Petri nets

Complex systems are often designed and built from smaller pieces, called components. Components are open sub-systems meant to be combined (or composed) to form other components or closed systems. It is well known that Petri nets allow such a component based modeling, relying on parallel composition and transition synchronization. However, synchronizing transitions that carry temporal constraints does not yield a compositional method for assembling components, a highly desirable property. The paper addresses this particular problem: how to build complex systems in a compositional manner from components specified by Time Petri nets (TPN). A first solution is proposed, adequate for a particular subclass of Time Petri nets but significantly increasing the complexity of components. Then an improved solution is developed, relying on an extension of Time Petri nets with two relations added on transitions. This latter solution requires a much simpler transformation of nets, does not significantly increase their complexity, and is applicable to a larger class of TPN.     

Antichains and compositional algorithms for LTL synthesis

In this paper, we present new monolithic and compositional algorithms to solve the LTL realizability problem. Those new algorithms are based on a reduction of the LTL realizability problem to a game whose winning condition is defined by a universal automaton on infinite words with a k-co-Büchi acceptance condition. This acceptance condition asks that runs visit at most k accepting states, so it implicitly defines a safety game. To obtain efficient algorithms from this construction, we need several additional ingredients. First, we study the structure of the underlying automata constructions, and we show that there exists a partial order that structures the state space of the underlying safety game. This partial order can be used to define an efficient antichain algorithm. Second, we show that the algorithm can be implemented in an incremental way by considering increasing values of k in the acceptance condition. Finally, we show that for large LTL formulas that are written as conjunctions of smaller formulas, we can solve the problem compositionally by first computing winning strategies for each conjunct that appears in the large formula. We report on the behavior of those algorithms on several benchmarks. We show that the compositional algorithms are able to handle LTL formulas that are several pages long.