Single chamber Solid Oxide Fuel Cells selective electrodes: A real chance with brownmillerite-based nanocomposites

In this contribution brownmillerite-based nanocomposite cathode for Single-Chamber Solid Oxide Fuel Cells is developed. These cells can be very attractive especially for small and cheap devices because of the absence of seals. The efficiency of SC-SOFCs is strictly connected to the selectivity of anode and cathode, the bottleneck for this technology. The development of a cathode inert in fuel oxidation is particularly challenging. Our strategy is to start from a catalytically un-active support (CFA = Ca₂FeAl_0.95Mg_0.05O₅) and induce the formation of iron oxide based nanoparticles, expected to activate oxygen. Symmetric (CFA + FeO_x/CGO/CFA + FeO_x) and complete cells (CFA + FeO_x/CGO/Ni-CGO) are studied in air and methane/oxygen 2:1 mixture. The Area Specific Resistance of CFA + FeO_x is less than 1/3 that of CFA. The high selectivity allows to reach an efficiency of 25%; power still needs to be increased but we demonstrated the possibility to develop selective low cost electrodes. The effect of air, methane/oxygen exposure and the heat treatments were carefully investigated.     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

Automatic fog detection and estimation of visibility distance through use of an onboard camera

In this paper, we will present a technique for measuring visibility distances under foggy weather conditions using a camera mounted onboard a moving vehicle. Our research has focused in particular on the problem of detecting daytime fog and estimating visibility distances; thanks to these efforts, an original method has been developed, tested and patented. The approach consists of dynamically implementing Koschmieder's law. Our method enables computing the meteorological visibility distance, a measure defined by the International Commission on Illumination (CIE) as the distance beyond which a black object of an appropriate dimension is perceived with a contrast of less than 5%. Our proposed solution is an original one, featuring the advantage of utilizing a single camera and necessitating the presence of just the road and sky in the scene. As opposed to other methods that require the explicit extraction of the road, this method offers fewer constraints by virtue of being applicable with no more than the extraction of a homogeneous surface containing a portion of the road and sky within the image. This image preprocessing also serves to identify the level of compatibility of the processed image with the set of Koschmieder's model hypotheses. Nicolas Hautiére graduated from the École Nationale des Travaux Publics de l'État, France (2002). He received his M.S. and Ph.D. degree in computer vision, respectively, in 2002 and 2005 from Saint-Étienne University (France). From 2002, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France. His research interests include trafic engineering, computer vision, and pattern recognition. Jean-Philippe Tarel graduated from the École Nationale des Ponts et Chaussées, Paris, France (1991). He received his Ph.D. degree in Applied Mathematics from Paris IX-Dauphine University in 1996 and he was with the Institut National de Recherche en Informatique et Automatique (INRIA) from 1991 to 1996. From 1997 to 1998, he was a research associate at Brown University, USA. From 1999, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France, and from 2001 to 2003 in the INRIA. His research interests include computer vision, pattern recognition, and shape modeling. Jean Lavenant graduated from the École Nationale des Travaux Publics de l'État, Lyon, France (2001). He received the M.S. degree in Computer Vision from Jean Monnet university of Saint-Étienne in 2001. In 2001, he was a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC). In 2002, he was a system engineer in Chicago (USA). He is currently an engineer for the french ministry of transports. Didier Aubert received the M.S. and Ph.D. degree, respectively, in 1985 and 1989 from the National Polytechnical Institut of Grenoble (INPG). From 1989--1990, he worked as a research scientist on the development of an automatic road following system for the NAVLAB at Carnegie Mellon University. From 1990–1994, he worked in the research department of a private company (ITMI). During this period he was the project leader of several projects dealing with computer vision. He is currently a researcher at INRETS since 1995 and works on Road traffic measurements, crowd monitoring, automated highway systems, and driving assistance systems for vehicles. He is an image processing expert for several companies, teaches at Universities (Paris VI, Paris XI, ENPC, ENST) and is at the editorial board of RTS (Research - Transport - Safety).     

Weight smoothing to improve network generalization

A weight smoothing algorithm is proposed in this paper to improve a neural network's generalization capability. The algorithm can be used when the data patterns to be classified are presented on an n-dimensional grid (n>/=1) and there exists some correlations among neighboring data points within a pattern. For a fully-interconnected feedforward net, no such correlation information is embedded into the architecture. Consequently, the correlations can only be extracted through sufficient amount of network training. With the proposed algorithm, a smoothing constraint is incorporated into the objective function of backpropagation to reflect the neighborhood correlations and to seek those solutions that have smooth connection weights. Experiments were performed on problems of waveform classification, multifont alphanumeric character recognition, and handwritten numeral recognition. The results indicate that (1) networks trained with the algorithm do have smooth connection weights, and (2) they generalize better.     

A New Criteria Decision Applied on the Primary Synchronization in the DS-WCDMA Interface of the UMTS System

In DS-WCDMA mobile systems such the UMTS, asynchronous cell site operation,assigning different long spreading code to each cell, yields the advantageof flexible system deployment. We can design an indoor system basedon an outdoor one. However, in general, much longer search time isrequired in asynchronous operation than in synchronous. This paperproposes three techniques to take decisions about synchronizationbased on observation of correlated signals. Classical decision criterialike maximum and threshold criterion are presented. A new decisioncriteria that we call Threshold&Max combined decision criteriais analyzed. The results of this new introduced technique is comparedwith the classical ones.     

Effect of moderate to very low fat defined formula diets on serum lipids in healthy subjects

Serum total cholesterol, high density lipoprotein (HDL) cholesterol, and triglyceride levels were studied in healthy male and female subjects consuming for one-week periods a diet of conventional food (CF) providing 42% of energy as fat, principally butter fat, and then in random order nutritionally complete, defined formula diets of moderate (32%) to very low (1%) fat content. Compared to CF, the formula with 32% of energy as corn oil lowered serum cholesterol by 25% and the ratio of total to HDL-cholesterol by 13%. Low (9%) and very low (1–3%) fat formulas reduced HDL-cholesterol by as much as 40%, raised the total: HDL-cholesterol ratio by about 20% and raised serum triglyceride levels by as much as 100%. When low and very low fat formulas were ingested for three weeks, these effects persisted although maximal responses occurred during the first week. These results demonstrated that a moderate fat formula diet with a high P/S ratio had a more favorable effect on serum lipid levels than various low fat formulas. Low fat conventional food diets should be studied in long-term controlled metabolic experiments before such diets are recommended to the general population for coronary heart disease or cancer prevention.     

Performance evaluation of a water/silicone oil two‐phase partitioning bioreactor using Rhodococcus erythropolis T902.1 to remove volatile organic compounds from gaseous effluents

BACKGROUND: In the framework of biological processes used for waste gas treatment, the impact of the inoculum size on the start‐up performance needs to be better evaluated. Moreover, only a few studies have investigated the behaviour of elimination capacity and biomass viability in a two‐phase partitioning bioreactor (TPPB) used for waste gas treatment. Lastly, the impact of ethanol as a co‐substrate remains misunderstood. RESULTS: Firstly, no benefit of inoculation with a high cellular density (>1.5 g L^?1) was observed in terms of start‐up performance. Secondly, the TPPB was monitored for 38 days to characterise its behaviour under several operational conditions. The removal efficiency remained above 63% for an inlet concentration of 7 g isopropylbenzene (IPB) m^?3 and at some time points reached 92% during an intermittent loading phase (10 h day^?1), corresponding to a mean elimination capacity of 4 × 10^?3 g L^?1 min^?1 (240 g m^?3 h^?1) for a mean IPB inlet load of 6.19 × 10^?3 g L^?1 min^?1 (390 g m^?3 h^?1). Under continuous IPB loading, the performance of the TPPB declined, but the period of biomass acclimatisation to this operational condition was shorter than 5 days. The biomass grew to approximately 10 g L^?1 but the cellular viability changed greatly during the experiment, suggesting an endorespiration phenomenon in the bioreactor. It was also shown that simultaneous degradation of IPB and ethanol occurred, suggesting that ethanol improves the biodegradation process without causing oxygen depletion. CONCLUSION: A water/silicone oil TPPB with ethanol as co‐substrate allowed the removal of a high inlet load of IPB during an experiment lasting 38 days. Copyright © 2008 Society of Chemical Industry     

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.     

A Tool Support for Reusing ELAN Rule-Based Components

The adaptation of software components developed for a specific application in order to generate reusable components often includes some kind of generalization. This generalization may be carried out, for instance, by the renaming of some identifiers or by its parameterization. In our work, we are specially interested in the generalization by parameterization of algebraic specification components. Generalization and some other transformations on algebraic specifications are being integrated in the FERUS tool. This tool was initially developed for the Common Algebraic Specification Language, called CASL, and we show in the paper its adaptation to the new version of the rule-based programming language ELAN.