Model transformations and Tool Integration

Model transformations are increasingly recognised as being of significant importance to many areas of software development and integration. Recent attention on model transformations has particularly focused on the OMGs Queries/Views/Transformations (QVT) Request for Proposals (RFP). In this paper I motivate the need for dedicated approaches to model transformations, particularly for the data involved in tool integration, outline the challenges involved, and then present a number of technologies and techniques which allow the construction of flexible, powerful and practical model transformations

Dynamic Multilevel Graph Visualization

We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsening algorithm. To ensure the vertices follow smooth trajectories, we employ dynamics simulation techniques, treating the vertices as point particles. We simulate fine and coarse levels of the graph simultaneously, coupling the dynamics of adjacent levels. Projection from coarser to finer levels is adaptive, with the projection determined by an affine transformation that evolves alongside the graph layouts. The result is a dynamic graph visualizer that quickly and smoothly adapts to changes in a graph.Comment: 21 page

Automatic frequency assignment for cellular telephones using constraint satisfaction techniques

We study the problem of automatic frequency assignment for cellular telephone systems. The frequency assignment problem is viewed as the problem to minimize the unsatisfied soft constraints in a constraint satisfaction problem (CSP) over a finite domain of frequencies involving co-channel, adjacent channel, and co-site constraints. The soft constraints are automatically derived from signal strength prediction data. The CSP is solved using a generalized graph coloring algorithm. Graph-theoretical results play a crucial role in making the problem tractable. Performance results from a real-world frequency assignment problem are presented. We develop the generalized graph coloring algorithm by stepwise refinement, starting from DSATUR and augmenting it with local propagation, constraint lifting, intelligent backtracking, redundancy avoidance, and iterative deepening

‘Warrant’ revisited: Integrating mathematics teachers’ pedagogical and epistemological considerations into Toulmin’s model for argumentation

In this paper, we propose an approach to analysing teacher arguments that takes into account field dependence—namely, in Toulmin’s sense, the dependence of warrants deployed in an argument on the field of activity to which the argument relates. Freeman, to circumvent issues that emerge when we attempt to determine the field(s) that an argument relates to, proposed a classification of warrants (a priori, empirical, institutional and evaluative). Our approach to analysing teacher arguments proposes an adaptation of Freeman’s classification that distinguishes between: epistemological and pedagogical a priori warrants, professional and personal empirical warrants, epistemological and curricular institutional warrants, and evaluative warrants. Our proposition emerged from analyses conducted in the course of a written response and interview study that engages secondary mathematics teachers with classroom scenarios from the mathematical areas of analysis and algebra. The scenarios are hypothetical, grounded on seminal learning and teaching issues, and likely to occur in actual practice. To illustrate our proposed approach to analysing teacher arguments here, we draw on the data we collected through the use of one such scenario, the Tangent Task. We demonstrate how teacher arguments, not analysed for their mathematical accuracy only, can be reconsidered, arguably more productively, in the light of other teacher considerations and priorities: pedagogical, curricular, professional and personal

Reason Maintenance - State of the Art

This paper describes state of the art in reason maintenance with a focus on its future usage in the KiWi project. To give a bigger picture of the field, it also mentions closely related issues such as non-monotonic logic and paraconsistency. The paper is organized as follows: first, two motivating scenarios referring to semantic wikis are presented which are then used to introduce the different reason maintenance techniques

“Till the muddle in my mind have cleared awa”: can we help shape policy using systems modelling?

This paper considers how some well-documented deficiencies of mental models make it difficult to create effective policies, and suggests that systems modelling can begin to address this issue. To illustrate the argument three short cases are presented. These relate to specific domains but demonstrate how systems modelling can illuminate different general phenomena: effects on labour costs (unintended consequences and feedback); fishery management (accumulation and non-linearity) and child protection (worldviews and sense-making). Six levers for increasing the use of systems modelling in the policy arena are then discussed. The paper closes by emphasising the opportunities for systems modellers in the Anthropocene Era