Trace pollutants analysis in soil by a time-resolved laser-induced breakdown spectroscopy technique

The results of a joint experiment of IFAM-Pisa and ENEA-Frascati for the detection of traces of pollutants in soil by a time-resolved laser-induced spectroscopy technique are reported. Using samples of soil with known pollutants' concentration [Geochemical Exploration Reference (GXR) silicate from US Geological Survey], we were able to estimate the sensitivity of this Laser-Induced Breakdown Spectroscopy (LIBS) technique to be of the order of some parts per million for a vast class of metallic pollutants, including extremely dangerous soil pollutants such as copper, lead and chromium.ENEA guest with HC&M fellowship     

Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices

The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.The work of this author was supported by the National Science Foundation under grants CCR-8802408 and CCR-9101640.The work of this author was supported in part during a visit to Argonne National Laboratory by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-Eng-38, and in part during a visit to the Courant Institute by the U.S. Department of Energy under Contract DEFG0288ER25053.     

Cyclic voltammetric studies of certain industrially potential iron chelate catalysts

 For the analysis of infrared spectroscopic bands and complex patterns partial cross correlation functions of a sample spectrum with reference spectra are calculated. The chosen ranges of the spectra are based on empirical knowledge of infrared spectrum structure correlations. The normalised maxima of the partial cross correlation functions are interpreted as fuzzy truth values and are combined by fuzzy logical operators. By application of that procedure larger common substructures will be derived from the reference spectra than by a maximum common substructure search based on the complete spectra. Received: 30 October 1996/Revised: 24 February 1997/Accepted: 26 February 1997     

High-accuracy measurer of complex reflection coefficient of SHF transmission lines

We describe a new method of constructing a device for simultaneous measurement of the relative amplitude and phase difference of microwave signals, using complex phase manipulation of input signals. It is shown that systematic errors of measurement are significantly lower in the proposed amplitude and phase meter. Root-mean-square values are obtained for a system with nonideal elements. A block diagram of the device is presented and its principal characteristics are described. Institute of Radiophysics and Electronics, Armenian Academy of Sciences, Erevan. Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Radiofizika, Vol. 40, No. 9, pp. 1182–1188, September, 1997.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.