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

2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

作者： PENG YU DA-YOU LIU College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Uni

Aiming at the larger search space of learning clause in Inductive Logic Programming, we put forward the definitions of the predicate template and the clause template to reduce search *** suggest IMPI algorithm, which is a genetic algorithm combining immune mechanism and uses the clause template as genetic code to learn the clause template of required *** uses immune mechanism to invent new predicates, which can extend the hypothesis language, find better *** we design when to invent *** obtaining the clause template, we use a general method based on generalization and information gain sampling to convert clause template to *** design the corresponding fitness function and genetic *** indicates that this algorithm can reduce the search space, improve the efficiency of search algorithm and can learn recursion clause by theoretical analysis and experiment *** is an effective clause learning algorithm.

关键词： Inductive logic programming Clause template Immune mechanism Recursion clause Information gain Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A NEW TECHNIQUE FOR RAY TRACING POINT-BASED GEOMETRY

A NEW TECHNIQUE FOR RAY TRACING POINT-BASED GEOMETRY

引用

2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

作者： YONG QUAN ZHEN-HUA ZHANG WEN-HUI LI WEI LIU Computer Graphics Laboratory College of Computer Science and Technology Jilin University Qianwei Road Changchun 130012 P.R.China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education

In this paper a new technique for ray tracing point-based models is *** approach offers a higher ray tracing speed in comparison with previous *** pre-process, we add an important attribute to each point for the purpose of ray *** rendering, an algorithm of intersecting a ray with point geometry is demonstrated to get satisfied *** approach makes it possible to render high quality ray traced images with global *** performs well especially in the way of boundary *** have tested our idea for shadows, reflection and refraction.

关键词： Points Neighbor radius Ray tracing Intersection algorithm Boundary representation

来源：评论

学校读者我要写书评

暂无评论

Translating PDDL Tasks into Multi-valued Conformant Planning Tasks

Translating PDDL Tasks into Multi-valued Conformant Planning...

引用

International Conference on Fuzzy Systems and knowledge Discovery (FSKD)

作者： Jingjing Zhao Jigui Sun Minghao Yin College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Business Administration Changchun University of Technology China

In this paper, we formally define the problem of conformant planning with multi-valued state variables, namely multi-valued conformant planning task (MCPT), and present an algorithm for transforming conformant planning problems specified in Planning Domain Definition Language (PDDL) into MCPTs. The algorithm can deal with the uncertainties of initial conditions and disjunctive goals according to two important relaxed conditions.

关键词： Technology planning Uncertainty Educational institutions Educational technology State-space methods Computer science Laboratories knowledge engineering Computer science education Path planning

来源：评论

学校读者我要写书评

暂无评论

3D reconstruction using particle swarm optimization

引用

Journal of computational Information Systems 2007年第2期3卷 541-547页

作者： Li, Wenhui Han, Dongfeng Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

A new 3D reconstruction algorithm based on particle swarm optimization (PSO) is proposed. This is the first time to introduce PSO to the multi-views problem. The proposed algorithm designs a scheme to represent the 3D parameters using a particle. Then the PSO algorithm is used to search the solution space and optimizes the fitness function. Finally, the algorithm can efficiently get the correct solution with less time and less complexity. Additionally, some details of implement are discussed which influence the performance of the algorithm. Experiments and comparisons are given in real data. The accuracy of the recovered solution is compared to the existing algorithms and outperformed them.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Region-based image retrieval using graph-cuts and global/local features

引用

Journal of Harbin Institute of Technology (New Series) 2007年第SUPPL. 2期14卷 68-71页

作者： Li, Wenhui Han, Dongfeng Zhang, Zhenhua Guo, Wu Wang, Yi Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

This paper describes a region-based retrieval system based on graph-cuts and global/local feature. We also use dynamic partial function (DPF), indexing by locality sensitive hashing (LSH) and learning feedback for improving system performance. Such a system is useful for finding a sub-object from a large image database. In order to obtain the sub-object from a sample image, we propose an efficient graph-cuts segmentation method to cut out the object. The system utilizes the segmentation results to capture the higher-level concept of images and gets a stable and accurate result. Also the feedback method is efficient. Experimental and comparison results, which are performed using a general purpose database containing 5,000 images, are encouraging.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

SVM classifier-guided for domain-specific resource discovery based on HTML tag tree

引用

Journal of computational Information Systems 2007年第3期3卷 981-986页

作者： Peng, Tao Zuo, Wanli Zhang, Changli Wang, Dong Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

In designing a focused crawler, the choice of strategy for prioritizing unvisited URLs is vital. The text surrounding a link or the link context on the HMTL page is a good summary of the target page. This paper investigates some alternative methods and advocates that the link-context derived from reference page's HTML tag tree can provide a wealth of illumination for domain-specific web resource discovery guided by SVM classifier with uneven margins, which is particularly helpful for small training datasets. Little work has been done to utilize the beneficial link context information about the seed URLs. In order that crawler can acquire enough illumination from link-context, we initially look for some referring pages by traversing backward from seed URLs. The method collects this kind of resources beforehand and then uses it to steer resource discovery. A comprehensive experiment has been conducted using multiple crawls over 10 topics covering thousands of pages allowing us to derive statistically strong results.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Anomaly Intrusion Detection Methods for Peer-to-Peer System

Anomaly Intrusion Detection Methods for Peer-to-Peer System

引用

IFIP International Conference on Network and Parallel Computing Workshops (NPC Workshops)

作者： Daxin Tian Yanheng Liu Bin Li College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China College of Mathematics Science Jilin University Changchun China

Peer-to-peer systems and applications are the hotspot of research of network applications. As peer-to-peer system has no central system and is deployed on an open network, new concerns regarding security have been raised. As an additional security measure, the intrusion detection system would help determine whether unauthorized users are attempting to access, have already accessed, or have compromised the network Intrusion detection, as the second line of defense, is an indispensable tool for highly survivable networks. In this paper two anomaly intrusion detection methods are proposed for peer-to-peer system. The main characters of the methods are that they can detect intrusion in real-time without any expert knowledge and attack signatures. One method uses hidden Markov model to check reflector DoS attacks, another based on adaptive resonance theory, which can learn the normal behavior with unsupervised method. The experimental P2P system is built on FreePastry 1.401 and JDK 1.5.0. The results have indicated that the methods can find DoS attacks immediately and find new intruders with low false alarm rate.

关键词： Intrusion detection Peer to peer computing Computer crime Hidden Markov models Resonance Protection Communication system security Educational institutions Application software Authentication

来源：评论

学校读者我要写书评

暂无评论

An improved ant colony optimization algorithm based on route optimization and its applications in travelling salesman problem

An improved ant colony optimization algorithm based on route...

引用

7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE

作者： Zhang, Yi Pei, Zhi-Li Yang, Jin-Hui Liang, Yan-Chun College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Department of Computer Science Jilin Business and Technology College College of Mathematics and Computer Science Inner Mongolia University for Nationalities

ISBN: (纸本)1424415098

In this paper, we introduce two improvements on Ant Colony Optimization (ACO) algorithm: route optimization and individual variation. The first is an optimized implementation of ACO, by which the running time of ants routing is largely reduced. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the ACO but also surpasses existing algorithms in performance in solving large-scale TSP problems. In the second improvement, we introduce individual variation to ACO, by which the ants have different routing strategies. Simulation results show that the speed of convergence of ACO algorithm could be enhanced greatly. ©2007 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Making FF Faster in ADL Domains

Making FF Faster in ADL Domains

引用

International Conference on Natural computation (ICNC)

作者： Dunbo Cai Jigui Sun Minghao Yin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China School of Computer Science Northeast Normal University Changchun Jilin China

The fast-forward planning system (FF), which obtains heuristics via a relaxed planning graph to guide the enforced hill-climbing search strategy, has shown excellent performance in most STRIPS domains. When it comes to ADL domains, FF handles actions with conditional effects in a way similar to factored expansion. The result is that enforced hill-climbing guided by the relaxed Graphplan always fails in some ADL domains. We have discovered that the reason behind this issue is the relaxed Graphplan's inability to handle relationships between actions' components. We propose a novel approach called delayed partly reasoning on a naive conditional-effects planning graph (DP-CEPG). We do not ignore action's delete effects and consider restricted induced component mutual exclusions between factored expanded actions. Preliminary results show that enforced hill-climbing while guided by DP-CEPG gains obvious improvements in most ADL problems in terms of both solution length and runtime.

关键词： Computer science Strategic planning Technology planning Strips State estimation Educational institutions Educational technology Laboratories knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

A Prototype of Semantic-Based Intelligent Search Engine for Chinese Documents

A Prototype of Semantic-Based Intelligent Search Engine for ...

引用

International Conference on Fuzzy Systems and knowledge Discovery (FSKD)

作者： Haiyan Che Jigui Sun Tao Jing Xi Bai Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University College of Computer Science and Technology Jilin University Changchun China Jilin University Changchun Jilin CN

To overcome the shortcomings of traditional search engines, advocates a prototype of semantic-based search engine, called CRAB. By combining technologies of semantic Web, information extraction (IE), natural language processing (NLP) and a novel theme-based method, this framework can extract factual knowledge from Chinese natural language documents automatically. Instead of list of document links, results of user's query request returned from CRAB are semantically coherent reports generated intelligently, which can satisfy users greatly.

关键词： Prototypes Search engines Data mining Ontologies Educational institutions Computer science Educational technology Web pages Laboratories knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：