一种基于辅助交互的手抓握动作生成方法

针对沉浸式、非沉浸式和混合式虚拟维修系统中,维修动作交互过程繁琐、实现效果不佳的问题,提出一种高效的辅助交互方法,首先基于现有的维修动作规则和用户对维修任务的理解,建立了用户辅助信息接口和系统反馈辅助信息接口,前者由用户提供抓取目标、抓取手形和抓握点等辅助信息加速交互过程,系统通过后者反馈辅助信息帮助用户进一步决策,然后应用增广矩阵方法对经典逆向运动学算法进行扩展并生成具体的维修动作,最后应用该方法实现了装备车辆轮胎更换任务中维修动作的生成,维修动作交互过程的鲁棒性和效率得到显著提高。     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

一阶非线性脉冲边值问题解的存在性

研究一阶非线性脉冲周期边值问题，应用微分不等式和Schaefer不动点定理，得到了脉冲边值问题解存在的充分性判据，并给出了相应的Green函数。     

多目标广义指派问题的模糊匈牙利算法求解

提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子.     

一类拟线性周期抛物边值问题

研究了一类带有小扩散系数的拟线性周期抛物混合边值问题。给出当扩散系数趋于零时其非平凡解的渐近性。     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

军人伤亡保险存在的问题探析

军人伤亡保险作为军人保险制度的重要组成部分,其经济补偿功能已经被广大官兵逐渐认可。但作为分散军人职业风险的特定机制,其作用并未被充分开发出来,主要表现在较低的补偿水平等方面。因此,应充分借鉴国内外的相关经验,扬长避短,以充分发挥军人伤亡保险的作用。     

基层警营文化建设存在的问题及对策

基层警营文化建设是公安边消警部队文化工作的基础和基层建设的重要保证,直接关系部队的稳定、官兵关系和谐以及官兵的健康成长。通过实地调研基层警营文化建设情况,发现存在的问题与不足,分析其成因,提出切实可行的解决对策。     

随军配偶未就业期间社会保险问题分析

军人配偶随军未就业期间社会保险的建立解决了军人配偶在随军未就业期间的基本生活补贴和养老、医疗保险问题,在一定程度上保障了随军配偶的利益。但在执行过程中也出现一些诸如险种较少,保障范围较窄,保障程度较低等问题。在分析存在问题的基础上,提出一些完善社会保险的建议。