论开放对改革的历史意义和现实作用

中国的改革始终并越来越置于开放的国际大环境和背景下 ,围绕开放来进行 ,改革的历史取向、实际步骤等方方面面都自觉不自觉地受到开放的很大影响 :开放引致改革、开放促进改革、开放制约改革、开放本身就是改革、开放保障改革。因此 ,中国的改革是一种典型的开放式改革 ,中国的“改革开放”也可以或越来越应当是“开放改革” ;就改革与开放的相互关系、作用及对整个社会发展的作用和意义而言 ,开放重于改革。     

微分方程的有界性与概周期解的存在性

本文考虑高维非自治概周期系统ｄｘｄｔ＝ｆ（ｔ,ｘ）,利用对ｘ的分量分组构造Ｌｉａｐｕｎｏｖ函数的方法讨论了其概周期解的存在性。所得结果去掉了文献中系统存在有界解的假设,得到了比较明显的改进。     

网络安全策略制订与实施

讨论了基于价格／风险模型制订网络安全策略的方法和步骤,并指出了安全策略实施过程中应注意的问题。     

粉末粒度对储氢电极电化学性能的影响

以M1（NiCoMnTi）5为例,系统研究了粉末粒度对储氢电极电化学性能的影响。结果表明,在试验粒度范围内,合金粉越细,其放电容量越高,高倍率放电性能和循环稳定性也越好;将两种不同粒度的合金粉混合使用时,粒径相差越大,其放电容量越高。且当粗细粉质量比为7：3时,放电容量最高。     

带紧扰动的m-增生算子的满值性定理

引入“DC”空间的概念,研究了带紧扰动的m－增生算子的满值性问题,改进了Kartsatos、Deimling、周海云以及徐宗本等人的结果。     

基于复杂网络的作战网络分析

分布式网络化作战是网络中心战的基础,而分布式作战网络的构建是网络化作战的重要前提。首先,运用复杂网络的相关参数分析了多种不同的网络,选择了BA非标度网络作为分布式作战网络的最优表现形式;其次,以BA非标度网络为基础提出了一个适合军事上动态鲁棒性分析的模型DCNCE;最后,仿真结果表明,在以网络效能值为测度的对比下,分布式作战网络在介数毁伤策略下更脆弱,为构建并改进现有的作战网络提供了理论依据。     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种基于移动基站的无线传感器网络数据收集方法

针对传统的无线传感器网络数据收集协议大多受制于发生在基站周围的热点问题,提出了一种使用移动基站的数据收集方法.将数据收集问题转化为支配集构造和旅行商问题,并提出了一种分布式的支配集构建算法,结合旅行商问题的近似算法生成基站的移动路线.仿真结果表明,所提出的方法减少了通信消耗,且能使负载均衡地分布.     

复杂网络社团发现算法研究新进展

社团结构是复杂网络普遍存在的拓扑特性之一,发现复杂网络中的社团结构是复杂网络研究的基础性问题.针对非重叠社团发现和重叠社团发现两类问题,全面综述了当前复杂网络社团发现算法研究的新进展,分析了每类社团发现算法的特点,指出该领域值得进一步探索的研究方向.     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011