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

A Group Oriented Cryptosystem for the Vector Space Access Structure

Journal of Shanghai Jiaotong university(science) 2006年第2期11卷 184-187页

作者：许春香马华周军会肖国铮 School of Computer Science and Eng. Univ. of Electronic Science and Technology of China Chengdu 610054 China Key Lab. of Computer Networks & Information Security Xidian Univ. Xi'an 710071

A group oriented cryptosystem for the vector space access structure was proposed. This cryptosystem adopts self-certified public keys. It allows the participants of an authorized subset to cooperatively access an encrypted message. All data delivered in the cryptosystem are public. Therefore it does not need a partial decrypting results combiner and any secure communication channel. The security of the group oriented cryptosystem is based on the intractability of the discrete log problem and difficulty of factoring large integers. The suspected attacks can not break it.

关键词： group oriented cryptosystems sell-certified public keys vector space access structure

来源：评论

学校读者我要写书评

暂无评论

Syntax-enhanced pre-trained model 59

Syntax-enhanced pre-trained model

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Xu, Zenan Guo, Daya Tang, Duyu Su, Qinliang Shou, Linjun Gong, Ming Zhong, Wanjun Quan, Xiaojun Jiang, Daxin Duan, Nan School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Microsoft Research Asia Beijing China Microsoft Search Technology Center Asia Beijing China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (纸本)9781954085527

We study the problem of leveraging the syntactic structure of text to enhance pre-trained models such as BERT and RoBERTa. Existing methods utilize syntax of text either in the pre-training stage or in the fine-tuning stage, so that they suffer from discrepancy between the two stages. Such a problem would lead to the necessity of having human-annotated syntactic information, which limits the application of existing methods to broader scenarios. To address this, we present a model that utilizes the syntax of text in both pre-training and fine-tuning stages. Our model is based on Transformer with a syntax-aware attention layer that considers the dependency tree of the text. We further introduce a new pre-training task of predicting the syntactic distance among tokens in the dependency tree. We evaluate the model on three downstream tasks, including relation classification, entity typing, and question answering. Results show that our model achieves state-of-the-art performance on six public benchmark datasets. We have two major findings. First, we demonstrate that infusing automatically produced syntax of text improves pre-trained models. Second, global syntactic distances among tokens bring larger performance gains compared to local head relations between contiguous tokens. © 2021 Association for Computational Linguistics

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Person Re-identification

arXiv

引用

arXiv 2018年

作者： Wang, Guangcong Lai, Jianhuang Huang, Peigen Xie, Xiaohua School of Data and Computer Science Sun Yat-sen University China Guangdong Key Laboratory of Information Security Technology Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education

Most of current person re-identification (ReID) methods neglect a spatial-temporal constraint. Given a query image, conventional methods compute the feature distances between the query image and all the gallery images and return a similarity ranked table. When the gallery database is very large in practice, these approaches fail to obtain a good performance due to appearance ambiguity across different camera views. In this paper, we propose a novel two-stream spatial-temporal person ReID (st-ReID) framework that mines both visual semantic information and spatial-temporal information. To this end, a joint similarity metric with Logistic Smoothing (LS) is introduced to integrate two kinds of heterogeneous information into a unified framework. To approximate a complex spatial-temporal probability distribution, we develop a fast Histogram-Parzen (HP) method. With the help of the spatial-temporal constraint, the st-ReID model eliminates lots of irrelevant images and thus narrows the gallery database. Without bells and whistles, our st-ReID method achieves rank-1 accuracy of 98.1% on Market-1501 and 94.4% on DukeMTMC-reID, improving from the baselines 91.2% and 83.8%, respectively, outperforming all previous state-of-the-art methods by a large margin. Code is availab.e at https://***/Wanggcong/ Spatial-Temporal-Re-identification. Copyright © 2018, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Group oriented cryptosystem for the vector space access structure

引用

Journal of Shanghai Jiaotong University (science) 2006年第2期11 E卷 184-187页

作者： Xu, Chun-Xiang Ma, Hua Zhou, Jun-Hui Xiao, Guo-Zheng School of Computer Science and Eng. Univ. of Electronic Science and Technology of China Chengdu 610054 China Key Lab. of Computer Networks and Information Security Xidian Univ. Xi'an 710071 China

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Multi-user private keyword search for cloud computing

Multi-user private keyword search for cloud computing

引用

2011 3rd IEEE International Conference on Cloud Computing technology and science, CloudCom 2011

作者： Yang, Yanjiang Lu, Haibing Weng, Jian Institute for Infocomm Research Singapore Singapore Dept. of Operations Management and Information Systems Leavey School of Business Santa Clara University United States Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications China

ISBN: (纸本)9780769546223

Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities. © 2011 IEEE.

关键词： Outsourcing

来源：评论

学校读者我要写书评

暂无评论

ADCrowdNet: An Attention-Injective Deformable Convolutional Network for Crowd Understanding

arXiv

引用

arXiv 2018年

作者： Liu, Ning Long, Yongchao Zou, Changqing Niu, Qun Pan, Li Wu, Hefeng School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Information Security Technology University of Maryland Shanghai Jiao Tong University Guangdong University of Foreign Studies WINNER Technology

We propose an attention-injective deformable convolutional network called ADCrowdNet for crowd understanding that can address the accuracy degradation problem of highly congested noisy scenes. ADCrowdNet contains two concatenated networks. An attention-aware network called Attention Map Generator (AMG) first detects crowd regions in images and computes the congestion degree of these regions. Based on detected crowd regions and congestion priors, a multi-scale deformable network called Density Map Estimator (DME) then generates high-quality density maps. With the attention-aware training scheme and multi-scale deformable convolutional scheme, the proposed ADCrowdNet achieves the capability of being more effective to capture the crowd features and more resistant to various noises. We have evaluated our method on four popular crowd counting datasets (ShanghaiTech, UCF CC 50, WorldEXPO’10, and UCSD) and an extra vehicle counting dataset TRANCOS, and our approach beats existing state-of-the-art approaches on all of these datasets. Copyright © 2018, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Multicast algorithms based on minimum delay tree

引用

Journal of Computational information Systems 2012年第10期8卷 4039-4046页

作者： Zheng, Xinwei Jiang, Wenchao Wang, Xiaoyun Yuan, Zhibin Information Science School of Guangdong University of Business Studies Guangzhou 510023 China Computer School of Guangdong University of Technology Guangzhou 510006 China The Key Lab. of E-Business Market Application on Technology of Guangdong Province Guangzhou 510023 China

In constructing an efficient multicast tree of application-level multicast, not only the delay of link should be considered, but also the process delay of many end systems in sending and transmitting data can not be ignored. To solve the problem of "minimum delay spanning tree", this paper proposed two routing models including the MRDL model based on optimum delay and the LRRB model based on load balance. Moreover, this paper proposes corresponding heuristic algorithms. Simulation results prove these algorithms can transmit the media stream efficiently. © 2011 by Binary information Press.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dense-captioning events in videos: Sysu submission to Activitynet Challenge 2020

arXiv

引用

arXiv 2020年

作者： Wang, Teng Zheng, Huicheng Yu, Mingjing School of Data and Computer Science Sun Yat-sen University Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangdong Province Key Laboratory of Information Security Technology China

This technical report presents a brief description of our submission to the dense video captioning task of ActivityNet Challenge 2020. Our approach follows a two-stage pipeline: first, we extract a set of temporal event proposals;then we propose a multi-event captioning model to capture the event-level temporal relationships and effectively fuse the multi-modal information. Our approach achieves a 9.28 METEOR score on the test set. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Age and Energy Tradeoff for Short Packet Based Two-Hop Decode-and-Forward Relaying Networks

Age and Energy Tradeoff for Short Packet Based Two-Hop Decod...

引用

IEEE Conference on Wireless Communications and Networking

作者： Mangang Xie Jie Gong Xiao Ma School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China

Real-time and energy-efficient transmissions are two critical demands for status update systems, however it is difficult to meet these requirements simultaneously. This paper focuses on the tradeoff between the average age of information (AoI) and the average energy cost (EC) for two-hop decode-and-forward (DF) relaying networks with short packet transmissions. Both the partial relay selection (PRS) and max-min relay selection (MMRS) schemes are considered. The expressions for the average AoI and the average EC of two-hop relaying networks are derived, and the age-energy tradeoff is also achieved by minimizing the weighted sum of them. Numerical simulations show that both PRS and MMRS schemes have their own advantages to minimize the age and energy cost under different channel conditions, where MMRS is a fairness scheme that takes the channel conditions of two hops into account. In addition, an optimal packet length can always be found to tradeoff the average AoI and average EC in two-hop relaying networks.

关键词： Conferences Numerical simulation information age Real-time systems Energy efficiency Encoding Relays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：