空间推进系统工作过程的模块化建模

建立空间推进系统仿真模块(包括液体管道模块、三通模块、充填模块、推力室模块等)的数学模型.虽然采用的是集中参数方法,但同时考虑了液体的惯性、粘性和压缩性,所以本文建立的常微分方程组能在一定程度上反映供应系统工作过程的分布特性.     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

互联网中文搜索引擎存在的问题与发展趋势探析

搜索引擎是互联网信息检索技术的核心,中文搜索引擎与国外相比存在着搜索引擎覆盖率低、查准率不高、检索精度差、更新速度慢、无法控制网络信息的动态变化、对信息内容难于控制和管理等问题。对此,提出了中文搜索引擎从单一查询工具向综合化、全功能服务发展;分类主题一体化,检索语言向自然语言发展;查询智能化,向多国化和多语种化发展;搜索引擎集成化、网络资源著录标准化及利用智能代理技术的信息检索等对策。     

现代文本分类技术研究

分析了当前的文本分类技术,总结了文本分类需要解决的问题;在详细比较了各种不同的分类算法以及文本模型以后,为进一步开展优化以及提高文本分类技术的研究工作提供了一些参考和建议。     

空天一体预警探测实验室建设探讨

介绍了美军作战实验室的现状,分析了我军空天一体预警探测实验室的功能需求,提出了空天一体预警探测实验室的概念,并对空天一体预警探测实验室的体系结构和管理模式进行了探讨。结合我军实际,从作战体系层次、实体结构层次、技术规范层次对空天一体预警探测实验室的体系结构建设进行了设想,对其管理模式给出了建议。     

PMESI：一种优化进程私有数据访问的缓存一致性协议

并行应用程序中绝大部分的访存是对私有数据的访问,在cache一致性协议上不会产生冲突。传统一致性协议没有根据程序私有数据的访问模式进行针对性设计,存在着很大的优化空间。针对以上的问题,提出了一种支持私有状态的cache一致性协议PMESI,通过动态关闭和激活内存空间的cache一致性目录,优化私有内存空间的访问延迟和功耗。通过时钟精确模拟器的测试,PMESI协议优化了程序中54%的访存,并行程序的执行时间平均缩短了9%。     

航天器智能能力的构建

为解决航天器智能能力的构建和智能技术的引入问题,从能力部署视角提出了智能等级的划分,从定性的自动、自治、自主的等级出发,自底向上分解为数据注入接收能力、任务执行能力、自学习能力、系统自我管理能力、任务自我管理和思考能力,其程度分为底层反应、中层程序和高层思考。对照上述能力给出可实施的5阶模型和人字架构。人字架构是以即插即用技术加自主控制技术来支持上层智能能力的模型。该模型基于航天器接口业务架构和欧洲空间局的包应用标准业务,采用管理信息库和电子数据单技术进行数据化设计。对应星上的智能能力等级讨论相适应的地面系统能力。人字架构具有层次化、业务模型化和自底向上归一化构建的特点,对上层智能技术的引入是开放的。     

求解布尔不可满足子式的消解悖论算法

求解布尔不可满足子式在超大规模集成电路设计与验证领域都具有非常重要的理论与应用价值,帮助EDA工具迅速定位错误与不一致。针对求解不可满足子式的非完全方法,提出了消解悖论与悖论解析树的概念,在此基础上提出一种启发式局部搜索算法。该算法根据公式的消解规则,采用局部搜索过程直接构造证明不可满足性的悖论解析树,而后递归搜索得到不可满足子式;算法中融合了布尔推理技术、动态剪枝方法及蕴含消除方法以提高搜索效率。基于随机测试集进行了实验对比,结果表明提出的算法优于同类算法。