Transformation by example

La transformation de modèles consiste à transformer un modèle source en un modèle cible conformément à des méta-modèles source et cible. Nous distinguons deux types de transformations. La première est exogène où les méta-modèles source et cible représentent des formalismes différents et où tous les éléments du modèle source sont transformés. Quand elle concerne un même formalisme, la transformation est endogène. Ce type de transformation nécessite généralement deux étapes : l’identification des éléments du modèle source à transformer, puis la transformation de ces éléments. Dans le cadre de cette thèse, nous proposons trois principales contributions liées à ces problèmes de transformation. La première contribution est l’automatisation des transformations des modèles. Nous proposons de considérer le problème de transformation comme un problème d'optimisation combinatoire où un modèle cible peut être automatiquement généré à partir d'un nombre réduit d'exemples de transformations. Cette première contribution peut être appliquée aux transformations exogènes ou endogènes (après la détection des éléments à transformer). La deuxième contribution est liée à la transformation endogène où les éléments à transformer du modèle source doivent être détectés. Nous proposons une approche pour la détection des défauts de conception comme étape préalable au refactoring. Cette approche est inspirée du principe de la détection des virus par le système immunitaire humain, appelée sélection négative. L’idée consiste à utiliser de bonnes pratiques d’implémentation pour détecter les parties du code à risque. La troisième contribution vise à tester un mécanisme de transformation en utilisant une fonction oracle pour détecter les erreurs. Nous avons adapté le mécanisme de sélection négative qui consiste à considérer comme une erreur toute déviation entre les traces de transformation à évaluer et une base d’exemples contenant des traces de transformation de bonne qualité. La fonction oracle calcule cette dissimilarité et les erreurs sont ordonnées selon ce score. Les différentes contributions ont été évaluées sur d’importants projets et les résultats obtenus montrent leurs efficacités.

A review and implementation of swarm pattern formation and transformation models

Purpose: The purpose of this paper is to address a classic problem – pattern formation identified by researchers in the area of swarm robotic systems – and is also motivated by the need for mathematical foundations in swarm systems. Design/methodology/approach: The work is separated out as inspirations, applications, definitions, challenges and classifications of pattern formation in swarm systems based on recent literature. Further, the work proposes a mathematical model for swarm pattern formation and transformation. Findings: A swarm pattern formation model based on mathematical foundations and macroscopic primitives is proposed. A formal definition for swarm pattern transformation and four special cases of transformation are introduced. Two general methods for transforming patterns are investigated and a comparison of the two methods is presented. The validity of the proposed models, and the feasibility of the methods investigated are confirmed on the Traer Physics and Processing environment. Originality/value: This paper helps in understanding the limitations of existing research in pattern formation and the lack of mathematical foundations for swarm systems. The mathematical model and transformation methods introduce two key concepts, namely macroscopic primitives and a mathematical model. The exercise of implementing the proposed models on physics simulator is novel.

Technical Note: The normal quantile transformation and its application in a flood forecasting system.

The Normal Quantile Transform (NQT) has been used in many hydrological and meteorological applications in order to make the Cumulated Distribution Function (CDF) of the observed, simulated and forecast river discharge, water level or precipitation data Gaussian. It is also the heart of the meta-Gaussian model for assessing the total predictive uncertainty of the Hydrological Uncertainty Processor (HUP) developed by Krzysztofowicz. In the field of geo-statistics this transformation is better known as the Normal-Score Transform. In this paper some possible problems caused by small sample sizes when applying the NQT in flood forecasting systems will be discussed and a novel way to solve the problem will be outlined by combining extreme value analysis and non-parametric regression methods. The method will be illustrated by examples of hydrological stream-flow forecasts.

Societal transformation in response to global environmental change: a review of emerging concepts

The study of societal transformation in response to environmental change has become established, yet little consensus exists regarding the conceptual basis of transformation. This paper aims to provide structure to the dialog on transformation, and to reflect on the challenges of social research in this area. Concepts of transformation are identified through a literature review, and examined using four analytical criteria. It is found that the term ‘transformation’ is frequently used merely as a metaphor. When transformation is not used as a metaphor, eight concepts are most frequently employed. They differ with respect to (i) system conceptualization, (ii) notions of social consciousness (deliberate/emergent), and (iii) outcome (prescriptive/descriptive). Problem-based research tends to adopt concepts of deliberate transformation with prescriptive outcome, while concepts of emergent transformation with no prescriptive outcome tend to inform descriptive-analytical research. Dialog around the complementarities of different concepts and their empirical testing are priorities for future research.

Conditioning and preconditioning of the optimal state estimation problem

Optimal state estimation is a method that requires minimising a weighted, nonlinear, least-squares objective function in order to obtain the best estimate of the current state of a dynamical system. Often the minimisation is non-trivial due to the large scale of the problem, the relative sparsity of the observations and the nonlinearity of the objective function. To simplify the problem the solution is often found via a sequence of linearised objective functions. The condition number of the Hessian of the linearised problem is an important indicator of the convergence rate of the minimisation and the expected accuracy of the solution. In the standard formulation the convergence is slow, indicating an ill-conditioned objective function. A transformation to different variables is often used to ameliorate the conditioning of the Hessian by changing, or preconditioning, the Hessian. There is only sparse information in the literature for describing the causes of ill-conditioning of the optimal state estimation problem and explaining the effect of preconditioning on the condition number. This paper derives descriptive theoretical bounds on the condition number of both the unpreconditioned and preconditioned system in order to better understand the conditioning of the problem. We use these bounds to explain why the standard objective function is often ill-conditioned and why a standard preconditioning reduces the condition number. We also use the bounds on the preconditioned Hessian to understand the main factors that affect the conditioning of the system. We illustrate the results with simple numerical experiments.

Time Domain Analyses for Three-phase Lines with Corrected Modal Transformation Matrix

The results presented in this paper are based on a research about the application of approximated transformation matrices for electromagnetic transient analyses and simulations in transmission lines. Initially, it has developed the application of a single real transformation matrix for a double three-phase transmission lines, because the symmetry of the distribution of the phase conductors and the ground wires. After this, the same type of transformation matrix has applied for symmetrical single three-phase transmission lines. Analyzing asymmetrical single three-phase lines, it has used three different line configurations. For these transmission line types, the errors between the eigenvalues and the approximated results, called quasi modes, have been considered negligible. on the other hand, the quasi mode eigenvalue matrix for each case was not a diagonal one. and the relative values of the off-diagonal elements of the approximated quasi mode matrix are not negligible, mainly for the low frequencies. Based on this problem, a correction procedure has been applied for minimizing the mentioned relative values. For the correction procedure application, symmetrical and asymmetrical single three-phase transmission line samples have been used. Checking the correction procedure results, analyses and simulations have been carried out in mode and time domain. In this paper, the last results of mentioned research are presented and they related to the time domain simulations.

Cogeneration design problem Computational complexity analysis and solution through an expert system

Purpose - The purpose of this paper is twofold: to analyze the computational complexity of the cogeneration design problem; to present an expert system to solve the proposed problem, comparing such an approach with the traditional searching methods available.Design/methodology/approach - The complexity of the cogeneration problem is analyzed through the transformation of the well-known knapsack problem. Both problems are formulated as decision problems and it is proven that the cogeneration problem is np-complete. Thus, several searching approaches, such as population heuristics and dynamic programming, could be used to solve the problem. Alternatively, a knowledge-based approach is proposed by presenting an expert system and its knowledge representation scheme.Findings - The expert system is executed considering two case-studies. First, a cogeneration plant should meet power, steam, chilled water and hot water demands. The expert system presented two different solutions based on high complexity thermodynamic cycles. In the second case-study the plant should meet just power and steam demands. The system presents three different solutions, and one of them was never considered before by our consultant expert.Originality/value - The expert system approach is not a "blind" method, i.e. it generates solutions based on actual engineering knowledge instead of the searching strategies from traditional methods. It means that the system is able to explain its choices, making available the design rationale for each solution. This is the main advantage of the expert system approach over the traditional search methods. On the other hand, the expert system quite likely does not provide an actual optimal solution. All it can provide is one or more acceptable solutions.

Effect of particle size on the flexural strength and phase transformation of an airborne-particle abraded yttria-stabilized tetragonal zirconia polycrystal ceramic.

Statement of problem Because airborne-particle abrasion is an efficient method of improving the bond at the zirconia-cement interface, understanding its effect on the strength of yttria-stabilized tetragonal zirconia polycrystal is important. Purpose The purpose of this study was to evaluate the effect of the particle size used for airborne-particle abrasion on the flexural strength and phase transformation of a commercially available yttria-stabilized tetragonal zirconia polycrystal ceramic. Material and Methods For both flexural strength (20.0 × 4.0 × 1.2 mm) (n=14) and phase transformation (14.0-mm diameter × 1.3-mm thickness) (n=4), the zirconia specimens were made from Lava, and their surfaces were treated in the following ways: as-sintered (control); with 50-μm aluminum oxide (Al2O3) particles; with 120-μm Al2O3 particles; with 250-μm Al2O3 particles; with 30-μm silica-modified Al2O3 particles (Cojet Sand); with 120-μm Al2O3 particles, followed by 110-μm silica-modified Al2O3 particles (Rocatec Plus); and with Rocatec Plus. The phase transformation (%) was assessed by x-ray diffraction analysis. The 3-point flexural strength test was conducted in artificial saliva at 37°C in a mechanical testing machine. The data were analyzed by 1-way ANOVA and the Tukey honestly significant difference post hoc test (α=.05). Results Except for the Cojet Sand group, which exhibited statistically similar flexural strength to that of the as-sintered group and for the group abraded with 250-μm Al2O3 particles, which presented the lowest strength, airborne-particle abrasion with the other particle sizes provided the highest values, with no significant difference among them. The as-sintered specimens presented no monoclinic phase. The groups abraded with smaller particles (30 μm and 50 μm) and those treated with the larger ones (110 μm and/or 120 μm particles and 250 μm) exhibited percentages of monoclinic phase that varied from 4% to 5% and from 8.7% to 10%. Conclusions Except for abrasion with Cojet Sand, depending on the particle size, zirconia exhibited an increase or a decrease in its flexural strength. Airborne-particle abrasion promoted phase transformation (tetragonal to monoclinic), and the percentage of monoclinic phase varied according to the particle size.

Constraint handling rules. Compositional semantics and program transformation

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.

Cut-first branch-and-price-second for the capacitated arc-routing problem

This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cuts and an excellent lower bound. It is known that this bound is typically stronger than relaxations of a pure set-partitioning CARP model.rnSuch a set-partitioning master program results from a Dantzig-Wolfe decomposition. In the second phase, the master program is initialized with the strong cuts, CARP tours are iteratively generated by a pricing procedure, and branching is required to produce integer solutions. This is a cut-first bap-second algorithm and its main function is, in fact, the splitting of edge flows into unique CARP tours.

Youth criminality and urban social conflict in the city of Rosario, Argentina. Analysis and proposals for conflict transformation

The present article describes and analyses youth criminality in the city of Rosario, Argentina between the years 2003-2006. Key actors’ understandings of and responses to the conflict were investigated by means of semi-structured interviews, observations, discourse analysis of policy documents, analysis of secondary data, and draw heavily on the experience of the author, a citizen and youth worker of Rosario. The actors examined were the police, the local government, young delinquents and youth organisations. Youth criminality is analysed from a conflict transformation approach using conflict analysis tools. Whereas, the provincial police understand the issue as a delinquency problem, other actors perceive it as an expression of a wider urban social conflict between those that are “included” and those that are “excluded” and as one of the negative effects of globalisation processes. The results suggest that police responses addressing only direct violence are ineffective, even contributing to increased tensions and polarisation, whereas strategies addressing cultural and structural violence are more suitable for this type of social urban conflict. Finally, recommendations for local youth policy are proposed to facilitate participation and inclusion of youth and as a tool for peaceful conflict transformation.

Perspective transformation: Women in long-term recovery from alcohol abuse

Objective. The purpose of this study was to determine the meaning of personal transformation for twenty women in long term, stable recovery from alcohol abuse; to identify themes or patterns of this recovery, and; to determine the extent to which they experienced the phenomenon of perspective transformation. ^ Method. Volunteers were recruited by advertisement, word of mouth, and through a closed circuit web based broadcast. A descriptive, exploratory study, which analyzed perspective transformation from the standpoint of five action phases, was conducted. Data was collected using in-depth personal interviews and questionnaires. Subjects' responses were analyzed by qualitative methods. Triangulation was performed on the grouped data comparing the interviews to the data produced by the questionnaires. Quantitative analysis of questionnaire items explored behavioral changes experienced before and after alcoholism recovery. ^ Results. Five phases of recovery were identified. Phase I which involved recognition that alcohol was a problem and change might be possible took several years during which 3 major transitions occurred: (1) from often being alienated to having relationships with family and friends; (2) from daily upheavals to eventually a more peaceful existence, and; (3) from denial that alcohol was a problem to acceptance and willingness to change. Recovery was often seen in a spiritual context, which also required ongoing support. During Phase II there was an assessment of self, others, and the environment which revealed a pattern of intense unhappiness and negative feelings toward self and others with a disregard for cultural norms. Phase III revealed a period of desperation as life became unmanageable, but gradual willingness to accept support and guidance and a desire to improve self and help others. This led to improvement of existing role performance and the willingness to try out new roles. In Phase IV there was a pattern of personal growth which included: the establishment of boundaries, setting priorities, a willingness to place others' needs above their own, acceptance of responsibility, and learning to cope without alcohol, often with the use of tools learned in AA. During Phase V, many experienced knowledge of frailties but growing respect for self and others, with an improved ability to function in giving relationships. Implications for Prevention and Recovery: Early education concerning addiction and recovery may play a crucial role in prevention and early recovery, as it did for children of women in this study. Recovery requires persistent effort and organized support. ^

Remarks on methods for the computation of boundary-element integrals by co-ordinate transformation

It is well known that the evaluation of the influence matrices in the boundary-element method requires the computation of singular integrals. Quadrature formulae exist which are especially tailored to the specific nature of the singularity, i.e. log(*- x0)9 Ijx- JC0), etc. Clearly the nodes and weights of these formulae vary with the location Xo of the singular point. A drawback of this approach is that a given problem usually includes different types of singularities, and therefore a general-purpose code would have to include many alternative formulae to cater for all possible cases. Recently, several authors1"3 have suggested a type independent alternative technique based on the combination of standard Gaussian rules with non-linear co-ordinate transformations. The transformation approach is particularly appealing in connection with the p.adaptive version, where the location of the collocation points varies at each step of the refinement process. The purpose of this paper is to analyse the technique in eference 3. We show that this technique is asymptotically correct as the number of Gauss points increases. However, the method possesses a 'hidden' source of error that is analysed and can easily be removed.

A new set of integrals of motion to propagate the perturbed two-body problem

A formulation of the perturbed two-body problem that relies on a new set of orbital elements is presented. The proposed method represents a generalization of the special perturbation method published by Peláez et al. (Celest Mech Dyn Astron 97(2):131?150,2007) for the case of a perturbing force that is partially or totally derivable from a potential. We accomplish this result by employing a generalized Sundman time transformation in the framework of the projective decomposition, which is a known approach for transforming the two-body problem into a set of linear and regular differential equations of motion. Numerical tests, carried out with examples extensively used in the literature, show the remarkable improvement of the performance of the new method for different kinds of perturbations and eccentricities. In particular, one notable result is that the quadratic dependence of the position error on the time-like argument exhibited by Peláez?s method for near-circular motion under the J2 perturbation is transformed into linear.Moreover, themethod reveals to be competitive with two very popular elementmethods derived from theKustaanheimo-Stiefel and Sperling-Burdet regularizations.

EDROMO: An accurate propagator for elliptical orbits in the perturbed two-body problem

EDROMO is a special perturbation method for the propagation of elliptical orbits in the perturbed two-body problem. The state vector consists of a time-element and seven spatial elements, and the independent variable is a generalized eccentric anomaly introduced through a Sundman time transformation. The key role in the derivation of the method is played by an intermediate reference frame which enjoys the property of remaining fixed in space as long as perturbations are absent. Three elements of EDROMO characterize the dynamics in the orbital frame and its orientation with respect to the intermediate frame, and the Euler parameters associated to the intermediate frame represent the other four spatial elements. The performance of EDromo has been analyzed by considering some typical problems in astrodynamics. In almost all our tests the method is the best among other popular formulations based on elements.