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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Static vulnerabilities detection method based on security state tracing and checking

引用

Jisuanji Xuebao/Chinese Journal of Computers 2009年第5期32卷 899-909页

作者： Liang, Bin Hou, Kan-Kan Shi, Wen-Chang Liang, Zhao-Hui School of Information Renming University of China Beijing 100872 China MOE Key Laboratory of Data Engineering and Knowledge Engineering Beijing 100872 China

The main problem of existing static vulnerability detection methods based source code analysis is their high false positive and false negative rates. One main reason is lack of accurate and effective identification and analysis of security-related program elements, e.g. data validation checking, tainted data source, etc. A static vulnerability detection method based on data security state tracing and checking is proposed. In this method, the state space of state machine model is extended;the security state of a variable is identified by a vector that may correspond to multiple security-related properties rather than by a single property;Fine-grained state transition is provided to support accurate recognition of program security-related behaviors;The recognition of validation checking is introduced in vulnerability state machine to reduce false positives;and a systematic discrimination mechanism for tainted data is constructed to prevent false negatives result from neglecting tainted data sources. The experimental results of a prototype system show that this method can effectively detect buffer overflow and other type's vulnerabilities in software systems, and with obviously lower false positive than existing mainstream static detection methods and avoid some serious false negatives of these methods.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

ARRAY: A Non-application-Related, Secure, Wide-Area Disaster Recovery Storage System

ARRAY: A Non-application-Related, Secure, Wide-Area Disaster...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Lingfang Zeng Dan Feng Bharadwaj Veeravalli Qingsong Wei Division of Data Storage System Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electrical and Computer Engineering National University of Singapore Singapore Data Storage Institute Singapore

With our society more information-driven, we have begun to distribute data in wide-area storage systems. At the same time, both physical failure and logic error have made it difficult to bring the necessary recovery to bear on remote data disaster, and understanding this proceeding. We describe ARRAY, a system architecture for data disaster recovery that combines reliability, storage space, and security to improve performance for data recovery applications. The paper presents an exhaustive analysis of the design space of ARRAY systems, focusing on the trade-offs between reliability, storage space, security, and performance that ARRAY must make. We present RSRAII (Replication-based Snapshot Redundant Array of Independent Imagefiles) which is a configurable RAID-like data erasure-coding, and also others benefits come from consolidation both erasure-coding and replication strategies. A novel algorithm is proposed to improve snapshot performance referred to as SMPDP (Snapshot based on Multi-Parallel Degree Pipeline).

关键词： Secure storage Network servers Bandwidth Redundancy data security Cities and towns Laboratories Educational technology Hardware History

来源：评论

学校读者我要写书评

暂无评论

Dynamics of chaotic systems with attractive and repulsive couplings

引用

Physical Review E 2009年第4期80卷 046206-046206页

作者： Yuehua Chen Jinghua Xiao Weiqing Liu Lixiang Li Yixian Yang School of Science Beijing University of Posts and Telecommunications Beijing 100876 China School of Science Jiangxi University of Science and Technology Ganzhou 341000 China Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications P.O. Box 145 Beijing 100876 China Key Laboratory of Networking and Information Attack and Defence Technology of Ministry of Education Beijing University of Posts and Telecommunications Beijing 100876 China National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing 100876 China

Together with attractive couplings, repulsive couplings play crucial roles in determining important evolutions in natural systems, such as in learning and oscillatory processes of neural networks. The complex interactions between them have great influence on the systems. A detailed understanding of the dynamical properties under this type of couplings is of practical significance. In this paper, we propose a model to investigate the dynamics of attractive and repulsive couplings, which give rise to rich phenomena, especially for amplitude death (AD). The relationship among various dynamics and possible transitions to AD are illustrated. When the system is in the maximally stable AD, we observe the transient behavior of in-phase (high frequency) and out-of-phase (low frequency) motions. The mechanism behind the phenomenon is given.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Clustering XML retrieval results based on hybrid similarity

引用

Journal of Computational information Systems 2008年第3期4卷 1323-1330页

作者： Wan, Changxuan Yu, Hong School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China

With the unceasing growth of XML data in World Wide Web, XML document retrieval and clustering retrieval results are confronted with both challenges and opportunities. One of the challenges is how to improve the quality of XML retrieval results. Firstly, according to the features of XML documents, a method of modeling XML retrieval result documents is brought forward, which integrates both structural semantic features and content information of XML documents. Then, a measure method to compute similarity, including structural semantic similarity and keywords similarity, between retrieval result documents is suggested;and a strategy named Item Frequency in Cluster-Inverse Cluster Frequency to extract labels from result clusters is presented. Experiments indicate that the clustering quality for XML retrieval results based on hybrid similarity is obviously better than the one only based on content similarity.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Using IACO and QPSO to solve spatial clustering with obstacles constraints

Using IACO and QPSO to solve spatial clustering with obstacl...

引用

IEEE International Conference on Automation and Logistics

作者： Xueping Zhang Hongmei Zhang Yanxia Zhu Yawei Liu Tengfei Yang Taogai Zhang Key Laboratory of Spatial Data Mining & Information Sharing of Ministry of Education Fuzhou University Fuzhou China School of Computer Science & Engineering Henan University of Technology Zhengzhou Henan China Department of Computer Science & Engineering Henan University of Engineering Zhengzhou China

ISBN: (纸本)9781424447947

Spatial clustering has been an active research area in the data mining community. Spatial clustering is not only an important effective method but also a prelude of other task for spatial data mining (SDM). In this paper, we propose an improved ant colony optimization (IACO) and quantum particle swarm optimization (QPSO) method for spatial clustering with obstacles constraints (SCOC). In the process of doing so, we first use IACO to obtain the shortest obstructed distance, and then we develop a novel QPKSCOC based on QPSO and K-Medoids to cluster spatial data with obstacles. The experimental results demonstrate that the proposed method, performs better than Improved K-Medoids SCOC in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC.

关键词： Ant colony optimization data mining Particle swarm optimization Computer science Quantization Genetics Clustering algorithms Automation Logistics data engineering

来源：评论

学校读者我要写书评

暂无评论

The Research on the Algorithms of keyword Search in Relational database

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2008年 4977卷 134-143页

作者： Li, Peng Zhu, Qing Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing100872 China

ISBN: (纸本)354089375X

With the development of relational database, people require better database not only in the aspect of database performance, but also in the aspect of the database’s interactive ability. So that the database is much more friendly than just before and it is possible for a common user who do not have any special knowledge on database can access the database, without knowing the schema of database and writing intricate SQL. For the reason that the information retrieval on the web has developed well to some extent, when we develop the technology of keyword search in relational database, we can draw some ideas from information retrieve. But the great differences between the text database on the web and the relational database also bring some new challenges: 1) The answer needed by user is not only one tuple in database, but the tuple sets consisting of the tuple connect from different table using the "primary key-foreign key" relationship. 2)The results of the evaluation criteria is more important, because it is directly related to the effectiveness of Search System. 3)The structure of relational database is much more intricate than text database, and the algorithms of information retrieval are not fit the relational database. So in this paper, we introduce a novel keyword search algorithm and a modified criteria of evaluating answers in order to enhance efficiency of the keyword search and return much more effective information to users, finally, the search algorithm’s performance is tested and evaluated. © Springer-Verlag Berlin Heidelberg 2008

关键词： information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：