Synchronization in hub terminals with the circular arrangement problem

Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015     

高密度存储服务器高速链路设计与仿真

针对高密度存储服务器中高速链路结构复杂、信号速率高、链路长度长等特点,在高速链路PCIE3.0和SAS3.0设计过程中引入全面的信号完整性仿真。通过对高速印刷电路板设计中拓扑结构、材料类型、印刷电路板结构等关键项目进行仿真设计,获得成本最低、性能达标的最优方案;通过全链路有源仿真,预估系统性能,降低系统投产风险;通过系统实际信号测试,验证系统性能完全满足相应规范要求,仿真结果有效可靠。     

加油车加油系统瞬变流数值分析

针对加油车加油系统管路结构,利用特征线法和有限差分格式,对2种典型加油工况建立数学模型。用C#语言编制程序,对2种工况的泵出口压力和系统流量进行数值分析,得到压力和流量随时间变化的关系曲线。计算结果表明:单枪加油工况出现压力波动时间较早,且压力波动幅值较大。此方法更好地反映了加油系统的动态变化过程,为加油车虚拟训练系统的开发提供了理论依据。     

合成双射流冲击平板流场结构与模态分解分析

为揭示合成双射流冲击平板流场结构特征,通过大涡模拟方法对合成双射流冲击平板流动进行了仿真,采用有限时间Lyapunov指数方法对流场的拉格朗日涡结构进行了识别,并与欧拉框架下的速度矢量和涡量结果进行了对比分析。结果表明,在合成双射流两股射流交替作用下,射流核心区涡系结构较为复杂且涡量丰富,远离核心区存在一对稳定的涡结构,且拉格朗日涡结构与涡量对应较好,为合成双射流冲击冷却的布局设计提供了指导。另外,流场本征正交分解表明,第一阶模态关于激励器出口中心轴线大致对称,其能量占总体能量的35%,前6阶模态的能量占80%;根据前6阶模态所反映的流场特性,合成双射流冲击平板流场具有高度的对称性。     

GNSS信号功率增强对调零抗干扰接收机的性能影响

由于卫星端信号发射功率小、信号传播损耗大,到达接收机的卫星导航信号极其微弱,容易被干扰。为有效应对电磁干扰的威胁,在系统层面和用户层面同时采取抗干扰措施将是一种很好的选择。建立调零抗干扰接收机抗干扰能力分析模型,并定量分析信号功率增强对调零抗干扰接收机抗干扰性能的提升效果。结果表明：信号功率每增强10 dB,接收机抗干扰能力可提升3～4 dB,但从提高接收机非极限条件下的接收性能(载噪比、测距定位精度等)的角度,信号功率增强15～20 dB时,接收性能最优。研究成果可为卫星功率增强量的优化设计以及终端抗干扰设计提供参考。     

舰船水消防系统战斗损伤的智能重构决策与应用

针对当前舰船水消防系统监控点信息孤立、智能化决策程度不高的问题,构建了基于节点的水消防系统功能逻辑模型,提出了基于战斗损伤的水消防系统破损隔离重构使用智能决策算法,并据此开发了水消防智能监控系统。案例对比计算和系统测试检验的结果表明,该智能决策算法以及智能监控系统可以有效提升分析决策的速度和精度,显著提高指挥控制的效率,为水消防系统的战斗破损使用提供有效的支撑。     

基于SNR的烟幕干扰效果仿真

烟幕对红外等电磁波具有吸收、反射和散射特性,可导致导引头上接收的能量大大衰减,从而降低导弹的命中概率.针对外场烟幕性能测试受气象条件和环境因素的影响较大,对准确评估抗红外烟幕遮蔽性能存在较大困难的情况,结合气象条件从烟幕透过率的变化引起导引头信噪比变化的角度,建立了烟幕干扰效果的评估模型,通过计算机仿真,得出了烟幕对红外制导导弹的干扰效果.通过试验对其中的一些结论进行了实验验证,结果表明计算结果能够与实验数据较好吻合.     

Signal‐to‐interference‐plus‐noise ratio estimation for wireless communication systems: Methods and analysis

The Signal‐to‐Interference‐plus‐Noise Ratio (SINR) is an important metric of wireless communication link quality. SINR estimates have several important applications. These include optimizing the transmit power level for a target quality of service, assisting with handoff decisions and dynamically adapting the data rate for wireless Internet applications. Accurate SINR estimation provides for both a more efficient system and a higher user‐perceived quality of service. In this paper, we develop new SINR estimators and compare their mean squared error (MSE) performance. We show that our new estimators dominate estimators that have previously appeared in the literature with respect to MSE. The sequence of transmitted bits in wireless communication systems consists of both pilot bits (which are known both to the transmitter and receiver) and user bits (which are known only by the transmitter). The SINR estimators we consider alternatively depend exclusively on pilot bits, exclusively on user bits, or simultaneously use both pilot and user bits. In addition, we consider estimators that utilize smoothing and feedback mechanisms. Smoothed estimators are motivated by the fact that the interference component of the SINR changes relatively slowly with time, typically with the addition or departure of a user to the system. Feedback estimators are motivated by the fact that receivers typically decode bits correctly with a very high probability, and therefore user bits can be thought of as quasipilot bits. For each estimator discussed, we derive an exact or approximate formula for its MSE. Satterthwaite approximations, noncentral F distributions (singly and doubly) and distribution theory of quadratic forms are the key statistical tools used in developing the MSE formulas. In the case of approximate MSE formulas, we validate their accuracy using simulation techniques. The approximate MSE formulas, of interest in their own right for comparing the quality of the estimators, are also used for optimally combining estimators. In particular, we derive optimal weights for linearly combining an estimator based on pilot bits with an estimator based on user bits. The optimal weights depend on the MSE of the two estimators being combined, and thus the accurate approximate MSE formulas can conveniently be used. The optimal weights also depend on the unknown SINR, and therefore need to be estimated in order to construct a useable combined estimator. The impact on the MSE of the combined estimator due to estimating the weights is examined. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004