一种新型NoC互连算法及连线冗余的修正

片上网络(Noc)是一种新兴的以包交换为通信方式的芯片互连结构。NoC的互连问题可以抽象为在有障碍曼哈顿平面生成最小森林的图论问题,本文提出了一种新型的NoC互连算法,该算法通过对连线边长权重进行更改后再调用最小生成树算法,并针对连线冗余进行修正。实验表明,该算法使得片上网络的全局连线长度最小,从而解决传统片上总线结构中连线延时长、信号完整性差等缺点。     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

新型伪噪声雷达波形研究

研究一种新型伪噪声雷达信号波形,该波形采用了多个脉冲组,每组脉冲中调相的伪码相同,相邻组内的脉冲调相所用的伪码捷变,同时每个脉组内的各脉冲频率捷变。理论推导和仿真分析了这种雷达信号波形的模糊函数,仿真结果表明这种信号具备良好的距离和速度分辨力及低截获概率,能测高速和远距离目标,工程上也易于产生和处理,具备良好的应用前景。     

第三代移动通信概述

随着工业和信息化部批准发放第三代移动通信(3G)牌照,标志着我国正式进入了3G时代。但是很多人对第三代移动通信的概念还是很陌生,基于此,简要地介绍了第三代移动通信,在介绍其基本概念的基础上简要地叙述了其对于移动通信的意义。     

神经网络技术在智能BIT故障诊断系统中的应用

论述了智能BIT的智能设计、智能检测、智能诊断和智能决策,构建了基于神经网络的某高炮装备随动系统的智能BIT故障诊断系统。用Multisim进行电路仿真,提取输出信号的均值、峭度、偏斜度构成三维向量,以它作为特征向量利用神经网络进行模拟电路的故障诊断。通过比较BP神经网络、SOM神经网络和小波神经网络的诊断结果,得知利用均值、峭度和偏斜度作为特征,BP神经网络和SOM神经网络能够有效识别故障状态模式。     

When Programming Trumps Policy and Plans: The Case of the US Department of the Navy11

Traditionally, policy and planning have been institutionally weak in the Naval Staff (Office of the Chief of Naval Operations – OPNAV). In their place, the N8 (Programming) has dominated resource decision-making, and, by default, decisions relating to policy and planning. Recent uncertainty over defense authorization and appropriations has resulted in calls for a greater role to be played by the N3/5, Policy and Plans Directorate. The article argues that reform of the Department of the Navy’s planning process is urgently needed. OPNAV’s weak planning and overly dominant programming practices are compared with those of the Departments of the Army and Air Force and are shown to be out of conformance with them. The article concludes with specific and detailed recommendations for reform of both the current planning and programming processes.     

基于贝叶斯网络的装备损伤定位系统研究

分析了贝叶斯网络在装备损伤定位方面的优势，及其损伤定位的方法与流程，建立了用于装备损伤定位的贝叶斯网络模型，并开发了损伤定位系统。以某型火炮为例，演示了其损伤定位的一般过程，验证了贝叶斯网络在装备损伤定位中应用的可行性与有效性。     

自适应神经模糊推理系统(ANFIS)及其仿真

自适应神经网络模糊推理系统ANF IS是模糊控制与神经网络控制结合的产物。讨论了ANF IS的结构及其特点,并利用M ATLAB的专用工具箱进行了仿真研究,取得满意的效果。     

无线传感器网络DV—Hop定位算法的研究与改进

为了改善DV—Hop算法对节点的定位精度和提高覆盖率，对DV—Hop定位算法中未知节点到锚节点间距离计算方法进行了改进，提出了一种新的距离计算方法，并对改进算法和原算法进行了对比仿真。仿真结果表明了改进算法的有效性。     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016