Local Utility Functions and Local Probability Transformations

This note shows that, under appropriate conditions, preferences may be locally approximated by the linear utility or risk-neutral preference functional associated with a local probability transformation.

Martensite Crystallography - the apparent controversy between the infinitesimal deformation approach and the phenomenological theory of martensitic transformations

The aim of this article is to demonstrate that the apparent controversy between the infinitesimal deformation (ID) approach and the phenomenological theory of martensitic transformations (PTMTs) in predicting the crystallographic characteristics of a martensitic transformation is entirely based on unjustified approximations associated with the way in which the ID calculations are performed. When applied correctly, the ID approach is shown to be absolutely identical to the PTMT. Nevertheless, there may be some advantages in using the ID approach. In particular, it is somewhat simpler than the PTMT; it is based on a physical concept that is easier to understand and, most important, it may provide a tool for investigating some of the features of martensitic transformations that have eluded explanation via the PTMT.

Modal characteristics of a flexible beam with multiple distributed actuators

A flexible structure with surface-bonded piezoceramic patches is modelled using Timoshenko beam theory. Exact mode shapes and natural frequencies associated with the flexural motion are computed for various piezoceramic distributed actuator arrangements. The effects of patch placement and of shear on the modal characteristics are demonstrated using a cantilevered beam as an example. Perfect bonding of the piezoceramic to the beam substructure is assumed, and for the purposes of this paper only passive piezoceramic properties are considered. The modelling technique and results obtained in a closed form are intended to assist investigations into the modelling and control of active structures with surface-bonded piezoceramic actuators. (C) 2003 Elsevier Science Ltd. All rights reserved.

Administering Welfare Reform: International Transformations in Welfare Governance

While reforms of welfare policies have been widely analyzed, the reform of welfare administration has received far less attention. Using empirical case studies, this book provides significant new insights into the way welfare administration is being internationally transformed. Particular attention is given to the effect on welfare clients, staff, and agencies. The book presents a critical analysis of governance practices in welfare administration, examining shifts in the participants, practices, and processes. Administering Welfare Reform provides a much-needed international and comparative perspective of changing welfare governance.

A graphical specification of model transformations with triple graph grammars

Models and model transformations are the core concepts of OMG's MDA (TM) approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification formalism. These triple graph grammars can be specified within the FUJABA tool and we argue that these rules can be more easily specified and they become more understandable and maintainable. To show the practicability of our approach, we present how to generate Tefkat rules from triple graph grammar rules, which helps to integrate triple graph grammars with a state of a art model transformation tool and shows the expressiveness of the concept.

Verifying metamodel coverage of model transformations

Since the object management group (OMG) commenced its model driven architecture (MDA) initiative, there has been considerable activity proposing and building automatic model transformation systems to help implement the MDA concept. Much less attention has been given to the need to ensure that model transformations generate the intended results. This paper explores one aspect of validation and verification for MDA: coverage of the source and/or target metamodels by a set of model transformations. The paper defines the property of metamodel coverage and some corresponding algorithms. This property helps the user assess which parts of a source (or target) metamodel are referenced by a given model transformation set. Some results are presented from a prototype implementation that is built on the eclipse modeling framework (EMF).

On the relative complexity of labelled modal tableaux

We investigate the relative complexity of two free-variable labelled modal tableaux(KEM and Single Step Tableaux, SST). We discuss the reasons why p-simulation is not a proper measure of the relative complexity of tableaux-like proof systems, and we propose an improved comparison scale (p-search-simulation). Finally we show that KEM p-search-simulates SST while SST cannot p-search-simulate KEM.

Minimum description length, regularisation and multi-modal data

Relationships between clustering, description length, and regularisation are pointed out, motivating the introduction of a cost function with a description length interpretation and the unusual and useful property of having its minimum approximated by the densest mode of a distribution. A simple inverse kinematics example is used to demonstrate that this property can be used to select and learn one branch of a multi-valued mapping. This property is also used to develop a method for setting regularisation parameters according to the scale on which structure is exhibited in the training data. The regularisation technique is demonstrated on two real data sets, a classification problem and a regression problem.

Minimum description length, regularisation and multi-modal data

Conventional feed forward Neural Networks have used the sum-of-squares cost function for training. A new cost function is presented here with a description length interpretation based on Rissanen's Minimum Description Length principle. It is a heuristic that has a rough interpretation as the number of data points fit by the model. Not concerned with finding optimal descriptions, the cost function prefers to form minimum descriptions in a naive way for computational convenience. The cost function is called the Naive Description Length cost function. Finding minimum description models will be shown to be closely related to the identification of clusters in the data. As a consequence the minimum of this cost function approximates the most probable mode of the data rather than the sum-of-squares cost function that approximates the mean. The new cost function is shown to provide information about the structure of the data. This is done by inspecting the dependence of the error to the amount of regularisation. This structure provides a method of selecting regularisation parameters as an alternative or supplement to Bayesian methods. The new cost function is tested on a number of multi-valued problems such as a simple inverse kinematics problem. It is also tested on a number of classification and regression problems. The mode-seeking property of this cost function is shown to improve prediction in time series problems. Description length principles are used in a similar fashion to derive a regulariser to control network complexity.

Accuracy and applications of group MEG studies using cortical source locations estimated from participants' scalp surfaces

We contend that powerful group studies can be conducted using magnetoencephalography (MEG), which can provide useful insights into the approximate distribution of the neural activity detected with MEG without requiring magnetic resonance imaging (MRI) for each participant. Instead, a participant's MRI is approximated with one chosen as a best match on the basis of the scalp surface from a database of available MRIs. Because large inter-individual variability in sulcal and gyral patterns is an inherent source of blurring in studies using grouped functional activity, the additional error introduced by this approximation procedure has little effect on the group results, and offers a sufficiently close approximation to that of the participants to yield a good indication of the true distribution of the grouped neural activity. T1-weighted MRIs of 28 adults were acquired in a variety of MR systems. An artificial functional image was prepared for each person in which eight 5 × 5 × 5 mm regions of brain activation were simulated. Spatial normalisation was applied to each image using transformations calculated using SPM99 with (1) the participant's actual MRI, and (2) the best matched MRI substituted from those of the other 27 participants. The distribution of distances between the locations of points using real and substituted MRIs had a modal value of 6 mm with 90% of cases falling below 12.5 mm. The effects of this -approach on real grouped SAM source imaging of MEG data in a verbal fluency task are also shown. The distribution of MEG activity in the estimated average response is very similar to that produced when using the real MRIs. © 2003 Wiley-Liss, Inc.