Optimization methodology of dynamic data structures based on genetic algorithms for multimedia embedded systems

Modern multimedia application exhibit high resource utilization. In order to efficiently run this kind of applications in embedded systems, the dynamic memory subsystem needs to be optimized. A key role in this optimization is played by the dynamic data structures that reside in every real-life application. This paper presents a novel and automated way to optimize dynamic data structures. The search space is pruned using genetic algorithms that converge to the best multilayered data structure implementation for the targeted applications.     

Apodized fiber Bragg gratings manufactured with the phase plate process

We present a manufacturing method based on the dynamic use of phase plates to photowrite Bragg gratings. This process allows for control of the local value of the index modulation envelope in the grating. The application to apodized fiber Bragg gratings is discussed.     

Reduction of the correlation sensitivity to the changes of the input illumination by a post processing based on the correlation statistics

Linear-correlation amplitude changes when the intensity level of the input image is modified. As recognition is often based on the correlation-peak level, a change of the input illumination may result in a false recognition. We propose an illumination-change compensation by a post processing of the correlation distribution that is based on statistical measures of the correlation histograms. The theoretical background and simulation results are provided in the frame of an actual application in biology.     

Low-dissipation and low-dispersion fourth-order Runge–Kutta algorithm

An optimized explicit low-storage fourth-order Runge–Kutta algorithm is proposed in the present work for time integration. Dispersion and dissipation of the scheme are minimized in the Fourier space over a large range of frequencies for linear operators while enforcing a wide stability range. The scheme remains of order four with nonlinear operators thanks to the low-storage algorithm. Linear and nonlinear propagation problems are finally solved to illustrate the accuracy of the present Runge–Kutta scheme.     

CEA and AREVA R&D on HTR fuel fabrication and presentation of the CAPRI experimental manufacturing line

In the framework of the French V/HTR fuel development and qualification program, the Commissariat à l’Energie Atomique (CEA) and AREVA are conducting R&D projects covering the mastering of UO₂ coated particle and fuel compact fabrication technology. To fulfill this task, a review of past knowledge, of existing technologies and a preliminary laboratory-scale work program have been conducted with the aim of retrieving the know-how on HTR coated particle and compact manufacture:

• The different stages of UO₂ kernel fabrication GSP process have been reviewed, reproduced and improved.

• The experimental conditions for the chemical vapor deposition of coatings have been defined on dummy kernels and development of innovative characterization methods has been carried out.

• Former CERCA compacting process has been reviewed and updated.

In parallel, an experimental manufacturing line for coated particles, named GAIA, and a compacting line based on former CERCA compacting experience have been designed, constructed and are in operation since early 2005 at CEA Cadarache and CERCA Romans, respectively. These two facilities constitute the CAPRI line (CEA and AREVA PRoduction Integrated line).The major objectives of the CAPRI line are:

• to recover and validate past knowledge,

• to produce representative HTR TRISO fuel meeting industrial standards,

• to permit the optimization of reference fabrication processes for kernels and coatings defined previously at a laboratory-scale and the investigation of alternative and innovative fuel design (UCO kernel, ZrC coating),

• to test alternative compact process options and

• to fabricate and characterize fuel required for irradiation and qualification purpose.

This paper presents the status of progress of R&D conducted on HTR fuel particles and compact manufacture by early 2005 and the potential of the laboratory-scale HTR fuel CAPRI line.     

Volume-Surface Trees

Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS³), such as octrees, kD‐trees or BSP trees. Such HS³ usually provide an axis‐aligned subdivision of the 3D space embedding a scene or an object. However, the purely volume‐based behavior of these schemes often leads to strongly imbalanced surface clustering. In this article, we introduce the VS‐Tree, an alternative HS³ providing efficient and accurate surface‐based hierarchical clustering via a combination of a global 3D decomposition at coarse subdivision levels, and a local 2D decomposition at fine levels near the surface. First, we show how to efficiently construct VS‐Trees over meshes and point‐based surfaces, and analyze the improvement it offers for cluster‐based surface simplification methods. Then we propose a new surface reconstruction algorithm based on the volume‐surface classification of the VS‐Tree. This new algorithm is faster than state‐of‐the‐art reconstruction methods and provides a final semi‐regular mesh comparable to the output of remeshing algorithms.     

Independence and Possibilistic Conditioning

There is not a unique definition of a conditional possibility distribution since the concept of conditioning is complex and many papers have been conducted to define conditioning in a possibilistic framework. In most cases, independence has been also defined and studied by means of a kind of analogy with the probabilistic case. In [2,4], we introduce conditional possibility as a primitive concept by means of a function whose domain is a set of conditional events. In this paper, we define a concept of independence associated with this form of conditional possibility and we show that classical properties required for independence concepts are satisfied.     

Electrical Conductivity and Spin Crossover: Towards the First Achievement With a Metal Bis Dithiolene Complex

The synthesis, structure, magnetic behavior and electrical conductivity of the system [Fe(sal₂trien)][Ni(dmit)₂]_x have been investigated. The electrocrystallization method used has afforded small amounts of crystalline multi-phase materials. In particular, the complex salt [Fe(sal₂trien)][Ni(dmit)₂]₃ has been unambiguously characterized. Surprisingly, despite it contains the spin crossover cation [Fe(sal₂trien)]⁺, the complex does not exhibit spin transition. Most probably, this fact is related to the structural arrangement of the cationic species, which in addition are strongly disordered. This salt behaves like a semiconductor. A strongly cooperative spin transition accompanied with a hysteresis loop is observed in a still-unknown phase obtained during the preparation of [Fe(sal₂-trien)] [Ni(dmit)₂]₃.     

Prescribed error tolerances within fixed computational times for scattering problems of arbitrarily high frequency: the convex case

We present a new algorithm for the numerical solution of problems of electromagnetic or acoustic scattering by large, convex obstacles. This algorithm combines the use of an ansatz for the unknown density in a boundary-integral formulation of the scattering problem with an extension of the ideas of the method of stationary phase. We include numerical results illustrating the high-order convergence of our algorithm as well as its asymptotically bounded computational cost as the frequency increases.