求解CPM网络计划的最大网络时差

CPM网络计划的网络时差表示项目中各工序实际可使用的机动时间的总和(绝非理论上机动时间的简单加总),即CPM网络计划的总机动时间,它决定着在总工期不变的前提下,所有工序实际可以达到的最大工期的总和,与项目的成本管理和时间管理密切相关。网络时差是变量,取决于各工序的时间进度安排,说明可以通过调整工序的时间进度来决定该时差的取值,特别是其最大值,进而实现成本和时间优化。本文首先从新的角度分析了网络时差的含义;然后,在此基础上设计了求解最大网络时差的算法,其思路为,通过建立和分析最大网络时差模型,将其转化为特殊的“时间-费用权衡问题”,进而可运用Fulkerson算法等经典算法求解;最后,通过应用举例对该算法进行了演示。     

具控制结构的向量拟均衡系统

引入一类向量伪单调映射,在Hausdorff拓扑线性空间中,利用向量映射的锥连续条件与极大元定理,讨论具控制结构的向量拟均衡问题系统,研究该问题的有效解及强解,得到这两类解的存在性与解集的紧性,并建立这两类解之间的联系。     

Effect of magnetic field on poroelastic bone model for internal remodeling

This paper studies the effects of the magnetic field and the porosity on a poroelastic bone model for internal remodeling. The solution of the internal bone remodeling process induced by a magnetic field is presented. The bone is treated as a poroelastic material by Biot’s formulation. Based on the theory of small strain adaptive elasticity, a theoretical approach for the internal remodeling is proposed. The components of the stresses, the displacements, and the rate of internal remodeling are obtained in analytical forms, and the numerical results are represented graphically. The results indicate that the effects of the magnetic field and the porosity on the rate of internal remodeling in bone are very pronounced.     

Maximal and total skew information for a two-qubit system using nonlinear interaction models

Maximal and total skew information is studied. For symmetric pure states of two-qubit, they are closely related to the linear entropy, the concurrence, and the spin squeezing parameter. For a two-qubit system implemented in three nonlinear interaction models with an external field, we give the exact state vectors and the expectation value 〈S_z〉 at any time t. Based on 〈S_z〉², we give the maximal and the total skew information and a condition in which the maximal and the total skew information can reach 1 and 2, respectively.     

矩阵初等变换方法的几何原理

用向量的线性运算解释了矩阵初等行变换的本质,完善了用初等行变换求最大无关组的方法.     

Nonstationary monotone iterative methods for nonlinear partial differential equations

A simple technique is given in this paper for the construction and analysis of monotone iterative methods for a class of nonlinear partial differential equations. With the help of the special nonlinear property we can construct nonstationary parameters which can speed up the iterative process in solving the nonlinear system. Picard, Gauss–Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive solutions. The adaptive meshes are generated by the 1-irregular mesh refinement scheme which together with the M-matrix of the finite element stiffness matrix lead to existence–uniqueness–comparison theorems with simple upper and lower solutions as initial iterates. Some numerical examples, including a test problem with known analytical solution, are presented to demonstrate the accuracy and efficiency of the adaptive and monotone properties. Numerical results of simulations on a MOSFET with the gate length down to 34 nm are also given.     

Lp[0,1](1《p《∞)空间正系数多项式的倒数逼近的Jackson型估计

本文讨论了Lp[0,1](1相似文献   

多线性Calder(o)n-Zygmund算子的加权估计

本文建立由Grafakos和Torrea引进的多线性Calder(o)n-Zygmund算子相关极大算子的加权Lp(RN)估计和弱端点估计.     

奇异非线性四阶微分方程边值问题正解的存在唯一性

利用一类混合单调算子的一个不动点定理,给出了奇异非线性四阶微分方程边值问题的解的存在及惟一性.     

具有优先约束的单机随机排序问题

讨论工件的加工时间为常数,机器发生随机故障的单机随机排序问题,目标函数极小化工件的加权完工时间和的数学期望最小.考虑两类优先约束模型.在第一类模型中,设工件间的约束为串并有向图.证明了模块M的ρ因子最大初始集合I中的工件优先于模块中的其它工件加工,并且被连续加工所得的排序为最优排序,从而将Lawler用来求解约束为串并有向图的单机加权总完工时间问题的方法推广到机器发生随机故障的情况.在第二类模型中,设工件间的约束为出树优先约束.证明了最大家庭树中的工件优先于家庭树中其它的工件加工,并且其工件连续加工所得到的排序为最优排序并给出了最优算法.