A Reference Interpreter for the Graph Programming Language GP 2

GP 2 is an experimental programming language for computing by graph transformation. An initial interpreter for GP 2, written in the functional language Haskell, provides a concise and simply structured reference implementation. Despite its simplicity, the performance of the interpreter is sufficient for the comparative investigation of a range of test programs. It also provides a platform for the development of more sophisticated implementations.Comment: In Proceedings GaM 2015, arXiv:1504.0244

A Complexity View of Rainfall

We show that rain events are analogous to a variety of nonequilibrium relaxation processes in Nature such as earthquakes and avalanches. Analysis of high-resolution rain data reveals that power laws describe the number of rain events versus size and number of droughts versus duration. In addition, the accumulated water column displays scale-less fluctuations. These statistical properties are the fingerprints of a self-organized critical process and may serve as a benchmark for models of precipitation and atmospheric processes.Comment: 4 pages, 5 figure

Self-Referential Noise and the Synthesis of Three-Dimensional Space

Generalising results from Godel and Chaitin in mathematics suggests that self-referential systems contain intrinsic randomness. We argue that this is relevant to modelling the universe and show how three-dimensional space may arise from a non-geometric order-disorder model driven by self-referential noise.Comment: Figure labels correcte

Rooted Graph Programs

We present an approach for programming with graph transformation rules in which programs can be as efficient as programs in imperative languages. The basic idea is to equip rules and host graphs with distinguished nodes, so-called roots, and to match roots in rules with roots in host graphs. This enables graph transformation rules to be matched in constant time, provided that host graphs have a bounded node degree (which in practice is often the case). Hence, for example, programs with a linear bound on the number of rule applications run in truly linear time. We demonstrate the feasibility of this approach with a case study in graph colouring

GP 2: Efficient Implementation of a Graph Programming Language

The graph programming language GP (Graph Programs) 2 and its implementation is the subject of this thesis. The language allows programmers to write visual graph programs at a high level of abstraction, bringing the task of solving graph-based problems to an environment in which the user feels comfortable and secure. Implementing graph programs presents two main challenges. The first challenge is translating programs from a high-level source code representation to executable code, which involves bridging the gap from a non-deterministic program to deterministic machine code. The second challenge is overcoming the theoretically impractical complexity of applying graph transformation rules, the basic computation step of a graph program. The work presented in this thesis addresses both of these challenges. We tackle the first challenge by implementing a compiler that translates GP 2 graph programs directly to C code. Implementation strategies concerning the storage and access of internal data structures are empirically compared to determine the most efficient approach for executing practical graph programs. The second challenge is met by extending the double-pushout approach to graph transformation with root nodes to support fast execution of graph transformation rules by restricting the search to the local neighbourhood of the root nodes in the host graph. We add this theoretical construct to the GP 2 language in order to support rooted graph transformation rules, and we identify a class of rooted rules that are applicable in constant time on certain classes of graphs. Finally, we combine theory and practice by writing rooted graph programs to solve two common graph algorithms, and demonstrate that their execution times are capable of matching the execution times of tailored C solutions

The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Results

This report summarizes the 3rd International Verification of Neural Networks Competition (VNN-COMP 2022), held as a part of the 5th Workshop on Formal Methods for ML-Enabled Autonomous Systems (FoMLAS), which was collocated with the 34th International Conference on Computer-Aided Verification (CAV). VNN-COMP is held annually to facilitate the fair and objective comparison of state-of-the-art neural network verification tools, encourage the standardization of tool interfaces, and bring together the neural network verification community. To this end, standardized formats for networks (ONNX) and specification (VNN-LIB) were defined, tools were evaluated on equal-cost hardware (using an automatic evaluation pipeline based on AWS instances), and tool parameters were chosen by the participants before the final test sets were made public. In the 2022 iteration, 11 teams participated on a diverse set of 12 scored benchmarks. This report summarizes the rules, benchmarks, participating tools, results, and lessons learned from this iteration of this competition.Comment: Corrected a small error in instance-wise results; 54 pages, 27 tables, and 16 figure

Entry, Descent, and Landing with Propulsive Deceleration: Supersonic Retropropulsion Wind Tunnel Testing and Shock Phenomena

The future exploration of the Solar System will require innovations in transportation and the use of entry, descent, and landing (EDL) systems at many planetary landing sites. The cost of space missions has always been prohibitive, and using the natural planetary and planet's moon atmospheres for entry, and descent can reduce the cost, mass, and complexity of these missions. This paper will describe some of the EDL ideas for planetary entry and survey the overall technologies for EDL that may be attractive for future Solar System missions. Future EDL systems may include an inflatable decelerator for the initial atmospheric entry and an additional supersonic retropropulsion (SRP) rocket system for the final soft landing. A three engine retropropulsion configuration with a 2.5 in. diameter sphere-cone aeroshell model was tested in the NASA Glenn Research Center's 1- by 1-ft (11) Supersonic Wind Tunnel (SWT). The testing was conducted to identify potential blockage issues in the tunnel, and visualize the rocket flow and shock interactions during supersonic and hypersonic entry conditions. Earlier experimental testing of a 70deg Viking-like (sphere-cone) aeroshell was conducted as a baseline for testing of a SRP system. This baseline testing defined the flow field around the aeroshell and from this comparative baseline data, retropropulsion options will be assessed. Images and analyses from the SWT testing with 300- and 500-psia rocket engine chamber pressures are presented here. In addition, special topics of electromagnetic interference with retropropulsion induced shock waves and retropropulsion for Earth launched booster recovery are also addressed

CoastalImageLib: An open- source Python package for creating common coastal image products

CoastalImageLib is a Python library that produces common coastal image products intended for quantitative analysis of coastal environments. This library contains functions to georectify and merge multiple oblique camera views, produce statistical image products for a given set of images, and create subsampled pixel instruments for use in bathymetric inversion, surface current estimation, run-up calculations, and other quantitative analyses. This package intends to be an open-source broadly generalizable front end to future coastal imaging applications, ultimately expanding user accessibility to optical remote sensing of coastal environments. This package was developed and tested on data collected from the Argus Tower, a 43 m tall observation structure in Duck, North Carolina at the US Army Engineer Research and Development Center’s Field Research Facility that holds six stationary cameras which collect twice-hourly coastal image products. Thus, CoastalImageLib also contains functions designed to interface with the file storage and collection system implemented at the Argus Tower