基于改进多嵌入空间的实时语义数据流推理

将语义数据流处理引擎与知识图谱嵌入表示学习相结合,可以有效提高实时数据流推理查询性能,但是现有的知识表示学习模型更多关注静态知识图谱嵌入,忽略了知识图谱的动态特性,导致难以应用于实时动态语义数据流推理任务。为了使知识表示学习模型适应知识图谱的在线更新并能够应用于语义数据流引擎,建立一种基于改进多嵌入空间的动态知识图谱嵌入模型PUKALE。针对传递闭包等复杂推理场景,提出3种嵌入空间生成算法。为了在进行增量更新时更合理地选择嵌入空间,设计2种嵌入空间选择算法。基于上述算法实现PUKALE模型,并将其嵌入数据流推理引擎CSPARQL-engine中,以实现实时语义数据流推理查询。实验结果表明,与传统的CSPARQL和KALE推理相比,PUKALE模型的推理查询时间分别约降低85%和93%,其在支持动态图谱嵌入的同时能够提升实时语义数据流推理准确率。     

Identification of Pivotal Causes and Spreaders in the Time‐Varying Fault Propagation Model to Improve the Decision Making under Abnormal Situation

Under abnormal conditions, timely and effective decisions of system recovery and protective measures are of great significance for safety‐critical systems. The knowledge of the roles that network nodes play in the spreading process is crucial for developing efficient maintenance decisions; for singling out and preferential control, the ‘pivotal spreaders’ may be a way to maximize the chances to timely hinder the fault pervasion. Inspired by the inhomogeneous topological nature of a complex fault propagation network, this study is devoted to exploring the spreading capabilities of nodes regarding both structural connectivity and causal influence strength, so as to provide decisions of preferential recovery actions under specific fault scenarios. Specifically, the dynamic betweenness centrality and nonsymmetrical entropy are incorporated to adaptively measure the system‐wide fault diffusion risk of a set of controllable fault events. In order to model the dynamics and uncertainties involved in the complex fault spreading process, we introduce the model of a dynamic uncertain causality graph, based on which solutions of time‐varying structure decomposition and causality reduction are adopted to improve the reasoning efficiency. Verification experiments consisting of simulated calculation cases and generator faults of a nuclear power plant show empirically the effectiveness and applicability of this method in large‐scale engineering practice. Copyright © 2014 John Wiley & Sons, Ltd.     

Automatic text classification using BPLion-neural network and semantic word processing

Text mining has become a major research topic in which text classification is the important task for finding the relevant information from the new document. Accordingly, this paper presents a semantic word processing technique for text categorization that utilizes semantic keywords, instead of using independent features of the keywords in the documents. Hence, the dimensionality of the search space can be reduced. Here, the Back Propagation Lion algorithm (BP Lion algorithm) is also proposed to overcome the problem in updating the neuron weight. The proposed text classification methodology is experimented over two data sets, namely, 20 Newsgroup and Reuter. The performance of the proposed BPLion is analysed, in terms of sensitivity, specificity, and accuracy, and compared with the performance of the existing works. The result shows that the proposed BPLion algorithm and semantic processing methodology classifies the documents with less training time and more classification accuracy of 90.9%.     

Region-based surveillance video retrieval with effective object representation

Retrieving the most relevant video frames that contain the object specified in a given query (query-by-region) remains a challenging task. Two common challenges of region-based retrieval approaches are to accurately extract or segment object(s) and select a proper matching strategy. This paper addresses these problems by proposing a retrieval approach that uses a new region-based matching technique equipped with an effective object representation method. In the first stage, the proposed approach selects the most informative instances of each object that appeared in the video by utilizing an adapted clustering algorithm over the extracted features. In the retrieval stage, the new matching technique returns the most relevant sequences of video by mapping a given region with those identified representative instances of objects based on their similarity scores. The proposed approach is evaluated on standard datasets and the results demonstrate a 31% improvement in the retrieval performance compared to other state-of-the-art methods.     

一种基于分层的人类动作识别和定位算法研究

人类动作识别在视频自动分析、视频检索等领域获得广泛应用,是目前的研究热点。然而现有的动作识别方法重点关注视频的非静态部分而忽略大部分静态部分,从而影响了动作识别和定位的效果。本文提出一种新的分层空间-时间分段表示法,以分层方式实现部位和整个身体的多分辨率表示,可用于运动识别和定位。该算法分为3个步骤。第一步,首先对每个视频帧进行分层分段,以得到一组分段树,每颗树是身体分段树的候选。第二步,利用视频的轮廓、接合对象结构、全局前景色等信息对候选分段树进行修剪。第三步,在时域上对剩余分段层的每个分段进行前向和后向跟踪。我们以难度较大的UCF-Sports和HighFive数据集为实验对象,对本文方法进行性能评估,实验结果表明,本文方法的性能要优于当前最新运动检测算法性能,运动定位性能与当前最新算法相当。     

Critical Relation Path Aggregation-Based Industrial Control Component Exploitable Vulnerability Reasoning

With the growing discovery of exposed vulnerabilities in the Industrial Control Components (ICCs), identification of the exploitable ones is urgent for Industrial Control System (ICS) administrators to proactively forecast potential threats. However, it is not a trivial task due to the complexity of the multi-source heterogeneous data and the lack of automatic analysis methods. To address these challenges, we propose an exploitability reasoning method based on the ICC-Vulnerability Knowledge Graph (KG) in which relation paths contain abundant potential evidence to support the reasoning. The reasoning task in this work refers to determining whether a specific relation is valid between an attacker entity and a possible exploitable vulnerability entity with the help of a collective of the critical paths. The proposed method consists of three primary building blocks: KG construction, relation path representation, and query relation reasoning. A security-oriented ontology combines exploit modeling, which provides a guideline for the integration of the scattered knowledge while constructing the KG. We emphasize the role of the aggregation of the attention mechanism in representation learning and ultimate reasoning. In order to acquire a high-quality representation, the entity and relation embeddings take advantage of their local structure and related semantics. Some critical paths are assigned corresponding attentive weights and then they are aggregated for the determination of the query relation validity. In particular, similarity calculation is introduced into a critical path selection algorithm, which improves search and reasoning performance. Meanwhile, the proposed algorithm avoids redundant paths between the given pairs of entities. Experimental results show that the proposed method outperforms the state-of-the-art ones in the aspects of embedding quality and query relation reasoning accuracy.     

An efficient approach for statistical moments estimation of structural response based on a novel adaptive hybrid dimension-reduction method

Statistical moments estimation is one of the main topics for the analysis of a stochastic system, but the balance among the accuracy, efficiency, and versatility for different methods of statistical moments estimation still remains a challenge. In this paper, a novel point estimate method (PEM) based on a new adaptive hybrid dimension-reduction method (AH-DRM) is proposed. Firstly, the adaptive cut-high-dimensional model representation (cut-HDMR) is briefly reviewed, and a novel AH-DRM is developed, where the high-order component functions of the adaptive cut-HDMR are further approximated by multiplicative forms of the low-order component functions. Secondly, a new point estimation method (PEM) based on the AH-DRM is proposed for statistical moments estimation. Finally, several examples are investigated to demonstrate the performance of the proposed PEM. The results show the proposed PEM has fairly high accuracy and good versatility for statistical moments estimation.     

Modal Pure Type Systems

We present a framework for intensional reasoning in typed -calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a propositions-as-types-interpretation can be given for normal modal logics. MPTSs are an extension of the Pure Type Systems (PTSs) of Barendregt (1992). We show that they retain the desirable meta-theoretical properties of PTSs, and briefly discuss applications in the area of knowledge representation.     

基于Agent的面向DSS的模型库系统研究

智能性是决策支持系统未来的发展方向,为了提高决策支持系统模型库的智能性,文章将Agent的智能性融人到模型库系统中,提出了一种基于Agent的模型库系统构建方案。主要研究基于Agent的模型表示、模型选择和模型组合技术,模型库系统的架构方案及各功能Agent模型,详细阐述了模型库系统各部分的工作原理,并在JADE平台完成了模型库系统原型的开发。实验证明：所设计的基于Agent的模型库系统能很好的解决模型表示、模型组合和模型选择问题,比传统模型库系统具有更高的智能性。     

On the 2-tuples based genetic tuning performance for fuzzy rule based classification systems in imbalanced data-sets

When performing a classification task, we may find some data-sets with a different class distribution among their patterns. This problem is known as classification with imbalanced data-sets and it appears in many real application areas. For this reason, it has recently become a relevant topic in the area of Machine Learning.The aim of this work is to improve the behaviour of fuzzy rule based classification systems (FRBCSs) in the framework of imbalanced data-sets by means of a tuning step. Specifically, we adapt the 2-tuples based genetic tuning approach to classification problems showing the good synergy between this method and some FRBCSs.Our empirical results show that the 2-tuples based genetic tuning increases the performance of FRBCSs in all types of imbalanced data. Furthermore, when the initial Rule Base, built by a fuzzy rule learning methodology, obtains a good behaviour in terms of accuracy, we achieve a higher improvement in performance for the whole model when applying the genetic 2-tuples post-processing step. This enhancement is also obtained in the case of cooperation with a preprocessing stage, proving the necessity of rebalancing the training set before the learning phase when dealing with imbalanced data.