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

IEEE Symposium on Web Society, SWS

作者： Xin Sun Yanheng Liu Jian Wang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China Jilin University Changchun Jilin CN

One of the most prevalent security problems in network is the rampant propagation of email worms. Unlike active worms, the email worm has to be activated by user action in order to spread further. This paper deals with modeling email worm propagation by analyzing and combining human factors. Impact of human factors on email worm propagation is investigated and discussed. Results of email worm propagation under a practical simulation environment show that the presented model well describes the email worm behavior. Conclusions are also drawn that infection probability decreases during evolution of worm infection due to the security consciousness rising, and highly connected nodes are more susceptible.

关键词： Human factors Computer worms Network topology Security Electronic mail Educational institutions Computer science Educational technology Laboratories Computer networks

来源：评论

学校读者我要写书评

暂无评论

Ensemble methods for spectral-spatial classification of urban hyperspectral data

Ensemble methods for spectral-spatial classification of urba...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Xin-Lu Wang Björn Waske Jón Atli Benediktsson Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Faculty of Electrical and Computer Engineering University of Iceland Reykjavik Iceland

Classification of hyperspectral data with high spatial resolution from urban areas is investigated. The approach is an extension of existing approaches, using both spectral and spatial information for classification. The spatial information is derived by mathematical morphology and principal components of the hyperspectral data set, generating a set of different morphological profiles. The whole data set is classified by the Random Forest algorithm. However, the computational complexity as well as the increased dimensionality and redundancy of data sets based on morphological profiles are potential drawbacks. Thus, in the presented study, feature selection is applied, using nonparametric weighted feature extraction and the variable importance of the random forests. The proposed approach is applied to ROSIS data from an urban area. The experimental results demonstrate that a feature reduction is useful in terms of accuracy. Moreover, the proposed approach also shows excellent results with a limited training set.

关键词： Hyperspectral imaging Feature extraction Radio frequency Hyperspectral sensors Morphology Remote sensing Data mining Image reconstruction knowledge engineering Spatial resolution

来源：评论

学校读者我要写书评

暂无评论

Heuristics Propositional Extension Rule Method

Heuristics Propositional Extension Rule Method

引用

International Conference on Innovative computing, Information and Control (ICICIC)

作者： Xia Wu Haihong Yu Ying Li College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

Theorem proving based on the extension rule is a new reasoning method. Based on the extension rule algorithm RIER, this paper presents a more efficient algorithm HRIER, which uses the heuristic strategy to guide the choosing of restricted searching space. The experiment results show HRIER improves the efficiency a lot, meanwhile it keeps the essence characteristic of extension rule method, namely it is still potentially a complementary method to resolution based methods.

关键词： Erbium Computer science Mathematics Educational institutions Educational technology Laboratories knowledge engineering Computer science education Control engineering education Frequency

来源：评论

学校读者我要写书评

暂无评论

ON RESEARCH OF OPTIMIZATION STRATEGY FOR DYNAMIC BACKTRACKING

ON RESEARCH OF OPTIMIZATION STRATEGY FOR DYNAMIC BACKTRACKIN...

引用

2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

作者： HONG-BO LI ZHAN-SHAN LI YANG AI HUI-YING DU Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University Changchun 130012 College of Computer Science and Technology Jilin University Changchun 130012

Constraint Satisfaction Problem is an important branch of Artificial Intelligence, one typical algorithm to solve Constraint Satisfaction Problem is the searching algorithm based on backtracking. The Dynamic Backtracking algorithm proposed by Ginsberg in 1993 is an efficient algorithm which uses backtracking integrates with constraint propagation. Now, according to the basic idea of dynamic backtracking, we put forward four implementary strategies and demonstrate that the efficiency and backtracking times of these four strategies are different The most efficient strategy of these four strategies is the Strategy2.1,it can significantly improve the efficiency and reduce the backtracking times. Anatomizing the results of experiments, we find the differences between these four strategies, then we propose an heuristic rules to improve dynamic backtracking algorithm on selecting a variable that has not been instantiated - Successful Assignment Principle. According to the Failure First Principle, we propose an optimization strategy that combine the Successful Assignment Principle with the Failure First Principle - Strategy 2.4. What is more ,the final test results show that efficiency of Strategy 2.4 is 1.595 ～2.227 times more than the that of Strategy 2.1.

关键词： Constraint satisfaction problem Dynamic backtracking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：