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

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Wang, Ruiwei Xia, Wei Yap, Roland H.C. Li, Zhanshan School of Software Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Education Ministry China School of Computing National University of Singapore Singapore

Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency algorithms. We propose STRbit, a GAC algorithm, based on simple tabular reduction (STR) using an efficient bit vector support data structure. STRbit is extended to deal with compression of the underlying constraint with c-tuples. Experimental evaluation show our algorithms are faster than many algorithms (STR2, STR2-C, STR3, STR3-C and MDDc) across a variety of benchmarks except for problems with small tables where complex data structures do not payoff.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

The BBC news hunter: A novel crawler for BBC news 2nd

The BBC news hunter: A novel crawler for BBC news

引用

2nd International Conference on Young Computer Scientists, Engineers and Educators, ICYCSEE 2016

作者： Wang, Mingxin Wang, Ning Wang, Boran Tian, Can Liang, Yanchun Zhao, Guozhong Han, Xiaosong College of Software Jilin University Changchun130012 China Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory for Symbol Computation Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai519041 China Daqing Oilfield Personnel Development Institute CNPC Daqing163000 China

ISBN: (纸本)9789811020971

In order to distinguish and extract the topic information from other interferential information on the BBC news website for the study in social computing, the BBC News Hunter was proposed in this paper. The whole system consists of 6 subsystems, respectively named: UI, Control, Download, Analysis, Storage and Log. Numerical experiments show that satisfactory results can be obtained from the BBC news website, whose average accuracy as well as efficiency are acceptable. © Springer Science+Business Media Singapore 2016.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Integrity Constraint Validation in DL-LiteR Based Ontology Using Rewriting

Integrity Constraint Validation in DL-LiteR Based Ontology U...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 Group key Management Scheme Based on Random Transmission for VANET

A Group Key Management Scheme Based on Random Transmission f...

引用

2016 6th International Conference on Machinery,Materials,Environment,Biotechnology and Computer(MMEBC 2016)

作者： Liang PANG Da WEI Qi ZHAO Jianqi ZHU College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin University

ISBN: (纸本)9781510828087

Group key management plays an important role in ensuring the safety and reliability of the VANET(vehicular ad-hoc network) over the channelThrough considering the characteristics of VANET communication and topology, a VANET group key management scheme is proposed based on random transmission which is combined with the construction of polynomial and key updating by Hash chainThe scheme achieves the random transmission function of group key and the node revocation capabilityMoreover, it can ensure the forward and backward and other security attributes of the group keyThe results show that the proposed scheme has less communication complexity and better communication performance, also it can suitable for large scale VANET group.

关键词： VANET Group Random Transmission Polynomial Hash Chain

来源：评论

学校读者我要写书评

暂无评论

Biogeography-based optimization for cluster analysis

Biogeography-based optimization for cluster analysis

引用

International Conference on Computer, Communication and computational Sciences, ICCCCS 2016

作者： Wu, Xueyan Wang, Hainan Chen, Zhimin Lu, Zhihai Phillips, Preetha Wang, Shuihua Zhang, Yudong School of Computer Science and Technology Nanjing Normal University NanjingJiangsu210023 China Key Laboratory of Statistical Information Technology & Data Mining State Statistics Bureau ChengduSichuan610225 China School of Computer and Information Engineering Henan Normal University XinxiangHenan453000 China School of Electronic Information Shanghai Dianji University Shanghai200240 China Key Laboratory of Symbolic Computation & Knowledge Engineering of Ministry of Education Jilin University ChangchunJilin130012 China Guangxi Key Laboratory of Manufacturing System & Advanced Manufacturing Technology GuilinGuangxi541004 China School of Natural Sciences and Mathematics Shepherd University ShepherdstownWV25443 United States West Virginia School of Osteopathic Medicine 400 N Lee St LewisburgWV24901 United States Department of Electrical Engineering The City College of New York CUNY New YorkNY10031 United States State Key Lab of CAD & CG Zhejiang University HangzhouZhejiang310027 China Manchester Metropolitan University ManchesterM156BH United Kingdom

ISBN: (纸本)9789811037696

With the aim of resolving the issue of cluster analysis more precisely and validly, a new approach was proposed based on biogeography-based optimization (abbreviated as BBO) algorithm. (Method) First, we reformulated the problem with an optimization model based on the variance ratio criterion (VARAC). Then, BBO was presented to search the optimal solution of the VARAC. There are 400 data of four groups in the experimental dataset, which have the degrees of overlapping of three distinct scales. The first one is nonoverlapping, the second one is partial overlapping, and the last is severely overlapping. BBO algorithm was compared with three different state-of-the-art approaches. We ran every algorithm 20 times. In this experiment, our results demonstrate the maximum VARAC values that can be found by BBO. The conclusion is that BBO is predominant which is extremely quick for the issue of clustering analysis. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Minimum cover set coverage algorithm for achieving low energy in wireless sensor networks

Minimum cover set coverage algorithm for achieving low energ...

引用

2016 4th International Conference on Advanced Materials and Information Technology Processing(AMITP 2016)

作者： AIMIN WANG YINGNAN GAO WENJUAN JIA College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University College of software Jilin University

A minimum cover set coverage algorithm（MCSCA） for pursuing low energy is presented in this paper to prolong the lifetime of wireless sensor networks. The proposed algorithm improves energy efficiency in three aspects. First, when generating cover sets, the selection strategy of the algorithm considers the contributions of sensor nodes, energy variance, and other factors. The algorithm can cover all targets with a few sensor nodes. Second, useless coverage optimization reduces coverage areas without target nodes to save energy. Third, redundant coverage optimization further saves energy by reducing redundant coverage in wireless sensor networks. Compared with similar heuristic algorithms, the proposed MCSCA can extend network lifetime by 11% on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Attribute selection for job shop scheduling problem based on concept lattice

Attribute selection for job shop scheduling problem based on...

引用

第27届中国过程控制会议（CPCC2016）

作者： Wang Zhenjiang Cao Zhengcai Liu MinJilin College of Information Science and Technology Beijing University of Chemical Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education University Department of Automation Tsinghua University

Attribute selection is an effective approach to improve the inference efficiency of data-based schedulingstrategies system and many researchers have studied the attribute selection based on computational intelligence *** computational intelligence methods,concept lattice,an important tool for knowledge extraction andanalysis,has nature advantages in attribute

关键词： Attribute selection for job shop scheduling problem based on concept lattice

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：