Engineering Object-Oriented Semantics Using Graph Transformations

In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph transformation rules. In the process we establish a mapping between UML models and graphs. TAAL was developed for the purpose of this paper, as an extensive case study in engineering object-oriented language semantics using graph transformation. It incorporates the basic aspects of many commonly used object-oriented programming languages: apart from essential imperative programming constructs, it includes inheritance, object creation and method overriding. The language specification is based on a number of meta-models written in UML. Both the static and dynamic semantics are defined using graph rewriting rules. In the course of the case study, we have built an Eclipse plug-in that automatically transforms arbitrary TAAL programs into graphs, in a graph format readable by another tool. This second tool is called Groove, and it is able to execute graph transformations. By combining both tools we are able to visually simulate the execution of any TAAL program

Design and Performance of Horizontal Drains

The paper presents a comparison of field and analytical data regarding the performance of horizontal drains installed to stabilize a landslide. Results of the comparison provide generalized guidelines with which to design drain spacing, length and position. The most significant conclusions are, firstly, that horizontal drains were able to successfully depressurize a silty fine sand with up to 60% silt; secondly, that the ultimate drawdown that can be achieved by slotted horizontal drains in fine-grained soils is controlled primarily by the elevation of the drain; and thirdly; that the design drain spacing is dependent primarily on the initial drawdown response time

Continuous non-perturbative regularization of QED

We regularize in a continuous manner the path integral of QED by construction of a non-local version of its action by means of a regularized form of Dirac's $\delta$ functions. Since the action and the measure are both invariant under the gauge group, this regularization scheme is intrinsically non-perturbative. Despite the fact that the non-local action converges formally to the local one as the cutoff goes to infinity, the regularized theory keeps trace of the non-locality through the appearance of a quadratic divergence in the transverse part of the polarization operator. This term which is uniquely defined by the choice of the cutoff functions can be removed by a redefinition of the regularized action. We notice that as for chiral fermions on the lattice, there is an obstruction to construct a continuous and non ambiguous regularization in four dimensions. With the help of the regularized equations of motion, we calculate the one particle irreducible functions which are known to be divergent by naive power counting at the one loop order.Comment: 23 pages, LaTeX, 5 Encapsulated Postscript figures. Improved and revised version, to appear in Phys. Rev.

Arithmetically Cohen-Macaulay Bundles on complete intersection varieties of sufficiently high multidegree

Recently it has been proved that any arithmetically Cohen-Macaulay (ACM) bundle of rank two on a general, smooth hypersurface of degree at least three and dimension at least four is a sum of line bundles. When the dimension of the hypersurface is three, a similar result is true provided the degree of the hypersurface is at least six. We extend these results to complete intersection subvarieties by proving that any ACM bundle of rank two on a general, smooth complete intersection subvariety of sufficiently high multi-degree and dimension at least four splits. We also obtain partial results in the case of threefolds.Comment: 15 page