面向多核网络分组处理系统的线程亲和缓冲区管理机制

基于通用多核架构的网络分组处理系统性能受到诸如分组IO开销高、多核共享内存及进程调度竞争大、页表缓冲表项失效率高等问题的困扰。为此提出一种基于通用多核网络分组处理系统、面向高速分组转发应用的线程亲和缓冲区硬件管理机制,并在网络专用协处理引擎上实现。该机制采用无中断的线程亲和调度策略,将包含控制信息与缓冲区地址信息的描述符和分组数据按照分组处理的线程号链式地对应加载在多个地址连续的共享缓冲区中。基于通用多核和现场可编程门阵列平台进行报文转发测试,实验结果表明,采用线程亲和缓冲区管理机制能使平均报文转发处理性能提升12.4%,有效地降低IO开销和TLB表项失效率。     

雷达干扰资源一对多分配方法

在对雷达干扰资源分配的一般优化模型和求解算法进行分析的基础上,从提高资源利用效率的角度出发,提出了目标雷达分群思想,并建立了一种新的基于一对多策略的雷达干扰资源分配模型,通过对目标雷达群的一对一分配实现对单部雷达的一对多分配.最后,对该模型中一些关键性问题进行了探讨,如任务整合、新任务参数确定、任务优先级排序、干扰机位置部署以及单目标雷达群干扰效益评估等.     

基于磁流变液的舰载机拦阻过程模糊PID控制

针对舰载机拦阻过程的运动特性分析,建立了舰载机拦阻缓冲过程的力学模型与状态方程,通过对基于磁流变阻尼拦阻缓冲过程的分析,引入了位移和速度矢量作为磁流变缓冲拦阻控制系统的输入,完成基于模糊控制的舰载机拦阻缓冲过程控制。应用模糊PID控制器非线性拟合能力来适应舰载机着舰情况变化,并仿真验证建立的磁流变缓冲拦阻模糊PID算法具有较好的预测精度和应用范围。     

Resource rents,institutions, and violent civil conflicts

Natural resources have been blamed for inducing slow growth and sparking civil conflicts and violence. This paper first develops a model to account for the hazard of armed civil conflicts as a manifestation of the natural resource curse, which is mediated by the quality of both economic and political institutions. We then use recently published data on institutional quality and natural resource rents to measure the potential impact of the resource curse on violent civil conflicts using a panel of data for over 100 countries in the period 1970–2010. Our model explicitly accounts for the role of good economic and political institutions in deterring the recourse to violence as well as the extent to which they might weaken the resource rents effect.     

异构资源类型下多无人机任务分配

针对多无人机在执行侦察、打击任务的过程中携带任务资源的异构性,以及任务对于异构资源的要求,设计了一种改进的基于共识的捆绑算法(consensus-based bundle algorithm, CBBA)。考虑任务价值、任务执行时间窗以及航程代价等条件建立了多无人机对地目标侦察、打击任务分配模型。利用K-medoids聚类分析方法对多无人机进行基于距离和携带资源平衡的聚类,以解决多无人机对于异构资源类型的要求。对打击任务进行子任务生成,并利用改进后的CBBA求解所建立的任务分配模型,通过对比仿真实验验证了算法的可行性和有效性。     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

论军队院校科研管理资源配置机制建设

分析了目前军队院校科研管理资源配置机制中存在的问题及原因,提出了军队院校建立科学高效优化合理的科研管理资源配置机制的基本思路:建立基于学科的资源优化配置机制;建立和完善资源开放平台和共享机制;建立尊重和适应市场规律、科学合理的人才资源配置机制。     

基于网格技术的装备保障资源监控系统研究

研究了网格资源监控理论,介绍了端到端监控组件及LDAP协议。结合基于LDAP的资源监控模型,讨论了装备保障资源监控系统中监控对象的表示及系统的结构设计,并说明其工作机理。     

通用装备维修保障资源需求仿真建模研究

从新型通用装备维修保障的实际需求出发,在对维修保障系统运行过程分析的基础上,建立了维修资源需求的仿真模型,并给出了相关算法。该模型可实现对各种主要维修资源需求的预测,并能给出装备完好率、备件缺货率和装备待修时间等系统特征指标。该模型和算法可为装备的维修保障提供科学的依据。