基因表达缺失值的加权回归估计算法

在基因芯片实验中,数据缺失客观存在,并在一定程度上影响芯片数据后续分析结果的准确性。在不增加实验次数的情况下,缺失值估计是降低缺失数据对后续分析影响的有效方法。利用相似性信息的核加权函数来实现缺失值回归估计的局部化,提出了基于加权回归估计的基因表达缺失值估计算法。在两个不同类型的基因芯片数据上,将新方法与几种已知的方法进行了比较分析。实验结果表明,新的估计算法具有比传统缺失值估计算法更好的稳定性和估计准确度。     

基于改进局部投影算法的非线性时间序列降噪

改进了非线性时间序列降噪的局部投影算法,并应用此算法对含噪Lorenz混沌信号进行降噪,将其与小波分析降噪效果进行比较,实验结果表明:改进的局部投影算法对非线性信号降噪效果十分明显。     

基于支持向量机的彩色图像恢复新方法

引起图像退化的因素众多,因而难以用一个统一的方法来进行恢复处理。鉴于图像的像素和各颜色分量通道间本质上存在某种相关性,以及以支持向量机为核心的统计学习理论具有较好地解决小样本、非线性、高维数问题的能力,提出了一种新的空域图像恢复方法,并通过对来自于待处理图像本身的训练样本的学习,构造自适应的回归插值函数;然后基于该函数对图像作有选择的修改,从而达到图像恢复的目的。实验表明,该方法是有效的,并且具有较好的泛化性能。     

Counterinsurgency Challenge in Post-2001 Afghanistan

Although the Taliban insurgency was internally divided and unable to coordinate its activities in 2014–2015, the Afghan security forces were not able to contain it and steadily lost ground throughout 2015. Until 2015, there had been little effort to develop an indigenous Afghan counterinsurgency strategy, but a sense of urgency emerged after a string of Taliban victories. At the beginning of 2016, it was still not clear if and when the National Unity Government would be able to produce a counterinsurgency strategy and, in any case, the need for a coherent counterinsurgency approach became questionable as the Taliban appeared to be transitioning towards conventional warfare.     

基于改进支持向量回归机的火炮身管寿命预测

为准确预测火炮身管寿命终止时火炮射弹数,根据射击过程中火炮身管磨损量与身管寿命特性,分析了身管膛线起始部磨损量与身管射弹数之间的关系,提出了支持向量回归机算法,并采用遗传算法进行模型优化改进,得到火炮身管寿命预测最优模型。结合两种类型火炮的身管数据,利用该模型对身管寿命进行预测,并与原始支持向量回归机进行对比,通过分析可知改进的支持向量回归机预测效果好、精度高,为火炮在实际应用中身管的寿命预测提供了新的思路。     

基于广义回归神经网络的单位运营状况分类

单位的运营状况会直接影响股东和广大人民的利益,针对运营状况可以使用广义回归神经网络进行分类。由于广义回归神经网络中径向基函数的扩展参数Spread的选取会导致分类的准确率,提出了一种果蝇优化算法优化参数Spread的分类模型。充分利用了果蝇优化算法的寻优能力,将优化后的参数代入到广义回归神经网络中对单位的财务数据进行运营状况的分类。结果表明,与广义回归神经网络做比较,优化后的网络模型对数据的分类可以达到很高的准确率,在相关领域的分类上有非常大的实用性。     

Too much Western bias? The need for a more culturally adaptable approach to post-conflict security sector reform

The existing guidelines for security sector reform (SSR) tend to draw on theoretical work in the field of civil–military relations, which in turn has been derived from Western, liberal democratic models of governance. Although guidelines strongly advise that local culture and context need to be considered when drawing up objectives for post-conflict SSR programmes, this is not often reflected in practice. This article considers some of the reasons for this, citing both in-country challenges and donor-related issues, and suggests that one of the biggest problems is a lack of alternative, non-orthodox models of civil–military relations to draw upon. It is further suggested that elements of suitable alternative models may be found in states which possess political structures not entirely dissimilar to the Western, liberal democratic ideal, but which can offer different perspectives. Detailed research of these structures should produce a pool of sub-models which could then be employed to create bespoke, culturally appropriate objectives for use in post-conflict SSR programmes.     

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