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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A method of combining SE-tree to compute all minimal hitting sets

引用

Progress in Natural Science:Materials International 2006年第2期16卷 169-174页

作者： ZHAO Xiangfu and OUYANG Dantong (School of Computer Science and Technology, Jilin University, Changchun 130012, China key laboratory of symbolic computation and knowledge engineering of Ministry of Education, Changchun 130012, China) School of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China

In model-based diagnosis, the candidate diagnostic results are generally characterized by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to judge a hitting set by the number of conflict sets corresponding to components, and the computing procedure is formalized by combining revised SE-tree (set enumeration tree) with closed nodes to generate all minimal hitting sets. Results show that because closed nodes are added into SE-tree, the search efficiency is highly improved. Furthermore, the proposed method is easy to be understood and implemented. Compared with other effective algorithms with completeness in some experimental tests, the diagnosis efficiency of our proposed method is higher, particularly for single- and double-fault diagnosis.

关键词： model-based diagnosis conflict set minimal hitting set set enumeration tree.

来源：评论

学校读者我要写书评

暂无评论

Research of mobile IPv6 application based on diameter protocol

Research of mobile IPv6 application based on diameter protoc...

引用

First International Multi- Symposiums on Computer and computational Sciences, IMSCCS'06

作者： Da, Wei Yanheng, Liu Xuegang, Yu Xiaodong, Li Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education China

ISBN: (纸本)0769525814

The Diameter protocol is recommended by IETF as AAA (Authentication, Authorization and Accounting) protocol criterion for the next generation network, Because the IPv6 protocol will be widely applied in the intending all-IP network, mobile IPv6 application based on Diameter protocol will play more important role in authentication, authorization and accounting. In this paper, the implementation of mobile node's authentication and authorization is presented with PANA (Protocol for carrying Authentication for Network Access) protocol. It is based on Diameter protocol for the application expansion of mobile IPv6, which provides the supports to the basic AAA process of mobile IPv6 nodes and dynamic Home Agent distribution in the visited network and the secret key distribution. Finally, the correctness of this application expansion is testified with developing the design of protocol based on OpenDiameter. © 2006 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Design for network camera based on DSP

Design for network camera based on DSP

引用

2006 International Conference on Hybrid Information Technology, ICHIT 2006

作者： Zhezhou, Yu Yuchen, Xie Congying, Lv Chunguang, Zhou Faner, Meng Lei, Liu Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769526748

The hardware design of the DSP-based network camera is described in this paper which includes the implementation of CCD camera, DSP, Flash, SDRAM, CPLD, and Ethernet. The program of JPEG2000has been tested on the designed board and the result turns out to be good. It'll be implemented as a network camera with real-time video compression and transmission which can be connected to the Ethernet. © 2006 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Extracting initial and reliable negative documents to enhance classification performance 1

引用

PAKDD 2006 International Workshop on knowledge Discovery in Life Science Literature, KDLL 2006

作者： Wang, Hui Zuo, Wanli Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (数字)9783540328100

ISBN: (纸本)3540328092

Most existing text classification work assumes that training data are completely labeled. In real life, some information retrieval problems can only be described as learning a binary classifier from a set of incompletely labeled examples, where a small set of labeled positive examples and a very large set of unlabeled ones are provided. In this case, all of the traditional text classification methods can't work properly. In this paper, we propose a method called Weighted Voting Classifier, which is an improved 1-DNF algorithm. Experimental results on the Reuters-21578 set show that our algorithm Weighting Voting Classifier outperforms PEBL and one-class SVM in terms of F measure. Weighting Voting Classifier can achieve high F score when comparing with PEBL and one-class SVM. Furthermore, the reduction of iterations is 2.26 when comparing the method of PEBL with ours. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Experimental study of the three key issues of multi-auctioneer model in computer grid

Experimental study of the three key issues of multi-auctione...

引用

18th IASTED International Conference on Parallel and Distributed Computing and Systems

作者： Han, Xiao Fang, Zhiyi Wang, Wanyu Xu, Fengyuan Huang, Mengzhou School of Economics and Information Systems School of Computer Science and Technology Key Laboratory Symbolic Computation and Knowledge Engineering Education Ministry

ISBN: (纸本)9780889866386

By means of introducing multi-auctioneer model, resources in the computational economic grid can be managed and allocated like in the auction. We research and put forward the corresponding solve schemes of three key issues of auctioneer system: preventing auctioneer from cheating, selection of auctioneer, setting of trading prices, and use computational grid modeling and simulation tools GridSim to simulate computational grid environment in the experiment which uses multiauctioneer system to manage and schedule, then we analyze the results of experiment in different conditions, and validate the feasibility of a multi-auctioneer system in computational grid.

关键词： computational economic grid multi-auction system election of auctioneer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：