Synthesis of Benzazepine Analogues of Noscapine

The synthesis of benzazepine analogues of the opium alkaloid noscapine ( 1 ) is described. The benzazepines 2 and 3 were prepared starting from nornarceine ethyl ester ( 4 ; readily available from 1 ) in several steps. X-Ray analysis of compound 2 revealed that it is not a diastereosisomer mixture but a racemate of the threo-form and thus has the same configuration as 1 .     

An approach to triquinane synthesis using the Pauson-Khand reaction

Tricyclic skeletons have been generated from acyclic enyne precursors by using an intramolecular Pauson-Khand reaction in combination with aldol, Michael and alkylation reactions.     

Cleaving functors and controlled wild algebras

We show that the cleaving functors introduced in [Bautista et al., Invent. Math. 81 (1985) 217] as a tool for proving infinite representation type of finite-dimensional algebras can also be used to establish controlled wildness. The main application is that an algebra is controlled wild if there is an indecomposable projective module with a Loewy factor having a homogeneous direct summand which is of length at least 3. As a second application we derive Han's covering criterion.     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

Measurement of the Seperation between Atoms beyond Diffraction Limit

We propose a scheme to obtain the distance of two identical atoms placed inside the standing wave field by monitoring the collective resonance fluorescence spectrum emitted by the two particles. We find three different parameter ranges, depending on the distance of the atoms as compared to the transition wavelength. For large interparticle distances, dipole-dipole coupling is negligible, and the main system evolution arises from the interaction with the standing wave field. In the small-distance limit, the dynamics is dominated by the dipole-dipole interaction. Finally, in the intermediate region, a rich interplay of the various couplings arises, which however is lifted for strong driving laser fields. The present measurement procedure allows us to distinguish the three cases. In each of the cases, we show how to determine the distance of the two particles and their respective positions relative to the nodes of the standing wave field with fractional-wavelength precision.     

Attractors and Dimensions for Discretizations of a Dissipative Zakharov Equations

Abstract In this paper, a dissipative Zakharov equations are discretized by difference method.We make priorestimates for the algebric system of equations. It is proved that for each mesh size,there exist attractors forthe discretized system.The bounds of the Hausdorff dimensions of the discrete attractors are obtained,and thevarious bounds are dependent of the mesh sizes.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.