Security sector reform in Africa: Donor approaches versus local needs

Many African states have security sector reform (SSR) programs. These are often internationally funded. But how do such programs account for previously existing security institutions and the security needs of local communities? This article examines SSR all over Africa to assess local ownership and path dependency from a New Institutionalist perspective. It finds that SSR, particularly in post-conflict countries, tends to be driven by ideas and perceptions of international donors promoting generalized blueprints. Often, such programs only account in a very limited way for path-dependent aspects of security institutions or the local context. Hence, the reforms often lack local participation and are thus not accepted by the local community eventually.     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

基于数据链的航空作战进程研究

研究了数据链支持下的航空作战兵力变化问题。将空战能力指数通过映射关系转化为平均战斗力水平,从数学理论上证明了二者具有等价性。结合平均战斗力水平,建立了基于数据链的改进蓝彻斯特空战模型及具有增援力量的作战模型。仿真分析了等效实力比、不同初始值以及增援时刻的不同对空战进程的影响,结果表明数据链具有提高作战效能和改变战局的作用。实验发现了在增援作战时,存在"局部最优增援时刻点"这一重要结论。     

航天器转动惯量参数在轨辨识的最优激励

根据矩阵分析理论研究了转动惯量参数的可辨识性问题,从姿态动力学方程导出关于未知参数的线性回归模型,将回归矩阵的条件数作为参数可辨识度的定量指标,以可辨识度最大为目标函数建立最优控制模型;应用解最优控制问题的伪谱法,计算控制力矩陀螺的指令轨线,使得惯量参数的辨识精度和收敛速度显著提高;在仿真中采用双无迹卡尔曼滤波算法进行参数辨识,结果验证了所提出的最优激励设计方法可以改善参数辨识性能,同时该方法对先验信息误差具有鲁棒性。     

面向监督学习的稀疏平滑岭回归方法

岭回归是监督学习中的一个重要方法,被广泛用于多目标分类和识别。岭回归中一个重要的步骤是定义一个特殊的多变量标签矩阵,以实现对多类别样本的编码。通过将岭回归看作是一种基于图的监督学习方法,拓展了标签矩阵的构造方法。在岭回归的基础之上,进一步考虑投影中维度的平滑性和投影矩阵的稀疏性,提出稀疏平滑岭回归方法。对比一系列经典的监督线性分类算法,发现稀疏平滑岭回归在多个数据集上有着更好的表现。另外,实验表明新的标签矩阵构造方法不会降低原始岭回归方法的表现,同时还可以进一步提升稀疏平滑岭回归方法的性能。     

Limiting survival functions of self‐similar structures

We show the existence of a unique analytic single parameter limiting survival function arising from the repeated composition of a coherent structure as the number of components tends to infinity. Examples include the repeated composition process of the bridge structure. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

试论大学英语翻译教学中本土文化的引入——以兵团文化为例

文化交流可以促进相互了解、共同繁荣。文化没有优劣之分,因此,文化交流应该是平衡的。这种交流离不开翻译。翻译教学是培养翻译人才的主要手段。教材是教学三要素之一,其重要性自不待言。我们目前的翻译教材在很大程度上仍然偏重文学,忽略实用文体的翻译,而且不可能顾及各地文化,因此在利用现有的翻译教材进行翻译教学时,有必要增加本地文化的翻译内容。兵团文化是一种崭新、独特的文化,更有必要在翻译教学中占有一席之地。     

漏磁检测的励磁装置优化设计

为了提高漏磁检测的灵敏度,利用ANSYS软件建立了漏磁检测励磁装置的三维有限元模型,研究了钢板的厚度、永磁体厚度、磁极面积以及磁化间隙等因素对钢板局部磁化效果的影响,得到了钢板磁化强度随永磁体几何参数改变时的变化规律,提出了永磁磁化方式下励磁装置优化设计的基本方法,对励磁装置各部分参数进行了优化设计．实验证明,优化设计的励磁装置能改善磁化效果,提高检测灵敏度．