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

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Lan Zhang Xiang-Yang Li Yunhao Liu QiuYuan Huang Shaojie Tang MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science Illinois Institute of Technology USA Department of Computer Science and Engineering HKUST Hong Kong China Department of Electrical Engineering University of Florida USA

ISBN: (纸本)9781467307734;9781467307758

In this work, we address the problem of finding experts using chains of social referrals and profile matching with only local information in online social networks. By assuming that users are selfish, rational, and have privately known cost of participating in the referrals, we design a novel truthful efficient mechanism in which an expert-finding query will be relayed by intermediate users. When receiving a referral request, a participant will locally choose among her neighbors some user to relay the request. In our mechanism, several closely coupled methods are carefully designed to improve the search performance, including, profile matching, social acquaintance prediction, score function for locally choosing relay neighbors, and budget estimation. We conduct extensive experiments on several datasets of online social networks. The extensive study of our mechanism shows that the success rate of our mechanism is about 90% in finding closely matched experts using only local search and limited budget, which significantly improves the previously best rate 20%. The overall cost of finding an expert by our truthful mechanism is about 20% of the untruthful method and only about 2% of the method that always selects high-degree neighbors. The median length of social referral chains is 6 using our localized search decision, which surprisingly matches the well-known small-world phenomenon of global social structures.

关键词： Vectors Probability Search problems Facebook Relays Databases

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised vehicle recognition: An approximate region constrained approach

Semi-supervised vehicle recognition: An approximate region c...

引用

7th International Conference on Rough Sets and Knowledge technology, RSKT 2012

作者： Zhao, Rui Wei, Zhihua Miao, Duoqian Wu, Yan Mei, Lin Department of Computer Science and Technology Tongji University 201804 Shanghai China Third Research Institute Ministry of Public Security 201204 Shanghai China State Key Laboratory for Novel Software Technology Nanjing University 210093 Nanjing China

ISBN: (纸本)9783642318993

Semi-supervised learning attracts much concern because it can improve classification performance by using unlabeled examples. A novel semi-supervised classification algorithm SsL-ARC is proposed for real-time vehicle recognition. It makes use of the prior information of object vehicle moving trajectory as constraints to bootstrap the classifier in each iteration. Approximate region interval of trajectory are defined as constraints. Experiments on real world traffic surveillance videos are performed and the results verify that the proposed algorithm has the comparable performance to the state-of-the-art algorithms. © 2012 Springer-Verlag.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

WILL: Wireless indoor localization without site survey

WILL: Wireless indoor localization without site survey

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Chenshu Wu Zheng Yang Yunhao Liu Wei Xi MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science and Engineering HKUST Hong Kong China Xian Jiaotong University China

ISBN: (纸本)9781467307734

Indoor localization is of great importance for a range of pervasive applications, attracting many research efforts in the past two decades. Most radio-based solutions require a process of site survey, in which radio signatures are collected and stored for further comparison and matching. Site survey involves intensive costs on manpower and time. In this work, we study unexploited RF signal characteristics and leverage user motions to construct radio floor plan that is previously obtained by site survey. On this basis, we design WILL, an indoor localization approach based on off-the-shelf WiFi infrastructure and mobile phones. WILL is deployed in a real building covering over 1600m 2 , and its deployment is easy and rapid since site survey is no longer needed. The experiment results show that WILL achieves competitive performance comparing with traditional approaches.

关键词： Fingerprint recognition Floors Databases Skeleton Mobile handsets IEEE 802.11 Standards

来源：评论

学校读者我要写书评

暂无评论

Towards energy-fairness in asynchronous duty-cycling sensor networks

Towards energy-fairness in asynchronous duty-cycling sensor ...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Zhenjiang Li Mo Li Yunhao Liu Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China School of Computer Engineering Nanyang Technological University Singapore MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China

ISBN: (纸本)9781467307734

In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. We propose a mathematical model to describe the energy efficiency of such networks and observe that traditional sleep interval setting strategy, i.e., operating sensor nodes with identical sleep intervals, or intuitive control heuristics, i.e., greedily increasing sleep intervals of sensor nodes with high energy consumption rates, hardly perform well in practice. There is an urgent need to develop an efficient sleep interval control strategy for achieving fair and high energy efficiency. To this end, we theoretically formulate the Sleep Interval Control (SIC) problem and find it a convex optimization problem. By utilizing the convex property, we decompose the original problem and propose a distributed algorithm, called GDSIC. In GDSIC, sensor nodes can tune sleep intervals through a local information exchange such that the maximum energy consumption rate in the network approaches to be minimized. The algorithm is self-adjustable to the traffic load variance and is able to serve as a unified framework for a variety of asynchronous duty-cycling MAC protocols. We implement our approach in a prototype system and test its feasibility and applicability on a 50-node testbed. We further conduct extensive trace-driven simulations to examine the efficiency and scalability of our algorithm with various settings.

关键词： Energy consumption Silicon carbide Protocols Receivers Wireless sensor networks Data communication Switching circuits

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable Data Aggregation Scheme in Wireless Sensor Networks

引用

IEEE Transactions on Parallel and Distributed systems 2012年第10期23卷 1958-1969页

作者： Cheng Wang Changjun Jiang Shaojie Tang Xiang-Yang Li Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science and Engineering Tsinghua National Laboratory for Information Science and Technology (TNLIST) University of Tongji China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density \lambda \in [1,n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SHL) scheme and multiple-hop-length (MHL) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MHL scheme, for a practically important set of symmetric functions called divisible perfectly compressible (DPC) functions, including the mean, max, and various kinds of indicator functions, etc., the data from \Theta (n) sensors can be aggregated to the sink at the throughput of a constant order \Theta (1), implying that, our MHL scheme is indeed scalable.

关键词： Throughput Wireless sensor networks Temperature measurement Protocols Lattices Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

To better stand on the shoulder of giants 12

To better stand on the shoulder of giants

引用

12th ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL '12

作者： Yan, Rui Huang, Congrui Tang, Jie Zhang, Yan Li, Xiaoming School of Electronics Engineering and Computer Science Peking University Beijing 100871 China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing 100083 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science and Information Engineering National Taiwan University Taipei 10617 Taiwan

ISBN: (纸本)9781450311540

Usually scientists breed research ideas inspired by previous publications, but they are unlikely to follow all publications in the unbounded literature collection. The volume of literature keeps on expanding extremely fast, whilst not all papers contribute equal impact to the academic society. Being aware of potentially influential literature would put one in an advanced position in choosing important research references. Hence, estimation of potential influence is of great significance. We study a challenging problem of identifying potentially influential literature. We examine a set of hypotheses on what are the fundamental characteristics for highly cited papers and find some interesting patterns. Based on these observations, we learn to identify potentially influential literature via Future Influence Prediction (FIP), which aims to estimate the future influence of literature. The system takes a series of features of a particular publication as input and produces as output the estimated citation counts of that article after a given time period. We consider several regression models to formulate the learning process and evaluate their performance based on the coefficient of determination (R2). Experimental results on a real-large data set show a mean average predictive performance of 83.6% measured in R2. We apply the learned model to the application of bibliography recommendation and obtain prominent performance improvement in terms of Mean Average Precision (MAP). © 2012 ACM.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Direct CCA secure identity-based broadcast encryption

Direct CCA secure identity-based broadcast encryption

引用

6th International Conference on Network and system security, NSS 2012

作者： Zhang, Leyou Wu, Qing Hu, Yupu Department of Mathematics School of Science Xidian University Xi'an 710071 China School of Automation Xi'an University of Posts and Telecommunications Xi'an 710121 China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China

ISBN: (纸本)9783642346002

In the previous works, the general transformation methods from a CPA(chosen-plaintext attacks) secure scheme to a CCA(chosen-ciphertext attacks) secure scheme are the hierarchical identity-based encryption, one-time signature and MAC. These folklore construction methods lead to the CCA secure schemes that are somewhat inefficient in the real life. In this paper, a new direct chosen-ciphertext technique is introduced and a practical identity-based broadcast encryption(IBBE) scheme that is CCA secure is proposed. The new scheme has many advantages over the available, such as constant size private keys and constant size ciphertexts, which solve the trade-off between the private keys size and ciphertexts size. In addition, under the standard model, the security of the new scheme is reduced to the hardness assumption-decision bilinear Diffie-Hellman exponent problem(DBDHE). This assumption is more natural than many of the hardness assumptions recently introduced to IBBE in the standard model. © 2012 Springer-Verlag.

关键词： Hardness

来源：评论

学校读者我要写书评

暂无评论

Fault detection on the software implementation of CLEFIA lightweight cipher

引用

Journal of Networks 2012年第8期7卷 1288-1294页

作者： Li, Wei Gu, Dawu Xia, Xiaoling Liu, Ya Liu, Zhiqiang School of Computer Science and Technology Donghua University Shanghai China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

CLEFIA is an efficient lightweight cipher that delivers advanced copyright protection and authentication in computer networks. It is also applied in the secure protocol for transmission including SSL and TLS. Since it was proposed in 2007, some work about its security against differential fault analysis has been devoted to reducing the number of faults and to improving the time complexity of this attack. This attack is very efficient when a single fault is injected into the last several rounds of the CLEFIA, and it allows to recover the whole secret key. Thus, it is an open question whether detecting the faults injected into the CLEFIA with low overhead of space and time tolerance. In this paper, we present a fault detection of the CLEFIA block cipher in the single-byte fault model. Our result in this study could detect the faults with negligible cost when faults are even injected into the last four rounds. © 2012 ACADEMY PUBLISHER.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

PatternTrack: A Visual Pattern Detection Technique for Multidimensional Data

PatternTrack: A Visual Pattern Detection Technique for Multi...

引用

International Conference on computer science and Service system (CSSS)

作者： Quan Li Li Chen Hongsen Liao Junhai Yong School of Software Key Laboratory for Information System Security Ministry of Education of China Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781467307215

In multidimensional data analysis, one important task is to investigate the inner relations and patterns. Numerous visual representations have been proposed, such as parallel coordinates and scatter plots. However, parallel coordinates emphasize the overall patterns and data distributions while ignoring the correlation of data values over more than three dimensions. And when rendering more poly lines, the visual clutter may occur. Scatter plots are powerful in revealing the data distributions but the overall patterns are restrained. We propose Pattern Track to reveal the implied relations and patterns while also maintaining flexible operations on data values. The layout of Pattern Track is composed of a mixture of automatic computations and interactive adjustments by mapping all dimension axes to concentric circles and integrating three levels of concentric group -- data values, patterns and gradient circles. Multi-interactive operations are supported to help users dig out the implied multivariate correlations. Experimental results demonstrate the effectiveness.

关键词： Correlation Visualization Sorting Clutter Concrete Image color analysis Measurement

来源：评论

学校读者我要写书评

暂无评论

Secure Data Retrieval of Outsourced Data with Complex Query Support

Secure Data Retrieval of Outsourced Data with Complex Query ...

引用

International Conference on Distributed Computing systems Workshop

作者： Yan Zhu Di Ma Shanbiao Wang Beijing Key Laboratory of Internet Security Technology Institute of Computer Science and Technology Peking University Beijing China Department of Computer and Information Science University of Michigan Dearborn MI USA

The ability to efficiently retrieve data in their encrypted form is important for the cloud to become a truly secure and practical data sharing platform. Although this field has attracted tremendous research attention in the past a few years, most existing solutions do not support efficient searches with complex query conditions. Also, there has been little work to explore various comparison methods to specify complex query conditions. In this paper, we propose a framework of multi-keyword secure data retrieval to meet the needs of secure data retrieval with complex query support by leveraging recent development in attribute-based encryptions. Moreover, we propose a novel cryptographic comparison method based on forward and backward deviation functions (FDF/BDF). This method supports dual range comparisons and tree-oriented keyword search, as well as almost constant complexity for large size of integer range. We also provide several authentication mechanisms for preventing unpermitted access and verifying validity of protocol output. We implement a prototype system and our experimental results demonstrate its efficiency for practical usage.

关键词： Cryptography Servers Indexes Cloud computing Access control Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：