Model Selection for Solving Kinematics Problems

There has been much interest in the area of model-based reasoning within the Artificial Intelligence community, particularly in its application to diagnosis and troubleshooting. The core issue in this thesis, simply put, is, model-based reasoning is fine, but whence the model? Where do the models come from? How do we know we have the right models? What does the right model mean anyway? Our work has three major components. The first component deals with how we determine whether a piece of information is relevant to solving a problem. We have three ways of determining relevance: derivational, situational and an order-of-magnitude reasoning process. The second component deals with the defining and building of models for solving problems. We identify these models, determine what we need to know about them, and importantly, determine when they are appropriate. Currently, the system has a collection of four basic models and two hybrid models. This collection of models has been successfully tested on a set of fifteen simple kinematics problems. The third major component of our work deals with how the models are selected.

Combining Associational and Causal Reasoning to Solve Interpretation and Planning Problems

This report describes a paradigm for combining associational and causal reasoning to achieve efficient and robust problem-solving behavior. The Generate, Test and Debug (GTD) paradigm generates initial hypotheses using associational (heuristic) rules. The tester verifies hypotheses, supplying the debugger with causal explanations for bugs found if the test fails. The debugger uses domain-independent causal reasoning techniques to repair hypotheses, analyzing domain models and the causal explanations produced by the tester to determine how to replace faulty assumptions made by the generator. We analyze the strengths and weaknesses of associational and causal reasoning techniques, and present a theory of debugging plans and interpretations. The GTD paradigm has been implemented and tested in the domains of geologic interpretation, the blocks world, and Tower of Hanoi problems.

Probabilistic Solution of Inverse Problems

In this thesis we study the general problem of reconstructing a function, defined on a finite lattice from a set of incomplete, noisy and/or ambiguous observations. The goal of this work is to demonstrate the generality and practical value of a probabilistic (in particular, Bayesian) approach to this problem, particularly in the context of Computer Vision. In this approach, the prior knowledge about the solution is expressed in the form of a Gibbsian probability distribution on the space of all possible functions, so that the reconstruction task is formulated as an estimation problem. Our main contributions are the following: (1) We introduce the use of specific error criteria for the design of the optimal Bayesian estimators for several classes of problems, and propose a general (Monte Carlo) procedure for approximating them. This new approach leads to a substantial improvement over the existing schemes, both regarding the quality of the results (particularly for low signal to noise ratios) and the computational efficiency. (2) We apply the Bayesian appraoch to the solution of several problems, some of which are formulated and solved in these terms for the first time. Specifically, these applications are: teh reconstruction of piecewise constant surfaces from sparse and noisy observationsl; the reconstruction of depth from stereoscopic pairs of images and the formation of perceptual clusters. (3) For each one of these applications, we develop fast, deterministic algorithms that approximate the optimal estimators, and illustrate their performance on both synthetic and real data. (4) We propose a new method, based on the analysis of the residual process, for estimating the parameters of the probabilistic models directly from the noisy observations. This scheme leads to an algorithm, which has no free parameters, for the restoration of piecewise uniform images. (5) We analyze the implementation of the algorithms that we develop in non-conventional hardware, such as massively parallel digital machines, and analog and hybrid networks.

CARPS: A Program which Solves Calculus Word Problems

A program was written to solve calculus word problems. The program, CARPS (CALculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow's STUDENT, the primary difference being the introduction of "structures" as the internal model in CARPS. Structures are stored internally as trees. Each structure is designed to hold the information gathered about one object. A description of CARPS is given by working through two problems, one in great detail. Also included is a critical analysis of STUDENT.

Continuous configuration time-dependent self-consistent field method for polyatomic quantum dynamical problems

A new continuous configuration time-dependent self-consistent field method has been developed to study polyatomic dynamical problems by using the discrete variable representation for the reaction system, and applied to a reaction system coupled to a bath. The method is very efficient because the equations involved are as simple as those in the traditional single configuration approach, and can account for the correlations between the reaction system and bath modes rather well. (C) American Institute of Physics.

Roll Project Bin Packing Benchmark Problems.

This document describes two sets of Benchmark Problem Instances for the One Dimensional Bin Packing Problem. The problem instances are supplied as compressed (zipped) SQLITE database files.

Roll Project Job Shop scheduling benchmark problems.

This document describes two sets of benchmark problem instances for the job shop scheduling problem. Each set of instances is supplied as a compressed (zipped) archive containing a single CSV file for each problem instance using the format described in http://rollproject.org/jssp/jsspGen.pdf

Roll Project Rich Vehicle Routing benchmark problems.

This document describes a large set of Benchmark Problem Instances for the Rich Vehicle Routing Problem. All files are supplied as a single compressed (zipped) archive containing the instances, in XML format, an Object-Oriented Model supplied in XSD format, documentation and an XML parser written in Java to ease use.

Rings around the World: Notes on the Challenges, Problems & Possibilities of International Audience Projects

Egan, K., Barker, M. (2006). Rings around the World: Notes on the Challenges, Problems & Possibilities of International Audience Projects. Participations: Journal of Audience & Reception Studies, 3 (2). Sponsorship: This research was made possible by a grant from the Economic and Social Research Council (ESRC Grant No. 000-22-0323)

France and the Problems of Security and Disarmament after the First World War

Jackson, Peter, 'France and the Problems of Security and Disarmament after the First World War', Journal of Strategic Studies (2006) 29(2) pp.247-280 Special Issue: Enforcing arms limits: Germany post 1919; Iraq post 1991 RAE2008

The Where, Who, When and Why of Medieval Welsh Prose Texts: Some Methodological Considerations

Rodway, S. (2007). The Where, Who, When and Why of Medieval Welsh Prose Texts: Some Methodological Considerations. Studia Celtica. 41, pp.47-89. RAE2008

Birkhoff normal forms in semi-classical inverse problems

Iantchenko, A.; Sj?strand, J.; Zworski, M., (2002) 'Birkhoff normal forms in semi-classical inverse problems', Mathematical Research Letters 9(3) pp.337-362 RAE2008

Problems of maximal mean resistance on the plane

Plakhov, A.Y.; Gouveia, P.D.F., (2007) 'Problems of maximal mean resistance on the plane', Nonlinearity 20(9) pp.2271-2287 RAE2008

IInformacyjne wspomaganie oświaty

In view of a constant growth of writings on didactic and educational problems it is necessary to create an efficient system of scientific educational information. This system will provide creative teachers with materials that will facilitate the selection and access to materials that will enrich the teachers' methodological base and their own intellectual potential by means of a network of school and pedagogical libraries. Such well-organized and efficiently operating system at the level of the school superintendent's office, whose links will be educational institutions as well as those that improve teaching methods of the teaching staff, may be of great information and practical importance in the present age of rapid transformations. It will become an instrument that will make contact with pedagogical writings and improvement of qualifications of the teaching staff possible.