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

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

来源：评论

学校读者我要写书评

暂无评论

Practical privacy for value-added applications in vehicular ad hoc networks 5th

引用

5th International Conference on Internet and Distributed computing Systems, IDCS 2012

作者： Zhang, Lei Wu, Qianhong Qin, Bo Domingo-Ferrer, Josep Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Dept. of Comp. Eng. and Maths Universitat Rovira i Virgili TarragonaCatalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan University School of Computer China Department of Maths School of Science Xi’an University of Technology China

ISBN: (纸本)9783642348822

Advances in mobile networking and information processing technologies have triggered vehicular ad hoc networks (VANETs) for traffic safety and value-added applications. Most efforts have been made to address the security concerns while little work has been done to investigate security and privacy for value-added applications in VANETs. To fill this gap, we propose a value-added application, specifically, a security and privacy preserving location-based service (LBS) scheme for VANETs. For each LBS transaction, the scheme provides authentication, integrity and non-repudiation for both the service provider and the user. A user can obtain the service in an anonymous way and hence user privacy is well protected. However, a tracing procedure can be invoked to find malicious users, thereby efficiently preventing users from abusing the anonymity provided by the system. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

LotusX: A Position-Aware XML Graphical Search System with Auto-Completion

LotusX: A Position-Aware XML Graphical Search System with Au...

引用

International Conference on data engineering

作者： Chunbin Lin Jiaheng Lu Tok Wang Ling Bogdan Cautis Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China School of Computing National University of Singapore Singapore Télécom Paris Technology France

ISBN: (纸本)9781467300421

The existing query languages for XML (e.g., XQuery) require professional programming skills to be formulated, however, such complex query languages burden the query processing. In addition, when issuing an XML query, users are required to be familiar with the content (including the structural and textual information) of the hierarchical XML, which is diffcult for common users. The need for designing user friendly interfaces to reduce the burden of query formulation is fundamental to the spreading of XML community. We present a twig-based XML graphical search system, called LotusX, that provides a graphical interface to simplify the query processing without the need of learning query language and data schemas and the knowledge of the content of the XML document. The basic idea is that LotusX proposes "position-aware" and "auto-completion" features to help users to create tree-modeled queries (twig pattern) by providing the possible candidates on-the-fly. In addition, complex twig queries (including order sensitive queries) are supported in LotusX. Furthermore, a new ranking strategy and a query rewriting solution are implemented to rank and rewrite the query effectively. We provide an online demo for LotusX system: http://***:8080/LotusX.

关键词： XML database languages Indexes Books Query processing Programming keyword search

来源：评论

学校读者我要写书评

暂无评论

Single attribute Join Queries within latest sampling periods in sensor networks

Single attribute Join Queries within latest sampling periods...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Shangfeng Mo Hong Chen Yinglong Li School of Math and Computing Science Hunan University of Science and Technology Xiangtan China Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing China

Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Single attribute Join Queries within latest sampling Periods (SJQP) for wireless sensor networks. The main idea of our filter-based framework is to discard non-matching tuples, and our scheme can guarantee the result is correct independent of the filters. Experiments based on real-world sensor data show that our method performs close to a theoretical optimum and consistently outperforms the centralized join algorithm.

关键词： Base stations Wireless sensor networks Probes Filtering algorithms Temperature sensors Information filters

来源：评论

学校读者我要写书评

暂无评论

Corrigendum: “Provably-secure electronic cash based on certicateless partially-blind signatures”

引用

Electronic Commerce Research and Applications 2013年第1期12卷 60-60页

作者： Lei Zhang Futai Zhang Bo Qin Shubo Liu East China Normal University Software Engineering Institute Shanghai Key Laboratory of Trustworthy Computing Shanghai China Universitat Rovira i Virgili Department of Computer Engineering and Mathematics UNESCO Chair in Data Privacy Tarragona Catalonia Spain Nanjing Normal University School of Computer Science and Technology China Xi’an University of Technology School of Science Department of Maths China Wuhan University School of Computer Science Wuhan China

来源：评论

学校读者我要写书评

暂无评论

Crowd flow-based information for crowd simulation

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2012年第23期6卷 145-152页

作者： Wu, He Qi, Li Rao, Yunbo Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Sichuan Normal University Chengdu Sichuan 610068 China Digital Media Department Sichuan Normal University Chengdu Sichuan 610068 China School of Information Science and Technology Southwest Jiaotong University Chengdu Sichuan 610031 China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu Sichuan 6100541 China

In this paper, we propose a novel algorithm for crowd simulation in real-time virtual environments. The proposed algorithm uses a navigation mesh for global planning in a polygonal multilayered threedimensional (3D) environment and crowd flow-based information to help individuals collision-free. At the same time, the proposed algorithm also focuses on addressing two problems: 1) in order to improve precision of collision-free, we propose based on hierarchy priority for collision-free of the individuals. 2) To avoid "shaking" behaviors of the individuals in the original place, we propose the stopping rule for solving it. Experimental results show that the proposed algorithm could be used for crowd simulation in complicated virtual environments.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Strong Security Enabled Certificateless Aggregate Signatures Applicable to Mobile Computation

Strong Security Enabled Certificateless Aggregate Signatures...

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Hu Xiong Qianhong Wu Zhong Chen Key Laboratory of Network and Software Security Assurance of the Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China Department of Computer Engineering and Mathematics UNESCO Chair in Data Pr Universitat Rovira i Virgili Tarragona Spain Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University of China China

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.

关键词： Aggregates Games Generators Synchronization Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed Skyline Queries for Mobile Applications

引用

计算机科学技术学报（英文版） 2010年第3期25卷 523-536页

作者： Ying-Yuan Xiao Yue-Guo Chen Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191China Key Laboratory of Computer Vision and System Tianjin University of TechnologyTianjin 300191China School of Computing National University of Singapore117417Singapore Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaBeijing 100872China

In this paper,we consider skyline queries in a mobile and distributed environment,where data objects are distributed in some sites(database servers)which are interconnected through a high-speed wired network,and queries are issued by mobile units(laptop,cell phone,etc.)which access the data objects of database servers by wireless *** inherent properties of mobile computing environment such as mobility,limited wireless bandwidth,frequent disconnection,make skyline queries more *** show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach,called efficient distributed skyline based on mobile computing(EDS-MC).In EDS-MC,a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication,network delay and query response *** conduct extensive experiments in a simulated mobile database system,and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.

关键词： skyline distributed query processing mobile database system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：