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

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

基于Prony算法的大型结构振动信号降噪方法

以去除力锤激励下大型结构振动信号的背景噪声为研究目的,分析了背景噪声产生的原因及结构振动信号的特点,提出了将Prony算法应用于降噪的方法。该方法首先用一组衰减余弦信号分量之和来拟合原始信号,得出各衰减余弦信号的参数,然后根据振动信号的特点从中识别出背景噪声并构造其数学表达式,最后进行降噪处理。运用传统Prony算法和改进Prony算法分别对仿真信号和实测信号进行降噪处理,其结果证明了Prony算法的有效性,且改进的Prony算法具有更高的识别精度和更好的降噪效果。     

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

通过变换将一类高次多项式系统化为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     

一类微分多项式的值分布

讨论了微分多项式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     

电控共轨柴油机初始控制MAP研究

为合理快捷地获取电控柴油机的控制参数表MAP,进行了共轨柴油机电控初始MAP研究。分析了柴油机运行工况特点和试验获取特征工况数据的原则;引入了散点曲面拟合方法,简要说明了Shepard有理插值曲面理论和它的Lagrange插植的形式;根据柴油机运行工况的特点,提出了变步长试验点,减小试验量,引入均方根误差衡量不同试验点数拟合控制MAP的精度,结合实例给出了电控初始MAP的散点曲面拟合过程,并在493共轨柴油机上进行初始MAP的控制效果试验,试验数据表明：该方法能满足电控柴油机初始MAP的要求。     

基于随机拟合的悬浮式深弹弹阵特征建模＊

通过分析悬浮式深弹发射后在空中的弹道特性,建立了深弹弹着点坐标的计算模型。采取蒙特卡洛方法,分别对舰艇六自由度状态下,单管和六联装火箭深弹的弹着点坐标进行了仿真计算,对弹着点的分布规律进行了研究,并得出弹着点的联合密度函数。结果表明,在发射参数存在正态扰动时,弹着点散布区域均呈椭圆形分布,弹着点坐标均仍服从正态分布。     

一种快速解算火箭助飞鱼雷关机点方法

为解决火箭助飞鱼雷射程与关机点计算速度问题,运用Chebyshev正交多项式拟合曲线,提出了一种基于时间或能量关机的计算方法.可根据不同的射程快速解算助飞雷关机点,达到实时控制助飞雷射程的目的,与现有方法相比,计算简洁、迅速.最后给出了关机方法软件的仿真流程,并将该软件应用于某助飞雷仿真系统,论证了该方法的可行性.     

小子样下命中概率的估计

研究了当试验次数较少时 ,命中圆域的概率估计。给出了自助估计法和融合估计方法 ,对于估计的精度进行了分析。方法易于实现 ,适用于工程应用