Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

Partial structure elucidation of the most abundant octa and nonachlorotoxaphene congeners in marine mammals by using conventional electron ionization mass spectrometry and mass spectrometry/mass spectrometry

Summary Conventional electron ionization (EI) mass spectrometry (MS) and MS/MS techniques were applied to the analysis of two abundant octa and nonachlorobornanes isolated from seals of the Baltic sea and originating from technical toxaphene. The exact sterical structures of the two compounds were previously determined using nuclear magnetic resonance (NMR) spectroscopy by two independent research groups. The MS and MS/MS data generated in this study allowed partial structure elucidation of these polychlorobornanes, in particular revealing the distribution of the Cl substituents between the six-membered carbon ring, the bridge and the bridgehead in the parent bornane structure. Fragmentation of the six-membered carbon ring and the bridge by retro-Diels-Alder (RDA) and related mechanisms was discovered by studying specific parent/daughter ion transitions. The detailed fragmentation pathways formulated may be applicable to the structure elucidation of other toxaphene congeners and the monitoring of strategic transitions is highly selective for the detection of these compounds in technical toxaphene and in environmental samples.     

Subgroup separable free products with cyclic amalgamation

Using topological methods we give a proof that the free product of two strict subgroup separable groups with infinite cyclic amalgamation is subgroup separable.     

Degradative chain transfer in vinyl acetate polymerizations using toluene as solvent

In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (C_trs) determined using the Mayo method is equal to 3.8 × 10^?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10^?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the M_n data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007     

Mode beating in spot-size converter lasers

An anomalous modulation in the wavelength spectrum has been observed in lasers with spot-size converters. This intensity modulation is shown to be caused by beating between the fundamental lasing mode and radiation modes in the taper. This results in a periodic modulation in the net gain spectrum, which causes wavelength jumps between adjacent net gain maxima, and a drive current dependent spectral width that is expected to affect system performance. The amplitude of this spectral modulation is reduced significantly by either using an angled rear-facet which reflects the beating radiation modes away from the laser axis, or by using a nonlinear, adiabatic taper.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

A note on the Σ1 spectrum of a theory

Let T be a suitable system of classical set theory. We will show, that the Σ₁ spectrum of T, i.e. the set of ordinals having good Σ₁ definition in T is an initial segment of the ordinals. Received: 11 October 1999 / Published online: 12 December 2001