基于键合图模型的新型解析冗余关系故障诊断方法研究

研究了通过诊断键合图模型建立系统解忻冗余关系(ARRs)的故障诊断方法.通过在系统键合图中加入虚拟传感器的方法建立系统的诊断键合图,根据诊断键合图模型的因果关系路径构建系统的解析冗余关系和系统故障特征矩阵,并利用系统实际观测特征与故障特征的比较进行系统的故障检测和隔离,通过在双容水箱系统的仿真验证,证明了该方法便捷性和...     

最小生成树算法在旅行商问题中的应用

如何在n个顶点之间的1/2(n-1)!巡回路径中选择距离最短的,这是一个典型的组合优化问题,也是解决旅行商问题的根本.在最小生成树的基本思想上进行了改进,成功地解决了旅行商问题.     

基于MKL-SVM的网络购物评论分类方法

购物网站在线评论系统收集了大量的顾客评价。支持向量机（SVM）是一种有效的文本分类方法,可以用于跟踪和管理顾客意见,但是SVM存在训练收敛速度慢,分类精度难以提高等缺点。文章提出利用异质核函数性的不同特性,解决支持向量机（SVM）数据泛化学习能力弱的问题,提高SVM的分类精度,通过对顾客购物评论进行分类,解决购物网站海量顾客评论分析的问题,帮助企业及时进行顾客反馈,提升服务水平。     

Workflow simulation for operational decision support using event graph through process mining

It is increasingly common to see computer-based simulation being used as a vehicle to model and analyze business processes in relation to process management and improvement. While there are a number of business process management (BPM) and business process simulation (BPS) methodologies, approaches and tools available, it is more desirable to have a systemic BPS approach for operational decision support, from constructing process models based on historical data to simulating processes for typical and common problems. In this paper, we have proposed a generic approach of BPS for operational decision support which includes business processes modeling and workflow simulation with the models generated. Processes are modeled with event graphs through process mining from workflow logs that have integrated comprehensive information about the control-flow, data and resource aspects of a business process. A case study of a credit card application is presented to illustrate the steps involved in constructing an event graph. The evaluation detail is also given in terms of precision, generalization and robustness. Based on the event graph model constructed, we simulate the process under different scenarios and analyze the simulation logs for three generic problems in the case study: 1) suitable resource allocation plan for different case arrival rates; 2) teamwork performance under different case arrival rates; and 3) evaluation and prediction for personal performances. Our experimental results show that the proposed approach is able to model business processes using event graphs and simulate the processes for common operational decision support which collectively play an important role in process management and improvement.     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.     

基于贝叶斯核主成分分析的远距离地形标记方法

由于非结构化室外场景外观特征分布存在动态不确定性以及映射偏移特性,因此在室外移动机器人自主导航的过程中采用预确定外观特征并不能非常有效地进行地形标记.为了解决此问题,提出了基于贝叶斯核主成分分析(BKPCA)的远距离地形标记方法.该方法融合了基于贝叶斯公式的聚类中心后验概率,且采用自定义的核函数,实现了原始特征数据结构在低维空间上的保持,能够提取出适合当前场景地形标记的外观特征.实验结果表明,BKPCA模型有效地提高了远距离地形标记的精度.     

基于VC＋＋的SEGY数据格式地震剖面图绘制

地震数据显示是地震资料解释的基础,将数据转换为图形的形式在屏幕上显示出来可以使其更加直观、易于理解。本文在分析了SEGY格式地震数据文件结构的基础上,利用VC＋＋实现了地震数据的准确读取,完成了波形、面积填充和变密度这几种常见地震数据剖面显示方式的绘制。对绘制的原理和过程进行了介绍,并展示了绘制结果。     

利用二进制数算法寻找5个点的Ramsey图

用二进制数来表示完全图的各种组合,借助计算机编程可从完全图的各种组合中寻找出ramsey图.5个顶点的Ramsey图是最基本的Ramsey图,这种基本方法为寻找更复杂的Ramsey图提供了基础.     

一种多学科设计优化工作流验证方法

在多学科设计优化集成系统中,设计过程和优化求解算法均通过可视化工作流实现,工作流有效性验证对提高设计效率和提高系统的用户体验具有重要意义。当前验证方法主要针对办公自动和企业管理系统中的工作流验证问题,多学科设计优化集成系统中的工作流验证问题研究较少。在分析前期工作验证技术的基础上,针对以循环结构为特征的优化环,提出一种基于图论方法的,名为浓缩环(concentration-loop)的验证算法。结合发射平台数字化设计系统的设计与实现,对该算法进行了验证。     

一种用于指针程序的形状分析方法

指针程序的分析一直是研究热点。本文提出一种基于形状图逻辑的形状分析方法,其中形状分析采用形状图来表达程序中指针的指向和相等关系,并用形状图逻辑来进行推理。形状图逻辑是一种把形状图看成有关指针的断言,并在此基础上对Hoare逻辑进行扩展而得到的程序逻辑。首先介绍所提出的形状图和形状图逻辑;然后在此基础之上,设计一种基于形状图逻辑的形状分析方法。