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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on Trust Prediction from a Sociological Perspective

引用

Journal of Computer Science & Technology 2015年第4期30卷 843-858页

作者：王英王鑫左万利 College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China School of Computer Technology and Engineering Changehun Institute of Technology Changchun 130012 China

Trust, as a major part of human interactions, plays an important role in helping users collect reliable infor-mation and make decisions. However, in reality, user-specified trust relations are often very sparse and follow a power law distribution; hence inferring unknown trust relations attracts increasing attention in recent years. Social theories are frameworks of empirical evidence used to study and interpret social phenomena from a sociological perspective, while social networks reflect the correlations of users in real world; hence, making the principle, rules, ideas and methods of social theories into the analysis of social networks brings new opportunities for trust prediction. In this paper, we investigate how to exploit homophily and social status in trust prediction by modeling social theories. We first give several methods to compute homophily coe？cient and status coe？cient, then provide a principled way to model trust prediction mathe-matically, and propose a novel framework, hsTrust, which incorporates homophily theory and status theory. Experimental results on real-world datasets demonstrate the effectiveness of the proposed framework. Further experiments are conducted to understand the importance of homophily theory and status theory in trust prediction.

关键词： trust prediction homophily coefficient status coefficient social theory matrix factorization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：