The Influence of C60 Powders On Cultured Human Leukocytes

In order to check its possible acute toxicity, C₆₀ was incorporated into living human phagocytes. It was observed that C₆₀ has no influence on the survival of human leukocytes.     

Vector Quantization-Based Motion Field Segmentation under the Entropy Criterion

This paper proposes a segmentation of block-based motion fields under the constraint of the entropy criterion. The segmentation is performed by a vector quantization technique which associates the segmentation pattern to an element of a codebook. Optimization of the bit rate as a trade-off between motion and segmentation on the one hand and prediction error on the other hand is addressed. An estimation of the amount of information to code the displaced frame difference is derived, making it possible to control the segmentation process. Simulation results show the efficiency of the segmentation method combined with the entropy criterion in a video coding scheme.     

Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries

This paper deals with relational databases which are extended in the sense that fuzzily known values are allowed for attributes. Precise as well as partial (imprecise, uncertain) knowledge concerning the value of the attributes are represented by means of [0,1]-valued possibility distributions in Zadeh's sense. Thus, we have to manipulate ordinary relations on Cartesian products of sets of fuzzy subsets rather than fuzzy relations. Besides, vague queries whose contents are also represented by possibility distributions can be taken into account. The basic operations of relational algebra, union, intersection, Cartesian product, projection, and selection are extended in order to deal with partial information and vague queries. Approximate equalities and inequalities modeled by fuzzy relations can also be taken into account in the selection operation. Then, the main features of a query language based on the extended relational algebra are presented. An illustrative example is provided. This approach, which enables a very general treatment of relational databases with fuzzy attribute values, makes an extensive use of dual possibility and necessity measures.     

Propriétés de la Surface d'un Film de Polyéthylène Modifiée par Greffage d'un Oligomère Acrylique

The grafting of a liquid acrylic derivative (2-methylenepentane-1,5-dicarboxylic acid diethylester) on the surface of a polyethylene film (HD) was carried out in the presence of benzoylperoxide. The wettability of the surface was investigated with respect to the adhesion properties against aluminium and compared with those of a film of polyethylene grafted in mass with acrylic acid. The mobility of the surface grafted chains may cause the differences in the observed comportment.     

Choix entre les différentes méthodes quadratiques d’estimation du spectre de puissance

Quadratic estimators of power spectra are compared, for a given total observation range, by using the matrix of the associated quadratic form. Considering the case of smooth spectra, it is shown that the smallest variance for a given resolution is achieved if this matrix is Toeplitz. From the estimation and the computation points of view, a detailed comparison is made between two types of estimation schemes. The first is composed of methods equivalent to the smoothing of a single periodogram; the second reduces to the very popular Welch method (averaging of several short, modified periodograms). Our presentation makes clear the choice of parameters and should prevent errors, common mainly when dealing with short records.     

Simple FFT and DCT algorithms with reduced number of operations

A simple algorithm for the evaluation of discrete Fourier transforms (DFT) and discrete cosine transforms (DCT) is presented. This approach, based on the divide and conquer technique, achieves a substantial decrease in the number of additions when compared to currently used FFT algorithms (30% for a DFT on real data, 15% for a DFT on complex data and 25% for a DCT) and keeps the same number of multiplications as the best known FFT algorithms. The simple structure of the algorithm and the fact that it is best suited for real data (one does not have to take a transform of two real sequences simultaneously anymore) should lead to efficient implementations and to a wide range of applications.