检索结果-内蒙古大学图书馆

The Second International Conference of Young Computer Scientists, Engineers and Educators,ICYCSEE 2016

作者： Xianji Cui Dantong Ouyang Jialiang He College of Information and Communication Engineering Dalian Minzu University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University

With the rapid development of information technology,semantic web data present features of massiveness and complexity. As the data-centric science, social computing have great influence in collecting and analyzing semantic data. In our contribution, we propose an integrity constraint validation for DL-Lite R based ontology in view of data correctness issue in the progress of social computing ***, at the basis of translations from integrity constraint axioms into a set of conjunctive queries, integrity constraint validation is converted into the conjunctive query answering over knowledge bases. Moreover, rewriting rules are used for reformulating the integrity constraint axioms using standard axioms. On this account, the integrity constraint validation can be reduced to the query evaluation over the ABox, and use query mechanisms in database management systems to optimize integrity constraint validation. Finally, the experimental result shows that the rewritingbased method greatly improves the efficiency of integrity constraint validation and is more appropriate to scalable data in the semantic web.

关键词： Semantic web Social computing Integrity constraints Conjunctive query Rewriting

来源：评论

学校读者我要写书评

暂无评论

The Fitzpatrick-Neville-Type Algorithm for Multivariate Vector-Valued Osculatory Rational Interpolation

引用

Journal of Systems Science & Complexity 2015年第1期28卷 222-242页

作者： XIA Peng ZHANG Shugong LEI Na KIM Zhangyong School of Mathematics Liaoning University Automated Reasoning and Cognition Key Laboratory of Chongqing School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin University

In this paper,the authors first apply the Fitzpatrick algorithm to multivariate vectorvalued osculatory rational *** based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis,the authors present a Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational *** may be used to compute the values of multivariate vector-valued osculatory rational interpolants at some points directly without computing the interpolation function explicitly.

关键词： Fitzpatrick algorithm GrSbner basis module vector-valued osculatory rational interpolation.

来源：评论

学校读者我要写书评

暂无评论

A concurrent model for temporal hierarchical task network

引用

Journal of computational and Theoretical Nanoscience 2016年第5期13卷 3135-3138页

作者： Feng, Yuxuan Ouyang, Dantong Feng, Shasha Liu, Jie College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China

When several actions preformed at the same time, or performed concurrently, the possibility of multiple concurrent and mutually interacting make the planning solving process difficult. In this paper, we reform the framework of hierarchical task network planning paradigm to present the concurrent action planning, to make good use of domain knowledge to improve the performance of planner. There are several remarkable works deal with temporal planning problem by hierarchical task network planning paradigm, our work focus on the concurrent performing actions. The experimental results is positive. Copyright © 2016 American Scientific Publishers All rights reserved.

关键词： Nanoscience

来源：评论

学校读者我要写书评

暂无评论

Video face recognition based on the convex hull model of kernel subspace sample selection

引用

Journal of computational and Theoretical Nanoscience 2016年第2期13卷 1436-1441页

作者： Wang, Yu Shen, Xuan-Jing Chen, Hai-Peng College of Computer Science and Technology Jilin University Changchun130012 China Applied Technology College Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun13001 China

This paper proposes a novel video face recognition method based on the convex hull model of kernel subspace sample selection. This method treats each video as an image set. Each image is represented as a point in the feature vector space, then each image set is characterized by a convex hull spanning its feature points. The similarity between image sets can be measured using the distance of closest approach between their convex hulls. Before using the convex hull model, the kernel subspace sample selection was used to discard points that were far from the fitted model. The sample selection on the kernel subspace reduces the influence of confounding factors such as motion and gestures. Through experiments using the YouTube Face Database, the algorithm achieved high recognition accuracy, which verified the validity of the algorithm. © 2016 American Scientific Publishers All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Interactive Activity Learning from Trajectories with Qualitative Spatio-Temporal Relation

引用

Chinese Journal of Electronics 2015年第3期24卷 508-512页

作者： WANG Shengsheng WEN Changji LAI Yong LIU Yiting LIU Dayou College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University

Automatically analyzing interactions from video has gained much attention in recent years. Here a novel method has been proposed for analyzing interactions between two agents based on the tra jectories. Previous works related to this topic are methods based on features, since they only extract features from objects. A method based on qualitative spatio-temporal relations is adopted which utilizes knowledge of the model(qualitative spatio-temporal relation calculi) instead of the original tra jectory information. Based on the previous qualitative spatio-temporal relation works, such as Qualitative tra jectory calculus(QTC), some new calculi are now proposed for long term and complex interactions. By the experiments, the results showed that our proposed calculi are very useful for representing interactions and improved the interaction learning more effectively.

关键词： Interactive activity learning Tra jectory pair Qualitative spatio-temporal relation

来源：评论

学校读者我要写书评

暂无评论

Link prediction in social network based on local information and attributes of nodes

引用

Journal of Physics: Conference Series 2017年第1期887卷

作者： Yingying Liang Lan Huang Zhe Wang College of Computer Science and Technology Jilin University 130012 Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education 130012 Changchun China Zhuhai College of Jilin University 519041 Zhuhai China

Link prediction is essential to both research areas and practical applications. In order to make full use of information of the network, we proposed a new method to predict links in the social network. Firstly, we extracted topological information and attributes of nodes in the social network. Secondly, we integrated them into feature vectors. Finally, we used XGB classifier to predict links using feature vectors. Through expanding information source, experiments on a co-authorship network suggest that our method can improve the accuracy of link prediction significantly.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamics Analysis of Bionic Parallel Joint Mechanism for the Snake Robot

Dynamics Analysis of Bionic Parallel Joint Mechanism for the...

引用

第35届中国控制会议

作者： Chuncheng Wu Zhengcai Cao Qing Xiao Yili Fu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University State Key Laboratory of Robotics and Systems Harbin Institute of Technology College of Information Science and Technology Beijing University of Chemical Technology

ISBN: (纸本)9781509009107

Joint mechanism is a key factor for a snake robot adjusting its postures adapted to clutter environments in search and rescue *** joint mechanisms in prior research simply consist of serially connected revolute joints,which are lack of great load carrying *** nature snake structure,a modular bionic parallel joint mechanism(BPJM) is proposed for the rescue snake *** analysis of the BPJM is necessary for its optimal design and control,providing the force and constraint that must be resisted by joints,links and *** reduce the dynamics computation load,Newton equation and Euler equation are combined by synchronizing the inertial force and inertial moment with the aid of screw ***,the dynamics equations for moving platform and links are formulated in a simplified *** friction at the joints and external force acting on BPJM,which actually affect the motion,are both considered in the ***,the virtual prototype is provided in order to visualize the joint mechanism and the numerical results from the dynamics analysis are given.

关键词： Rescue snake robot Dynamics analysis Bionic parallel joint mechanism Screw theory Newton method

来源：评论

学校读者我要写书评

暂无评论

Detecting communities from signed network based on local search

Detecting communities from signed network based on local sea...

引用

2016 2nd International Conference on Electronics,Network and Computer engineering(ICENCE 2016)

作者： Xueyan Liu Bo Yang Xuehua Zhao Yi Yang School of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Digital Media Shenzhen Institute of Information Technology China UnionPay

Many researchers have begun to study signed networks which are widely existed in real world. In the signed network, the links are labeled the positive or negative sign to represent the active or passive relation between individuals, such as trusted or distrusted relation in social networks. Communities mining is still a great challenge to the domain of signed networks because of negative links. Unlike communities of unsigned networks, positive links mainly occur in the communities and negative links tend to occur between the communities in the signed networks. Nowadays, many methods which are based on global search for signed network community have been raised, and most of these methods require the global information at each iteration. Besides, determining the number of communities is an important problem for current algorithm for the lack of priori knowledge. To address above problems, a novel community detection method based on local information, is proposed for signed networks in this paper. The proposed method mainly includes two steps. In the first step, the number of communities is determined in terms of the centrality of nodes. In the second step, the local objective function is optimized by the local information of nodes, so the global objective function can also be optimized indirectly. Finally, the communities in signed networks are efficiently found. To validate the proposed method, the comparisons are made with other methods in the synthetic and real signed networks. The experimental results indicate that communities in signed networks can be efficiently found by the proposed method.

关键词： signed networks community detection local search

来源：评论

学校读者我要写书评

暂无评论

Hyponymy Graph Model for Word Semantic Similarity Measurement

引用

Chinese Journal of Electronics 2015年第1期24卷 96-101页

作者： WANG Junhua ZUO Wanli PENG Tao College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering attached to the Ministry of Education

Measuring word semantic similarity is a generic problem with a broad range of applications such as ontology mapping, computational linguistics and artificial intelligence. Previous approaches to computing word semantic similarity did not consider concept occurrence frequency and word’s sense number. This paper introduced Hyponymy graph, and based on which proposed a novel word semantic similarity model. For two words to be compared, we first retrieve their related concepts; then produce lowest common ancestor matrix and distance matrix between concepts; finally calculate distance-based similarity and information-based similarity, which are integrated to get final semantic similarity. The main contribution of our method is that both concept occurrence frequency and word’s sense number are taken into account. This similarity measurement more closely fits with human rating and effectively simulates human thinking process. Our experimental results on benchmark dataset M&C and R&G with Word Net2.1 as platform demonstrate roughly 0.9%–1.2%improvements over existing best approaches.

关键词： Word semantic similarity Concept semantic similarity Semantic similarity Hyponymy graph model Word Net.

来源：评论

学校读者我要写书评

暂无评论

Otsu multi-thresholding based on DCG3A for medical image

引用

ICIC Express Letters, Part B: Applications 2016年第8期7卷 1651-1656页

作者： Fang, Zheng Shen, Xuanjing Chen, Haipeng Feng, Yuncong College of Computer Science and Technology Jilin University No. 2699 Qianjin Ave. Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University No. 2699 Qianjin Ave. Changchun130012 China

In order to solve the problem that multi-thresholding segmentation spends too much time finding the optimal solution in medical image segmentation, Otsu multi-thresholding based on dynamic combination of genetic algorithm and ant algorithm (abbreviated as DCG3A-OM) was proposed in this paper. Firstly, the algorithm uses genetic algorithm to generate preliminary partition results, and then converts them into the initial information of ant colony. Finally ant algorithm will approach to optimal values efficiently. While running genetic algorithm, the conditions of combination will be analyzed dynamically to avoid stopping genetic algorithm early or late. Besides, it increases the probability of variation and decreases the numbers of individuals which are calculated for the evolution rate of colony. The experimental results demonstrate that DCG3A-OM gets the optimal solution more quickly and efficiently than the others, and it can always get the optimal values mostly. © 2016 ICIC International.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：