. Polytypic programming, shapely types and generic attribute grammars are generic programming methods related to this approach. A framework for generic programming is proposed to embed these methods. It consists in tools for automatic generation of morphisms between data structures, and for program

into generic components along sense-think-act lines. A discussion of the role and structure of each component is presented. An illustrative example is presented of an implementation of a Morphin/D*-based navigation algorithm using this framework. Early results from experimentation in simulation are also

pH in topsoil was difficult with all three methods. This framework can adopt both continuous and categorical soil variables in a semi-automated or automated manner. It opens a possibility to develop a bundle algorithm that can be implemented in a GIS to 0016-7 doi:10. $ S results

Aston UniversitySome pages of this thesis may have been removed for copyright restrictions. If you have discovered material in AURA which is unlawful e.g. breaches copyright, (either yours or that of a third party) or any other law, including but not limited to those relating to

The provision of location-based services is expected to have essential impact in the competition among 3 rd Generation network operators. To support the realization of this functionality the standard UMTS infrastructure will probably need to be supplemented with additional intelligent components. Furthermore, flexible Location-based charging mechanisms have to be designed and deployed to allow subscribers to be charged with different rates, depending on their location and profiles. In this paper a proposed platform for location-aware service provision is introduced and the interactions among its constituent components for applying an efficient locationbased charging scheme are discussed in detail.

This article describes a generic framework used in the MR based AMIRE (Authoring Mixed Reality) project. The concepts of the presented framework can be used in every 3D based application (e.g. game, VR-/AR- applications etc.) and our approach allows an easy communication between the objects (game

response. There are many tools which assist in capturing data transferred over the networks so that an attack or the malicious intent of the intrusions may be investigated. This paper presents a generic framework for network forensic analysis by specifically identifying the steps connected only to network

Discrete event simulation is widely used within the networking community for purposes such as demonstrating the validity of network protocols and architectures. Depending on the level of detail modeled within the simulation, the running time and memory requirements can be excessive. The goal of our research is to develop and demonstrate a practical, scalable approach to parallel and distributed simulation that will enable widespread reuse of sequential network simulation models and software. We focus on an approach to parallelization where an existing network simulator is used to build models of subnetworks that are composed to create simulations of larger networks. Changes to the original simulator are minimized, enabling the parallel simulator to easily track enhancements to the sequential version. In this paper we describe our lessons learned in applying this approach to the publicly available ns [9] software package, and converting it to run in a parallel fashion on a network of wo...

Abstract not found

defined has the properties naturally expected from it. A prototype implementation of our approach was developed in the K Framework. We demonstrate the genericity of our tool by instantiating it on several languages, and show how it can be used for the symbolic execution and model checking of several