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

International Workshop on Knowledge Discovery and Data Mining (WKDD)

作者： Ken Chen Fei Yu Cheng Xu Yan Liu School of Computer &Information Engineering Hunan Agricultural University Changsha China College of Computer & Communication Hunan University Changsha China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University Suzhou China

This paper firstly analyzed the front pattern matching algorithm of intrusion detection system, and improved on the pattern matching algorithm. Having immediately analyzed Rete algorithm and aimed at its shortage, the paper introduced the FRete net algorithm on the basis of Rete net algorithm constituting an inference machine based on FRete matching algorithm, which could infer logical suspicious facts. Then the authors discussed and designed an intrusion detection system based on high-speed networks, and finally established a simulation and experiment platform to test the performance of IDS.

关键词： Intrusion detection High-speed networks Inference algorithms computer networks Data security Pattern matching Algorithm design and analysis computer architecture Protection Data mining

来源：评论

学校读者我要写书评

暂无评论

Dynamic layered-graph model for routing in cognitive radio network

Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of ...

引用

Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of Science and technology (Natural Science Edition) 2008年第6期9卷 586-590页

作者： Li, Yang Dong, Yu-Ning Zhao, Hai-Tao College of Communication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu Provincial Key Lab. of Computer Information Processing Technology Soochow University Suzhou 215006 China

To analyze routing protocol in cognitive radio(CR) networks effectively, a dynamic routing model is necessary. Dynamic layered graphic(DG) was proposed aiming at the characteristic of dynamic spectrum access in CR networks. In DG model, nodes were split into many sub-nodes, and each sub-node state could denote whether the related channel was availab.e or *** DG model, sub-node state was taken as a stochastic process and the model of cognitive radio network's dynamic topology was set up by analyzing the dynamic characteristic of sub-node state. Simulation results show that in the aspect of the adaptability to CR network's variable SOP and depiction of the topology, the DG model outperforms the layered graph(LG) model, and can adapt well to CR networks environment.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

On automatic classification for agricultural products web pages in chinese based on LVQ network and ontology

引用

Journal of Computational information Systems 2008年第3期4卷 971-976页

作者： Wang, Chuanyi Fu, Zetian Zhang, Jian Hu, Liang Wang, Feng Zhang, Xiaoshuan China Agricultural University Beijing 100083 China Key Laboratory for Modern Precision Agriculture System Integration China Agricultural University Beijing 100083 China Beijing Information S and T University Beijing 100000 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University Suzhou 215000 China

The user often retrieves few anticipated results when searching information in Internet via generalized search engine due that the web pages also exist the synonymous and ambiguous characteristic. How to classify the webpage is the key point to construct vertical search engine, which is known as solution for the problems. This paper proposes a conceptual framework based on Learning Vector Quantization (LVQ) network and Ontology to automatic classification for the webpage from agricultural website. System test shows that the framework can automatically classify Chinese agricultural products web pages and perfectly resolve the synonymous problem.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm of pattern matching for information security audit system

引用

Journal of Computational information Systems 2008年第5期4卷 2221-2228页

作者： Ding, Lei Yu, Fei Xu, Cheng Yue, Guangxue School of Physics Science and Information Engineering Jishou University Jishou 416000 China Provincial Key Lab. of Image Processing and Imagecom Communication Nanjing University of Post and Telecommunications Nanjing 210003 China College of Computer and Communication Hunan University Changsha 410082 China

At present, network information audit system is almost based on text information filtering. Text categorization is the basic technology of text information filtering. Pattern matching algorithms are very important for the rule based information audit system. It directly influences the accuracy and real-time performance of the system. The KMP and BM algorithms are introduced in this paper. Research is carried out to improve the BM algorithm and a better BM algorithm is proposed According to the situation that the system characters group is bigger and that characters of the pat tern are less, the thesis puts forward an improved string-matching algorithm. The results of our experiments prove that it promotes the precision of text categorization. © 2008 Binary information Press.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Towards termination criteria of ant colony optimization

Towards termination criteria of ant colony optimization

引用

3rd International Conference on Natural Computation, ICNC 2007

作者： Lv, Qiang Xia, Oyan School of Computer Science and Technology Suzhou University Suzhou Jiangsu 215006 China Provincial Key Lab. for Computer Information Processing Technology Suzhou Jiangsu 215006 China

ISBN: (纸本)0769528759

Ant colony optimization (ACO for short) has been proved a successful meta-heuristic by a huge of empirical studies. This paper discusses the termination criteria of ACO and therefore provides research ideas to other meta-heuristics. A general discussion about four types of termination criteria has been firstly discussed in this article. Then some measures of convergence based on pheromone have been introduced. And a new termination criterion based on Bayesian approach is presented. Finally a new convergence proof for a class of ACO algorithms is presented. © 2007 IEEE.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

An access control model in lager-scale P2P file sharing systems

An access control model in lager-scale P2P file sharing syst...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Yue Guang-xue Yu Fei Chen Li-ping Chen Yi-jun College of Information Engineering Jiaxing University 314000 China Department of Computer Science and Technology Huaihua University 418000 China State Key Lab. for Novel Software Technology Nanjing University 210093 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University 2150063 China

ISBN: (纸本)9783540725893

In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm for pareto optimum-based route selection

引用

Journal of Systems Engineering and Electronics 2007年第2期18卷 360-368页

作者： Cui Xunxue Li Qin Tao Qing New Star Research Inst. of Applied Technology Hefei 230031 P. R. China Jiangsu Key Lab of Computer Information Processing Technology Soochow Univ. Suzhou 215006 P. R. China

A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.

关键词： Route selection Multiobjective optimization Pareto optimum Multi-constrained path Genetic algorithm.

来源：评论

学校读者我要写书评

暂无评论

Content-based image retrieval using fuzzy hamming distance

Content-based image retrieval using fuzzy hamming distance

引用

2007 8th International Conference on Electronic Measurement and Instruments, ICEMI

作者： Hu, Xuelong Yang, Li Zhang, Gensheng School of Information Engineering Yangzhou University Yangzhou 225009 China Jiangsu Province Key Lab. for Image Processing and Communication Nanjing University of Post and Telecommunications Nanjing 215006 China Jiangsu Province Key Lab. for Computer Information Processing Technology Suzhou University Suzhou 215006 China

ISBN: (纸本)1424411351

This paper addresses an effective issue of content-based image retrieval (CBIR) by presenting Fuzzy Hamming Distance (FHD). Firstly, the theory of FHD is introduced, which includes degree of difference and cardinality of the fuzzy set, and then follows defuzzification of FHD which is used as a fuzzy similarity measure. In the experiment, the image retrieval results show this method can be employed to capture implicitly some semantic contents of the image in addition to other features such as color, texture and shape. Finally, an implemented prototype system demonstrates a promising retrieval performance for a test database, as compared with FUZZYCLUB system. © 2007 IEEE.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

A new method for semi-automatic image annotation

A new method for semi-automatic image annotation

引用

2007 8th International Conference on Electronic Measurement and Instruments, ICEMI

作者： Xuelong, Hu Yuhui, Zhang Li, Yang School of Information Engineering Yangzhou University Yangzhou 225009 China Jiangsu Province Key Lab. of Image Processing and Communication Nanjing University of Post and Telecommunications Nanjing 215006 China Jiangsu Province Key Lab. of Computer Information Processing Technology Suzhou University Suzhou 215006 China

ISBN: (纸本)1424411351

Semantic-based image retrieval bridges the gap between visual features and human understanding of image in the field of image retrieval. Image annotation is one important technology of image retrieval based on the semantic. This paper proposed one method to realize semi-automatic image annotation with the tool Support Vector Machine (SVM). The image collection was divided into two parts, one for manual annotation and the other for testing. After being classified by SVM, the output was changed into a probability, and K-NN algorithm was applied to get the keywords for unlab.led images. The experiments show that the approach is feasible. © 2007 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

ADJSA: An adaptable dynamic job scheduling approach based on historical information 2

ADJSA: An adaptable dynamic job scheduling approach based on...

引用

2nd International Conference on Scalab.e information Systems, InfoScale 2007

作者： Xu, Lan Zhu, Qiao-Ming Gong, Zhengxian Li, Pei-Feng School of Computer Science and Technology Soochow University Suzhou215006 China Key Lab of Computer Information Processing Technology of Jiangsu Province Suzhou215006 China

ISBN: (纸本)9781595937575

Currently, there are many researches focusing on grid scheduling and more and more scheduling algorithms were proposed. However, those algorithms are not satisfied with the requirement of the grid for ignoring its characteristics of dynamics, autonomy, distributing, etc. Therefore, this paper proposes an adaptable dynamic job scheduling approach based on historical information (ADJSA). This approach adjusts the predicting model automatically by using the recent jobs execution historical information and then selects the appropriate resource to execute the job considering dynamic and real-time factors of the Grid.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：