一类二阶Hamilton系统周期解的存在性

Hamilton系统是非线性科学中的一个重要领域,很多人在超二次或次二次条件及其他一些条件下对Hamilton系统的周期解进行了研究。此文则研究了非自制二阶Hamilton系统在零点局部环绕及“非二次”条件下周期解的存在性,并利用局部紧性条件(C)条件以及极大极小方法证明了其周期解的存在性。     

利用数值优化技术设计周期性绕飞的编队轨道

考虑非线性和椭圆参考轨道等因素,选择编队卫星周期性绕飞的初始条件,设计自然周期性绕飞轨道,对长期编队飞行是十分必要的。然而利用Hill方程确定初始绕飞条件,设计长期编队飞行的轨道,具有很大的误差。本文在考虑非线性和椭圆参考轨道等因素的条件下,利用数字优化技术寻找周期性绕飞的初始条件,设计不消耗任何燃料的编队卫星轨道。优化的结果可用来研究周期性绕飞轨道必须满足的条件,加强对编队机理的认识。数值仿真结果验证了优化结果的正确性和有效性。     

一类时滞微分方程正周期解的存在性

讨论了一类生物模型正周期解的存在性问题,利用Mawhin延拓定理得到了系统存在正周期解的一个充分条件。而且,当系统为无穷时滞时,结论也是成立的。     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

关于非扩展映象的有限族的一个强收敛性定理

讨论了一个非扩展映象的有限族所定义的迭代格式,证明了Banach空间中的一个非扩展映象的有限族的强收敛性定理。     

Competition under time‐varying demands and dynamic lot sizing costs

We develop a competitive pricing model which combines the complexity of time‐varying demand and cost functions and that of scale economies arising from dynamic lot sizing costs. Each firm can replenish inventory in each of the T periods into which the planning horizon is partitioned. Fixed as well as variable procurement costs are incurred for each procurement order, along with inventory carrying costs. Each firm adopts, at the beginning of the planning horizon, a (single) price to be employed throughout the horizon. On the basis of each period's system of demand equations, these prices determine a time series of demands for each firm, which needs to service them with an optimal corresponding dynamic lot sizing plan. We establish the existence of a price equilibrium and associated optimal dynamic lotsizing plans, under mild conditions. We also design efficient procedures to compute the equilibrium prices and dynamic lotsizing plans.© 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于Rényi信息增量的机动目标协同跟踪算法

针对基于多传感器组网进行机动目标跟踪的传感器管理问题,提出了一种基于Rényi信息增量的机动目标协同跟踪算法。首先结合"当前"统计模型和交互式多模型不敏卡尔曼滤波算法设计了一种变结构多模型算法,来进行机动目标的状态估计;然后以Rényi信息增量为评价准则,选择使Rényi信息增量最大的单个传感器进行目标跟踪;最后利用得到的最优加速度估计进行网格划分,更新变结构多模型中的模型集合。在一般机动及强机动场景下进行了算法性能分析,仿真结果表明,该算法能够合理地选择传感器,提高了对机动目标的跟踪精度。     

微分方程解的稳定性与周期性

综合利用相空间理论、压缩映像原理、算子的性质以及Liapunov泛函的方法,研究了具有无限时滞中立型泛函微分方程周期解的存在性、唯一性及稳定性问题,得到新的结果,推广了已有的结果。     

基于分布式转发交换的并行路由器关键技术研究

随着Internet链路速率和IP前缀数目的不断增长,对路由器的转发和交换能力提出了更高的要求.提出一种基于分布式转发交换的并行路由器体系结构,采用多个低速的能够独立转发和交换报文的功能部件构成多级流水线,以流水的方式执行报文转发和交换.对该结构实现关键技术--基于子树映射的IP流水查找机制进行了深入的研究,提出了相应的解决方案,并指出了下一步的研究方向和思路.