油料保障力评估方案中的兼容度运用研究

旨在寻求一种从众多备选油料保障力评估方案中产生优化方案的方法,引入 兼容度的概念,并建立了兼容度极大化模型,根据模型建立了油料保障力评估方案优化系 统。利用优化系统对6个部队的油料保障力评估过程中的4个评估方案进行优化,通过计 算、比较、择优,得到了最优评估方案。应用表明运用兼容度优化油料保障力评估方案是合 理和正确的。     

新形势下师范类本科生就业能力现状及提升策略

随着高校毕业生的持续增加和我国事业单位人事制度的改革深化,近几年师范类大学生的就业问题Et益突出。在激烈的职场竞争中,就业能力的高低成为影响师范生就业的关键因素。本文通过问卷调查法,分析了师范类本科生就业能力的现状及存在的主要问题,从师范生培养模式、师范生就业观念、教育实习等方面分析影响师范生就业能力的因素。基于实证数据,建议从优化课程设置,制定大学生活规划,完善就业指导体系等几方面提升师范类本科生的就业能力。     

海战场舰艇反潜作战的优化配置研究

针对海战场舰艇反潜作战行动的特点,为增大反潜作战能力进行优化配置。在建立数学模型的基础上,以舰艇搜索突击群有效搜索带宽度为主要因素以及其他诸如概率参数的相关要素对反潜搜索能力进行优化配置,从而获得最大反潜搜索能力和最佳作战行动效果。该方法可以较好地为海战场作战行动的模拟仿真和实际应用提供理论依据和决策参考。     

英语教学应重视语言文化知识

语言与文化有着密切的关系。在英语教学中,文化教学的重要性不容忽视,因此,把传授文化知识融入英语教学之中,积极创设英语学习情境,提高学生对不同文化之间语言交际的理解,培养学生运用准确、流畅和得体的英语语言进行交际是十分必要的。     

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     

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

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

对加强党的执政能力建设的几点思考

长期执政、市场经济、全面开放,是我党所处的历史方位,它决定了加强党的执政能力建设的极端重要性。面对执政条件和社会环境的深刻变化,加强党的执政能力建设,提高党的领导水平和执政水平,已经成为一项带有全局性、根本性的重大历史课题,成为当前领导科学必须侧重研究的问题。     

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

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