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

International Conference on Machine Vision and Human-Machine Interface (MVHI)

作者： Ye Tian Dayou Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

Particle swarm optimization (PSO) algorithm is a robust and efficient approach for solving complex real-world problems. In this paper, a modified particle swarm algorithm (IMPSO) is introduced for unconstrained global optimization. The whole swarm is partitioned to three different sub-populations according to their fitness, and different velocity updating strategies are used to different sub-populations. Besides, we take advantage of crossover to maintain the diversity of the swarm and avoid getting into local optimum. IMPSO are extensively compared with other two modified PSO algorithms on three well-known benchmark functions with different dimensions. Experimental results show that IMPSO achieves not only better solutions but also faster convergence.

关键词： Particle swarm optimization Partitioning algorithms Educational institutions Marine animals Birds Testing Machine vision Man machine systems Computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Modeling Direction Relations Between Uncertain Regions

A Novel Approach for Modeling Direction Relations Between Un...

引用

International Conference on Machine Vision and Human-Machine Interface (MVHI)

作者： Yiqun Dong Dayou Liu Fang Wang Ye Tian Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

Conventional models based on crisp regions can not deal with the Direction Relations between Uncertain Regions (DRUR). Using broad boundary to represent the uncertain boundary, a novel approach is proposed based on model SK for modeling DRUR in this paper. DRUR are described as the combinations of basic cardinal direction relations, then we study the composition of DRUR, and a method is put forward for calculating this composition.

关键词： Uncertainty Tiles Machine vision Man machine systems Educational institutions Computer science Educational technology Laboratories Computer interfaces Computer vision

来源：评论

学校读者我要写书评

暂无评论

Solving SAT Problem with Boolean Algebra

Solving SAT Problem with Boolean Algebra

引用

Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST)

作者： Youjun Xu Dantong Ouyang Yuxin Ye Jialiang He Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

The satisfiability (SAT) problem is an important problem of automated reasoning. In the past decades, many methods of SAT are proposed, such as method based on resolution, method based on tableau and method based on extension rule. Based on the study of extension rule, we find that the SAT problem can be solved with hitting set algorithms. If we can find a hitting set of a clause set, and if there is not any pair of complementary literals in the hitting set, the clause set is satisfiable. Algorithm BHS based on Boolean algebra proposed by Jiang is an efficient hitting set algorithm. SSBF proposed in this paper is a revised algorithm of BHS that can be used to judge the satisfiability of a clause set. The test result shows that SSBF is an efficient algorithm.

关键词： Algorithm design and analysis Boolean algebra Cognition Atomic measurements Computers Computer science

来源：评论

学校读者我要写书评

暂无评论

A modal representation of RCC62

A modal representation of RCC62

引用

International Conference on Computer Sciences and Convergence Information Technology (ICCIT)

作者： Qian Fu Ji-hong Ouyang Da-you Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

The major problem in developing a useful formalism for reasoning about spatial information is the trade off between expressive power and computational tractability. Based on Bennett's modal representation of convex-hull and the RCC62 model which describes the topological relation between simple concave regions, the modal representation of RCC62 is presented in this paper, which has a theoretical advantage over 1st-order representations.

关键词： Cognition Calculus computational modeling Encoding knowledge engineering Laboratories

来源：评论

学校读者我要写书评

暂无评论

Ontology based automatic attributes extracting and queries translating for deep web

Journal of Software

引用

Journal of Software 2010年第7期5卷 713-720页

作者： Liang, Hao Ren, Fei Zuo, Wanli He, Fengling College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China China Development Bank Center of Operations Beijing 100037 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China

Search engines and web crawlers can not access the Deep Web directly. The workable way to access the hidden database is through query interfaces. Automatic extracting attributes from query interfaces and translating queries is a solvable way for addressing the current limitations in accessing Deep Web. However, the query interface provides semantic constraints, some attributes are co-occurred and the others are exclusive sometimes. To generate a valid query, we have to reconcile the key attributes and semantic relation between them. We design a framework to automatically extract attributes from query interfaces taking full advantage of instances information and enrich the attribute sets embedded in the semantic query interface by Ontology technique. Each attribute is extended into a candidate attribute expressed by a hierarchy tree and describes the semantic relation of the attributes. We carry out our experiments in the real-world domain and results showed the validation of query translation framework. © 2010 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Improving Incremental Diagnosis with Choosing Measurement Order

Improving Incremental Diagnosis with Choosing Measurement Or...

引用

2010 International Conference of Informationa Science and Management engineering(2010年信息科学与管理工程国际学术会议 ISME 2010)

作者： Xiangfu Zhao Dantong Ouyang College of Mathematics Physical and Information Engineering Zhejiang Normal University Jinhua China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Univ

There may be many groups of candidate results after the step of candidate generation in model-based diagnosis. Hwee Tou Ng proposed the Inc-Diagnose approach to further reduce the candidate results. However, the efficiency of Inc-Diagnose may not be very good. Firstly, we give some correction of IncDiagnosis by applying it to a real example. Then, we propose an improved approach with choosing the order of measurements for incremental diagnosis. Example results show that our approach has better efficiency.

关键词： model-based diagnosis measurement order incremental diagnosis

来源：评论

学校读者我要写书评

暂无评论

Solving SAT Problem with a Revised Hitting Set Algorithm

Solving SAT Problem with a Revised Hitting Set Algorithm

引用

The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

作者： Youjun Xu Dantong Ouyang Yuxin Ye Jialiang He College of Computer Science and Technology Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun China

ISBN: (纸本)9781424458219;9781424458240

The satisfiability(SAT) problem is a core problem of artificial intelligence. Research findings in SAT are widely used in many areas. The main methods solving SAT problem are resolution principle, tableau calculus and extension rule. Besides methods mentioned above, we find that the SAT problem can be solved with hitting set algorithms. If a set of clause is satisfiable, there must be a hitting set of the clause set which containing no complementary pairs of literals. Algorithm NEYVHS-tree is an efficient hitting set algorithm proposed by Ouyang. RNHST proposed in this paper is a revised algorithm in respect of ***-tree. It judges the satisfiability of a clause set by confirming the existence of the set's hitting set without complementary pairs of literals. The test result shows that RNHST is an efficient algorithm.

关键词： satisfiability problem hitting set minimal hitting set extension rule NEWHS-tree

来源：评论

学校读者我要写书评

暂无评论

A diversity-guided heuristic-based genetic algorithm for triangulation of Bayesian networks

A diversity-guided heuristic-based genetic algorithm for tri...

引用

International Conference on Networked Computing and Advanced Information Management (NCM)

作者： Xuchu Dong Haihong Yu Dantong Ouyang Yuxin Ye Yonggang Zhang Department of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun Jilin China

ISBN: (纸本)9781424476718

For the optimization problem about triangulation of Bayesian networks, a novel genetic algorithm, DHGA, is proposed in this paper. DHGA employs a heuristic-based mutation operation. Moreover, it uses population diversity to identify stagnation and convergence as well as to guide the search procedure. Experiments on representative benchmarks show that DHGA posses better performance and robustness than other swarm intelligence methods.

关键词： Bayesian methods

来源：评论

学校读者我要写书评

暂无评论

key Value Ordering Heuristic for Solving Algorithm Based on the AC-4 Algorithm

Key Value Ordering Heuristic for Solving Algorithm Based on ...

引用

2010 International Conference on Computer,Mechatronics,Control and Electronic engineering(2010计算机、机电、控制与电子工程国际会议 CMCE 2010)

作者： Zhan-shan Li Hai-jiao Shen Hui-ying Du Zi-wen Wang School of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University ChangchunChina

ISBN: (纸本)9781424479573

We have studied the AC-4 algorithm and then present key value ordering heuristic forming the new solving algorithm BT-KVV, which is based on the AC-4 algorithm. This algorithm takes full advantage of the state information of the data structure used in the AC-4 algorithm after the process of arc consistency. The algorithm sorts the values of the variables' domain according to the key importance of the values. So this order forces the solving algorithm to give priority to extend the key values of variables. In this way, the efficiency of the solving algorithm can be improved a lot. The result of our experiments shows that our algorithm has much more advantage over other solving algorithms.

关键词： arc consistency AC-4 value ordering heuristic solving algorithm key value

来源：评论

学校读者我要写书评

暂无评论

Learning Essential Graph with Immune Co-Evolutionary Algorithm

Learning Essential Graph with Immune Co-Evolutionary Algorit...

引用

2010 International Conference of Informationa Science and Management engineering(2010年信息科学与管理工程国际学术会议 ISME 2010)

作者： Haiyang Jia Juan Chen Dayou Liu College of Computer Science and Technology Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China 130012

Essential graph is a graphical representation for Markov equivalence classes of Bayesian networks. Learning essential graph can avoid some problems in traditional Bayesian networks learning algorithms: (1) the number of illegal structures is exponential, which infect the efficiency of structure learning;(2) comparing the structures in same equivalent class slow down the speed of convergence;(3) if the prior distribution for each structure is equal, the more structures contain in the equivalent class the higher prior probability of the class has. This paper employs two competitive bio-inspired algorithms, immune algorithm and co-evolutionary algorithm, for learning Essential graph. The algorithm combines dependency analysis and search-scoring approach together. Experiments show that the searching space was decreased, compare with prior works, the convergence speed and the efficiency was improved.

关键词： Bayesian network structure learining co-evolutionary algorithm artificial immune system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：