Sensitivity of hypersaline Arabian Gulf to seawater desalination plants

Due to the hot, arid nature of its bordering lands, seawater in the Arabian Gulf can have significant evaporation rates leading to hypersaline conditions. If additional desalination plants were to operate along its coast, then the extraction of desalinated water and returned brine waste stream into the Gulf would increase the salinity. This paper uses a tidally and cross-sectionally averaged mathematical model that reveals multiplicative dependence of the salinity on factors associated with river flow, evaporation rates and each of the desalination plants. Present-day desalinated water production rates are in the linear regime, but hypersalinity has exponential sensitivity to the position and volumetric rate of desalinated water extraction.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

On the Evaluation of Uncertain Courses of Action

We consider the problem of decision making under uncertainty. The fuzzy measure is introduced as a general way of representing available information about the uncertainty. It is noted that generally in uncertain environments the problem of comparing alternative courses of action is difficult because of the multiplicity of possible outcomes for any action. One approach is to convert this multiplicity of possible of outcomes associated with an alternative into a single value using a valuation function. We describe various ways of providing a valuation function when the uncertainty is represented using a fuzzy measure. We then specialize these valuation functions to the cases of probabilistic and possibilistic uncertainty.     

Linear dependence of stationary distributions in ergodic Markov decision processes

In ergodic MDPs we consider stationary distributions of policies that coincide in all but n states, in which one of two possible actions is chosen. We give conditions and formulas for linear dependence of the stationary distributions of n+2 such policies, and show some results about combinations and mixtures of policies.     

Oscillations and concentrations in weak solutions of the incompressible fluid equations

The authors introduce a new concept of measure-valued solution for the 3-D incompressible Euler equations in order to incorporate the complex phenomena present in limits of approximate solutions of these equations. One application of the concepts developed here is the following important result: a sequence of Leray-Hopf weak solutions of the Navier-Stokes equations converges in the high Reynolds number limit to a measure-valued solution of 3-D Euler defined for all positive times. The authors present several explicit examples of solution sequences for 3-D incompressible Euler with uniformly bounded local kinetic energy which exhibit complex phenomena involving both persistence of oscillations and development of concentrations. An extensions of the concept of Young measure is developed to incorporate these complex phenomena in the measure-valued solutions constructed here.Partially supported by N.S.F. GrantPartially supported by N.S.F. Grant 84-0223 and 86-11110     

Neighborhood unions and the cycle cover number of a graph

For several years, the study of neighborhood unions of graphs has given rise to important structural consequences of graphs. In particular, neighborhood conditions that give rise to hamiltonian cycles have been considered in depth. In this paper we generalize these approaches to give a bound on the smallest number of cycles in G containing all the vertices of G. We show that if for all x, y ? V(G), |N(x) ∩ N(y)| ≧ 2n/5 + 1, then V(G) is coverable by at most two cycles. Several related results and extensions to t cycles are also given.     

Determination of a double Lie groupoid by its core diagram

In a double groupoid S, we show that there is a canonical groupoid structure on the set of those squares of S for which the two source edges are identities; we call this the core groupoid of S. The target maps from the core groupoid to the groupoids of horizontal and vertical edges of S are now base-preserving morphisms whose kernels commute, and we call the diagram consisting of the core groupoid and these two morphisms the core diagram of S. If S is a double Lie groupoid, and each groupoid structure on S satisfies a natural double form of local triviality, we show that the core diagram determines S and, conversely, that a locally trivial double Lie groupoid may be constructed from an abstractly given core diagram satisfying some natural additional conditions.

In the algebraic case, the corresponding result includes the known equivalences between crossed modules, special double groupoids with special connection (Brown and Spencer), and cat¹-groups (Loday). These cases correspond to core diagrams for which both target morphisms are (compatibly) split surjections.