Phase formation and control of morphology in sputtered Cu-In alloy layers

The dependence of structural properties and surface morphology of Cu-In alloy layers on the composition and sputtering deposition sequence were investigated by X-ray diffraction, scanning electron microscopy and energy-dispersive X-ray spectroscopy. The properties of the co-sputtered alloy layers changed abruptly around the composition boundary when the Cu/In ratio reached 1/2. This can be explained by the effective heat of formation (EHF) model, which has been used to predict the sequence of phase formation for metal diffusion couples. The use of a co-sputtered alloy layer with a high In concentration was not suitable for fabricating solar cells, because the film had a very rough morphology due to large In islands formed on the CuIn₂ phase. However, it was possible to minimize this phase by In sputtering followed by co-sputtering with a Cu/In ratio of 1 (Cu-In/In/Glass). This permitted the fabrication of a homogeneous Cu-In alloy layer, which was not possible through the simple co-sputtering.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Reliability Estimation of Classification Algorithms. I. Introduction to the Problem. Point Frequency Estimates

The study deals with estimating the reliability of classification algorithms. The present article (the first of three) examines the statistical methods used for point estimation of the reliability of classifiers in the frequency approach. The estimation results are applicable to the small-sample case, which is of considerable importance in practice.     

On the advantage over a random assignment

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Simulation of Convective Flow of an Electrically Conducting Fluid in a Cavity

A new quasi-hydrodynamic algorithm is proposed for numerical analysis of convective flows in the presence of a homogeneous external magnetic field. The Marangoni convection problem in a square cross-section cavity is solved.     

Uniform estimate of the constant in the strengthened CBS inequality for anisotropic non‐conforming FEM systems

Preconditioners based on various multilevel extensions of two‐level finite element methods (FEM) lead to iterative methods which have an optimal order computational complexity with respect to the size of the system. Such methods were first presented in Axelsson and Padiy (SIAM. J. Sci. Stat. Comp. 1990; 20 :1807) and Axelsson and Vassilevski (Numer. Math. 1989; 56 :157), and are based on (recursive) two‐level splittings of the finite element space. The key role in the derivation of optimal convergence rate estimates is played by the constant γ in the so‐called Cauchy–Bunyakowski–Schwarz (CBS) inequality, associated with the angle between the two subspaces of the splitting. It turns out that only existence of uniform estimates for this constant is not enough but accurate quantitative bounds for γ have to be found as well. More precisely, the value of the upper bound for γ∈(0,1) is part of the construction of various multilevel extensions of the related two‐level methods. In this paper, an algebraic two‐level preconditioning algorithm for second‐order elliptic boundary value problems is constructed, where the discretization is done using Crouzeix–Raviart non‐conforming linear finite elements on triangles. An important point to make is that in this case the finite element spaces corresponding to two successive levels of mesh refinements are not nested. To handle this, a proper two‐level basis is considered, which enables us to fit the general framework for the construction of two‐level preconditioners for conforming finite elements and to generalize the method to the multilevel case. The major contribution of this paper is the derived estimates of the related constant γ in the strengthened CBS inequality. These estimates are uniform with respect to both coefficient and mesh anisotropy. To our knowledge, the results presented in the paper are the first such estimates for non‐conforming FEM systems. Copyright © 2004 John Wiley & Sons, Ltd.     

An Integral Formula for the Complex Intersection Number of Real Cycles in a Real Algebraic Variety with Topologically Rational Singularities

A formula of type indicated in the title is presented and discussed. Bibliography: 7 titles.