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     

A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

非空交定理及其应用

本文得到了广义区间空间中几个参数型非空交定理，并用此结果证明了一些新型极大极小定理，截口定理，重合定理，以及变分不等式解的存在性定理。本文中的结果包含（１，３，５－１２，１４－１６）中相应结果。     

Resonance method for IR sensing

A highly sensitive method for infrared radiation detection based on thermal resonance in an active bolometer is set forth. An active bolometer is a self-oscillating system consisting of an IR-sensitive cell in a feedback circuit of an adjustable proportional controller. The analysis of an active bolometer autonomous (dark) dynamics reveals that with a generalized gain factor A variation the system evolves from relaxation type towards oscillating and self-oscillating type. When A=A_c, where A_c is a critical value of the generalized gain factor A, the steady state loses stability through self-excited thermal oscillations. The resonance in a system weakly perturbed by IR radiation modulated at self-oscillation frequency q₀[1+exp(iω_ct)] is considered. It is shown that in a small precritical vicinity =(A−A_c)/A_c of the gain factor the amplitude of forced thermal oscillations is proportional to q₀/A_c. The D^* calculation reveals that the detection power of a passive (A=0) bolometer increases with feedback introduction by a factor of 1/||. The detection powers of feasible versions of an active bolometer are compared.     

关于多正解问题的某些研究

本文以ｆｐ 同伦方法为工具，借助于一些适当的变换，研究有序的（Ｂ）空间中的集值映象方程的多正解问题；在文中的有关工作中，还使用了集值映象的拟导数的某些性质．     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

Searching for extensible Korobov rules

Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209–215; F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of “good” extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138].     

The π-π-theorem for manifold pairs with boundaries

The surgery obstruction of a normal map to a simple Poincaré pair (X, Y) lies in the relative surgery obstruction group L _*(π ₁(Y) → π ₁(X)). A well-known result of Wall, the so-called π-π-theorem, states that in higher dimensions a normal map of a manifold with boundary to a simple Poincaré pair with π ₁(X) ? π ₁(Y) is normally bordant to a simple homotopy equivalence of pairs. In order to study normal maps to a manifold with a submanifold, Wall introduced the surgery obstruction groups LP _* for manifold pairs and splitting obstruction groups LS _*. In the present paper, we formulate and prove for manifold pairs with boundary results similar to the π-π-theorem. We give direct geometric proofs, which are based on the original statements of Wall’s results and apply obtained results to investigate surgery on filtered manifolds.