Self-similarity in diffraction by a self-similar fractal screen

Using the Sierpinski gasket as an example, it has been shown here that the paraxial Fraunhoffer-zone diffracted field of a self-similar fractal screen also exhibits self-similarity. This also establishes that fractal structures can be used with great profit in problems involving array syntheses. Recently, it has been shown that the Sierpinski gasket is itself a member of a much wider class of gaskets, and the potential for the use of fractal structures in electromagnetic (EM) problems may be vast indeed.     

Convergence of genetic algorithms

The mean convergence of various versions of a genetic algorithm are considered. A number of convergence statements are formulated and relevant estimates are obtained. A hypothesis concerning the form of these estimates under variation of the structure of a genetic algorithm is put forward. Roman Riviyanovich Sharapov. Born 1981. Graduated from the Faculty of Mechanics and Mathematics, Ural State University, in 2003. Presently, a postgraduate at the Department of Mathematical Economics at the same university. Scientific interests: genetic algorithms, neural networks, and financial mathematics. Aleksandr Vyacheslavovich Lapshin. Born 1980. Graduated from the Faculty of Mechanics and Mathematics, Ural State University, in 2003. Presently, a postgraduate at the Department of Mathematical Economics at the same university. Scientific interests: financial mathematics, genetic algorithms, and neural networks.     

Optimization of Automated Synthesis of 2-[18F]Fluoro-2-deoxy-D-glucose Involving Base Hydrolysis

Synthesis of 2-[¹⁸F]fluoro-2-deoxy-D-glucose ([¹⁸F]FDG) involving base hydrolysis was optimized. Fluorine-18 was isolated from irradiated water to more than 90% by sorption of [^{1 8}F]fluoride on QMA anion-exchange resin, which was followed by elution with a 96 : 4 (by volume) acetonitrile-water mixture containing Kryptofix 2.2.2 and potassium carbonate (molar ratio 2 : 1). This composition is the best for preparing the complex [K/K2.2.2]^{+ 18}F^- used in nucleophilic fluorinations. No additional azeotropic drying is required. Base hydrolysis under optimized conditions (40-45°C), followed by neutralization with HCl, removal of traces of the solvent, and purification of the final product on a combined SCX/Alumina N column, yielded [^{1 8}F]FDG of high radiochemical (>99%) and chemical purity with minimal product loss. With an RB-86 robotic system (Anatech, Sweden), the synthesis time was 38 min. The procedure is used in the Institute of Human Brain, Russian Academy of Sciences for routine synthesis of FDG; the radiochemical yield of the product by the end of synthesis (EOS) is reproducibly high: 63±3% (n = 40).     

Top-Seeded Melt-Growth of YBa2Cus3Ox Crystals for Neutron Diffraction Studies

We have grown cubic centimeter-size crystals of YBa₂Cu₃O _x suitable for neutron studies, by a top-seeded melt-growth technique. Growth conditions were optimized with an eye toward maximizing phase purity. It was found that the addition of 2% Y₂BaCuO₅ and 0.5% Pt (by mass) were required to prevent melt loss and to obtain the highest crystallinity. A neutron diffraction study on a mosaic of six such crystals found that the final Y₂BaCuO₅ concentration was 5%, while other impurity phases comprised less than 1% by volume. The oxygen content was set to x = 6.5, the crystals were detwinned, and then carefully annealed to give the well-ordered ortho-II phase. The neutron study determined that 70% of the mosaic's volume was in the majority orthorhomic domain. The neutron (006) and (110) rocking curve widths were ～1° per crystal and ～2.2° for the mosaic, and the oxygen chain correlation lengths were >100 Å in the a- and b-directions and ～50 Å in the c-direction.     

Augmenting Trees to Meet Biconnectivity and Diameter Constraints

Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D ) and 6 (for odd D ). A closely related problem of finding a minimum number of edges such that the augmented graph has diameter no greater than D has been shown to be NP-hard by Schoone et al. [21] when D=3 , and by Li et al. [17] when D=2. Received April 19, 1999; revised June 5, 2001.     

Numerical simulation of Zn coating solidification

A numerical model, which simulates nucleation and growth of Zn grains, has been developed in order to describe quantitatively the solidification of Zn coatings during the hot-dipping process. The inputs of the model are the nucleation distribution, which has been measured by electron backscattered diffraction (EBSD), and the dendritic growth kinetics, calculated with an analytical model of a parabolic dendrite tip modified to account for the interactions with the coating interfaces. The model predicts the shapes of the grain envelopes as a function of the grain orientation and the texture induced by growth. Three types of grain envelopes have been evidenced, depending on the angle between the c-axis and the normal to the coating plane. Moreover, it has been shown that growth reinforces the already existing {00.1} nucleation texture, in good agreement with experimental data. The model also predicts the cooling curve, including recalescence, and the grain size. Thus, it is used to describe the effects of Pb additions on solidification. In particular, it has been shown that Pb increases the nucleation undercooling and strongly decreases the density of active nuclei, thus resulting in a much larger grain size.