Content of carcinogenic nitroso compounds in food products

The data are provided on the content of carcinogenous N-nitroso compounds in foods manufactured in a region with a high gastric carcinoma incidence. It was found that foods under analysis have a high content of carcinogenous nitroso compounds. The foods were also found to contain N-nitrosopiperidine, a carcinogen inducing tumors of the gastrointestinal tract.     

Solving an Inverse Problem of Erosive Burning Rate Reconstruction

A new method for an experimental study of burning processes in condensed substances is suggested, based on the statement and solution of inverse problems. An inverse problem of reconstructing the erosive burning rate of solid propellants from experimental data is formulated. The choice of an approach to solving the problem by the joint application of well-known methods for inverse problem solution and specific features of experimental studies of burning processes, in particular, erosive burning, has been justified. The problem solution is illustrated by a numerical example. The testing involves a comparative analysis of two optimization methods: although both methods are characterized by an identical accuracy, the steepest descent method has a higher rate of convergence for this class of problems than the conjugate gradient method.     

Viscosity of Conventional Cryolite-Alumina Melts

Russian Journal of Non-Ferrous Metals - Viscosity of conventional cryolite-alumina melts NaF–AlF3–CaF2–Al2O3 with a cryolite ratio (xNaF/xAlF3, mol/mol) 2.3 was studied in...     

Synthesis of luminescent yttrium silicate materials by the sol-gel method

The sol-gel method is shown to be useful for obtaining luminescent yttrium silicate-based materials with performance characteristics superior to commercial analogs. The effect of the phase composition of sol-gel luminophors on the spectral luminescence parameters is analyzed. A way to prepare materials with controlled granulometric composition is proposed.Translated from Steklo i Keramika, No. 11, pp. 23–26, November, 1996.     

Minimization of the maximal lateness for a single machine

Consideration was given to the classical NP-hard problem 1|r_j|L_max of the scheduling theory. An algorithm to determine the optimal schedule of processing n jobs where the job parameters satisfy a system of linear constraints was presented. The polynomially solvable area of the problem 1|r_j|L_max was expanded. An algorithm was described to construct a Pareto-optimal set of schedules by the criteria L_max and C_max for complexity of O(n³logn) operations.