Investigation into the performance of an algorithm for deriving concise descriptions of optic flow fields for real-time control

This paper describes a region-based algorithm for deriving a concise description of a first order optical flow field. The algorithm described achieves performance improvements over existing algorithms without compromising the accuracy of the flow field values calculated. These improvements are brought about by not computing the entire flow field between two consecutive images, but by considering only the flow vectors of a selected subset of the images. The algorithm is presented in the context of a project to balance a bipedal robot using visual information.

A policy model for secure information flow

When a computer program requires legitimate access to confidential data, the question arises whether such a program may illegally reveal sensitive information. This paper proposes a policy model to specify what information flow is permitted in a computational system. The security definition, which is based on a general notion of information lattices, allows various representations of information to be used in the enforcement of secure information flow in deterministic or nondeterministic systems. A flexible semantics-based analysis technique is presented, which uses the input-output relational model induced by an attacker's observational power, to compute the information released by the computational system. An illustrative attacker model demonstrates the use of the technique to develop a termination-sensitive analysis. The technique allows the development of various information flow analyses, parametrised by the attacker's observational power, which can be used to enforce what declassification policies.

Using the web graph to influence application behaviour

The Web's link structure (termed the Web Graph) is a richly connected set of Web pages. Current applications use this graph for indexing and information retrieval purposes. In contrast the relationship between Web Graph and application is reversed by letting the structure of the Web Graph influence the behaviour of an application. Presents a novel Web crawling agent, AlienBot, the output of which is orthogonally coupled to the enemy generation strategy of a computer game. The Web Graph guides AlienBot, causing it to generate a stochastic process. Shows the effectiveness of such unorthodox coupling to both the playability of the game and the heuristics of the Web crawler. In addition, presents the results of the sample of Web pages collected by the crawling process. In particular, shows: how AlienBot was able to identify the power law inherent in the link structure of the Web; that 61.74 per cent of Web pages use some form of scripting technology; that the size of the Web can be estimated at just over 5.2 billion pages; and that less than 7 per cent of Web pages fully comply with some variant of (X)HTML.

Largest connected component of a star graph with faulty vertices

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n >= 3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.

An algorithm for isentropic flow

An efficient algorithm is presented for the solution of the equations of isentropic gas dynamics with a general convex gas law. The scheme is based on solving linearized Riemann problems approximately, and in more than one dimension incorporates operator splitting. In particular, only two function evaluations in each computational cell are required. The scheme is applied to a standard test problem in gas dynamics for a polytropic gas

An efficient shock capturing scheme for the pseudo-unsteady equations representing steady inviscid flow

An efficient algorithm is presented for the solution of the steady Euler equations of gas dynamics. The scheme is based on solving linearised Riemann problems approximately and in more than one dimension incorporates operator splitting. The scheme is applied to a standard test problem of flow down a channel containing a circular arc bump for three different mesh sizes.

A non-uniform mesh scheme for compressible flow

A non-uniform mesh scheme is presented for the computation of compressible flows governed by the Euler equations of gas dynamics. The scheme is based on flux-difference splitting and represents an extension of a similar scheme designed for uniform meshes. The numerical results demonstrate that little, if any, spurious oscillation occurs as a result of the non-uniformity of the mesh; and importantly, shock speeds are computed correctly.

Shallow water flow with cylindrical symmetry

A numerical scheme is presented tor the solution of the shallow water equations in a single radial coordinate. This can prove useful when testing codes for the two-dimensional shallow water equations. The scheme is applied with success to problems involving converging and diverging bores.

A shock capturing scheme for steady, supercritical, free-surface flow

Abstract A finite difference scheme is presented for the solution of the two-dimensional shallow water equations in steady, supercritical flow. The scheme incorporates numerical characteristic decomposition, is shock capturing by design and incorporates space-marching as a result of the assumption that the flow is wholly supercritical in at least one space dimension. Results are shown for problems involving oblique hydraulic jumps and reflection from a wall.

A Riemann solver for compressible flow of a real gas in a Lagrangian frame

An approximate Riemann solver is presented for the compressible flow equations with a general (convex) equation of state in a Lagrangian frame of reference.