Multiplicities of interpoint distances in finite planar sets

What is the maximum number of unit distances between the vertices of a convex n-gon in the plane? We review known partial results for this and other open questions on multiple occurrences of the same interpoint distance in finite planar subsets. Some new results are proved for small n. Challenging conjectures, both old and new, are highlighted.     

Microbial Baeyer-Villiger Oxidation of Ketones by Cyclohexanone and Cyclopentanone Monooxygenase – A Computational Rational for Biocatalyst Performance

Summary. Recombinant Escherichia coli overexpressing Pseudomonas sp. NCIMB 9872 cyclopentanone monooxygenase (CPMO, EC 1.14.13.16) and Acinetobacter sp. NCIMB 9871 cyclohexanone monooxygenase (CHMO, EC 1.14.13.22) have been utilized in whole-cell Baeyer-Villiger biotransformations of prochiral bicycloketones. A significant difference in substrate acceptance and stereoselectivity was observed for bicyclo[3.3.0] and bicyclo[4.3.0] substrates. A plausible mechanism of these transformations was established by means of high level DFT/B3LYP calculations suggesting an essential difference in electronic requirements for a successful enzymatic conversion, which was similarly encountered in recombinant whole-cell mediated biooxidations. Some of the lactones produced in the biocatalytic Baeyer-Villiger oxidation represent key intermediates for the synthesis of indole alkaloids.     

Approximation by a binomial type law

Kaunas Academy of Agriculture, 4324 Noreikiškés, Lithuania. Translated from Lietuvos Matematikos Rinkinys, Vol. 32, No. 2, pp. 221–228, April–June, 1992.     

Objective acoustic voice-quality parameters in the computer phonetogram

A phonetogram is a plot of the dynamic range of the voice as a function of fundamental frequency. Traditionally, the phonetogram only records the sound-pressure level (SPL) of the threshold of phonation and the upper limit in SPL the voice can reach with sustained phonation as a function of the fundamental frequency (F₀). In this study, the phonetogram is extended by including acoustic voice-quality parameters. Three additional parameters are tested: jitter, shimmer, and crest factor. For each individual voice, the variation in the three parameters is evaluated over the entire phonetogram area. By averaging individual phonetograms, standard or norm phonetograms are obtained revealing general patterns in voice-quality variation. These patterns reflect the complex relations between F₀, SPL, and the acoustic voice-quality parameters just mentioned. Jitter and shimmer distributions over the phonetogram show that large variations in perturbation values can be expected when production conditions are altered. Highest perturbation values are found for the low F₀ and low SPL phonations. For all voices, a gradual decrease of the crest factor is found with increasing F₀, reflecting the degrading of spectral complexity with F₀. The crest-factor parameter can also be used to mark those areas in the phonetogram where the fundamental dominates the waveform and where flow control is the main SPL regulating mechanism in voice production. The strong quality variations within the phonetogram stress the need for accurate control of F₀ and SPL in objective voice-quality measurement.     

Studies of the kinetics of the reduction of chromate by glutathione and related thiols

The reduction of chromate by glutathione, its mono- and diethyl esters, -cysteine, 2-mercapto-propionic acid and mercapto-succinic acid has been studied. The empirical rate law k_obs = ab[Thiol]²/(1 + b[Thiol]) is obeyed by all of these thiols, at neutral pH. No evidence could be obtained for a first-order pathway in glutathione under these conditions. These observations are used to comment on the stability of intermediates potentially important in explaining chromate toxicity.     

Chemical Reactivity of Tetrasulfur Tetranitride: Synthesis,Physical Properties,and Structural Characterization of the Amorphous Phase Cu7S4N4

Tetrasulfur tetranitride, S₄N₄, reacts with elemental Cu within inert solvents to a black‐blue material of approximate composition Cu₇S₄N₄ which is totally amorphous to X‐rays and which cannot be made crystalline by either thermal treatment or electron radiation. Cu₇S₄N₄ explodes if heated above 234 °C or when subjected to mechanical shock to eventually yield copper(I) sulfide; this together with the characteristic infrared spectrum of Cu₇S₄N₄ indicates the presence of molecular S₄N₄ units inside the amorphous phase. The metastable nature of Cu₇S₄N₄ is also mirrored by electron microscopy which furthermore allows the structural characterization of its degradation products. Based on experimental EXAFS data offering characteristic Cu—N and Cu—S distances, a theoretical crystalline approximant of Cu₇S₄N₄ was suggested and structurally optimized by density‐functional total‐energy calculations including periodic boundary conditions. This model incorporates a central S₄N₄ unit bonded to three shells of Cu atoms of different functionalities; in addition, a partial rupture of the S₄N₄ unit is likely to allow for a lowering of the total energy of the metastable phase. The latter observation supports the impossibility to make Cu₇S₄N₄ crystallize using ₄N₄ crystallize using whatever kind of measures.     

Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique

This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.