An algorithm for computing Jordan chains and inverting analytic matrix functions

We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)⁻¹b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic.     

Crosslinked polystyrene latexes prepared with 12-(o-styryloxy)dodecyltrimethylammonium bromide

Crosslinked polystyrene latexes with high surface charge densities have been prepared with 1, 3, and 5 mol% divinylbenzene and 0.5–5.0 mol% of 12-(o-styryloxy)dodecyltrimethylammonium bromide ( 1 ). Within experimental error all of surfactant 1 was incorporated into the particles. Analysis of the latex particles by transmission electron microscopy showed nonspherical shapes, aggregates, and number average diameters ranging from 22 to 95 nm. The particle size decreases and the polydispersity increases with increasing amounts of surfactant 1 and of divinylbenzene in the monomer mixture. A mechanism is proposed for particle formation by precipitation of crosslinked polymer from monomer droplets to form primary particles, coagulation of the primary particles to colloidally stable aggregates, and growth by further polymerization.     

The solution of a convection–diffusion–reaction equation arising from cathodic reduction in a pulsating crack

This paper derives the convection–diffusion-reaction equation governing the reaction between the dissolved oxygen in sea-water and the steel walls of a pulsating crack. By the neglect of the diffusion term it is shown that an exact solution of the convection-reaction equation can be obtained. A numerical method for the solution of the complete convection–diffusion-reaction equation is derived by the use of finite differences. The numerical computation of the initial transient and the final periodic steady-state values is also discussed.     

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.     

Random orderings of the integers and card shuffling

In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of these orders in terms of a class of generalized riffle shuffles.     

A 24-GHz Patch Array with a Power Amplifier/Low-Noise Amplifier MMIC

This paper presents an active patch array designed at 24 GHz. It can be used as a front-end component for a phased array. A series resonant array structure is chosen which is compact and easy excite. With 5 elements, the array proved a 12-dB antenna gain. A power amplifier and a low noise amplifier are designed on a single GaAs chip (PALNA). Bias switch is used in the PALNA, which greatly reduces the switch loss in a transceiver and increases the efficiency. 20-dB small signal gain is achieved in both power amplifier and low noise amplifier. The active patch array is built by the combination of the patch array and PALNA. The measured active gain of this antenna is 35-dB for the PA mode and 31-dB for the LNA mode. This active patch array can obtain an EIRP of 34 dBm with a total radiated power of 22dBm and a maximum PAE of 32%. To check the noise performance, we applied sources at both normal temperature and 77K (liquid nitrogen) and extracted the noise figure (3.5 dB) of the active antenna by the Y factor method. The results proved that the active antenna is working efficiently as both a transmitting and receiving antenna.     

Liquid crystalline hexa-amides and side chain polysiloxanes of azacrown [18]-N6

The hexa-4-dodecyloxybenzoyl derivative 1 of azacrown [18]-N₆ was originally reported to have a 'tubular' mesophase on the basis of its large central ring and 6-fold symmetry. Starting in the mesophase, annealing of 1 under a cover slip results in formation of a new crystalline phase that melts directly to an isotropic liquid at the temperature previously observed for the mesophase to isotropic transition. Thus the phase behaviour of 1 is kinetically controlled. The analogous hexa-3,4-bisdodecyloxybenzoyl derivative 2 of azacrown [18]-N₆ has no kinetic limitations to its phase changes and has an enantiotropic columnar liquid crystalline phase. We have synthesized side chain copolysiloxanes with a (CH₂)₁₁ spacer and 75-84 per cent by weight of the same 4-dodecyloxybenzoyl-[18]-N₆ mesogen. The polysiloxanes also display a liquid crystalline phase.     

Geometry optimization in Cartesian coordinates: Constrained optimization

An efficient algorithm for constrained geometry optimization in Cartesian coordinates is presented. It incorporates mode-following techniques within both the classical method of Lagrange multipliers and the penalty function method. Both constrained minima and transition states can be located and, unlike the standard Z-matrix using internal coordinates, the desired constraints do not have to be satisfied in the initial structure. The algorithm is as efficient as a Z-matrix optimization while presenting several additional advantages.     

Structural properties and tractability results for linear synteny

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.