A smooth homotopy method for incomplete markets

Mathematical Programming - In the general equilibrium with incomplete asset markets (GEI) model, the excess demand functions are typically not continuous at the prices for which the assets have...     

Particle Model for the Reservoirs in the Simple Symmetric Exclusion Process

Journal of Statistical Physics - In this paper, we will study the long time behavior of the simple symmetric exclusion process in the “channel” $$\varLambda _N=[1,N]\cap \mathbb {N}$$...     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

Stability radii of positive linear Volterra-Stieltjes equations

We study stability radii of linear Volterra-Stieltjes equations under multi-perturbations and affine perturbations. A lower and upper bound for the complex stability radius with respect to multi-perturbations are given. Furthermore, in some special cases concerning the structure matrices, the complex stability radius can precisely be computed via the associated transfer functions. Then, the class of positive linear Volterra-Stieltjes equations is studied in detail. It is shown that for this class, complex, real and positive stability radius under multi-perturbations or multi-affine perturbations coincide and can be computed by simple formulae expressed in terms of the system matrices. As direct consequences of the obtained results, we get some results on robust stability of positive linear integro-differential equations and of positive linear functional differential equations. To the best of our knowledge, most of the results of this paper are new.     

Diffraction by a wedge at skew incidence: integral representations of Cauchy-Carleman for the electromagnetic fields

An electromagnetic diffraction problem in a wedge shaped region is reduced to a system of coupled functional difference equations by means of Sommerfeld integrals and Malyuzhinets theorem. By introducing an integral operator it is shown that the solutions of this system of functional equations can be defined in terms of integral representations whose kernels are solutions of a singular integral equation of Cauchy-Carleman type for which an explicit solution is given.     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.     

On bounding the effective conductivity of isotropic composite materials

In this paper inequalities for the effective conductivity of isotropic composite materials are derived. These inequalities depend on several coefficients characterizing the microstructure of composites. The obtained coefficients can be exactly calculated for models of a two-component aggregate of multisized, coated ellipsoidal inclusions, packed to fill all space. As a result, new bounds for effective conductivity, considerably narrower than those of Hashin-Shtrikman, are established for such models of composite materials.     

Polynomial decay rate for the dissipative wave equation

Using Fourier integral operators with special amplitude functions, we analyze the stabilization of the wave equation in a three-dimensional bounded domain on which exists a trapped ray bouncing up and down infinitely between two parallel parts of the boundary.