超声速湍流混合层中小激波结构的实验研究

在对流马赫数为1.24的超声速湍流混合层风洞中,以NPLS实验技术为基础观察到了小激波结构。分析了小激波结构产生时的混合层流场参数,给出了从实验图像中确定对流马赫数的方法,避免了理论分析不必要的假设。探讨了小激波结构产生、发展的一般规律。     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

一种改进的指纹图像局部方向场匹配方法

指纹方向场真实地反映了指纹图像中本质的纹理特征,包括了指纹的基本形状、结构和走势。定义了局部方向场图像的描述方法,可以根据纹理信息有效地描述并区分不同的细节点。在低质量指纹图像,特别是存在较严重非线性形变的指纹图像中,细节点方向属性不够可靠,使得以细节点对作为参考对齐局部方向场图像的方法效果不佳。提出一种改进的局部方向场图像对齐和匹配方法,能够明显改善局部对齐效果,提高局部匹配的准确性,从而更加有效地区分对应和不对应细节点。实验结果验证了提出方法的有效性。     

一种新的保持分形特征的分形变形方法

针对IFS吸引子变形过程中间出现的分形特征退化的问题,提出基于局部吸引子的近似凸包及旋转匹配的特征对应方法.IFS吸引子的局部吸引子可由独立的IFS生成,IFS中每个压缩仿射映射存在不动点,构造所有不动点的凸包,即得到局部近似凸包;证明了局部近似凸包间的相似对应等价于局部吸引子间的相似对应,并提出了通过旋转匹配的特征对应方法实现局部近似凸包的配对,最后计算所有配对下相似度最高的一组局部近似凸包匹配,确定局部吸引子间的特征对应,即IFS特征对应.对两个IFS进行线性插值可实现保持分形特征的分形变形.     

混沌信号处理

描述了混沌特征参量 ,包括Lyapunov指数和分形维 ;讨论了信号相空间重构和Takens嵌入定理 ,以及嵌入维数、时间延迟等参数。还阐述应用神经网络进行混沌信号非线性处理     

基于神经网络和功率谱的水中目标信号检测方法

将功率谱和神经网络相结合,应用于高海况、低信噪比条件下,水中目标信号的特征提取中.文中首先对信号进行功率谱估计,利用目标信号功率主要集中在低频部分的特点,提取低频信号的能量作为特征,然后利用人工神经网络对目标信号进行检测.利用不同浪级情况下海洋水压场的仿真信号数据,对某型目标舰船的水压信号进行了检测计算,验证了该方法的有效性,尤其是达到了在高海况、低信噪比条件下,对目标信号检测率比较高、虚警率比较低的效果.     

基于ANN的高炮火力单元射击有利度评估

采用ANN(人工神经网络)方法对高炮火力单元射击有利度进行评估是一种新的尝试。在对各影响因素进行分析与量化处理的基础上,建立了基于ANN的高炮火力单元射击有利度评估网络模型,并提供了网络的解算方法。通过某型高炮对不同目标射击的已知有利度评估值对网络进行的训练,确定了网络的各权值,并使学习误差达到了预先规定的标准,实现了对该型高炮对空射击有利度的评估。     

基于粗集的神经网络在目标类型识别中的研究

为克服传统的目标类型识别方法的不足,提出将粗集和神经网络紧耦合建立新的识别模型,即经过识别信息预处理、样本数据粗集方法简化、神经网络学习训练及待识信息网络识别等步骤,充分融合了粗集强大的规则提取能力和神经网络优良的分类能力。实验表明,该模型减少了识别的主观因素,简化了神经网络结构,提高了运算速度。     

Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem

In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.