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

Vulnerabilities Static Detection for Web Applications with False Positive Suppression

Vulnerabilities Static Detection for Web Applications with F...

2010 IEEE International Conference on Information Theory and Information Security(2010 IEEE 国际信息论与信息安全会议)

作者： Bin Liang Qianqian Wang Jianjun Huang Jiagui Zhong Jingjing Cai Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Schoo School of Information Renmin University of China Beijing 100872 China Beijing Venustech Cybervision Co. Ltd Beijing 100094 China

Web applications become more and more important, and the corresponding security problems have been concerned about. This paper presents TASA, an ASP static analyzer, which employs a path-sensitive, inter-procedural and contextsensitive data flow analysis, mainly concerning the taint propagation and sanitization. This paper also discusses some techniques used in TASA, such as sanitization routines modeling, ASP specific features, alias analysis and path-related routines modeling, to prune false positives. Experiments on four open source applications show that TASA has a rate of false positive of 4.98% and it can avoid certain false warnings owing to the proposed approaches.

关键词： Security Detectors Computer bugs Portals Analytical models Browsers Merging

来源：评论

学校读者我要写书评

暂无评论

Two novel semantics of top-k queries processing in uncertain database

Two novel semantics of top-k queries processing in uncertain...

引用

10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Liu, Dexi Wan, Changxuan Xiong, N. Yang, Laurence T. Chen, Lei Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science St. Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9780769541082

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Topk queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this xtuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain xkRanks queries (U-x-kRanks) and Global x-Top-k queries (Gx- Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Study in retrieval visibility and optical thickness of fog with MODTRAN

Study in retrieval visibility and optical thickness of fog w...

引用

International Conference on Multimedia Technology

作者： Zhang, Wengang Wei, Ming Yu, Tao Wang, Gengke Lai, Jibao Wang, Yuqing Key Laboratory of Meteorological Disaster of Ministry of Education Earth System Remote Sensing Institute Nanjing University of Information Science and Technology Nanjing 210044 China Center for National Space-borne Demonstration Beijing 100101 China Institute of Data and Knowledge Engineering Henan University Kaifeng Henan 475001 China Binjiang College Nanjing University of Information Science and Technology Nanjing 210044 China

ISBN: (纸本)9781424478743

In recent years, many scientists have done some work in monitoring the fog, and achieved fruitful results. Now we want to conduct more in-depth study. In this paper, we utilize MODTRAN to simulate the relationship between transmittance and visibility, height of fog. By fitting the relationship between them, we get the formula that calculates visibility of fog using transmittance and height of fog. The correlation coefficient of this formula is very high, so it can be regarded as an accuracy one. The height of fog can be calculated by top temperature of fog, surface temperature and vertical lapse rate. The transmittance of the fog can be measured by using special instrument. Therefore, the visibility and optical thickness can be retrieved by this method. ©2010 IEEE.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Global Top-k Aggregate Queries Based on X-tuple in Uncertain database

Global Top-k Aggregate Queries Based on X-tuple in Uncertain...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Dexi Liu Changxuan Wan Naixue Xiong Jong Hyuk Park Sang-Soo Yeoe School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science and Engineering Seoul National University of Technology Seoul South Korea Division of Computer Engineering Mokwon University Daejeon South Korea

ISBN: (纸本)9781424467013;9780769540191

A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Aggregates databases knowledge engineering Query processing Computer networks Power engineering computing data engineering Power engineering and energy Dynamic programming Radar imaging

来源：评论

学校读者我要写书评

暂无评论

Studies and implementation of the trusted process mechanism in a secure operating system

引用

Qinghua Daxue Xuebao/Journal of Tsinghua University 2010年第SUPPL. 1期50卷 1547-1553页

作者： Zhang, Chongbin Li, Fengjuan Liang, Bin China Information Technology Security Evaluation Center Beijing 100085 China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renming University of China Beijing 100872 China

The trusted process mechanism is an important part of the operating system security mechanism, but there is no uniform definition of the trusted process and there are some limitations in understanding its fundamental properties. In this paper, the trustworthiness of a trusted process is discussed in terms of privilege, data-operated integrity, functional and logic correctness, self-integrity, availability and trusted interactions. A trusted process definition is then given which summarizes the fundamental properties of a trusted process as a theoretical foundation for researching and enforcing the trusted process mechanism. A prototype of a trusted process mechanism is implemented in a secure operating system based on Linux, with the trustworthiness of the trusted process assured in many ways to improve and extende the original trust mechanisms in Linux.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Operating system mechanisms for TPM-based lifetime measurement of process integrity

Operating system mechanisms for TPM-based lifetime measureme...

引用

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

作者： Xiao, Li Wenchang, Shi Zhaohui, Liang Bin, Liang Zhiyong, Shan Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Ministry of Education

ISBN: (纸本)9781424451135

Implementing runtime integrity measurement in an acceptable way is a big challenge. We tackle this challenge by developing a framework called Patos. This paper discusses the design and implementation concepts of our operating system mechanisms for runtime process integrity measurement, which is an important part of the Patos framework and is named Patos-RIP. Patos-RIP is developed into the mainstream Linux operating system and utilizes TPM as hardware support for tamper-resistance. From the beginning a process is created to the moment the process dies, Patos-RIP conducts integrity measurement at appropriate points of time when the process runs, so as to ensure that the integrity of a process is not compromised during its whole lifetime. This way, Patos-RIP can improve trustworthiness of processes by effectively detecting runtime tampering attacks on processes' integrity. ©2009 IEEE.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Median query research in wireless sensor networks

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2010年第2A期38卷 133-137页

作者： Wu, Zhong-Bo Zhang, Hui Chen, Hong Information School Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China School of Mathematics and Computer Science Xiangfan University Xiangfan Hubei 441053 China

Poor quality and harsh condition can result in faulty and outlier data in sampling data of sensor nodes. So we need median query to reflect average level of monitoring region. First, we put forward HMA algorithm. Second, we extend HMA algorithm and put forward HFMA algorithm. In HFMA, We only need collect data inside filter and aggregate influence coefficient during sampling period. Base station can compute median result according to the sample data inside filter and influence coefficient aggregation value. Experimental results have shown that HFMA outperforms Naive algorithm and HMA algorithm and can prolong the lifetime of sensor network.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Two Novel Semantics of Top-k Queries Processing in Uncertain database

Two Novel Semantics of Top-k Queries Processing in Uncertain...

引用

International Conference on Computer and Information Technology (CIT)

作者： Dexi Liu Changxuan Wan N. Xiong Laurence T. Yang Lei Chen School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science Saint Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong China

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Top-k queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this x-tuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain x-kRanks queries (U-x-kRanks) and Global x-Top-k queries (G-x-Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Semantics Upper bound Heuristic algorithms Query processing Equations Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

A Review-Based Reputation Evaluation Approach for Web Services

引用

Journal of Computer Science & Technology 2009年第5期24卷 893-900页

作者：李海华杜小勇 Member 田萱 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Information Science & Technology Beijing Forestry University Beijing 100083 China

Web services are commonly perceived as an environment of both offering opportunities and threats. In this environment, one way to minimize threats is to use reputation evaluation, which can be computed, for example, through transaction feedback. However, the current feedback-based approach is inaccurate and ineffective because of its inner limitations （e.g., feedback quality problem）. As the main source of feedback, the qualities of existing on-line reviews are often varied greatly from low to high, the main reasons include：（1） they have no standard expression formats, （2） dishonest comments may exist among these reviews due to malicious attacking. Up to present, the quality problem of review has not been well solved, which greatly degrades their importance on service reputation evaluation. Therefore, we firstly present a novel evaluation approach for review quality in terms of multiple metrics. Then, we make a further improvement in service reputation evaluation based on those filtered reviews. Experimental results show the effectiveness and efficiency of our proposed approach compared with the naive feedback-based approaches.

关键词： Web services reputation evaluation review quality measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：