Existence of a semicontinuous or continuous utility function: a unified approach and an elementary proof

In this paper, we present a new unified approach and an elementary proof of a very general theorem on the existence of a semicontinuous or continuous utility function representing a preference relation. A simple and interesting new proof of the famous Debreu Gap Lemma is given. In addition, we prove a new Gap Lemma for the rational numbers and derive some consequences. We also prove a theorem which characterizes the existence of upper semicontinuous utility functions on a preordered topological space which need not be second countable. This is a generalization of the classical theorem of Rader which only gives sufficient conditions for the existence of an upper semicontinuous utility function for second countable topological spaces. (C) 2002 Elsevier Science B.V. All rights reserved.

Integrals for continuous-time Markov chains

This paper presents a method of evaluating the expected value of a path integral for a general Markov chain on a countable state space. We illustrate the method with reference to several models, including birth-death processes and the birth, death and catastrophe process. (C) 2002 Elsevier Science Inc. All rights reserved.

The non-existence of a utility function and the structure of non-representable preference relations

In this paper we investigate the structure of non-representable preference relations. While there is a vast literature on different kinds of preference relations that can be represented by a real-valued utility function, very little is known or understood about preference relations that cannot be represented by a real-valued utility function. There has been no systematic analysis of the non-representation problem. In this paper we give a complete description of non-representable preference relations which are total preorders or chains. We introduce and study the properties of four classes of non-representable chains: long chains, planar chains, Aronszajn-like chains and Souslin chains. In the main theorem of the paper we prove that a chain is non-representable if and only it is a long chain, a planar chain, an Aronszajn-like chain or a Souslin chain. (C) 2002 Published by Elsevier Science B.V.

Lexicographic decomposition of chains and the concept of a planar chain

In an earlier paper [Journal of Mathematical Economics, 37 (2002) 17-38], we proved that if a preference relation on a commodity space is non-representable by a real-valued function then that chain is necessarily a long chain, a planar chain, an Aronszajn-like chain or a Souslin chain. In this paper, we study the class of planar chains, the simplest example of which is the Debreu chain (R-2, <(l)). (C) 2002 Elsevier Science B.V. All rights reserved.

Testing insect movement theory: empirical analysis of pest data routinely collected from agricultural crops

Observations of an insect's movement lead to theory on the insect's flight behaviour and the role of movement in the species' population dynamics. This theory leads to predictions of the way the population changes in time under different conditions. If a hypothesis on movement predicts a specific change in the population, then the hypothesis can be tested against observations of population change. Routine pest monitoring of agricultural crops provides a convenient source of data for studying movement into a region and among fields within a region. Examples of the use of statistical and computational methods for testing hypotheses with such data are presented. The types of questions that can be addressed with these methods and the limitations of pest monitoring data when used for this purpose are discussed. (C) 2002 Elsevier Science B.V. All rights reserved.

Automatic construction of explicit R matrices for the one-parameter families of irreducible typical highest weight (0(m)vertical bar alpha(n)) representations of U-q[gl(m vertical bar n)]

We detail the automatic construction of R matrices corresponding to (the tensor products of) the (O-m\alpha(n)) families of highest-weight representations of the quantum superalgebras Uq[gl(m\n)]. These representations are irreducible, contain a free complex parameter a, and are 2(mn)-dimensional. Our R matrices are actually (sparse) rank 4 tensors, containing a total of 2(4mn) components, each of which is in general an algebraic expression in the two complex variables q and a. Although the constructions are straightforward, we describe them in full here, to fill a perceived gap in the literature. As the algorithms are generally impracticable for manual calculation, we have implemented the entire process in MATHEMATICA; illustrating our results with U-q [gl(3\1)]. (C) 2002 Published by Elsevier Science B.V.

Bishadowing and hyperbolicity

Shadowing of a dynamical system is often used to justify the validity of computer simulations of the system, and in numerical calculations an inverse form of the shadowing concept is also of some interest. In this paper we characterize the notion of shadowing in terms of stability, and express the notion of hyperbolicity using the concept of inverse shadowing.

Wavelet-based image segment representation

An efficient representation method for arbitrarily shaped image segments is proposed. This method includes a smart way to select wavelet basis to approximate the given image segment, with improved image quality and reduced computational load.

Existence of multiple solutions for second-order discrete boundary value problems

We give conditions on f involving pairs of discrete lower and discrete upper solutions which lead to the existence of at least three solutions of the discrete two-point boundary value problem yk+1 - 2yk + yk-1 + f (k, yk, vk) = 0, for k = 1,..., n - 1, y0 = 0 = yn,, where f is continuous and vk = yk - yk-1, for k = 1,..., n. In the special case f (k, t, p) = f (t) greater than or equal to 0, we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and Peterson and are in the spirit of our results for the continuous analogue. (C) 2002 Elsevier Science Ltd. All rights reserved.

Estimating and evaluating the statistics of gapped local-alignment scores

We present a novel maximum-likelihood-based algorithm for estimating the distribution of alignment scores from the scores of unrelated sequences in a database search. Using a new method for measuring the accuracy of p-values, we show that our maximum-likelihood-based algorithm is more accurate than existing regression-based and lookup table methods. We explore a more sophisticated way of modeling and estimating the score distributions (using a two-component mixture model and expectation maximization), but conclude that this does not improve significantly over simply ignoring scores with small E-values during estimation. Finally, we measure the classification accuracy of p-values estimated in different ways and observe that inaccurate p-values can, somewhat paradoxically, lead to higher classification accuracy. We explain this paradox and argue that statistical accuracy, not classification accuracy, should be the primary criterion in comparisons of similarity search methods that return p-values that adjust for target sequence length.

Control of chaotic instabilities in a spinning spacecraft with dissipation using Lyapunov's method

Control of chaotic instability in a simplified model of a spinning spacecraft with dissipation is achieved using an algorithm derived using Lyapunov's second method. The control method is implemented on a realistic spacecraft parameter configuration which has been found to exhibit chaotic instability for a range of forcing amplitudes and frequencies when a sinusoidally varying torque is applied to the spacecraft. Such a torque, may arise in practice from an unbalanced rotor or from vibrations in appendages. Numerical simulations are performed and the results are studied by means of time history, phase space, Poincare map, Lyapunov characteristic exponents and bifurcation diagrams. (C) 2002 Elsevier Science Ltd. All rights reserved.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

Bridge strike reduction: optimising the design of markings

Cases of high-sided vehicles striking low bridges is a large problem in many countries, especially the UK. This paper describes an experiment to evaluate a new design of markings for low bridges. A full size bridge was constructed which was capable of having its overhead clearance adjusted. Subjects sat in a truck cab as. it drove towards the bridge and were asked to judge whether the vehicle could pass safely under the bridge. The main objective of the research, was to determine whether marking the bridge with a newly devised experimental marking would result in more cautious decisions from subjects regarding whether or not the experimental bridge structure could be passed under safely compared with the currently used UK bridge marking standard. The results show that the type of bridge marking influenced the level of caution associated with decisions regarding bridge navigation, with the new marking design producing the most cautious decisions for the two different bridge heights used, at all distances away from the bridge structure. Additionally, the distance before the bridge at which decisions were given had an effect on the level of caution associated with decisions regarding bridge navigation (the closer to the bridge, the more cautious the decisions became, irrespective of the marking design). The implications of these results for reducing the number of bridge strikes are discussed. (C) 2002 Elsevier Science Ltd. All rights reserved.

A curious experiment: the paradigm switch from observation and speculation to experimentation, in the understanding of neuromuscular function and disease

The four-link chain of the motor unit represents the contemporary end-point of some two millennia of evolving knowledge in neuroscience. The paradigm shift in neuromuscular epistemology occurred in the mid-17th century. In 1666, the newly graduated Dutch doctor, Jan Swammerdam (1637-1680) published his former investigations of dissected nerve-muscle preparations. These experiments comprised the quantum leap from observation and speculation, to that of experimentation in the field of neuroanatomy and neurophysiology. In what he termed 'A Curious Experiment' he also described the phenomenon of intrinsic muscle excitability - I cannot observe that the muscle in the living animal ever absolutely ceases from all motion. Eighty years later (1752), von Haller demonstrated experimentally that irritability (contractility) was an intrinsic property of all muscular tissue; and distinguished between the sensibility of nerve impulses and the irritability of muscular contraction. This experimental progression from Swammerdam to von Haller culminated in 1850, when Claude Bernard's studies in experimental pharmacology confirmed that muscle was a functional unit, independent of any electrical innervation via its supplying nerve. This account comprises an audit of Swammerdam's work in the perspective of neuromuscular knowledge. (C) 2002 Elsevier Science B.V. All rights reserved.