Phase and microstructural evolution during the heat treatment of Sm-Ca-alpha-sialon ceramics

The phase and microstructural evolution of multi-cation Sm-Ca-alpha-sialon ceramics was investigated. Six samples were prepared, ranging from a pure Sm-sialon to a pure Ca-sialon, with calcium replacing samarium in 20 eq% increments, thus maintaining an equivalent design composition in all samples. After pressureless sintering at 1820 degreesC for 2 It, all samples were subsequently heat treated up to 192 h at 1450 and 1300 degreesC. The amount of grain boundary glass in the samples after sintering was observed to decrease with increasing calcium levels. A M-ss' or M-ss',-gehlenite solid solution was observed to form during the 1450 degreesC heat treatment of all Sm-containing samples, and this phase forms in clusters in the high-Sm samples. The thermal stability of the alpha-sialon phase was improved in the multi-cation systems. Heat treatment at 1300 degreesC produces SmAlO3 in the high-Sm samples, a M-ss',-gehlenite solid solution in the high-Ca samples, and a Sm-Ca-apatite phase in some intermediate samples. (C) 2002 Elsevier Science Ltd. All rights reserved.

Capillaries within compartments: Microvascular interpretation of dynamic positron emission tomography data

Measurement of exchange of substances between blood and tissue has been a long-lasting challenge to physiologists, and considerable theoretical and experimental accomplishments were achieved before the development of the positron emission tomography (PET). Today, when modeling data from modern PET scanners, little use is made of earlier microvascular research in the compartmental models, which have become the standard model by which the vast majority of dynamic PET data are analysed. However, modern PET scanners provide data with a sufficient temporal resolution and good counting statistics to allow estimation of parameters in models with more physiological realism. We explore the standard compartmental model and find that incorporation of blood flow leads to paradoxes, such as kinetic rate constants being time-dependent, and tracers being cleared from a capillary faster than they can be supplied by blood flow. The inability of the standard model to incorporate blood flow consequently raises a need for models that include more physiology, and we develop microvascular models which remove the inconsistencies. The microvascular models can be regarded as a revision of the input function. Whereas the standard model uses the organ inlet concentration as the concentration throughout the vascular compartment, we consider models that make use of spatial averaging of the concentrations in the capillary volume, which is what the PET scanner actually registers. The microvascular models are developed for both single- and multi-capillary systems and include effects of non-exchanging vessels. They are suitable for analysing dynamic PET data from any capillary bed using either intravascular or diffusible tracers, in terms of physiological parameters which include regional blood flow. (C) 2003 Elsevier Ltd. All rights reserved.

First-principles quantum dynamics in interacting Bose gases II: stochastic gauges

First principles simulations of the quantum dynamics of interacting Bose gases using the stochastic gauge representation are analysed. In a companion paper, we showed how the positive-P representation can be applied to these problems using stochastic differential equations. That method, however, is limited by increased sampling error as time evolves. Here, we show how the sampling error can be greatly reduced and the simulation time significantly extended using stochastic gauges. In particular, local stochastic gauges (a subset) are investigated. Improvements are confirmed in numerical calculations of single-, double- and multi-mode systems in the weak-mode coupling regime. Convergence issues are investigated, including the recognition of two modes by which stochastic equations produced by phase-space methods in general can diverge: movable singularities and a noise-weight relationship. The example calculated here displays wave-like behaviour in spatial correlation functions propagating in a uniform 1D gas after a sudden change in the coupling constant. This could in principle be tested experimentally using Feshbach resonance methods.

Novel ultra-wideband pulse spectrum modulation scheme

Current ultra-wideband communication systems use short narrow timed pulse sequences to transmit information. Some disadvantages of UWB communication systems are its interference of other conventional wireless systems and its reliance on time hopping schemes for multiple access. This paper presents a novel UWB data modulation scheme based on pulse shaping. This modulation scheme adds more flexibility for data modulation in UWB communication systems. The modulation scheme encodes data in both the timing and frequency spectrum of the transmitted pulse. This has the potential to improve data throughput rates and to lower interference between UWB and narrowband systems.

Classifying an opponent's behaviour in robot soccer

This paper illustrates the prediction of opponent behaviour in a competitive, highly dynamic, multi-agent and partially observableenvironment, namely RoboCup small size league robot soccer. The performance is illustrated in the context of the highly successful robot soccer team, the RoboRoos. The project is broken into three tasks; classification of behaviours, modelling and prediction of behaviours and integration of the predictions into the existing planning system. A probabilistic approach is taken to dealing with the uncertainty in the observations and with representing the uncertainty in the prediction of the behaviours. Results are shown for a classification system using a Naïve Bayesian Network that determines the opponent’s current behaviour. These results are compared to an expert designed fuzzy behaviour classification system. The paper illustrates how the modelling system will use the information from behaviour classification to produce probability distributions that model the manner with which the opponents perform their behaviours. These probability distributions are show to match well with the existing multi-agent planning system (MAPS) that forms the core of the RoboRoos system.

Embedding defeasible logic into logic programming

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

Rough Notes on Programming AVR Microcontrollers in C

These notes follow on from the material that you studied in CSSE1000 Introduction to Computer Systems. There you studied details of logic gates, binary numbers and instruction set architectures using the Atmel AVR microcontroller family as an example. In your present course (METR2800 Team Project I), you need to get on to designing and building an application which will include such a microcontroller. These notes focus on programming an AVR microcontroller in C and provide a number of example programs to illustrate the use of some of the AVR peripheral devices.

DR-NEGOTIATE - A system for automated agent negotiation with defeasible logic-based strategies

This paper reports on a system for automated agent negotiation, based on a formal and executable approach to capture the behavior of parties involved in a negotiation. It uses the JADE agent framework, and its major distinctive feature is the use of declarative negotiation strategies. The negotiation strategies are expressed in a declarative rules language, defeasible logic, and are applied using the implemented system DR-DEVICE. The key ideas and the overall system architecture are described, and a particular negotiation case is presented in detail.

Interaction between Normative Systems and Cognitive Agents in Temporal Modal Defeasible Logic

While some recent frameworks on cognitive agents addressed the combination of mental attitudes with deontic concepts, they commonly ignore the representation of time. An exception is [1]that manages also some temporal aspects both with respect to cognition and normative provisions. We propose in this paper an extension of the logic presented in [1]with temporal intervals.

Programming internet based DAI applications in Qu-Prolog

This paper presents the unique collection of additional features of Qu-Prolog, a variant of the Al programming language Prolog, and illustrates how they can be used for implementing DAI applications. By this we mean applications comprising communicating information servers, expert systems, or agents, with sophisticated reasoning capabilities and internal concurrency. Such an application exploits the key features of Qu-Prolog: support for the programming of sound non-clausal inference systems, multi-threading, and high level inter-thread message communication between Qu-Prolog query threads anywhere on the internet. The inter-thread communication uses email style symbolic names for threads, allowing easy construction of distributed applications using public names for threads. How threads react to received messages is specified by a disjunction of reaction rules which the thread periodically executes. A communications API allows smooth integration of components written in C, which to Qu-Prolog, look like remote query threads.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.