Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem

For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms.     

New interpretations of XPS spectra of nickel metal and oxides

A current interpretation of XPS spectra of Ni metal assumes that the main 6 eV satellite is due to a two hole c3d⁹4s² (c is a core hole) final state effect. We report REELS observation in AES at low voltages of losses (plasmons and inter-band transitions) corresponding to the satellite structures in Ni metal 2p spectra. The satellite near 6 eV is attributed to a predominant surface plasmon loss. A current interpretation of Ni 2p spectra of oxides and other compounds is based on charge transfer assignments of the main peak at 854.6 eV and the broad satellite centred at around 861 eV to the cd⁹L and the unscreened cd⁸ final-state configurations, respectively (L is a ligand hole). Multiplet splittings have been shown to be necessary for assignment of Fe 2p and Cr 2p spectral profiles and chemical states. The assignments of Ni 2p states are re-examined with intra-atomic multiplet envelopes applied to Ni(OH)₂, NiOOH and NiO spectra. It is shown that the free ion multiplet envelopes for Ni²⁺ and Ni³⁺ simulate the main line and satellite structures for Ni(OH)₂ and NiOOH. Fitting the NiO Ni 2p spectral profile is not as straightforward as the hydroxide and oxyhydroxide. It may involve contributions from inter-atomic, non-local electronic coupling and screening effects with multiplet structures significantly different from the free ions as found for MnO. A scheme for fitting these spectra using multiplet envelopes is proposed.     

The 1-type of a Waldhausen K-theory spectrum

We give a small functorial algebraic model for the 2-stage Postnikov section of the K-theory spectrum of a Waldhausen category and use our presentation to describe the multiplicative structure with respect to biexact functors.     

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     

Current methods for site-directed structure generation

Summary There has been a rapid growth of interest in techniques for site-directed drug design, fuelled by the increasing availability of structural models of proteins of therapeutic importance, and by studies reported in the literature showing that potent chemical leads can be obtained by these techniques. Structure generation programs offer the prospect of discovering highly original lead structures from novel chemical families. Due to the fact that this technique is more-or-less still in its infancy, there are no case studies available that demonstrate the use of structure generation programs for site-directed drug design. Such programs were first proposed in 1986, and became commercially available in early 1992. They have shown their ability to reproduce, or suggest reasonable alternatives for, ligands in well-defined binding sites. This brief review will discuss the recent advances that have been made in the field of site-directed structure generation.     

Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations

Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties of iterative solvers. Received August 5, 2000 / Published online June 20, 2001     

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings

Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms.     

Fast switching anisotropic networks obtained by in situ photopolymerization of liquid crystal molecules

Lightly cross-linked anisotropic networks with uniaxial and π/2 twisted orientations were produced by photopolymerization of monotropic mixtures containing liquid crystal mono and diacrylates. In this way the polymer backbone was immobilized and became decoupled from the motion of the mesogenic side groups. The networks showed very good reversibility and even after becoming isotropic, upon cooling, the initial orientation was recovered. In the same way, in the presence of electric fields the mesogenic groups could be reoriented in the direction of the electric field, reverting back to the initial orientation on removal of the field at a rate comparable with those observed in the monomeric state. Combining viscoelastic measurements with the dielectric behaviour of the monomeric liquid crystal and the anisotropic network, a comparison between the internal and bulk rotational viscosities was also made.