周期平稳通信信号时差估计

研究了一种利用信号谱相关特性对周期平稳通信信号进行时差估计的方法。研究表明,谱相关时差估计方法较之经典的广义互相关(GCC)法具有更强的抗干扰能力,在多辐射源环境下,该方法可以无模糊地估计各个辐射源的时差。     

加权模糊C均值聚类算法实现BDS三频组合观测值优选

在对BDS三频载波相位组合观测值进行误差分析的基础上,确定了优选载波相位线性组合系数的筛选标准。针对传统聚类算法在高维多频混合数据集分类中存在的不足,采用一种基于加权的模糊C均值聚类算法,通过对同一维度在不同簇上赋予不同的权重值,对传统遍历搜索法所获得的部分BDS三频载波相位组合观测值进行了优化分类选取,有效解决了传统全球导航卫星系统载波相位观测值选取方法效率低的问题,同时为多系统多频数据组合观测值系数的优化选取提供了一种新的思路。对分类结果进行分析,确定了各类组合观测量的适用范围,并结合实测数据,利用无几何层叠模糊度解算方法对优选组合进行了整周模糊度的解算,结果验证了该方法的可行性。     

Mitigation of EDFA transient effects in variable duty cycle pulsed signals

We report the transient effects in Erbium Doped Fiber Amplifier (EDFA) systems for pulsed signals with different duty-cycles. The work includes the analysis using three different duty-cycles, 10%, 20% and 50%. A curve fitting technique is also proposed to predict the transients of any lesser duty-cycled pulse, once the transients of a larger duty-cycled pulse is known. Mathematical evaluation confirms the double exponential shape of transient distorted signal. Further, EDFA transient effect is experimentally verified on a Wavelength Division Multiplexed (WDM) link by multiplexing high and low bitrate modulated optical signals. We conclude the paper by proposing a transient suppression technique for variable duty-cycle signals and analyzing its effectiveness with different wavelength spacing.     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

舰船空调系统不同保障模式的效费分析

分析了舰船全寿命期和使用期的结构,在此基础上,借助于WSEIAC模型,分别对舰船空调系统在两种保障方式的全寿命使用期效能和费用的各个指标进行了建模,提出了指标计算的思路与计算方法.结合海军舰船特点,在对WSEIAC效能模型进行修改和完善的基础上,给出了计算示例,结果显示了海军舰船空调系统采用岸基保障方式的合理性和优越性.     

A novel modeling approach for express package carrier planning

Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于部分可辨识振动系统的载荷恢复方法

在复模态分析和参数辨识的基础上,对部分可辨识振动系统的载荷识别问题进行了研究,提出了基于部分可辨识复模态参数的载荷恢复方法。恢复模型存在幅值模糊和相位模糊,不存在排列模糊。数值仿真验证了该方法的有效性,并讨论了提高恢复精度的方法。     

一类具Holling-Ⅲ类功能性反应的食物有限捕食-被捕食模型的极限环

研究一类具Holling-Ⅲ类功能性反应的食物有限捕食-被捕食模型的动力学性态。应用微分方程定性理论,证明当正平衡点不稳定时该模型存在唯一稳定的极限环。