Utility and entropy

In this paper we study an astonishing similarity between the utility representation problem in economics and the entropy representation problem in thermodynamics.

Adaptive multiscale principal components analysis for online monitoring of wastewater treatment

Fault detection and isolation (FDI) are important steps in the monitoring and supervision of industrial processes. Biological wastewater treatment (WWT) plants are difficult to model, and hence to monitor, because of the complexity of the biological reactions and because plant influent and disturbances are highly variable and/or unmeasured. Multivariate statistical models have been developed for a wide variety of situations over the past few decades, proving successful in many applications. In this paper we develop a new monitoring algorithm based on Principal Components Analysis (PCA). It can be seen equivalently as making Multiscale PCA (MSPCA) adaptive, or as a multiscale decomposition of adaptive PCA. Adaptive Multiscale PCA (AdMSPCA) exploits the changing multivariate relationships between variables at different time-scales. Adaptation of scale PCA models over time permits them to follow the evolution of the process, inputs or disturbances. Performance of AdMSPCA and adaptive PCA on a real WWT data set is compared and contrasted. The most significant difference observed was the ability of AdMSPCA to adapt to a much wider range of changes. This was mainly due to the flexibility afforded by allowing each scale model to adapt whenever it did not signal an abnormal event at that scale. Relative detection speeds were examined only summarily, but seemed to depend on the characteristics of the faults/disturbances. The results of the algorithms were similar for sudden changes, but AdMSPCA appeared more sensitive to slower changes.

Application of the maximum entropy method to the (2 + 1)D four-fermion model

We investigate spectral functions extracted using the maximum entropy method from correlators measured in lattice simulations of the (2+1)-dimensional four-fermion model. This model is particularly interesting because it has both a chirally broken phase with a rich spectrum of mesonic bound states and a symmetric phase where there are only resonances. In the broken phase we study the elementary fermion, pion, sigma, and massive pseudoscalar meson; our results confirm the Goldstone nature of the π and permit an estimate of the meson binding energy. We have, however, seen no signal of σ→ππ decay as the chiral limit is approached. In the symmetric phase we observe a resonance of nonzero width in qualitative agreement with analytic expectations; in addition the ultraviolet behavior of the spectral functions is consistent with the large nonperturbative anomalous dimension for fermion composite operators expected in this model.

Non-compact generalized variational inequalities for quasi-monotone and hemi-continuous operators with applications

Some results are obtained for non-compact cases in topological vector spaces for the existence problem of solutions for some set-valued variational inequalities with quasi-monotone and lower hemi-continuous operators, and with quasi-semi-monotone and upper hemi-continuous operators. Some applications are given in non-reflexive Banach spaces for these existence problems of solutions and for perturbation problems for these set-valued variational inequalities with quasi-monotone and quasi-semi-monotone operators.

Explicit/implicit partitioning and a new explicit form of the generalized alpha method

Most finite element packages use the Newmark algorithm for time integration of structural dynamics. Various algorithms have been proposed to better optimize the high frequency dissipation of this algorithm. Hulbert and Chung proposed both implicit and explicit forms of the generalized alpha method. The algorithms optimize high frequency dissipation effectively, and despite recent work on algorithms that possess momentum conserving/energy dissipative properties in a non-linear context, the generalized alpha method remains an efficient way to solve many problems, especially with adaptive timestep control. However, the implicit and explicit algorithms use incompatible parameter sets and cannot be used together in a spatial partition, whereas this can be done for the Newmark algorithm, as Hughes and Liu demonstrated, and for the HHT-alpha algorithm developed from it. The present paper shows that the explicit generalized alpha method can be rewritten so that it becomes compatible with the implicit form. All four algorithmic parameters can be matched between the explicit and implicit forms. An element interface between implicit and explicit partitions can then be used, analogous to that devised by Hughes and Liu to extend the Newmark method. The stability of the explicit/implicit algorithm is examined in a linear context and found to exceed that of the explicit partition. The element partition is significantly less dissipative of intermediate frequencies than one using the HHT-alpha method. The explicit algorithm can also be rewritten so that the discrete equation of motion evaluates forces from displacements and velocities found at the predicted mid-point of a cycle. Copyright (C) 2003 John Wiley Sons, Ltd.

Integrable generalized spin ladder models based on the SU(1|3) and SU(3|1) algebras

We present two integrable spin ladder models which possess a general free parameter besides the rung coupling J. The models are exactly solvable by means of the Bethe ansatz method and we present the Bethe ansatz equations. We analyze the elementary excitations of the models which reveal the existence of a gap for both models that depends on the free parameter. (C) 2003 American Institute of Physics.

Pseudo memory effects, majorization and entropy in quantum random walks

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial distribution. In a classical walk, entropy increase can be regarded as a consequence of the majorization ordering of successive distributions. The Lorenz curves of successive distributions for a symmetric quantum walk reveal no majorization ordering in general. Nevertheless, entropy can increase, and computer experiments show that it does so on average. Varying the stages at which the quantum coin system is traced out leads to new quantum walks, including a symmetric walk for which majorization ordering is valid but the spreading rate exceeds that of the usual symmetric quantum walk.

A generalized Markov sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis-Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.

Classification and analysis of integrating frameworks in multiscale modelling

Chemical engineers are turning to multiscale modelling to extend traditional modelling approaches into new application areas and to achieve higher levels of detail and accuracy. There is, however, little advice available on the best strategy to use in constructing a multiscale model. This paper presents a starting point for the systematic analysis of multiscale models by defining several integrating frameworks for linking models at different scales. It briefly explores how the nature of the information flow between the models at the different scales is influenced by the choice of framework, and presents some restrictions on model-framework compatibility. The concepts are illustrated with reference to the modelling of a catalytic packed bed reactor. (C) 2004 Elsevier Ltd. All rights reserved.

Jointly radial and translation homothetic preferences: generalized constant risk aversion

The paper identifies the structural restrictions on preferences required for them to exhibit both translation homotheticity in particular direction and radial homotheticity. The results are illustrated by an application to an asset allocation problem in the absence of riskless asset.

Teleonomic entropy: measuring the phase-space of end-directed systems

We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm designed to numerically update a collection of values such as artificial neural network weights undergoing adjustments during learning. We measure the entropy as a function of the phase-space of the values, i.e. their magnitude and velocity of change, using a method based on the abstract measure of entropy introduced by the philosopher Rudolf Carnap. By constructing a time-dynamic two-dimensional Voronoi diagram using Voronoi cell generators with coordinates of value- and value-velocity (change of magnitude), the entropy becomes a function of the cell areas. We term this measure teleonomic entropy since it can be used to describe changes in any end-directed (teleonomic) system. The usefulness of the method is illustrated when comparing the different approaches of two search algorithms, a learning artificial neural network and a population of discovering agents. (C) 2004 Elsevier Inc. All rights reserved.

Efficacy of sertraline in a 12-week trial for generalized anxiety disorder

Objective: Sertraline's efficacy and tolerability in treating generalized anxiety disorder were evaluated. Method: Adult outpatients with DSM-IV generalized anxiety disorder and a total score of 18 or higher on the Hamilton Anxiety Rating Scale were eligible. After a 1-week single-blind placebo lead-in, patients were randomly assigned to 12 weeks of double-blind treatment with placebo (N=188, mean baseline anxiety score=25) or flexible doses (50-150 mg/day) of sertraline (N=182, mean anxiety score=25). The primary outcome measure was baseline-to-endpoint change in the Hamilton anxiety scale total score. A secondary efficacy measure was the Clinical Global Impression (CGI) improvement score; response was defined as a score of 2 or less. Results: Sertraline patients had significantly greater improvement than placebo patients on all efficacy measures at week 4. Analysis of covariance of the intent-to-treat group at endpoint (with the last observation carried forward) showed a significant difference in the decrease from baseline of the least-square mean total score on the Hamilton anxiety scale between sertraline (mean=11.7) and placebo (mean=8.0). Significantly greater endpoint improvement with sertraline than placebo was obtained for mean scores on the Hamilton anxiety scale psychic factor (6.7 versus 4.1) and somatic factor (5.0 versus 3.9). The rate of responders, based on CGI improvement and last observation carried forward, was significantly higher for sertraline (63%) than placebo (37%). Sertraline was well tolerated; 8% of patients versus 10% for placebo dropped out because of adverse events. Conclusions: Sertraline appears to be efficacious and well tolerated in the treatment of generalized anxiety disorder.