Large fault-tolerant interconnection networks

This paper deals with reliability and fault-tolerant properties of networks. We first survey general reliability properties of networks, in particular those concerning diameter vulnerability. Then we study in details reliability properties of some families of networks in particular de Bruijn and Kautz networks and their generalizations which appear as very good fault-tolerant networks.     

The Barnett approximation in the theory of hydrodynamic fluctuations

The Langevin dynamics and fluctuational-dissipative relationships for the hydrodynamic fluctuations for systems which are described in the third Barnett order with respect to the gradients of the hydrodynamic variables are generalized on the basis of a kinetic approach.     

A thermodynamic description of the distribution of water in H2O-tributyl phosphate and H2O-tributyl phosphate-solvent systems

Various methods for describing the distribution of water in the H₂O-tributyl phosphate (TBP) system were considered. An equation for describing the deviations from the Henry law was proposed. A three-parameter equation for calculating the distribution of water in H₂O-TBP-solvent systems was derived. It is based on the additive solubility model and allows for the dependence of the activity coefficients on the TBP concentration. Based on the published data, the parameters of the equation for a number of systems were calculated.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

Highly accurate calculation of radial spheroidal functions

A new method for calculating the radial spheroidal functions of the first kind is proposed for the arguments that are greater than unity in modulus. A well-known representation of these functions is refined and used for this purpose. The constructs and the software implementation proposed in the paper provide an efficient tool for the calculation of the functions with a desired accuracy in a wide range of parameters.