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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Expert control system for progress of grinding classification

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2007年第SUPPL.期37卷 45-48页

作者： Zhang, Xiao-Lin Zhao, Hong-Wei Qi, Yi-Ming Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

According to the complex control process of grinding, an expert system for grinding control based on fuzzy control and artificial neural network process was designed. The system integrates compute intelligence, expert system and automatic control technology, relying on powerful development environment. NET, using the advanced object-oriented language C++ and expert system tool CLIPS to develop the system. Under the guidance of expert experience and knowledge, the system has high accuracy control and run flexible stability. In the mean time it has strong adaptability and self-learning capability.

关键词： Fuzzy control

来源：评论

学校读者我要写书评

暂无评论

Constraint solving algorithm for semi on-line scheduling problem

引用

Zidonghua Xuebao/Acta Automatica Sinica 2007年第7期33卷 765-767页

作者： Zhang, Ju-Yang Sun, Ji-Gui Yang, Qing-Yun College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Changchun 130012 China

Most of real-life scheduling problems are semi online. Recently, how to solve such dynamic problems is a hot topic in the research of artificial intelligence. The semi on-line scheduling is introduced and the constraint models are analyzed and categorized. By defining the relevant concept of monotony about constraints that appear in general dynamic constraint models, a kind of constraint extending is formalized. Based on this dynamic constraint modeling, a sound dynamic constraint solving algorithm is designed to deal with the scheduling problems. Finally, an application example of semi on-line discrete resource scheduling problems is given. Experiments show that the algorithm is valid.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Logical exception handling method in agent communication

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2007年第3期44卷 427-433页

作者： Bai, Yan Liu, Dayou College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

In an open multi-agent of dynamic network environment, different mobile agents hope to carry on the communication for the problem of a certain domain. There is a need to avoid appearance of logical exception phenomenon, and the term in this domain must be made to obtain consistency. A layer ontology services communication model named LOSCM is proposed in this paper. LOSCM has two primary advantages. First, it fully takes into account the factors that affect the communication, and using ontology can be represented in agent's knowledge base. Second, provided ontology does not belong to the public data source or have public ontologies, according to the concept loss degree and the concept related degree, LOSCM establishes a layering algorithm, which is able to avoid logical exception handling policies, ensure the right understanding of communication entity concept, and resolve the consistency problem of concept translation. It is shown by experiments that LOSCM is superior to other methods, and can effectively improve the communication consistency of a mobile agent system under certain conditions.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

Clause learning algorithm based on template

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2007年第11期35卷 2140-2145页

作者： Yu, Peng Liu, Da-You Qi, Hong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

For the larger search space when learning clause in Inductive Logic Programming, we defined the clause template. Firstly, we learn the clause templates by Genetic Algorithm, and then convert it to the requisite clauses by combining tag matrix and information gain sampling. We designed the corresponding fitness function and genetic operators. Theoretical analysis and experiment comparison show that this algorithm can reduce the search space, improve the search efficiency and can learn recursion clause. It is an effective clause learning algorithm.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Mini-conflict repair based algorithm for solving dynamic constraint satisfaction problems

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2007年第12期44卷 2078-2084页

作者： Sun, Jigui Gao, Jian Zhang, Yonggang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Constraint satisfaction problems (CSPs) is an important research branch in artificial intelligence. Recently, dynamic CSP is proposed as a powerful tool for solving many real-world problems on dynamic environments. As a result, several algorithms to solve dynamic CSPs are presented. Among those algorithms, local change (LC) algorithm based on solution reuse strategy is a method for solving many kinds of dynamic CSPs and efficient for flexible planning. On the basis of LC algorithm which is widely used, the tabu search strategy is integrated and a mini-conflict repair based algorithm is proposed, which is called Tabu_LC. The improved algorithm considers all the conflict variables as a whole, and then solves the sub-problems with branch and bound algorithm to find the best neighbor assignment, which improves the efficiency markedly. Furthermore, the Tabu_LC algorithm is implemented in the framework of constraint solving system Ming-yue 1.0, and compared with the LC algorithm using large amount of random CSPs. The experiment indicates that the improved algorithm has overwhelmed the LC algorithm on both the efficiency and quality of solutions.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Force-Based Incremental Algorithm for Mining Community Structure in Dynamic Network

引用

Journal of Computer Science & Technology 2006年第3期21卷 393-400页

作者：杨博刘大有 College of Computer Science and Technology & Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P.R. China

Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.

关键词： incremental algorithm community structure dynamic network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：