Fast in situ 3D nanoimaging: a new tool for dynamic characterization in materials science

1. Download high-res image (269KB)
2. Download full-size image

     

Through‐the‐glass spectroscopic ellipsometry for analysis of CdTe thin‐film solar cells in the superstrate configuration

Polycrystalline CdS/CdTe thin‐film solar cells in the superstrate configuration have been studied by spectroscopic ellipsometry (SE) using glass side illumination. In this measurement method, the first reflection from the ambient/glass interface is rejected, whereas the second reflection from the glass/film‐stack interface is collected; higher order reflections are also rejected. The SE analysis incorporates parameterized dielectric functions ε for solar cell component materials obtained by in situ and variable‐angle SE. In the SE analysis of the complete cells, a step‐wise procedure ranks the fitting parameters, including thicknesses and those defining the spectra in ε, according to their ability to reduce the root‐mean‐square deviation between the simulated and measured SE spectra. The best fit thicknesses from this analysis are found to be consistent with electron microscopy. Based on the SE results, the solar cell quantum efficiency (QE) can be simulated without any free parameters, and comparisons with measured QE enable optical model refinements as well as identification of optical and electronic losses. These capabilities have wide applications in photovoltaic module mapping and in‐line monitoring. Copyright © 2016 John Wiley & Sons, Ltd.     

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages

Seki et al. (Theor. Comput. Sci. 88(2):191–229, 1991) showed that every m-multiple context-free language L is weakly 2m-iterative in the sense that either L is finite or L contains a subset of the form \(\{ u_{0} w_{1}^{i} u_{1} \cdots w_{2m}^{i} u_{2m} \mid i \in \mathbb {N}\}\) , where w ₁?w _2n ≠ε. Whether every m-multiple context-free language L is 2m-iterative, that is to say, whether all but finitely many elements z of L can be written as z=u ₀ w ₁ u ₁?w _2m u _2m with w ₁?w _2m ≠ε and \(\{ u_{0} w_{1}^{i} u_{1} \cdots w_{2m}^{i} u_{2m} \mid i \in \mathbb {N}\} \subseteq L\) , has been open. We show that there is a 3-multiple context-free language that is not k-iterative for any k.     

Understanding of the annealing temperature impact on ion implanted bifacial n‐type solar cells to reach 20.3% efficiency

Ion implantation has the advantage of being a unidirectional doping technique. Unlike gaseous diffusion, this characteristic highlights strong possibilities to simplify solar cell process flows. The use of ion implantation doping for n‐type PERT bifacial solar cells is a promising process, but mainly if it goes with a unique co‐annealing step to activate both dopants and to grow a SiO₂ passivation layer. To develop this process and our SONIA cells, we studied the impact of the annealing temperature and that of the passivation layers on the electrical quality of the implanted B‐emitter and P‐BSF. A high annealing temperature (above 1000 °C) was necessary to fully activate the boron atoms and to anneal the implantation damages. Low J_0BSF (BSF contribution to the saturation current density) of 180 fA/cm² was reached at this high temperature with the best SiO₂ passivation layer. An average efficiency of 19.7% was reached using this simplified process flow (“co‐anneal process”) on large area (239 cm²) Cz solar cells. The efficiency was limited by a low FF, probably due to contaminations by metallization pastes. Improved performances were achieved in the case of a “separated anneals” process where the P‐BSF is activated at a lower temperature range. An average efficiency of 20.2% was obtained in this case, with a 20.3% certified cell. Copyright © 2014 John Wiley & Sons, Ltd.     

Measuring and Improving Image Resolution by Adaptation of the Reciprocal Cell

Traditionally, discrete images are assumed to be sampled on a square grid and from a special kind of band-limited continuous image, namely one whose Fourier spectrum is contained within the rectangular reciprocal cell associated with the sampling grid. With such a simplistic model, resolution is just given by the distance between sample points.Whereas this model matches to some extent the characteristics of traditional acquisition systems, it doesn't explain aliasing problems, and it is no longer valid for certain modern ones, where the sensors may show a heavily anisotropic transfer function, and may be located on a non-square (in most cases hexagonal) grid.In this work we first summarize the generalizations of Fourier theory and of Shannon's sampling theorem, that are needed for such acquisition devices. Then we explore its consequences: (i) A new way of measuring the effective resolution of an image acquisition system; (ii) A more accurate way of restoring the original image which is represented by the samples. We show on a series of synthetic and real images, how the proposed methods make a better use of the information present in the samples, since they may drastically reduce the amount of aliasing with respect to traditional methods. Finally we show how in combination with Total Variation minimization, the proposed methods can be used to extrapolate the Fourier spectrum in a reasonable manner, visually increasing image resolution.     

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems

Given a graph G=(V,E) and a positive integer k, an edge modification problem for a graph property Π consists in deciding whether there exists a set F of pairs of V of size at most k such that the graph $H=(V,E\vartriangle F)$ satisfies the property Π. In the Π edge-completion problem, the set F is constrained to be disjoint from E; in the Π edge-deletion problem, F is a subset of E; no constraint is imposed on F in the Π edge-editing problem. A number of optimization problems can be expressed in terms of graph modification problems which have been extensively studied in the context of parameterized complexity (Cai in Inf. Process. Lett. 58:171–176, 1996; Fellows et al. in FCT, pp. 312–321, 2007; Heggernes et al. in STOC, pp. 374–381, 2007). When parameterized by the size k of the set F, it has been proved that if Π is a hereditary property characterized by a finite set of forbidden induced subgraphs, then the three Π edge-modification problems are FPT (Cai in Inf. Process. Lett. 58:171–176, 1996). It was then natural to ask (Bodlaender et al. in IWPEC, 2006) whether these problems also admit a polynomial kernel. in polynomial time to an equivalent instance (G′,k′) with size bounded by a polynomial in k). Using recent lower bound techniques, Kratsch and Wahlström answered this question negatively (Kratsch and Wahlström in IWPEC, pp. 264–275, 2009). However, the problem remains open on many natural graph classes characterized by forbidden induced subgraphs. question to characterize for which type of graph properties, the parameterized edge-modification problems have polynomial kernels. Kratsch and Wahlström asked whether the result holds when the forbidden subgraphs are paths or cycles and pointed out that the problem is already open in the case of P ₄-free graphs (i.e. cographs). This paper provides positive and negative results in that line of research. We prove that Parameterized cograph edge-modification problems have cubic vertex kernels whereas polynomial kernels are unlikely to exist for the P _l -free edge-deletion and the C _l -free edge-deletion problems for l?7 and l≥4 respectively. Indeed, if they exist, then NP?coNP/poly.     

Influence of surface tension, osmotic pressure and pores morphology on the densification of ice-templated ceramics

We attempt here to clarify the influence of the nature of the solvent on the ice-templating process, based on literature experimental results of porosity and suspension concentration. In particular, we compare the relative influence of surface tension, osmotic pressure and the pore size and radius of curvature on the densification of the green bodies. Variations of the osmotic pressure when changing the solvent can yield significantly different behaviour during the freezing stage and therefore significantly affect the densification behaviour, an effect not apparent when using the Shanti model. In addition, and equally important, a modification of the macropores morphology is induced by the evolution of the solvent crystals morphology, and resulting in smaller and more intricate crystals and macropores which facilitates the densification. The radius of curvature is probably also an essential parameter controlling the densification of ice-templated ceramics.     

Concomitant use of liquid–liquid batch and continuous plug flow reactors for kinetic model discrimination. Application to the Rh/TPPTS catalysed reduction of the C–C double bond in dimethylitaconate

The biphasic catalytic reduction of the C–C double bond of dimethylitaconate with a water soluble rhodium/triphenylphosphinetrisulphonated sodium salt (TPPTS) complex is investigated. Kinetic studies in a well-mixed batch reactor provide kinetics parameters and an activation energy of 71 kJ mol⁻¹ but cannot discriminate between a first order or a complex kinetic model within the range of substrate concentration where the approximation of linear liquid/liquid partition is respected. Catalytic tests in the centrifugal partition chromatograph (CPC) reactor under steady-state operations in chemical regime and plug flow mode allow discriminating the kinetic models, the complex kinetic rate law being preferred.     

Consistent Video Filtering for Camera Arrays

Visual formats have advanced beyond single‐view images and videos: 3D movies are commonplace, researchers have developed multi‐view navigation systems, and VR is helping to push light field cameras to mass market. However, editing tools for these media are still nascent, and even simple filtering operations like color correction or stylization are problematic: naively applying image filters per frame or per view rarely produces satisfying results due to time and space inconsistencies. Our method preserves and stabilizes filter effects while being agnostic to the inner working of the filter. It captures filter effects in the gradient domain, then uses input frame gradients as a reference to impose temporal and spatial consistency. Our least‐squares formulation adds minimal overhead compared to naive data processing. Further, when filter cost is high, we introduce a filter transfer strategy that reduces the number of per‐frame filtering computations by an order of magnitude, with only a small reduction in visual quality. We demonstrate our algorithm on several camera array formats including stereo videos, light fields, and wide baselines.