一种以太网拓扑发现算法

局域网内部的拓扑对于现代网络管理非常重要,而网络层拓扑发现对于局域网内部的拓扑是不可见的。文章提出了一种基于生成树协议(STP)的拓扑发现算法,利用简单网络管理协议(SNMP)读取交换机MIB中的生成树信息,可以得到局域网内设备间的连接。该算法不需要交换机地址转发表(AFT)完整,也能发现交换机的备份链路和集线器以及不支持SNMP的交换机。经分析,该算法是一种简单的,准确的以太网拓扑发现算法。     

基于1553B协议的星载高速无线数据网络协议的设计*

星载无线数据网络可以解除航天器内错综复杂的线缆网的束缚,是航天器轻小型化的重要技术储备。旨在替代航天器内现有的点对点三线制的LVDS线缆,提出了一种基于脉冲超宽带(IR-UWB)技术的星载高速无线数据网络的设计方案,并重点介绍了高速无线网络协议的设计和实现。网络协议设计参考了美国军用数据总线标准MIL-STD-1553B 协议,采用时分制指令响应机制,分别对其物理层、链路层、网络层和应用层进行设计,以适应星载高速率无线数据传输的要求,具有灵活性高、可靠性高、扩展性高的特点。网络协议的IP核经过地面演示系统进行验证,实验测得应用层数据传输的误码率小于10_-10。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

非均匀形核法制备Cu包覆纳米SiO2复合粉体

采用非均匀形核法制备了Cu包覆纳米SiO2复合颗粒,利用X射线衍射仪、扫描电镜、能谱仪及透射电镜等分析手段对复合颗粒进行了表征,并探讨了包覆结构的形成机制。结果表明:复合颗粒分散均匀,无团聚,单颗粒内包含多个分布均匀的纳米SiO2颗粒,且均被Cu包覆层隔离,纳米SiO2颗粒的分散性得到了显著改善;新制备的复合颗粒不存在氧化,在存放或者制样过程中会部分氧化为Cu2O;纳米SiO2颗粒表面Cu包覆层的形成机制主要是非均匀形核作用,包覆的结构取决于 Cu晶粒在纳米SiO2颗粒表面的沉积以及对复合颗粒的团聚控制。     

纳米颗粒和非晶相复合刷镀层n-Al2O3／Ni-P的制备

采用纳米电刷镀技术在钢基体表面制备了n-Al2O3/Ni-P复合刷镀层,研究了复合刷镀液中纳米颗粒含量、刷镀电压和刷镀笔移动速度对复合刷镀层中P和Al2O3含量的影响.优化后的工艺参数范围为刷镀液中n-Al2O3颗粒含量20～30 g/L、刷镀电压8～12 V、刷镀笔移动速度5～10 m/min.制备的n-Al2O3/Ni-P复合刷镀层组织致密,含有纳米颗粒和非晶相.     

一种基于联动的军队网络安全防护体系

网络是军队信息化建设的基础,安全是军队信息化建设的保障。通过分析当前军队网络安全方面所存在的隐患以及防护措施的不足,引入一种基于联动技术的网络安全防护体系。该体系以防火墙为核心,以安全通信协议为基础框架,以PKI/CA体系为安全支撑,能够从整体上对军队网络进行全方位、立体的防护。其逻辑构成为核心安全设备、外围安全设备和安全通信协议3个部分,各种外围安全设备通过不同的安全通信协议如LD- BP、LCSP、ASIP等与核心安全设备(防火墙)进行有机联动,整个体系的安全性可以满足军队对网络安全的要求。     

分段相关累加算法提取直扩信号伪码周期

针对低信噪比直接序列扩频(DS/SS)信号伪码周期难以检测的问题,特别是加信码的直扩信号,提出了一种新的分段相关模值累加检测方法和相应的快速算法。计算机仿真表明,在信号带宽内信噪比为-12 dB时,能够快速有效地检测直扩信号的伪码周期。     

用于射频/红外复合制导半实物仿真的波束组合器

射频/红外双模复合制导技术的不断发展引发了对射频/红外双模复合制导半实物仿真系统的需求,而波束组合器是半实物仿真系统的关键部件。讨论了波束组合器技术以及波束组合器对单脉冲雷达测角精度影响的测试方法。     

窄带干扰下GPS接收机捕获性能的研究

针对GPS接收机抗干扰能力强的特点,分析了窄带干扰对接收机的捕获性能的影响.在扩频理论的基础上,给出了GPS C/A码接收机信号捕获的数学模型,计算得出平均捕获时间与捕获时间方差,给出窄带干扰下的接收机信号捕获的仿真结果.结果表明,当窄带干扰功率超过一定的值时,会导致GPS接收机捕获性能的严重恶化.