The aerocrew mission : training space Session at Ny Aalesund Arctic base

The Aerocrew mission has been realized in December 2007, in the frame of the International Polar Year, and in cooperation with the Polar Institut Paul-Émile Victor. The team has realized an original5 days training experience at Ny-Aalesund Arctic Base (79°N) the. The 11 crew members constituted a space crew, including physicians, aerospace crew trainers and engineers, and were implied in a seminar with 4 sessions, dealing with the training capabilities of Arctic Bases. The goal was on one hand to show that this kind of base constitutes a pertinent and affordable facility for space and aerospace teams, and on the other hand that the specific aerospace crew training techniques, could be fruitful for the scientists in artcic bases (glaciologists, geologists, specialists of the atmosphere). The 4 sessions, given by professionals of aerospace, robotics and medicine, covered the training methods for crews, robotics for outdoor and indoor activities, engineering of embedded systems, and the internal arrangement of crafts. The experience has shown the efficiency of a transverse visiting multidisciplinary team for training, and possible synergies with the resident scientists. In addition, the sessions were enriched by demonstrations such as mini-robot for observation, micro-helicopter for special sites, and also the comparison between EVA Russian glove and Polar Suits. After this mission, it was possible to conclude that this kind of cooperation could certainly open perspectives with crossed benefits either for space training and arctic research

Aspects of Large Scale Symbolic Computation Management

The special-purpose computer algebra system FELIX is designed for computations in constructive commutative and non-commutative algebra. In this paper we discuss some features of the system supporting the computation of rather complex problems, especially standard basis computations, using standard hardware. There is a frst aspect concerning the definition and implementation of the basic data types which should be a good compromise between space and time efficient representations of the algebraic objects. Usually, rather complex computations are very time consuming (up to weeks) and often require several attempts. So, there are included special session saving methods in FELIX which allows to backup the attained intermediate results in form of memory images into special session files and to restart later on. Finally, we describe our efforts crunching complex problems by parallelization. The implemented interface is based on stream sockets and includes a special protocol for the data exchange. It supports the distributed computation on heterogeneous, loosely coupled systems

The aerocrew mission: training space session at Ny Aalesund Arctic base

The Aerocrew mission was realized at Ny-Aalesund Arctic Base in December 2007, in theframe of the International Polar Year, and in cooperation with the French Polar Institute. The team made an original training experience, constituting an integrated space crew, including physicians, aerospace trainers and engineers, implied in a seminar with 4 sessions, dealing with the training capabilities of Arctic Bases. This kind of base constitutes a pertinent and affordable facility for aerospace teams, and the specific aerospace crew training techniques, are fruitful for the polar scientists (glaciologists, geologists, specialists of the atmosphere). The sessions, given by professionals of aerospace, robotics and medicine, covered the training methods for crews, robotics for outdoor and indoor activities, engineering of embedded systems, and the arrangement of crafts. The experience has shown the efficiency of a transverse visiting multidisciplinary team for training, and possible synergies with the resident scientists. In addition, the sessions were enriched by demonstrations such as mini-robot for observation, micro-helicopter, and also the comparison between EVA Russian glove and Polar Suits

Mining domain-specific edit operations from model repositories with applications to semantic lifting of model differences and change profiling

Model transformations are central to model-driven software development. Applications of model transformations include creating models, handling model co-evolution, model merging, and understanding model evolution. In the past, various (semi-) automatic approaches to derive model transformations from meta-models or from examples have been proposed. These approaches require time-consuming handcrafting or the recording of concrete examples, or they are unable to derive complex transformations. We propose a novel unsupervised approach, called Ockham, which is able to learn edit operations from model histories in model repositories. Ockham is based on the idea that meaningful domain-specifc edit operations are the ones that compress the model diferences. It employs frequent subgraph mining to discover frequent structures in model diference graphs. We evaluate our approach in two controlled experiments and one real-world case study of a large-scale industrial model-driven architecture project in the railway domain. We found that our approach is able to discover frequent edit operations that have actually been applied before. Furthermore, Ockham is able to extract edit operations that are meaningful—in the sense of explaining model diferences through the edit operations they comprise—to practitioners in an industrial setting. We also discuss use cases (i.e., semantic lifting of model diferences and change profles) for the discovered edit operations in this industrial setting. We fnd that the edit operations discovered by Ockham can be used to better understand and simulate the evolution of models

Representing Polynomials in Computer Algebra Systems

There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of different polynomial representations are reported

A Note on Data Types Supporting Efficient Implementations of Polynomial Arithmetics

There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of different polynomial representations are reported

Aspects of Large Scale Symbolic Computation Management

The special-purpose computer algebra system FELIX is designed for computations in constructive commutative and non-commutative algebra. In this paper we discuss some features of the system supporting the computation of rather complex problems, especially standard basis computations, using standard hardware. There is a frst aspect concerning the definition and implementation of the basic data types which should be a good compromise between space and time efficient representations of the algebraic objects. Usually, rather complex computations are very time consuming (up to weeks) and often require several attempts. So, there are included special session saving methods in FELIX which allows to backup the attained intermediate results in form of memory images into special session files and to restart later on. Finally, we describe our efforts crunching complex problems by parallelization. The implemented interface is based on stream sockets and includes a special protocol for the data exchange. It supports the distributed computation on heterogeneous, loosely coupled systems

A Note on Data Types Supporting Efficient Implementations of Polynomial Arithmetics

There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of different polynomial representations are reported