Rhodium‐Catalyzed Asymmetric Intramolecular Hydroamination of Allenes

The rhodium‐catalyzed asymmetric intramolecular hydroamination of sulfonyl amides with terminal allenes is reported. It provides selective access to 5‐ and 6‐membered N‐heterocycles, scaffolds found in a large range of different bioactive compounds. Moreover, gram scale reactions, as well as the application of suitable product transformations to natural products and key intermediates thereof are demonstrated.     

Controlled Radical Polymerization of Ethylene Using Organotellurium Compounds

The first successfully controlled radical polymerization (CRP) of ethylene is reported using several organotellurium chain‐transfer agents (CTAs) under mild conditions (70 °C, 200 bar of ethylene) within the concept of organotellurium‐mediated radical polymerization (TERP). In contrast to preceding works on CRPs of ethylene applying reversible addition–fragmentation chain‐transfer (RAFT), the TERP system provided a high livingness and chain‐end functionalization of polyethylene chains. Molar‐mass distributions with dispersities between 1.3 and 2.1 were obtained up to average molar masses of 5000 g mol^?1. As in the RAFT system, the high reactivity of the growing polyethylenyl radical led to an inherent side reaction. For the presented TERP systems, however, this side reaction did not result in dead chains, while it could even be effectively suppressed by a good choice of the CTA.     

Ultrafine grain formation and coating mechanism arising from a blast coating process: A transmission electron microscopy analysis

This article examines the substrate/coating interface of a coating deposited onto mild steel and stainless steel substrates using an ambient temperature blast coating technique known as CoBlast. The process uses a coincident stream of an abrasive blast medium and coating medium particles to modify the substrate surface. The hypothesis for the high bond strength is that the abrasive medium roughens the surface while simultaneously disrupting the passivating oxide layer of the substrate, thereby exposing the reactive metal that then reacts with the coating medium. The aim of this study is to provide greater insight into the coating/substrate bonding mechanism by analysing the interface between a hydroxyapatite coating on both mild and stainless steel substrates. The coating adhesion was measured via a tensile test, and bond strengths of approximately 45 MPa were measured. The substrate/coating interface was examined using transmission electron microscopy and selected area diffraction. The analysis of the substrate/coating interface revealed the presence of ultrafine grains in both the coating and substrate at interface associated with deformation at the interface caused by particle impaction during deposition. The chemical reactivity resulting from the creation of these ultrafine grains is proposed to explain the high adhesive strength of CoBlast coatings.     

On discrete Fourier transform,ambiguity, and Hamming-autocorrelation of pseudorandom sequences

We estimate discrete Fourier transform, ambiguity, and Hamming-auto-correlation of \(m\) -ary sequences in terms of their (periodic) correlation measure of order 4. Roughly speaking, we show that every pseudorandom sequence, that is, any sequence with small correlation measure up to a sufficiently large order, cannot have a large discrete Fourier transform, ambiguity, or Hamming-autocorrelation. Conversely, there are sequences, for example the two-prime generator, with large correlation measure of order 4 but small discrete Fourier transform, ambiguity, autocorrelation, and Hamming-autocorrelation.     

A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems

This paper presents a parallel tabu search algorithm that utilizes several different neighborhood structures for solving the capacitated vehicle routing problem. Single neighborhood or neighborhood combinations are encapsulated in tabu search threads and they cooperate through a solution pool for the purpose of exploiting their joint power. The computational experiments on 32 large scale benchmark instances show that the proposed method is highly effective and competitive, providing new best solutions to four instances while the average deviation of all best solutions found from the collective best results reported in the literature is about 0.22%. We are also able to associate the beneficial use of special neighborhoods with some test instance characteristics and uncover some sources of the collective power of multi-neighborhood cooperation.     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

Some Notes on the Linear Complexity of Sidel’nikov-Lempel-Cohn-Eastman Sequences

We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences.