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

Web page malicious code detection based on embedded fingerprints

Qinghua Daxue Xuebao/Journal of Tsinghua University 2009年第SUPPL. 2期49卷 2208-2214页

作者： Huang, Jianjun Liang, Bin Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renmin University of China Beijing 100872 China

Web sites have become the main targets of many attackers. Signature-based detection needs to maintain a large signature database and Honeypot based methods are not efficient. Since attackers always make the malicious codes in Web pages difficult to detect by the browser users, their methods can be classified into various fingerprints. Various malicious codes were analyzed to identify 6 types of fingerprints. The system utilizes a spider integrated with script interpretation to fetch target Web pages and extract specific tags for detection by HTML parsing for matching with the fingerprints to detect malicious codes. This method needs fewer fingerprints than traditional detection methods and is more efficient. Results for 60 websites show that the system has a false negative rate of 2.63% and a false positive rate of 1.99%.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Computing Link-Based Similarity in Real World Networks

Efficient Algorithm for Computing Link-Based Similarity in R...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuanzhe Cai Gao Cong Xu Jia Hongyan Liu Jun He Jiaheng Lu Xiaoyong Du Key Laboratories of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Computer Science University of Aalborg Denmark Department of Management Science and Engineering Tsinghua University China

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.

关键词： Computer networks Collaboration data engineering knowledge engineering Computer science Iterative algorithms Filtering data mining Helium Computer science education

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PEJA:Progressive Energy-Efficient Join Processing for Sensor Networks

引用

Journal of Computer Science & Technology 2008年第6期23卷 957-972页

作者：赖永炫陈毅隆陈红 School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education

Sensor networks are widely used in many applications to collaboratively collect information from the physical environment. In these applications, the exploration of the relationship and linkage of sensing data within multiple regions can be naturally expressed by joining tuples in these regions. However, the highly distributed and resource-constraint nature of the network makes join a challenging query. In this paper, we address the problem of processing join query among different regions progressively and energy-efficiently in sensor networks. The proposed algorithm PEJA （Progressive Energy-efficient Join Algorithm） adopts an event-driven strategy to output the joining results as soon as possible, and alleviates the storage shortage problem in the in-network nodes. It also installs filters in the joining regions to prune unmatchable tuples in the early processing phase, saving lots of unnecessary transmissions. Extensive experiments on both synthetic and real world data sets indicate that the PEJA scheme outperforms other join algorithms, and it is effective in reducing the number of transmissions and the delay of query results during the join processing.

关键词： progressive join minimal join set in-network processing sensor network

来源：评论

学校读者我要写书评

暂无评论

VSM-RF: A method of relevance feedback in keyword Search over Relational databases

VSM-RF: A method of relevance feedback in Keyword Search ove...

引用

IEEE International Symposium on Information (IT) in Medicine and education, ITME

作者： Zhao-hui Peng Jun Zhang Shan Wang Chang-liang Wang Li-zhen Cui School of Computer Science and Technology Shandong University Jinan 250101 China School of Computer Science and Technology Dalian Maritime University 116026 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China The Hong Kong University of Science and Technology China

In keyword search over relational databases (KSORD), retrieval of user's initial query is often unsatisfying. User has to reformulate his query and execute the new query, which costs much time and effort. In this paper, a method of automatically reformulating user queries by relevance feedback is introduced, which is named VSM-RF. Aimed at the results of KSORD systems, VSM-RF adopts a ranking method based on vector space model to rank KSORD results. After the first time of retrieval, using user feedback or pseudo feedback just as user like, VSM-RF computes expansion terms based on probability and reformulates the new query using query expansion. After KSORD systems executing the new query, more relevant results are produced by the new query in the result list and presented to user. Experimental results verify this method's effectiveness.

关键词： Feedback keyword search Relational databases Computer science Information retrieval Laboratories data engineering knowledge engineering Computer science education Costs

来源：评论

学校读者我要写书评

暂无评论

Bring User Feedback into keyword Search over databases

Bring User Feedback into Keyword Search over Databases

引用

Web Information Systems and Applications Conference (WISA)

作者： Zhaohui Peng Jun Zhang Shan Wang Changliang Wang School of Computer Science & Technology Shandong University Jinan China Key Laboratory of Data Engineering & Knowledge Engineering Ministry of Education Beijing China School of Computer Science & Technology Dalian Maritime University Dalian China Hong Kong University of Science and Technology Hong Kong China

keyword search over relational databases (KSORD) enables casual users to use keyword queries (a set of keywords) to search relational databases just like searching the Web, without any knowledge of the database schema or any need of writing SQL queries. In KSORD, retrieval of user's initial query is often unsatisfying. User has to reformulate his query and execute the new query, which costs much time and effort. A method of automatically reformulating user queries by user feedback aimed at the results of KSORD is introduced in this paper, which is named UFBP (user feedback based on probability). After the first time of retrieval, according to the users' feedback information, UFBP computes terms to be added into the expanded query based on probability and reformulates the new query using query expansion. After KSORD executing the new query automatically, more relevant results are presented to user. Experimental results verify its effectiveness.

关键词： Feedback keyword search Relational databases Tree graphs Information retrieval Computer science educational technology Writing Information systems Application software

来源：评论

学校读者我要写书评

暂无评论

A Novel Spatial Obstructed Distance Using Quantum-Behaved Particle Swarm Optimization

A Novel Spatial Obstructed Distance Using Quantum-Behaved Pa...

引用

International Conference on Intelligent Computation Technology and Automation, ICICTA

作者： Xueping Zhang Hong Yi Dan Cao Yawei Liu Tengfei Yang Key Laboratory of Spatial Data Mining & Information Sharing of Ministry of Education Fuzhou University Fuzhou China School of Information Science & Engineering Henan University of Technology Zhengzhou China

Spatial clustering with obstacles constraints (SCOC) has been a new topic in spatial data mining (SDM). Spatial obstructed distance (SOD) is the key to SCOC. The obstacles constraint is generally ignored in computing distance between two points, and it leads to the clustering result which is of no value, so obstructed distance has a great effect upon clustering result. In this paper, we propose a novel spatial obstructed distance using quantum-behaved particle swarm optimization (QPSO) based on grid model to obtain obstructed distance, which is named QPGSOD. The experimental results show that QPGSOD is effective, and it can not only give attention to higher local constringency speed and stronger global optimum search.

关键词： Particle swarm optimization Clustering algorithms Quantum computing data mining educational technology Automation Information science data engineering Laboratories Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Spatial Clustering with Obstacles Constraints by Ant Colony Optimization and Quantum Particle Swarm Optimization

Spatial Clustering with Obstacles Constraints by Ant Colony ...

引用

International Conference on Artificial Intelligence and Computational Intelligence (AICI)

作者： Xueping Zhang Jianjun Wu Haifang Si Tengfei Yang Yawei Liu Key Laboratory of Spatial Data Mining & Information Sharing of Ministry of Education Fuzhou University Fuzhou China School of Information Science & Engineering Henan University of Technology Zhengzhou China

The paper proposed a novel ant colony optimization (ACO) and quantum particle swarm optimization (QPSO) method for spatial clustering with obstacles constraints (SCOC). We first developed AQPGSOD using ACO and QPSO based on grid model to obtain obstructed distance, and then we presented a new QPKSCOC based on QPSO and K-Medoids to cluster spatial data with obstacles. The experimental results show that AQPGSOD is effective, and QPKSCOC can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints and practicalities of spatial clustering.

关键词： Ant colony optimization Particle swarm optimization Quantum computing data mining Clustering algorithms Artificial intelligence Computational intelligence Information science data engineering educational technology

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：