Dans la langue française, une forme d'auxiliarité, composée de deux éléments cohérents l'auxiliant et l'auxilié, fournit, en effet, à la phrase une diversité significative et structurale. L'auxiliarité, renvoie à l'unification de deux éléments grammaticaux afin de localiser l'énoncé sur l'axe du temps, d'aspect ou de mode. É. Benveniste définit l'auxiliarité en : « Il s'agit d'une forme linguistique unitaire qui se réalise, à travers des paradigmes entiers, en  deux éléments, dont chacun assume une partie des fonctions grammaticales, et qui sont à la fois liés et autonomes, distincts et complémentaires »[1]. Ces deux éléments d'auxiliarité possèden

Three-dimensional (3D) image and medical image processing, which are considered big data analysis, have attracted significant attention during the last few years. To this end, efficient 3D object recognition techniques could be beneficial to such image and medical image processing. However, to date, most of the proposed methods for 3D object recognition experience major challenges in terms of high computational complexity. This is attributed to the fact that the computational complexity and execution time are increased when the dimensions of the object are increased, which is the case in 3D object recognition. Therefore, finding an efficient method for obtaining high recognition accuracy with low computational complexity is essentia

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.

The Adaptive Optics technique has been developed to obtain the correction of atmospheric seeing. The purpose of this study is to use the MATLAB program to investigate the performance of an AO system with the most recent AO simulation tools, Objected-Oriented Matlab Adaptive Optics (OOMAO). This was achieved by studying the variables that impact image quality correction, such as observation wavelength bands, atmospheric parameters, telescope parameters, deformable mirror parameters, wavefront sensor parameters, and noise parameters. The results presented a detailed analysis of the factors that influence the image correction process as well as the impact of the AO components on that process

The aim of this paper is to present the numerical method for solving linear system of Fredholm integral equations, based on the Haar wavelet approach. Many test problems, for which the exact solution is known, are considered. Compare the results of suggested method with the results of another method (Trapezoidal method). Algorithm and program is written by Matlab vergion 7.

To obtain the approximate solution to Riccati matrix differential equations, a new variational iteration approach was ‎proposed, which is suggested to improve the accuracy and increase the convergence rate of the approximate solutons to the ‎exact solution. This technique was found to give very accurate results in a few number of iterations. In this paper, the ‎modified approaches were derived to give modified solutions of proposed and used and the convergence analysis to the exact ‎solution of the derived sequence of approximate solutions is also stated and proved. Two examples were also solved, which ‎shows the reliability and applicability of the proposed approach. ‎