Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.     

OSCILLATION FOR NONAUTONOMOUS NEUTRAL DYNAMIC DELAY EQUATIONS ON TIME SCALES

The article is concerned with oscillation of nonautonomous neutral dynamic delay equations on time scales. Sufficient conditions are established for the existence of bounded positive solutions and for oscillation of all solutions of this equation. Some results extend known results for difference equations when the time scale is the set Z of positive integers and for differential equations when the time scale is the set R of real numbers.     

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.     

Territories,corridors, and networks: A biological model for the premodern state

When depicted on maps as homogenous territorial wholes, ancient states are visually summarized as static entities in a way that conceals the highly fluid dynamics of polity formation, maintenance, and growth. Models derived from studies of animal behavior show that “territory” does not consist of an undifferentiated use of the landscape. Instead, the concept of territory can be parsed into a series of resource‐rich nodes linked by corridors of access, surrounded by unutilized regions and boundaries marked at points of competition. Ancient human groups also can be analyzed as having perceived and occupied landscapes through strategies of flexible networks in which nodes and corridors were surrounded by unutilized spaces around which boundaries were selectively identified and defended. This strategy is identifiable in human social groups at different levels of complexity ranging from hunter‐gatherers through ancient chiefdoms and states. © 2007 Wiley Periodicals, Inc. Complexity 12: 28–35, 2007     

A six-step synthesis of (S)-5-ethenyl-3-(1-methyl-2-pyrrolidinyl)pyridine (SIB-1508Y) from (S)-nicotine

The anti-Parkinson’s agent SIB-1508Y was prepared in six steps from (S)-nicotine in 20% overall yield. The strategy involves a regioselective formylation at C-5 of a 1,4-dihydronicotine intermediate.     

Pure adaptive search in monte carlo optimization

Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.     

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.     

Low-temperature property investigation of the lead indium-niobate-lead nickel-niobate solid solution

The complex perovskite solid solution (1−x) Pb(In_1/2Nb_1/2)O₃-(x) Pb(Ni_1/3Nb_2/3)O₃ has been successfully prepared by the Columbite precursor method. The temperature dependencies of the dielectric constant and pyroelectric coefficient were measured between −261 and 200 °C. Relaxor ferroelectric behavior has been noticed in all compositions across the solid solution. The room-temperature electrostrictive coefficient, Q₃₃, was 1.83×10⁻² C²/m⁴ for x=0.10. No room-temperature piezoelectric activity was detected; however, upon cooling to −261 °C the maximum coupling coefficients k_p=29%, k_t=11%, and k₃₃=31% were observed for the composition x=1.00.     

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.