链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

一类高次多项式系统极限环的讨论

通过变换将一类高次多项式系统化为Lienard系统,利用Hopf分枝定理和张芷芬唯一性定理,证明了该类系统极限环的存在性与唯一性。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

谈网络理论与现代控制论的交叉结合

当前计算机技术的飞速发展和多学科的交叉结合,给复杂网络的设计和计算等带来了深刻的变化。"现代控制论"与"现代网络理论"一直紧密地联系着,控制论的要领与方法已渗透到网络分析中,可以认为网络理论是受基尔霍夫定律约束的系统理论的子学科。     

一种新型内曲线式径向柱塞泵的设计

讨论了各种液压泵的使用特点,提出了一种新型内曲线式径向柱塞泵的设计思路.通过合理设计泵内定子内曲线表面,在理论上实现了无流量脉动;为了提高柱塞泵的使用寿命,采取了降低定子导轨压力角的措施;通过Matlab实现了定子表面曲线和压力角的仿真计算;理论分析的结果对于设计和制造低噪声的柱塞式液压泵有一定的指导意义.     

一类微分多项式的值分布

讨论了微分多项式fnP(f)(n≥2)之导数的Picard例外集问题,在Picard例外集的意义之下推广了Anderson等人的结果。     

Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression

The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

罗兰C双台链交叉定位算法研究

在推导罗兰C双台链交叉定位算法基础上,根据试验得到的时差测量结果进行了单台链双曲线定位、非时基交叉圆定位以及双台链交叉定位算法比较.结果表明:测量点几何因子GDOP较好时,单台链双曲线定位与交叉圆定位方法的定位结果基本相同,而GDOP较差时,交叉圆定位方法的定位结果明显优于单台链双曲线定位算法的定位结果,但两种情况下的...     

算术映射交织器设计的改进

首先分析算术二次同余映射的原理 ,然后在此基础上对交织器的映射关系加以保奇偶序限制和移位运算 ,从而得到两个改进型的算术映射交织算法。通过仿真对改进型交织器的性能进行验证 ,结果说明在复杂度可比的情况下 ,改进后的交织器比传统分组交织器具有更好的译码性能。     

高超声速飞行器低可探测性滑翔弹道优化方法

为进一步提高高超声速飞行器的突防性能,提出高超声速飞行器低可探测性滑翔弹道优化方法。考虑飞行器180°×360°方向的雷达散射截面,针对原数据尖峰多、收敛难的难题,运用高斯滤波法对其进行预处理,既不改变原数据趋势又加以平滑,提高优化问题收敛性能。为使计算所用雷达散射截面数据具备较强的保真性,采用三次样条插值方法调用离散数据计算实时雷达散射截面。完成了高超声速飞行器低可探测性滑翔弹道优化问题的建模,以探测概率为目标函数,运用hp自适应Radau伪谱法优化求解,采用逐步计算策略进一步提高优化效率和收敛性能。与传统最短飞行时间弹道对比表明,该方法有效降低了飞行器被雷达发现的概率。