The specification logic νZ

This paper introduces a wide-spectrum specification logic νZ. The minimal core logic is extended to a more expressive specification logic which includes a schema calculus similar (but not equivalent) to Z, new additional schema operators, and extensions to programming and program development logics.     

Space-dependent color gamut mapping: a variational approach.

Gamut mapping deals with the need to adjust a color image to fit into the constrained color gamut of a given rendering medium. A typical use for this tool is the reproduction of a color image prior to its printing, such that it exploits best the given printer/medium color gamut, namely the colors the printer can produce on the given medium. Most of the classical gamut mapping methods involve a pixel-by-pixel mapping and ignore the spatial color configuration. Recently proposed spatial-dependent approaches for gamut mapping are either based on heuristic assumptions or involve a high computational cost. In this paper, we present a new variational approach for space-dependent gamut mapping. Our treatment starts with the presentation of a new measure for the problem, closely related to a recent measure proposed for Retinex. We also link our method to recent measures that attempt to couple spectral and spatial perceptual measures. It is shown that the gamut mapping problem leads to a quadratic programming formulation, guaranteed to have a unique solution if the gamut of the target device is convex. An efficient numerical solution is proposed with promising results.     

Learning to Predict Non-Deterministically Generated Strings

In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.     

On regional nonlinear H-filtering

The structure of the nonlinear H^∞-filter in the neighborhood of the estimated trajectory is investigated and a bound on the size of the neighborhood that allows this structure is determined, both for finite and infinite horizons. Riccati inequalities that depend on the estimated trajectory are derived for finding the filter gain matrix and an algorithm for calculating the bound on the size of the above neighborhood is presented. Explicit formulas are obtained in the infinite horizon case for the minimum achievable disturbance attenuation level, the size of the neighborhood, and the corresponding filter gain.     

Dynamic stiffness vibration analysis using a high‐order beam model

This work presents the derivation of the exact dynamic stiffness matrix for a high‐order beam element. The terms are found directly from the solutions of the differential equations that describe the deformations of the cross‐section according to the high‐order theory, which include cubic variation of the axial displacements over the cross‐section of the beam. The model has six degrees of freedom at the two ends, one transverse displacement and two rotations, and the end forces are a shear force and two end moments. Using the dynamic stiffness matrix exact vibration frequencies for beams with various combinations of boundary conditions are tabulated and compared with results from the Bernoulli–Euler and Timoshenko beam models. Copyright © 2003 John Wiley & Sons, Ltd.     

A branch and cut algorithm for the VRP with satellite facilities

An important aspect of the vehicle routing problem (VRP) that has been largely overlooked is the use of satellite facilities to replenish vehicles during a route. When possible, satellite replenishment allows the drivers to continue making deliveries until the close of their shift without necessarily returning to the central depot. This situation arises primarily in the distribution of fuels and certain retail items. When demand is random, optimizing customer routes a priori may result in significant additional costs for a particular realization of demand. Satellite facilities are one way of safeguarding against unexpected demand. This paper presents a branch and cut methodology for solving the VRP with satellite facilities subject to capacity and route time constraints. We begin with a mixed-integer linear programming formulation and then describe a series of valid inequalities that can be used to cut off solutions to the linear programming relaxation. Several separation heuristics are then outlined that are used to generate the cuts. Embedded in the methodology is a VRP heuristic for finding good feasible solutions at each stage of the computations. Results are presented for a set of problems derived from our experience with a leading propane distributor.     

Energy Trapping in Dications

The energy interaction curves of a number of diatomic and polyatomic dication systems were calculated in order to study their energy-trapping properties. Generally, the ab initio complete active space multiconfiguration self-consistent field method was used in an extended valence + polarization basis set, with compact effective potentials replacing the core electrons. The diatomic dications include all ten possible binary combinations of oxygen, sulphur, selenium, and tellurium. O₂²⁺ shows the largest exothermicity, measured from equilibrium to the monocation combination asymptote, and highest barrier to dissociation. The calculated equilibrium bond length and harmonic vibrational frequency agree very well with experiment. The O₂²⁺, SO²⁺, SeO²⁺, and TeO²⁺ series show progressively decreasing exothermicities but similar barrier heights. The non-oxides, in contrast, show similar exothermicities but decreasing barriers with increasing size of the atom constituents. These trends are interpreted in terms of both valence bond curve-crossing and molecular orbital bonding models. The ozone dication, O₃²⁺, is found to have a number of low-lying singlet and triplet stationary state structures spanning near-linear to D_3h2+ symmetries. Although the calculated exothermicity is even larger than for O₂²⁺, the barrier to O₂⁺ + O⁺ dissociation is predicted to be low in each case. O₂²⁺ surrounded by six argon atoms to model an isolating environment shows increased equilibrium O–O bond length, decreased exothermicity, and increased barrier to dissociation, relative to the bare dication. O₂²⁺ flanked at each end by a perpendicularly oriented H₂ molecule in a staggered conformation is obstructed from direct conversion to the water dimer dication by a high barrier. However, [(H₂O)₂]²⁺ dissociates smoothly from equilibrium to two water monocations with a large exothermicity but a small barrier.     

Estimating frequency of occurrence.

Various models have been proposed that attribute judgments of frequency of occurrence either to the direct coding of frequency information or to the estimation of frequency from characteristics of memory traces that are not direct frequency codes. We present three experiments that replicate and further explore a phenomenon that is significant in the distinction between direct and indirect models of frequency coding. The phenomenon is that deeper processing of stimulus material results in superior judgments of frequency for that material than does shallower processing. This effect is at least partly attributable to the number of associations that are generated by deep analysis. The results of the present experiments thereby implicate an indirect coding mechanism underlying frequency judgments. However, we also show that there is ample reason to suppose a contribution of a direct coding mechanism as well. The most reasonable view, therefore, is that multiple mechanisms are involved in the registration of frequency of occurrence. (PsycINFO Database Record (c) 2010 APA, all rights reserved)