Limiting survival functions of self‐similar structures

We show the existence of a unique analytic single parameter limiting survival function arising from the repeated composition of a coherent structure as the number of components tends to infinity. Examples include the repeated composition process of the bridge structure. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

高精度分数时延滤波器设计的边界拟合Remez算法

在卫星星间测距模拟信号仿真及实际测试中,为提高测距模拟信号精度和系统可用带宽,提出基于边界拟合Remez算法的高精度分数时延滤波器的设计算法。该算法利用Farrow结构的多项式近似思想,采用多项式拟合Remez算法设计滤波器的冲激响应边界系数,通过多相分解实现分数时延滤波器组。该算法改善了当设计的滤波器阶数较高时冲激响应边界的不连续现象,进而降低了群时延误差,提高了精度。仿真结果表明,该算法设计的滤波器的分数时延精度得到了提高,同时系统可用带宽提高近一倍,实现时需使用的乘法器数目也有明显降低。     

一种RS码快速盲识别方法

为了获取数字通信中未知线路的纠错编码信息,提出了一种RS码快速盲识别方法.通过对RS码的二进制表示进行码根求解的方法来检测未知线路的RS码长、本原多项式阶数以及可能的本原多项式;进而遍历得到的本原多项式对RS序列进行伽罗华域的傅里叶变换(GFFT),通过连零位置和个数最终确定未知线路的真实本原多项式和生成多项式.实验验...     

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

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

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

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

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

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

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     

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

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

Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems

Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009