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.     

Smart Geodesic Tracing in GRworkbench

We have developed a new tool for numerical work in General Relativity: GRworkbench. We discuss how GRworkbench's implementation of a numerically-amenable analogue to Differential Geometry facilitates the development of robust and chart-independent numerical algorithms. We consider, as an example, geodesic tracing on two charts covering the exterior Schwarzschild space-time.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

On the Reality of the Eigenvalues for a Class of -Symmetric Oscillators

 We study the eigenvalue problem with the boundary conditions that decays to zero as z tends to infinity along the rays , where is a real polynomial and . We prove that if for some we have for all , then the eigenvalues are all positive real. We then sharpen this to a larger class of polynomial potentials. In particular, this implies that the eigenvalues are all positive real for the potentials when with , and with the boundary conditions that decays to zero as z tends to infinity along the positive and negative real axes. This verifies a conjecture of Bessis and Zinn-Justin. Received: 16 January 2002 / Accepted: 1 May 2002 Published online: 6 August 2002     

Structural evolution in amorphous silicon and germanium thin films.

The structural evolution in amorphous silicon and germanium thin films has been investigated by high-resolution transmission electron microscopy (HRTEM) in conjunction with autocorrelation function (ACF) analysis. The results established that the structure of as-deposited semiconductor films is of a high density of nanocrystallites embedded in the amorphous matrix. In addition, from ACF analysis, the structure of a-Ge is more ordered than that of a-Si. The density of embedded nanocrystallites in amorphous films was found to diminish with annealing temperature first, then to increase. The conclusions also corroborate well with the results of diminished medium-range order in annealed amorphous films determined previously by a variable coherence microscopy method.     

Economic Equilibrium: Optimality and Price Decentralization

Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Possible Loss and Recovery of Gibbsianness¶During the Stochastic Evolution of Gibbs Measures

We consider Ising-spin systems starting from an initial Gibbs measure ν and evolving under a spin-flip dynamics towards a reversible Gibbs measure μ≠ν. Both ν and μ are assumed to have a translation-invariant finite-range interaction. We study the Gibbsian character of the measure νS(t) at time t and show the following: (1) For all ν and μ, νS(t) is Gibbs for small t. (2) If both ν and μ have a high or infinite temperature, then νS(t) is Gibbs for all t > 0. (3) If ν has a low non-zero temperature and a zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t and non-Gibbs for large t. (4) If ν has a low non-zero temperature and a non-zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t, non-Gibbs for intermediate t, and Gibbs for large t. The regime where μ has a low or zero temperature and t is not small remains open. This regime presumably allows for many different scenarios. Received: 26 April 2001 / Accepted: 10 October 2001     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001