Some empirical relations for electron mobility in II–VI compound semiconductors

Electron mobility has been calculated in a number of binary II–VI compound semiconductors using a displaced Maxwellian distribution function and taking the various scattering mechanisms into consideration at different lattice temperatures and for various amounts of ionized impurity concentrations. It is observed that the low field mobility values can be expressed by a cubic power relationship with lattice temperature and with ionized impurity concentration using a least mean square fit technique with an accuracy better than 5 per cent. Similarly, the field dependence of mobility can also be expressed as a power series of the applied electric field. It is suggested that these equations can be profitably used for a quick estimation of mobility values as a check on experiments and also as sufficiently accurate formulae for simulation and modelling purposes.     

Nonemptiness conditions for cores of discrete cooperative games

Translated from Programmnoe Oborudovanie i Voprosy Prinyatiya Reshenii, pp. 210–219, 1989.     

Quasi-extremality for control systems

A full exposition of the authors' previously announced results about the extremality index of controls in smooth control systems and a generalization of these results to systems with constraints on the controls.Translated from Itogi Nauki i Tekhniki, Seriya Sovremennye Problemy Matematiki, Noveishie Dostizheniya, Vol. 35, pp. 109–134, 1989.     

Universal algebras

A survey of the development of the theory of universal algebras in the years 1976–1988. Such basic directions of development of this theory as classes of universal algebras (varieties, quasivarieties, etc.), Mal'tsev conditions, congruences, sheaves, homomorphisms, subalgebras, products of algebras, clones of operations, completeness, systems of equations in algeberas, and connections with computer mathematics show up in it. Considerable attention is given to concrete classes of algebras (p-algebras, BCK-algebras, unary algebras, etc.).Translated from Itogi Nauki i Tekhniki, Seriya Algebra, Topologiya, Geometriya, Vol. 27, pp. 45–124, 1989.     

Theory of interfacial phase transitions in surfactant systems

The spin-1 Ising model, which is equivalent to the three-component lattice gas model, is used to study wetting transitions in three-component surfactant systems consisting of an oil, water, and a nonionic surfactant. Phase equilibria, interfacial profiles, and interfacial tensions for three-phase equilibrium are determined in mean field approximation, for a wide range of temperature and interaction parameters. Surfactant interaction parameters are found to strongly influence interfacial tensions, reducing them in some cases to ultralow values. Interfacial tensions are used to determine whether the middle phase, rich in surfactant, wets or does not wet the interface between the oil-rich and water-rich phases. By varying temperature and interaction parameters, a wetting transition is located and found to be of the first order. Comparison is made with recent experimental results on wetting transitions in ternary surfactant systems.This paper is dedicated to J. K. Percus in honor of his 65th birthday.     

Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.