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

Modeling Email Worm Propagation Using Game Theory

Modeling Email Worm Propagation Using Game Theory

The First International Conference on Multimedia Information Networking and Security(第一届国际多媒体网络信息安全会议 MINES 2009)

作者： Xin Sun Yanheng Liu Jian Wang College of Computer Science and Technology Jilin University Changchun Jilin 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China

One of the most prevalent security problems in network is the rampant propagation of email worms. In this paper game theory is suggested as a method for modeling and computing the probabilities of expected behaviors of email users in the email worm propagation process. The game situation models the actions of the email users under the condition that at the time they open an attachment, the system may be infected. Results of email worm propagation simulation under a practical simulation environment show that well camouflaged worms spread more quickly and survive longer than naive worms, moreover, user's security consciousness and the update frequency of anti-virus software make great impact on email worm propagation.

关键词： Netwok security Game theory Email worm propagation User behavior

来源：评论

学校读者我要写书评

暂无评论

A New Framework for Accessing Trusted Network

A New Framework for Accessing Trusted Network

引用

International Workshop on Intelligent Networks and Intelligent Systems (ICINIS)

作者： Jian Wang Yanheng Liu Xiangpeng Jia Xiaomin Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN China Mobile Shenyang Branch Corporation Shenyang China

Trusted network connect (TNC), whose goal is to improve network security from source, now has become hot topic in security domain. We proposed a new access model for the terminals without meeting the requirements in TNC specifications. Also we discussed the work flow and communication process of presented model. Simulations show that the feasibility of the presented model used in the scenario where terminals fall short of network demand can pass the access authentication of network with TNC specifications.

关键词： Authentication Computer networks Protection Computer architecture Computer security Intelligent networks Data security Intrusion detection Access control Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

The Ontology Based Semantic Evaluating Method in LAV

The Ontology Based Semantic Evaluating Method in LAV

引用

Pacific-Asia Conference on Circuits, Communications and Systems, PACCS

作者： Fei Ren Hao Liang Liang Hu Wanli Zuo College of Computer Science and Technology Jilin University Changchun China Department of Information Changchun Taxation College Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

The Web has been dramatically deepened by the deep Web, which the traditional information fusion system shows disability to integrate. The myriad information hidden behind the deep Web attracts the considerable attention from the researchers. The key element in a deep Web information fusion system is the data source modeling problem, which determine the whole technical method of the whole system. The query interfaces provided by the deep Web are the clues to disclose the hidden schemas. But the complicated semantic relationships in the query interfaces lead to the low generality and ability of local as view (LAV) method in the traditional information fusion system. An approach of evaluating the semantic relationships between the attributes in the query interfaces by utilizing WordNet, a typical ontology technique, is presented in this paper. The semantic relationships between semantic related attributes are evaluated by the semantic calculating method of WordNet. The meaningless attributes is instantiated by instance information embedded in the interfaces in order to attach correlated semantic information. The experiment is carried out in the real life domains, and the result shows the efficiency of ontology based semantic evaluating method in LAV.

关键词： Ontologies Databases Educational institutions Computer science Educational technology Search engines Circuits Laboratories knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

Extending the Expression Ability of LAV Using Ontology Technique

Extending the Expression Ability of LAV Using Ontology Techn...

引用

International Conference on Information Technology and Computer Science, ITCS

作者： Hao Liang Fei Ren Wanli Zuo Aiqi Zhang College of Computer Science and Technology Jilin University Changchun China Department of Information Changchun Taxation College Changchun China Engineering of the Ministry of Education Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

Information fusion is an interdisciplinary research field aiming to combine and merge the information or data from different information sources. The output of information fusion system is a global schema through which users can get information or data from different dispersed sources. To generate a deep Web information fusion system is facing many challenges, because the nature of Web is different from those of traditional databases and multi-databases. The major challenge in a deep Web information fusion system is the data source modeling problem, which determine the technical method of the whole system. The query interfaces provided by the deep Web are the clues to disclose the hidden schemas. But the complicated semantic relationships in the query interfaces lead to the lower generality and ability of local as view (LAV) method in the traditional information fusion system. We present an approach that the semantic relationships between semantic related attributes can be evaluated by the WordNet, a kind of ontology instrument. The experiment is carried out on the famous dataset, and the result shows the efficiency of ontology extended LAV of building mappings between local views and mediator schema.

关键词： Ontologies Databases Computer science Educational institutions Educational technology Fusion power generation Information technology Laboratories knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Prediction of Protein Domain Using Distance-Based Maximal Entropy

引用

Journal of Bionic engineering 2008年第3期5卷 215-223页

作者： Shu-xue Zou Yan-xin Huang Yan Wang Chun-guang Zhou Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 P. R. China

Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine （SVM）. The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.

关键词： protein domain boundary SVM imbalanced data learning distance-based maximal entropy

来源：评论

学校读者我要写书评

暂无评论

Hybrid algorithm for flowshop scheduling problem

引用

Zidonghua Xuebao/ Acta Automatica Sinica 2009年第3期35卷 332-336页

作者： Zhang, Chang-Sheng Sun, Ji-Gui Yang, Qing-Yun Zheng, Li-Hui Key Laboratory of Symbol Computation and Knowledge Engineer Jilin University Changchun 130012 China Changchun Institute of Optics Fine Mechanics and Physics Chinese Acad. of Sci. Changchun 130012 China

A hybrid particle and genetic algorithm (HPGA) based on the 'alldifferent' constraint is proposed to solve the flowshop scheduling problem, which combines the particle swarm optimization algorithm, genetic operators, and annealing strategy together. To improve the algorithm's performance further, a neighborhood based local search strategy is proposed and introduced into HPGA. Finally, the HPGA is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The result shows that both the solution quality and the stability of the HPGA precede the other two algorithms. Copyright ©2009 Acta Automatica Sinica. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Novel theorem proving algorithm based on extension rule

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2009年第1期46卷 9-14页

作者： Sun, Jigui Li, Ying Zhu, Xingjun Lu, Shuai College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

ATP (automated theorem proving) has always been one of the most advanced areas of computer science. The traditional idea used in ATP is to try to deduce the empty clause to check satisfiability, such as resolution based theorem proving, which is one of the most popular methods. Extension-rule-based theorem proving is a new resolution-based theorem proving method. After a deep research work on the extension rule, a brilliant property of the rule is obtained. In this paper, the property and an algorithm which is used to decide it are proposed firstly. In addition, the algorithm's time complexity and space complexity are analyzed and proved. Based on the above work, a novel extension rule based theorem proving algorithm called NER is proposed. The NER algorithm transforms the problem which decides whether a clause set is satisfiable to a series of problems deciding whether one literal set includes another one, while the original extension algorithm transforms them to problems counting the number of maximum terms that can be expended. A number of experiments show that the NER algorithm obviously outperforms both the original extension rule based algorithm ER and the directional resolution algorithm DR. Especially, it can be improved up to two orders of magnitude.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

New preprocessing technique based on entirety singleton consistency

引用

Zidonghua Xuebao/ Acta Automatica Sinica 2009年第1期35卷 71-76页

作者： Zhu, Xing-Jun Sun, Ji-Gui Zhang, Yong-Gang Li, Ying College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

This paper studies the technique of preprocessing in constraint satisfaction problem (CSP). Firstly, we propose a notion of entirety singleton consistency (ESC) and the algorithm, and then analyze the time and space complexity and correctness. Based on this, we present a new preprocessing algorithm SAC-ESC based on ESC, and prove its correctness. Furthermore, we use the divide-conquer strategy for the algorithm to automatically adapt to domain partition of various problems. In our experiments on random CSPs, pigeon problems, N-queens problems and benchmarks, the efficiency of our algorithm SAC-ESC is 3-20 times those of the existing SAC-SDS and SAC-3.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Escrow mechanism for personal security keys on IBE

引用

Tongxin Xuebao/Journal on Communications 2009年第11 A期30卷 75-80页

作者： Zou, Yue-Peng Ouyang, Dan-Tong He, Li-Li Bai, Hong-Tao College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

A new escrow mechanism for personal security keys on IBE was proposed. This mechanism constructed a security trust system composed of private key generator, key management center, and user security component to set up a personal security key escrow model, thus providing identity validation, confidentiality and integrality check for the application, backup, recovery, and renewal of the escrowed keys. The mechanism, taking advantage of the IBE, simplified the process of authentication and encryption, mede it possible for users to complete independently the escrow of personal security keys. Therefore, it is more practical than traditional key escrow schemes.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural Science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of Computer Science and Technology, Jilin University, key laboratory of symbol computation and knowledge engineering of the Ministry of Education, Changchun 130012, China b Department of Computer Science, Jilin Technology and Business College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：