Chemometric approaches in environmental problems concerning PCDD and PCDF. Data interpretation and source correlation. Mechanisms of formation and destruction in MSW combustion process

Summary The role of multivariate analysis methods in evaluating, rationalizing, and working out complex environmental problems is discussed. The discussion is organized in two sections; a literature analysis of the application of chemometric methods to PCDD/PCDF data interpretation and source correlation and a review of the role of chemometric methods in analysing the results obtained by the Authors studying PCDD/PCDF formation and destruction mechanisms in MSW combustion processes.     

Learning Markov chains in fractal compression of image data

In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available. Received: 1 July 2002     

ContributionsSign-balanced covering matrices

A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]^t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C₁, C₂,…, C_t of t columns and for each choice = (₁,…,_t) Δ of signs, the linear combination ∑_j=1^t _jC_j contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (₁, …, _t) of signs in δ, the linear combination ∑_j=1^t _jC_j contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described.     

Synthesis of Surface-Modified Nanoparticles via Cycloaddition-Reactions

Summary. The surface modification of nanoparticles via azide/alkine-1,3-dipolar cycloaddition-reactions is described. Ligand exchange onto various nanoparticles was monitored by ¹H NMR spectroscopy and formed the basis for the attachment of ligands onto the nanoparticles and their subsequent modification by dipolar cycloaddition reactions. Nanoparticle-surfaces were monitored by binding onto self-assembled monolayers derivatized with matching supramolecular interactions after derivatization.     

Complex surfaces polarized by an ample and spanned line bundle of genus three

Let X be a complex connected projective nonsingular algebraic surface endowed with an ample line bundle L, which is spanned by its global sections. Pairs (X, L) as above, with sectional genus g(X, L)=1+(L·(K _X L))/2=3 are classified by means of the main techniques of adjunction theory.     

Families of curves with ordinary singular points on regular surfaces

Sunto Fissata una superficie algebrica liscia X sopra un campo algebricamente chiuso e di caratteristica 0, e una curva ridotta C su X, si introduce, per ogni -upla di numeri naturali m₁,..., m, uno schema W=W(C, m₁,..., m), parametrizzante le curve del sistema lineare ¦C¦ con punti multipli ordinari di molteplicità almeno m₁,..., m. Si studia W in relazione con la configurazione delie singolarità e delle componenti irriducibili di C. Si prova in particolare un teorema di «virtuale connessione», che permette di stabilire l'esistenza di curve irriducibili in alcuni di tali schemi W.

---

---

Membro del G.N.S.A.G.A. del C.N.R.