HOW GOOD IS A DENSE SHOP SCHEDULE?

In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense open-shop schedules, we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture. Support for the research by the first author is provided by the Management Research Fellowship of the ESRC (Economic & Social Research Council) of U.K., and this research is also partially supported by the National Natural Science Foundation of China.  

CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems

We reformulate a stochastic nonlinear complementarity problem as a stochastic programming problem which minimizes an expected residual defined by a restricted NCP function with nonnegative constraints and CVaR constraints which guarantee the stochastic nonlinear function being nonnegative with a high probability. By applying smoothing technique and penalty method, we propose a penalized smoothing sample average approximation algorithm to solve the CVaR-constrained stochastic programming. We show that the optimal solution of the penalized smoothing sample average approximation problem converges to the solution of the corresponding nonsmooth CVaR-constrained stochastic programming problem almost surely. Finally, we report some preliminary numerical test results.  

An aggregate deformation homotopy method for min-max-min problems with max-min constraints

In this paper, the constrained min-max-min problem, which is an essentially nonsmooth and nonconvex problem, is considered. Based on a twice aggregate function with a modification, an aggregate deformation homotopy method is established. Under some suitable assumptions, a smooth path from a randomly given point to a solution of the generalized KKT system is proven to exist. By numerically tracing the smooth path, a globally convergent algorithm for some solution of the problem is given. Some numerical results are given to show the feasibility of the method.  

Homotopy Methods for Solving Variational Inequalities in Unbounded Sets

In this paper, for solving the finite-dimensional variational inequality problem

AFS结构上矩阵的幂等指数估计

在应用AFS结构(M,τ,X)研究故障诊断问题中,需要寻找正整数r使其满足M2γτ=Mγτ.由于复杂系统对应的AFS结构上矩阵Mτ的阶数较大,为了减少计算量,需要估计出最小的γ.本文给出了基于集合M上的布尔矩阵的概念,并得出其传递闭包的相关性质,在集合M上的布尔矩阵与(0,1)布尔矩阵之间建立一种同态映射并给出其证明,最后运用该映射对r的范围进行了估计.  

服务台休假的GI/Geom/1离散时间排队

本文研究了具有位相型休假、位相型启动和单重几何休假的离散时间排队,假定 顾客到达间隔服从一般分布,服务时间服从几何分布,运用矩阵解析方法我们得到了这 些排队系统中顾客在到达时刻稳态队长分布及其随机分解.  

Eigenvalue solution to the electron-collisional effect on ion-acoustic and entropy waves

The linearized electron Fokker- Planck and cold-ion fluid equations are solved as an eigenvalue problem in the quasineutral limit for ionization state, Z = 1, 8, and 64 for ion-acoustic and entropy waves. The perturbed electron distribution function is written as a moment expansion of eigenvectors, and is used to compute collisionality-dependence macroscopic quantities in the plasma such as the generalized specific heat ratio, and the electron thermal conductivity.  

The PT-order,minimal cutsets and menger property

If P is a poset, the associated PT-order is the quasi order in which a b holds if every maximal chain of P which passes through a also passes through b. P is special if whenever A is a chain in P and a=sup A or inf A, then there is b A such that b a. It is proved that if P is chain complete and special then the set of -maximal elements is -dominating and contains a minimal cutset. As corollaries of this, we give partial answers to (i) a question of Rival and Zaguia by showing that if P is regular and special every element is in a minimal cutset and (ii) a question of Brochet and Pouzet by showing that if P is chain complete and special then it has the Menger property.Research partially supported by grants from the National Natural Science Foundation of China and the Natural Science Foundation of Shaanxi province  

一个基于电路结构分析的测试产生系统——SABATPG

本文首次介绍一个基于电路结构分析的测试产生系统——SABATPG.该系统从局部产生测试和后效作用两个新概念出发,以FAN算法为基础,采用局部蕴涵利用已知不可测故障加速测试产生和故障信号的共同敏化三项新技术.对ISCAS’8510个组合电路的测试产生结果表明,SABATPG与基于FAN算法的测试产生系统相比,测试产生效率提高近20％.  

规范场的分解约化及可Abel化场对偶荷解

本文根据荷算符的同位旋方向,将规范势与其场强规范协变地分解成以该荷及其对偶荷为源的场和带该荷的矢粒子场。写出了SU(N)/U(1)~(N-1),SU(N)/SU(P)SU(N-P)U(1),SO(N)/SO(N-1)规范场的明显分解式——其中包括各种推广的’t Hooft场强式.将可Abel化的规范场的无源方程分离变量化简,求得了静多体点荷系解及直线运动加速荷的推迟解。