小型无人机协同覆盖侦察路径规划

针对多架小型无人机对含有障碍的区域覆盖侦察最佳路径规划问题,首先用方形单元格将待侦察区域离散化,利用基于初始位置的划分方法划分出与无人机对应的子区域,把问题转化为单无人机优化问题以降低计算复杂度;然后在最小生成树的基础上提出节点交换法,对各子区域的形状和最小生成树进行调整优化;最后依据优化后的最小生成树为每个子区域构建侦察路径。仿真验证了该方法产生的规划路径能够完全覆盖指定区域且无重叠,路径长度和转弯数最小。     

探索式搜索中支持多角度概念发现方法

为帮助用户在执行探索式搜索时发现领域内重要、有价值的概念, 同时了解概念所处的问题角度进而全面理解目标领域, 以建模概念的实际使用情况为基础, 分析确定概念的重要度及问题角度对概念重要度的影响, 提出了支持用户多角度概念发现方法。该方法考虑了概念的重要性及概念所处问题角度之间的交互影响, 实现了对影响概念发现两方面因素的同步分析。实验表明, 相比直接搜索, 该方法减少了48.8%的搜索交互次数, 并提升了24.3%的概念出现数量。     

终身学习理念下的中小学幼儿园教师职业生涯规划

在国家全面加强教师队伍建设的背景下,如何培养"四有"的骨干、卓越、教育家,中小学、幼儿园教师成为焦点,成为加强教师队伍建设的核心目标。从骨干到卓越到教育家体现了教师专业成长过程,如何让教师的专业成长的过程有时间表、路线图,在终身学习的理念下引导教师做好职业生涯规划是教师迅速专业成长的前提。     

问答社区问句中多字词表达提取

基于互动问答社区问句中多字词表达和问句理解的关系,提出针对互动问答社区问句进行多字词表达抽取,并基于互动问答社区问句中多字词表达的特点,提出适用于互动问答社区的多字词表达提取方法.该方法在利用互信息和停用词表的方法从问句中抽取候选多字词表达的基础上,将候选多字词表达分为正确串、残缺串、冗余串和错误串4类,借助搜索引擎对查询串的优化和候选多字词表达在互联网上的检索结果,设计候选多字词表达校正方法,实现对多字词表达的提取.以新浪爱问知识人问题库中的问句进行实验,结果表明,多字词表达抽取的准确率、召回率和F值分别达到84%,52%和0.64,验证了该方法的有效性.     

平顺移动模式下考虑加工时间与调整时间可分离的多目标流水车间批量调度

对平行顺序移动模式下考虑加工时间与调整时间可分离的多目标流水车间批量调度问题展开研究.构建以加工制造设备总停机次数、批量工件生产周期以及搬运批量工件的总次数为决策目标的基于分层序列法的多目标决策模型,利用该模型可确定批量工件的最优加工排序方案.建立平行顺序移动模式的加工与调整时间模型,该模型是求解生产周期的基础,也是为批量工件的最优调度方案制定生产作业计划的依据.提出并设计平行顺序移动模式下考虑加工时间与调整时间可分离的禁忌搜索算法对问题进行求解.研究结果表明:本研究可为平顺移动模式下考虑加工时间与调整时间可分离的批量生产流水车间选出批量工件的最优调度方案,同时可为批量工件的加工和加工制造设备的调整制定精确的生产作业计划.     

Multicategory Purchase Incidence Models for Partitions of Product Categories

We analyze multicategory purchases of households by means of heterogeneous multivariate probit models that relate to partitions formed from a total of 25 product categories. We investigate both prior and post hoc partitions. We search model structures by a stochastic algorithm and estimate models by Markov chain Monte Carlo simulation. The best model in terms of cross‐validated log‐likelihood refers to a post hoc partition with two groups; the second‐best model considers all categories as one group. Among prior partitions with at least two category groups a five‐group model performs best. Effects on average basket value differ for the model with five prior category groups from those for the best‐performing model in 40% and 24% of the investigated categories for features and displays, respectively. In addition, the model with five prior category groups also underestimates total sales revenue across all categories by about 28%. Copyright © 2016 John Wiley & Sons, Ltd.     

基于联想一体机构建OPAC检索机的研究与实现

联想一体机以其网络同传、硬盘保护等功能,以及美观、节约空间等优势广泛应用于图书馆领域。OPAC检索机是高校图书馆面向读者的主要窗口,通过构建基于联想一体机的图书馆OPAC检索机,运用组策略管理、注册表管理以及BIOS管理等计算机技术,形成了一套完整的检索机安全配置方案,经过一学期的运行,证明了此方案是切实可行的,实现了OPAC检索机的无人值守与零维护。     

略论交城县旮旯水电站建设的必要性

简要介绍了交城县概况及其水文气象条件,从工程规划、水土保持、环境评价、经济评价等方面对交城县旮旯水电站项目建设的可行性和必要性进行了论证。     

多米诺骨牌理论中的人为失误与风险管理(英文)

通过介绍多米诺骨牌理论在风险管理中的作用原理,提出海事风险管理应主要以控制人为失误为主的观点,深入分析人为失误的原因,提出控制人为失误的方法,总结多米诺骨牌理论的优缺点.     

Network Motif Detection： Algorithms, Parallel and Cloud Computing,and Related Tools

Network motif is defined as a frequent and unique subgraph pattern in a network, and the search involves counting all the possible instances or listing all patterns, testing isomorphism known as NP-hard and large amounts of repeated processes for statistical evaluation. Although many efficient algorithms have been introduced, exhaustive search methods are still infeasible and feasible approximation methods are yet implausible.Additionally, the fast and continual growth of biological networks makes the problem more challenging. As a consequence, parallel algorithms have been developed and distributed computing has been tested in the cloud computing environment as well. In this paper, we survey current algorithms for network motif detection and existing software tools. Then, we show that some methods have been utilized for parallel network motif search algorithms with static or dynamic load balancing techniques. With the advent of cloud computing services, network motif search has been implemented with MapReduce in Hadoop Distributed File System(HDFS), and with Storm, but without statistical testing. In this paper, we survey network motif search algorithms in general, including existing parallel methods as well as cloud computing based search, and show the promising potentials for the cloud computing based motif search methods.