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

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Dai, Zhuofang Zhang, Zheng Wang, Haojun Li, Yi Zhang, Weihua Software School Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China Parallel Processing Institute Fudan University Shanghai 201203 China State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou 450001 China

ISBN: (纸本)9783662444900

In order to harness abundant hardware resources, parallel programming has become a necessity in multicore era. However, parallel programs are prone to concurrency bugs, especially data races. Even worse, current software tools always suffer from both large runtime overheads and poor scalability, while most of hardware supports for race detection are not available in parallel programming. Therefore, it has been a challenge that how to introduce a practical and fast race detection tools. Nowadays, GPUs with massive parallel computation resources have become one of the most popular hardware platforms. Hence, the prevalence of GPU architectures has opened an opportunity of accelerating data race detection. In this paper, we first have a deeply analysis on data race detection algorithms like happens-before and observe that these algorithms have very good computation and data parallelism. Based on the observation, we propose Grace, a software approach that leverages massive parallelism computation units of GPU architectures to accelerate data race detection. Grace deploys detection, the most computation intensive workload, on GPU to fully utilize the computation resource in GPU. Moreover, Grace leverages coarse-grained pipeline parallelism and data parallelism through exploiting the computation resource in multi-core CPUs to further improve performance. Experimental results show that Grace is fast and scalable. It achieves over 80x speedup compared to the sequential version even under a 128-thread configuration. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

On the security of a privacy-preserving key management scheme for location based services in VANETs

On the security of a privacy-preserving key management schem...

引用

6th International Symposium on Foundations and Practice of Security, FPS 2013

作者： Liu, Bao Zhang, Lei Domingo-Ferrer, Josep Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chr. in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Tarragona Spain

ISBN: (纸本)9783319053011

Location based services (LBSs) are promising value-added services in vehicular ad hoc networks (VANETs), which can yield substantial economic profits. To extensively deploy LBSs in VANETs, it is essential to establish an efficient privacy-preserving key management scheme. In this paper, we point out a privacy weakness in a recent key management scheme based on group signatures for LBSs in VANETs;then we propose a secure and privacy-enhanced version. In our scheme, roadside units (RSUs) act as group managers. Vehicles are distributed into groups maintained by these RSUs. If a vehicle's member key is compromised, one just needs to update the group public key corresponding to its group manager. With this method, the member revocation and privacy leakage problems in schemes based on group signatures are solved effectively. As a result, a vehicle may enjoy LBSs efficiently without surrendering its privacy. © 2014 Springer International Publishing Switzerland.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Does web news media have opinions? Evidence from real estate market prediction 18

Does web news media have opinions? Evidence from real estate...

引用

18th Pacific Asia Conference on Information Systems, PACIS 2014

作者： Sun, Daoyuan Zhang, Ce Xu, Wei Zuo, Meiyun Zhou, Junjie Du, Yudie Department of Information Systems School of Computing National University of Singapore Singapore Singapore School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China School of Information Beijing China School of E-Commerce and Logistics Management Henan University of Economics and Law Zhengzhou China

In this paper, we propose a novel method for real estate price prediction using web new media sentiments by incorporating human searching behaivor on the web. By combining online daily news' sentiments and Google search engine query data, we construct a web news content and online search behavior-based integrated model for real estate prediction. Besides these factors, real estate price time series data are also considered into the model in order to improve the forecasting performance. Furthermore, we make a comparison between the integrated model and the baseline model without search engine query data. Experimental results indicate that the integrated model outperforms the non-integrated model, which suggests that online user searching behavior is of great value in enhancing the prediction performance. These findings imply that the proposed integrated model is effective and feasible for real estate market prediction.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Evolving Commitments for Self-Adaptive Socio-technical Systems

Evolving Commitments for Self-Adaptive Socio-technical Syste...

引用

IEEE International Conference on engineering of Complex Computer Systems

作者： Xin Peng Yi Xie Yijun Yu John Mylopoulos Wenyun Zhao Shanghai Key Laboratory of Data Science Fudan University China Department of Computing The Open University UK Department of Information Engineering and Computer Science University of Trento Italy

Socio-technical systems (STSs) consist of human, hardware and software agents that work in tandem to fulfill stakeholder requirements. A specification for an STS consists of a set of (social) commitments among participating agents that serve as a contract among them. However, by their very nature, STSs are open, dynamic and continuously evolving along with their environments. To ensure that such systems continue to satisfy their requirements, the agents that comprise an STS must continuously adapt their behaviors to take into account risks and opportunities that arise at runtime. This paper presents a decision-theoretic self-adaptation framework that proposes candidate adaptation strategies for participating agents. These strategies are implementable by reconfiguration of plans or even changes in contractual commitments among agents. The adaptation procedure involves negotiating commitment changes and possible compensations to/from creditor agents. To evaluate the proposal, the paper also presents the results of an experimental study with a simulated STS, which confirms that success rates for achieving stakeholder goals and overall trade off utility can be improved significantly by incorporating evolving commitments to support STS adaptation.

关键词： Adaptation models Switches Motorcycles Estimation Proposals Lifting equipment Protocols

来源：评论

学校读者我要写书评

暂无评论

Clonepedia: Summarizing Code Clones by Common Syntactic Context for Software Maintenance

Clonepedia: Summarizing Code Clones by Common Syntactic Cont...

引用

International Conference on Software Maintenance (ICSM)

作者： Yun Lin Zhenchang Xing Xin Peng Yang Liu Jun Sun Wenyun Zhao Jinsong Dong Shanghai Key Laboratory of Data Science Fudan University Shanghai China School of Computer Engineering Nanyang Technological University Singapore Singapore University of Technology and Design Singapore School of Computing National University of Singapore Singapore

Code clones have to be made explicit and be managed in software maintenance. Researchers have developed many clone detection tools to detect and analyze code clones in software systems. These tools report code clones as similar code fragments in source files. However, clone-related maintenance tasks (e.g., refactorings) often involve a group of code clones appearing in larger syntactic context (e.g., code clones in sibling classes or code clones calling similar methods). Given a list of low-level code-fragment clones, developers have to manually summarize from bottom up low-level code clones that are relevant to the syntactic context of a maintenance task. In this paper, we present a clone summarization technique to summarize code clones with respect to their common syntactic context. The clone summarization allows developers to locate and maintain code clones in a top-down manner by type hierarchy and usage dependencies. We have implemented our approach in the Clonepedia tool and conducted a user study on JHotDraw with 16 developers. Our results show that Clonepedia users can better locate and refactor code clones, compared with developers using the Clone Detective tool.

关键词： Cloning Syntactics Abstracts Context Ontologies Production facilities Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

Appearance-order-based schema matching

引用

Journal of computing Science and engineering 2014年第2期8卷 94-106页

作者： Ding, Guohui Cao, keyan Wang, Guoren Han, Dong Department of Computer Science Shenyang Aerospace University Shenyang China Key Laboratory of Medical Image Computing Ministry of Education Northeastern University Shenyang China College of Information Science and Engineering Northeastern University Shenyang China National Marine Data and Information Service Tianjin China

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance. © 2014. The Korean Institute of Information Scientists and Engineers.

关键词： data integration

来源：评论

学校读者我要写书评

暂无评论

Design of a high-performance full-system instrumentation

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 129-134页

作者： Min, Qing-Hao Zhang, Zheng Wang, Hao-Jun Zhang, Wei-Hua Software School Fudan University Shanghai201203 China Shanghai Key Laboratory of Data Science Fudan University Shanghai201203 China Parallel Processing Institute Fudan University Shanghai201203 China State Key Laboratory of Mathematic Engineering and Advanced Computing PLA Information Engineering University Zhengzhou450001 China

Instrumentation is an important mechanism to collect run-time information of applications for further analysis like bottleneck analysis, hotspot analysis and even bug detection and revision. Currently there are lots of analyzers using instrumentation to collect their source data. However, most of these tools lack of full-system support and thus become inadequate for analyzing multi-core programs as they cannot provide full-system information like scheduling, system calls and inter-process communication, etc. Meanwhile, full-system instrumentation needs to collect OS and hardware information, resulting to performance degradation. In this paper, a high-performance full-system instrumentation method was designed for collecting full-system information as well as application information. The proposed method was implemented inside the QEMU full-system emulator, and 40 MIPS performance on average was achieved after optimization, which was appropriated for normal program analysis. ©, 2014, Northeastern University. All right reserved.

关键词： Full-system High-performance Instrumentation Multi-core

来源：评论

学校读者我要写书评

暂无评论

A Generic Construction of Proxy Signatures from Certificateless Signatures

A Generic Construction of Proxy Signatures from Certificatel...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Lei Zhang Qianhong Wu Bo Qin Josep Domingo-Ferrer Peng Zeng Jianwei Liu Ruiying Du Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Tarragona Spain Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University China Department of Maths School of Science Xi'an University of Technology China School of Electronic and Information Engineering Beijing University of Aeronautics and Astronautics China

The primitive of proxy signatures allows the original signer to delegate proxy signers to sign on messages on behalf of the original signer. It has found numerous applications in distributed computing scenarios where delegation of signing rights is common. Certificate less public key cryptography eliminates the complicated certificates in traditional public key cryptosystems without suffering from the key escrow problem in identity-based public key cryptography. In this paper, we reveal the relationship between the two important primitives of proxy signatures and certificate less signatures and present a generic conversion from the latter to the former. Following the generic transformation, we propose an efficient proxy signature scheme with a recent certificate less signature scheme.

关键词： Artificial intelligence Bismuth Games Public key cryptography Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A blocked statistics method based on directional derivative

A blocked statistics method based on directional derivative

引用

2012 International Conference on Web Information Systems and Mining, WISM 2012

作者： Li, Junli Chu, Chengxi Li, Gang Lou, Yang Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Sichuan Normal University Chengdu 610066 China Information Science and Engineering College Ningbo University Ningbo 315211 China

ISBN: (纸本)9783642334689

The basic idea of identifying the motion blurred direction using the directional derivative is that the original image be an isotropic first-order Markov random process. However, the real effect of this method is not always good. There are many reasons, of which the main is that a lot of pictures do not meet the physical premises. The shapes of objects and texture of pictures would be vulnerably influenced for identifying. In this paper, according to the image characteristics of the local variance, we extract multiple blocks and identify the motion directions of the blocks to identify the motion blurred direction. Experimental results show that our method not only improve the identification accuracy, but also reduce the amount of computation. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Efficient approximation of the maximal preference scores by lightweight cubic views

Efficient approximation of the maximal preference scores by ...

引用

15th International Conference on Extending database Technology, EDBT 2012

作者： Chen, Yueguo Cui, Bin Du, Xiaoyong Tung, Anthony K. H. Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China Department of Computer Science Peking University Beijing China School of Information Renmin University of China Beijing China School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9781450307901

Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function. BPQs are very useful in applications where users want to efficiently check whether many individual data sets contain tuples that are of interest to them. Although a BPQ can be naïvely answered by issuing a top-1 query and computing the score from the returned tuple, doing so might require to load a larger number of tuples externally. In this paper, we address the problem of efficient processing BPQs by using lightweight cubic (3-dimensional) views. With these in-memory views, the MPSs of BPQs can be efficiently estimated with an error bound guaranteed, by paying only a small number of I/Os. Extensive experimental results over real-life data sets show that our approximate solution can achieve the efficiency of up to three orders of magnitude compared to exact solutions, with certain accuracy guaranteed. © 2012 ACM.

关键词： best preference score materialized views preference query top-k query

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：