Christoffel-Darboux-type formulae and a recurrence for biorthogonal polynomials

It is proved that biorthogonal polynomials obey two different kinds of Christoffel-Darboux-type formulae, one linking polynomials with a different parameter and one combining polynomials with different degrees. This is used to produce a mixed recurrence relation, which is valid for all biorthogonal polynomials. This recurrence relation establishes several results on interlacing property of zeros of successive biorthogonal polynomials and leads to a new result on the interlace of zeros of orthogonal polynomials (of equal degrees) with respect to two distributionsdψ(x) andx ^p dψ(x), 0<p≤1, with support in either [0, 1] or [1, ∞).     

A Stochastic Analysis of a Staffing Problem

Consider an organization with several categories of staff, each having a specified number of members. The age of entry into service and the age of retirement are both specified. Withdrawals occur at time-independent rates. Under this set-up, the authors have computed the maximum ages at which promotions should take place, assuming that the staff members continuing at various ages are random. Some illustrative calculations have been carried out.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

Polarization imaging for 3D inspection of highly reflective metallic objects

In the field of industrial vision, the 3D inspection of highly reflective metallic objects is still a delicate task. The specular reflections prevent the use of a 3D laser scanner, whereas the phase shifting-based 3D systems are more adapted to inspect surfaces with low curvature. This paper deals with a new automated 3D inspection system based on polarization analysis. Studying the state of polarization of the reflected light is very useful for obtaining information on the normals of the surface. An extension of the shape from polarization method from dielectric to metallic surfaces is demonstrated. Then, an improved relaxation algorithm is provided in order to reconstruct the shape from the normal field given by the polarization analysis. Finally, applications to shape defect detection are discussed and the efficiency of the system in discriminating defects on highly reflective metallic objects made by stamping and polishing is presented. The text was submitted by the authors in English.     

Wavelength and power monitoring of DWDM systems using scanning F–P filter calibrated with a F–P laser

A novel technique to overcome the long-term drift and hysteresis of a scanning Fabry–Perot filter was developed and applied to wavelength and power monitoring of DWDM system. By using the comb peaks generated by a temperature-stabilized, near threshold-biased Fabry–Perot diode laser as wavelength reference for the scanning Fabry–Perot filter, wavelength and power measurement accuracy of better than ±10 pm and 0.2 dB, respectively, were achieved.     

On Periodic Solutions of Degenerate Singularly Perturbed Linear Systems with Multiple Elementary Divisor

We establish sufficient conditions for the existence and uniqueness of a periodic solution of a system of linear differential equations with a small parameter and a degenerate matrix of coefficients of derivatives in the case of a multiple spectrum of a boundary matrix pencil. We construct asymptotics of this solution.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.