一个平凡解的稳定性定理的改进

利用K类函数改进了马尔金定理的一个结论（即在非注定系统中，若相关的定正函数V和定负函数V1满足limt→∞(dV/dT-V1)=0，则系统有稳定的平凡解），得到一个非驻定系统平凡解的稳定性定理，并通过实例说明本文给出的定理可以判别其平凡解的稳定性，而用马尔金定理的结论失效。     

辛算法应用于Duffing方程的保结构性

讨论了不受外力的Duffing方程在辛算法和非辛算法作用下，相轨线被保持和破坏的性质。证明了当时间步长充分小时，辛算法可以保持原系统的大部分不变闭曲线，而非辛算法却做不到这一点。     

两种改进Lagrange插值格式的对比分析

本文基于Lagrange插值多项式,给出了两种改进的Lagrange插值格式：Aitken插值和重心Lagrange插值。从算法的复杂性及数值稳定性两个方面进行了比较分析,结果表明重心形式的Lagrange插值是最优的。文末给出数值试验表明算法的有效性。     

Hamilton图的判定及其算法

本文提出一种判定Hamilton图的方法,其要点为:由图的邻接矩阵构造出二次矩阵,判断二次矩阵是否连通来确定图是否为Hamilton图,若所有可能得到的二次矩阵不连通,则为非Hamilton图,文中根据这一思路设计了相应的算法,给出了算法框图,并举有实例。     

最优Hamilton圈的一种新算法

提出了一种行之有效的执行算法——换顶算法，对无向图权值矩阵的数据进行有效处理，通过交换顶点来寻找一条较优Hamilton圈。在整个过程中，权值矩阵的上三角数据为有效数据，只需要按一定的顶点交换规则对这部分数据进行调整就可以达到优化Hamilton圈的目的。提出了交换规则的思想，且通过选择适当的规则，先判定可行性再执行交换算法，节省了大量的运算时间，降低了算法的时间复杂性。该算法也适用于Hamilton链的情况。     

UWB-SAR成像算法中的插值方法研究

本文简单介绍了大处理角超宽带合成孔径雷达（ＵＷＢ－ＳＡＲ）波数域成像算法，研究了其中Ｓｔｏｌｔ插值的内容及其必要性，提出了几种插值方法来解决其中的插值问题。最后，利用所提出的几种插值方法进行仿真，得到了较好的聚焦效果，表明所提插值方法是有效的。     

基于动态窗口的灰色加权填充算法及应用?

为解决复杂系统中单属性缺失数据填充困难问题，提出了基于动态窗口的灰色加权填充算法。该算法通过建立双向灰色预测模型，并采用模型精度评价系数加权填充缺失数据，有效增强了算法的准确性；提出基于灰色模型评价系数反馈的动态伸缩窗口概念，寻找产生最优模型的训练数据序列，使算法具有良好的鲁棒性和适应性。实验结果表明，该方法在RMSE和MA两项指标上均优于传统的双向灰插值、灰插值、多项式插值等方法。     

一类具有时滞和Gompertz增长率的捕食系统的稳定性与Hopf分支

研究一类具有时滞和Gompertz增长率的捕食系统,通过分析系统的特征方程,得到正平衡点的局部稳定性和系统出现Hopf分支的条件,并利用中心流形定理和规范型理论,得到确定Hopf分支方向和分支周期解稳定性的计算公式．     

基于查找表的像素处理器新算法

本文在基本的像素处理算法的基础上，提出了一种基于查找表的快速平滑插值算法。该算法不仅运算量小、精度较高，而且易于硬件实现，适合于高速显示处理系统中。     

数字信号抽样率提升的一种算法实现

本文通过对数字信号插值过程在频域和时域的分析，得到一种整数倍内插的通用算法，进而阐述了该内插算法的实现，并提出了内插器的概念及表示方法。     

Mathematical control theory solution of an interactive accounting flows model

In this paper we have applied the mathematical control theory to the accounting network flows, where the flow rates are constrained by linear inequalities. The optimal control policy is of the “generalized bang-bang” variety which is obtained by solving at each instant in time a linear programming problem whose objective function parameters are determined by the “switching function” which is derived from the Hamiltonian function. The interpretation of the adjoint variables of the control problem and the dual evaluators of the linear programming problem demonstrates an interesting interaction of the cross section phase of the problem, which is characterized by linear programming, and the dynamic phase of the problem, which is characterized by control theory.     

A generalized recursive algorithm for a class of non-stationary regeneration (scheduling) problems

Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques.     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于SAT的电路错误定位方法研究进展

随着VLSI芯片复杂度不断增加,功能验证与调试已占到整个芯片设计周期的60%以上。而错误的定位往往消耗大量的时间与精力,因此迫切需要一种高效的方法诊断与定位电路中的错误。针对近年来出现的许多电路错误定位方法,介绍了电路错误诊断方法的分类与工作流程,深入分析了基于SAT的错误定位方法的基本原理;对各种算法进行了概述评论,并简要介绍了在不可满足子式求解方面所做的一些研究工作,而不可满足子式能够显著提高错误定位效率与精度;讨论了电路错误定位技术所面临的主要挑战,并对今后的研究方向进行了展望。     

全隐LU-SGS算法在高超声速热化学非平衡流刚性问题中的应用

在高超声速热化学非平衡流动计算中,当地气体能量松弛时间、化学反应特征时间与流动时间推进步长量级差异过大会带来严重数值刚性问题,且在高雷诺数条件下,壁面、拐角等强干扰区网格加密使得该问题加剧,导致初始最大CFL数极小,收敛速度缓慢.原始LU-SGS算法仅考虑化学反应源项和对流项的隐式处理,通过推导黏性项Jacobian矩...     

相干信号源DOA估计改进ESPRIT算法研究

在目标方位估计(DOA)的众多算法中,ESPRIT是一种运算速度快、精度高的常用算法,但它不能解相干信号。提出一种基于观测数据直接空间平滑的改进型ESPRIT算法,解决了常规ESPRIT算法不能解相干、对信噪比要求高等问题。该方法适用于所有信号(非相干和相干信号)的目标方位估计。     

杂波环境下多目标跟踪数据关联的快速算法

数据关联是实现杂波环境下多目标跟踪的关键问题,目前公认较好的方法是联合概率数据关联（ＪＰＤＡ）,但是其计算和存储量很大,故在实际中寻求一种快速或近似的算法是十分必要的。本文提供一组有效快速算法,并在我们有关课题中得到初步验证。     

Defence industries adjusting to change 1

This paper analyses the impact of terrorist activity on international tourist flows. To this end, we have estimated a cross‐sectional gravity equation for tourism from the G‐7 countries to a sample of 134 destinations over the period 2001–2003. Within this framework, we evaluate the deviation from ‘normal’ tourist flows due to terrorist activity, which is considered as negative advertising for the affected country. The analysis suggests that both domestic victims and international attacks are relevant factors when foreign tourists make their choice. This result is robust under alternative specifications. Moreover, the impact of terrorism is more severe in developing countries.