Aziridine synthesis via nucleophilic attack of carbene equivalents on imines: the aza-Darzens reaction

The development of new methods for the efficient synthesis of aziridines has been of considerable interest to researchers for more than 60 years, but no single method has yet emerged as uniformly applicable, especially for asymmetric synthesis of chiral aziridines. One method which has been intensely examined and expanded of late involves the nucleophilic addition to imines by anions bearing a-leaving groups; by analogy with the glycidate epoxide synthesis, these processes are often described as "aza-Darzens reactions". This Microreview gives a summary of the area, with a focus on contemporary developments. ((C) Wiley-VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2009)

New mathematical modeling approach for predicting microbial inactivation by high hydrostatic pressure

A new primary model based on a thermodynamically consistent first-order kinetic approach was constructed to describe non-log-linear inactivation kinetics of pressure-treated bacteria. The model assumes a first-order process in which the specific inactivation rate changes inversely with the square root of time. The model gave reasonable fits to experimental data over six to seven orders of magnitude. It was also tested on 138 published data sets and provided good fits in about 70% of cases in which the shape of the curve followed the typical convex upward form. In the remainder of published examples, curves contained additional shoulder regions or extended tail regions. Curves with shoulders could be accommodated by including an additional time delay parameter and curves with tails shoulders could be accommodated by omitting points in the tail beyond the point at which survival levels remained more or less constant. The model parameters varied regularly with pressure, which may reflect a genuine mechanistic basis for the model. This property also allowed the calculation of (a) parameters analogous to the decimal reduction time D and z, the temperature increase needed to change the D value by a factor of 10, in thermal processing, and hence the processing conditions needed to attain a desired level of inactivation; and (b) the apparent thermodynamic volumes of activation associated with the lethal events. The hypothesis that inactivation rates changed as a function of the square root of time would be consistent with a diffusion-limited process.

Extending the friction cone algorithm for arbitrary polygon based haptic objects

Most haptic environments are based on single point interactions whereas in practice, object manipulation requires multiple contact points between the object, fingers, thumb and palm. The Friction Cone Algorithm was developed specifically to work well in a multi-finger haptic environment where object manipulation would occur. However, the Friction Cone Algorithm has two shortcomings when applied to polygon meshes: there is no means of transitioning polygon boundaries or feeling non-convex edges. In order to overcome these deficiencies, Face Directed Connection Graphs have been developed as well as a robust method for applying friction to non-convex edges. Both these extensions are described herein, as well as the implementation issues associated with them.

Optimal 3D surface reconstruction from multiview photographic images

This paper describes a new method for reconstructing 3D surface using a small number, e.g. 10, of 2D photographic images. The images are taken at different viewing directions by a perspective camera with full prior knowledge of the camera configurations. The reconstructed object's surface is represented a set of triangular facets. We empirically demonstrate that if the viewing directions are uniformly distributed around the object's viewing sphere, then the reconstructed 3D points optimally cluster closely on a highly curved part of the surface and are widely, spread on smooth or fat parts. The advantage of this property is that the reconstructed points along a surface or a contour generator are not undersampled or underrepresented because surfaces or contours should be sampled or represented with more densely points where their curvatures are high. The more complex the contour's shape, the greater is the number of points required, but the greater the number of points is automatically generated by the proposed method Given that the viewing directions are uniformly distributed, the number and distribution of the reconstructed points depend on the shape or the curvature of the surface regardless of the size of the surface or the size of the object.

Parallel Monte Carlo sampling scheme for sphere and hemisphere

The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation. In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Our aim is to construct and study the parallel sampling scheme for hemisphere and sphere. First we apply the symmetry property for partitioning of hemisphere and sphere. The domain of solid angle subtended by a hemisphere is divided into a number of equal sub-domains. Each sub-domain represents solid angle subtended by orthogonal spherical triangle with fixed vertices and computable parameters. Then we introduce two new algorithms for sampling of orthogonal spherical triangles. Both algorithms are based on a transformation of the unit square. Similarly to the Arvo's algorithm for sampling of arbitrary spherical triangle the suggested algorithms accommodate the stratified sampling. We derive the necessary transformations for the algorithms. The first sampling algorithm generates a sample by mapping of the unit square onto orthogonal spherical triangle. The second algorithm directly compute the unit radius vector of a sampling point inside to the orthogonal spherical triangle. The sampling of total hemisphere and sphere is performed in parallel for all sub-domains simultaneously by using the symmetry property of partitioning. The applicability of the corresponding parallel sampling scheme for Monte Carlo and Quasi-D/lonte Carlo solving of rendering equation is discussed.

Model selection approaches for non-linear system identification: a review

The identification of non-linear systems using only observed finite datasets has become a mature research area over the last two decades. A class of linear-in-the-parameter models with universal approximation capabilities have been intensively studied and widely used due to the availability of many linear-learning algorithms and their inherent convergence conditions. This article presents a systematic overview of basic research on model selection approaches for linear-in-the-parameter models. One of the fundamental problems in non-linear system identification is to find the minimal model with the best model generalisation performance from observational data only. The important concepts in achieving good model generalisation used in various non-linear system-identification algorithms are first reviewed, including Bayesian parameter regularisation and models selective criteria based on the cross validation and experimental design. A significant advance in machine learning has been the development of the support vector machine as a means for identifying kernel models based on the structural risk minimisation principle. The developments on the convex optimisation-based model construction algorithms including the support vector regression algorithms are outlined. Input selection algorithms and on-line system identification algorithms are also included in this review. Finally, some industrial applications of non-linear models are discussed.

3D surface point and wireframe reconstruction from multiview photographic images

This paper describes a new method for reconstructing 3D surface points and a wireframe on the surface of a freeform object using a small number, e.g. 10, of 2D photographic images. The images are taken at different viewing directions by a perspective camera with full prior knowledge of the camera configurations. The reconstructed surface points are frontier points and the wireframe is a network of contour generators. Both of them are reconstructed by pairing apparent contours in the 2D images. Unlike previous works, we empirically demonstrate that if the viewing directions are uniformly distributed around the object's viewing sphere, then the reconstructed 3D points automatically cluster closely on a highly curved part of the surface and are widely spread on smooth or flat parts. The advantage of this property is that the reconstructed points along a surface or a contour generator are not under-sampled or under-represented because surfaces or contours should be sampled or represented with more densely points where their curvatures are high. The more complex the contour's shape, the greater is the number of points required, but the greater the number of points is automatically generated by the proposed method. Given that the viewing directions are uniformly distributed, the number and distribution of the reconstructed points depend on the shape or the curvature of the surface regardless of the size of the surface or the size of the object. The unique pattern of the reconstructed points and contours may be used in 31) object recognition and measurement without computationally intensive full surface reconstruction. The results are obtained from both computer-generated and real objects. (C) 2007 Elsevier B.V. All rights reserved.

Optimal 3D surface reconstruction from a small number of conventional 2D X-ray images

This paper describes a method for reconstructing 3D frontier points, contour generators and surfaces of anatomical objects or smooth surfaces from a small number, e. g. 10, of conventional 2D X-ray images. The X-ray images are taken at different viewing directions with full prior knowledge of the X-ray source and sensor configurations. Unlike previous works, we empirically demonstrate that if the viewing directions are uniformly distributed around the object's viewing sphere, then the reconstructed 3D points automatically cluster closely on a highly curved part of the surface and are widely spread on smooth or flat parts. The advantage of this property is that the reconstructed points along a surface or a contour generator are not under-sampled or under-represented because surfaces or contours should be sampled or represented with more densely points where their curvatures are high. The more complex the contour's shape, the greater is the number of points required, but the greater the number of points is automatically generated by the proposed method. Given that the number of viewing directions is fixed and the viewing directions are uniformly distributed, the number and distribution of the reconstructed points depend on the shape or the curvature of the surface regardless of the size of the surface or the size of the object. The technique may be used not only in medicine but also in industrial applications.

An algorithm for isentropic flow

An efficient algorithm is presented for the solution of the equations of isentropic gas dynamics with a general convex gas law. The scheme is based on solving linearized Riemann problems approximately, and in more than one dimension incorporates operator splitting. In particular, only two function evaluations in each computational cell are required. The scheme is applied to a standard test problem in gas dynamics for a polytropic gas

A Riemann solver for compressible flow of a real gas in a Lagrangian frame

An approximate Riemann solver is presented for the compressible flow equations with a general (convex) equation of state in a Lagrangian frame of reference.

An isentropic flow algorithm with body fitted meshes

An efficient algorithm based on flux difference splitting is presented for the solution of the three-dimensional equations of isentropic flow in a generalised coordinate system, and with a general convex gas law. The scheme is based on solving linearised Riemann problems approximately and in more than one dimension incorporates operator splitting. The algorithm requires only one function evaluation of the gas law in each computational cell. The scheme has good shock capturing properties and the advantage of using body-fitted meshes. Numerical results are shown for Mach 3 flow of air past a circular cylinder. Furthermore, the algorithm also applies to shallow water flows by employing the familiar gas dynamics analogy.

Acoustic trapped modes in a three-dimensional waveguide of slowly varying cross section

In this paper we develop an asymptotic scheme to approximate the trapped mode solutions to the time harmonic wave equation in a three-dimensional waveguide with a smooth but otherwise arbitrarily shaped cross section and a single, slowly varying `bulge', symmetric in the longitudinal direction. Extending the work in Biggs (2012), we first employ a WKBJ-type ansatz to identify the possible quasi-mode solutions which propagate only in the thicker region, and hence find a finite cut-on region of oscillatory behaviour and asymptotic decay elsewhere. The WKBJ expansions are used to identify a turning point between the cut-on and cut-on regions. We note that the expansions are nonuniform in an interior layer centred on this point, and we use the method of matched asymptotic expansions to connect the cut-on and cut-on regions within this layer. The behaviour of the expansions within the interior layer then motivates the construction of a uniformly valid asymptotic expansion. Finally, we use this expansion and the symmetry of the waveguide around the longitudinal centre, x = 0, to extract trapped mode wavenumbers, which are compared with those found using a numerical scheme and seen to be extremely accurate, even to relatively large values of the small parameter.

On the near periodicity of eigenvalues of Toeplitz matrices

Let $A$ be an infinite Toeplitz matrix with a real symbol $f$ defined on $[-\pi, \pi]$. It is well known that the sequence of spectra of finite truncations $A_N$ of $A$ converges to the convex hull of the range of $f$. Recently, Levitin and Shargorodsky, on the basis of some numerical experiments, conjectured, for symbols $f$ with two discontinuities located at rational multiples of $\pi$, that the eigenvalues of $A_N$ located in the gap of $f$ asymptotically exhibit periodicity in $N$, and suggested a formula for the period as a function of the position of discontinuities. In this paper, we quantify and prove the analog of this conjecture for the matrix $A^2$ in a particular case when $f$ is a piecewise constant function taking values $-1$ and $1$.

Fourier transform, null variety, and Laplacian's eigenvalues

We consider a quantity κ(Ω)—the distance to the origin from the null variety of the Fourier transform of the characteristic function of Ω. We conjecture, firstly, that κ(Ω) is maximised, among all convex balanced domains of a fixed volume, by a ball, and also that κ(Ω) is bounded above by the square root of the second Dirichlet eigenvalue of Ω. We prove some weaker versions of these conjectures in dimension two, as well as their validity for domains asymptotically close to a disk, and also discuss further links between κ(Ω) and the eigenvalues of the Laplacians.

Dynamic shear modulus of isotropic elastomers

We have investigated the dynamic mechanical behavior of two cross-linked polymer networks with very different topologies: one made of backbones randomly linked along their length; the other with fixed-length strands uniformly cross-linked at their ends. The samples were analyzed using oscillatory shear, at very small strains corresponding to the linear regime. This was carried out at a range of frequencies, and at temperatures ranging from the glass plateau, through the glass transition, and well into the rubbery region. Through the glass transition, the data obeyed the time-temperature superposition principle, and could be analyzed using WLF treatment. At higher temperatures, in the rubbery region, the storage modulus was found to deviate from this, taking a value that is independent of frequency. This value increased linearly with temperature, as expected for the entropic rubber elasticity, but with a substantial negative offset inconsistent with straightforward enthalpic effects. Conversely, the loss modulus continued to follow time-temperature superposition, decreasing with increasing temperature, and showing a power-law dependence on frequency.