A study of behavioural groupings of polyphenolic species in "fino" sherry wine. Evolution during vinification and mechanical treatment of the grape

The different groups and/or classes among phenolic acids and aldehydes identified during the elaboration process of "fino" sherry wine have been studied. The study was carried out using different processes during the elaboration of the wine and we have attempted to establish whether the different treatments of the grape affect these groupings. The study was undertaken by means of cluster and multifactorial analysis on the data obtained by the quantitative determination of phenolic acids and aldehydes during vinification and in experiments carried out on the grape under different mechanical treatments. The analysis of phenolic acids and aldehydes was done with HPLC, using a C-18 mu-Bondapak and a stepwise composite gradient. The samples were previously extracted with ethylic ether.     

Feature detection in 3-d medical images using shape information

Three methods for identifying the left ventricular apex in 3-D medical images of the heart called gated blood pool tomograms were investigated. The first method assumed a known orientation and positioning of the entire blood pool. The second and third methods used shapes described by quadratic surfaces, which are invariant to position and orientation. The first method performed best when the blood pool was accurately oriented, but as expected, could not handle blood pools in the wrong orientations. The quadratic surface methods performed well whether or not the blood pool was accurately oriented. The best quadratic surface method predicted the x, y, z value of the apex with correlations of 0.97, 0.98, 0.99.     

Limited Angle Reconstruction in Tomography via Squashing

We give a new algorithm for reconstructing a density f in the plane from its projections along those lines making an angle greater than a fixed delta > 0 with the x axis. Of course, the performance of the algorithm depends on delta and on the smoothness of f, but it appears to give a practical and simple solution to the problem whenever one exists. The basic idea, which seems to be new, is to make an affine (squashing) scale change of f to g for which the projections are then known at n equally spaced angles, so that we know how to find g, and then we obtain f from g by inverting the scale change.     

An algorithm for solving sparse Nonlinear Least Squares problems

We introduce a new method for solving Nonlinear Least Squares problems when the Jacobian matrix of the system is large and sparse. The main features of the new method are the following:

1. The Gauss-Newton equation is “partially” solved at each iteration using a preconditioned Conjugate Gradient algorithm.
2. The new point is obtained using a two-dimensional trust region scheme, similar to the one introduced by Bulteau and Vial.

We prove global and local convergence results and we present some numerical experiments.     

Sparse decompositions for exploratory pattern analysis

We define and verify the utility of a pattern analysis procedure called sparse decomposition. This technique involves sequentially ``peeling' sparse subsets of patterns from a pattern set, where sparse subsets are sets of patterns which possess a certain degree of regularity or compactness as measured by a compactness measure c. If this is repeated until all patterns are deleted, then the sequence of decomposition ``layers' derived by this procedure provides a wealth of information from which inferences about the original pattern set may be made. A statistic P is derived from this information and is shown to be powerful in detecting clustering tendency for data in reasonably compact sampling windows. The test is applied to both synthetic and real data.     

Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers

This correspondence presents several parallel algorithms for image template matching on an SIMD array processor with a hypercube interconnection network. For an N by N image and an M by M window, the time complexity is reduced from O(N2M2) for the serial algorithm to O(M2/K2 + M * log2 N/K + log2 N * log2 K) for the N2K2-PE system (1 ? K ? M), or to O(N2M2/L2) for the L2-PE system (L ? N). With efficient use of the inter-PE communication network, each PE requires only a small local memory, many unnecessary data transmissions are eliminated, and the time complexity is greatly reduced.     

Tests in an MR reactor of experimental fuel elements of the VVÉR-1000 reactor

Conclusions In an MR reactor performance tests of 16 fuel assemblies, with elements having essentially the same structure as standard VVÉR-100 fuel elements, were carried out. Tests of five more fuel assemblies are continuing. Of the 16 assemblies, 13 were studied in a hot laboratory.The tests in the MR, carried out at high loads and with a large number of transition processes, as well as the postreactor studies, indicated that fuel elements of the specified design (with initial helium pressures of 1.96–2.45 MPa) have a high reliability. None of the elements of the fuel assemblies studied malfunctioned due to design defects or faults in their fabrication. During the tests the jackets were subject to a little oxidation and hydrogenation (zirconium-oxide film<3 m thick, hydrogen content less than 0.008% by mass), and their plasticity remained high (the relative elongation at the working temperature remained at the 20% level).Translated from Atomnaya Énergiya, Vol. 62, No. 5, pp. 312–317, May, 1987.