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

16th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2019

作者： Yang, Maohu Dai, Hua Bao, Jingjing Yi, Xun Yang, Geng Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Security and Intelligent Processing Lab of Big Data Nanjing210023 China Royal Melbourne Institute of Technology University Melbourne3001 Australia

ISBN: (纸本)9783030307080

With searchable encryptions in the cloud computing, users can outsource their sensitive data in ciphertext to the cloud that provides efficient and privacy-preserving multi-keyword top-k searches. However, most existing top-k search schemes over encrypted cloud data are the centralize schemes which are limited in large scale data environment. To support scalable searches, we propose a parallel multi-keyword top-k search scheme over encrypted cloud data. In this scheme, the fragment-based encrypted inverted index is designed, which is indistinguishable and can be used for parallel searching. On the basis of such indexes, a Map-Reduce-based distributed computing framework is adopted to implement the parallel multi-keyword top-k search algorithms. security analysis and experiment evaluation show that the proposed scheme is privacy-preserving, efficient and scalable. © 2019, IFIP International Federation for Information processing.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

User Grouping for Sharing Services with Capacity Limit

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2021年第2期14卷 614-627页

作者： Liu, Xiping Dou, Wanchun Wang, Xin Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Security& Intelligent Pr Sch Comp Sci Nanjing 210023 Jiangsu Peoples R China Nanjing Univ State Key Lab Novel Software Technol Dept Comp Sci & Technol Nanjing 210023 Jiangsu Peoples R China SUNY Stony Brook Wireless Networking & Syst Lab Dept Elect & Comp Engn Stony Brook NY 11794 USA

Sharing a service among multiple users could bring benefit to users by reducing their service price and also benefit service providers by allowing them to make more profit. Shared services usually have a capacity limit. To construct a win-win situation between users and providers through service sharing, it is necessary to reasonably organize users with similar service requests into groups under the limits of group sizes. This paper explores methods to enable user grouping for sharing services with the limit on the group size. Based on user request descriptions and evaluation, a connection relation is built to present which two users could be in a group. Semi-groups can be derived from the connection relation and two grouping schemes satisfying the group size limit are further determined through proposed algorithms to meet different service expectations. Finally, a case study and a simulation are given to demonstrate the effectiveness of the proposed methods in grouping users to provide higher service benefits to both users and providers.

关键词： Quality of service Public transportation Companies Computer science Service computing Smart devices Service sharing grouping services with capacity limit asymmetric similarity

来源：评论

学校读者我要写书评

暂无评论

TFS-index-based Multi-keyword Ranked Search Scheme over Cloud Encrypted data 29

TFS-index-based Multi-keyword Ranked Search Scheme over Clou...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Deng, Yinfu Dai, Hua Liu, Yuanlong Li, Zhangchen Yang, Geng Yi, Xun Nanjing University of Post and Telecommunication Nanjing China Nanjing University of Post and Telecommunication Jiangsu Security and Intelligent Processing Lab of Big Data Nanjing China Royal Melbourne Institute of Technology University Melbourne Australia

ISBN: (纸本)9798350330717

Traditional searchable encryption schemes for clouds are generally based on TF-IDF vector space model, but they ignore the high-dimensional sparse characteristic of encrypted vectors. It will lead to substantial computational cost of inner product, and thus slows the search speed. In this paper, we propose a two-layer fast search index-based multi-keyword ranked search scheme (TFSRS) to address this problem. In the proposed TFSRS scheme, a keyword clustering-based equal-length dictionary partition (KCEDP) strategy is adopted to compress the document and search vectors, which benefits the process of inner product. Based on the strategy, a novel KCEDP-based vector space model (KCEDP-VSM) is proposed, and based on which, a two-layer fast search index (TFS-index) is presented. By using the TFS-index, secure inner product and symmetric encryption, the efficient multi-keyword ranked search scheme over encrypted cloud data is proposed. Experimental results show the better performance of the proposed schemes in search efficiency. © 2023 IEEE.

关键词： Cloud computing dictionary partition multikeyword ranked search searchable encryption

来源：评论

学校读者我要写书评

暂无评论

Estimating Power Consumption of Containers and Virtual Machines in data Centers

Estimating Power Consumption of Containers and Virtual Machi...

引用

IEEE International Conference on Cluster Computing

作者： Xusheng Zhang Ziyu Shen Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

ISBN: (数字)9781728166773

ISBN: (纸本)9781728166780

Virtualization technologies provide solutions of cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many effective models for estimating power consumption of virtual machines (VM) have been proposed, few power estimation models of containers have been put forth. In this paper, we offer a fast-training piecewise regression model based on decision tree to build a VM power estimation model and estimate the containers' power by treating the container as a group of processes on the VM. In our model, we characterize the nonlinear relationship between power and features and realize the effective estimation of the containers on the VM. We evaluate the proposed model on 13 workloads in PARSEC and compare it with several models. The experimental results prove the effectiveness of our proposed model on most workloads. Moreover, the estimated power of the containers is in line with expectations.

关键词： Power demand Processor scheduling Estimation Containers Virtual machining data models Virtualization

来源：评论

学校读者我要写书评

暂无评论

A Lexical Updating Algorithm for Sentiment Analysis on Chinese Movie Reviews 5

A Lexical Updating Algorithm for Sentiment Analysis on Chine...

引用

5th International Conference on Advanced Cloud and big data, CBD 2017

作者： Song, Yiwei Gu, Kaiwen Li, Huakang Sun, Guozi Bell Honor School Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9781538610725

With the prevalence of Internet, sentiment analysis gets popularity among the world. Researchers have made use of kinds of online documents like commodities reivews and movie reviews as training samples to train their models and classfiers, by which they could speculate the underlying emotion in new ones. Douban is a Chinese online community where users share their personal reviews to express their feelings about movies. Those Chinese movie reviews were utilized by us to train our lexicon-based model. Yet multiple words in a ready-made lexicon do not agree with the movie reviews in a specific domain, which means the original lexicon acquires being updated to gain higher accuracy. In this paper we introduce a lexical updating algorithm based on a widely used lexicon. After turns of training of updating, this lexicon is capable of classifying sentiment among movie reviews. The experimental result shows our model using the updated lexicon could get a better performance than the primitive lexicon-based model. © 2017 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A survey on trust modeling from a bayesian perspective

arXiv

引用

arXiv 2018年

作者： Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Big Data Security & Intelligent Processing

In this paper, we are concerned with trust modeling for agents in networked computing systems. As trust is a subjective notion that is invisible, implicit and uncertain in nature, many attempts have been made to model trust with aid of Bayesian probability theory, while the field lacks a global comprehensive analysis for variants of Bayesian trust models. We present a study to fill in this gap by giving a comprehensive review of the literature. A generic Bayesian trust (GBT) modeling perspective is highlighted here. It is shown that all models under survey can cast into a GBT based computing paradigm as special cases. We discuss both capabilities and limitations of the GBT perspective and point out open questions to answer for advancing it to become a pragmatic infrastructure for analyzing intrinsic relationships between variants of trust models and for developing novel ones for trust evaluation. Copyright © 2018, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Visco-acoustic Wave-equation Traveltime Inversion with Correct and Incorrect Attenuation Profiles 87

Visco-acoustic Wave-equation Traveltime Inversion with Corre...

引用

Society of Exploration Geophysicists International Exposition and 87th Annual Meeting, SEG 2017

作者： Yu, Han Chen, Yuqing Guo, Bowen Schuster, Gerard T. Division of Physical Sciences and Engineering King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210003 China

A visco-acoustic wave-equation traveltime inversion method is presented that inverts for a shallow subsurface velocity distribution with correct and incorrect attenuation profiles. Similar to the classical wave equation traveltime inversion, this method applies the misfit functional that minimizes the first break differences between the observed and predicted data. Although, WT can partly avoid the cycle skipping problem, an initial velocity model approaches to the right or wrong velocity models under different setups of the attenuation profiles. However, with a Q model far away from the real model, the inverted tomogram is obviously different from the true velocity model while a small change of the Q model does not improve the inversion quality in a strong manner if low frequency information is not lost.. © 2017 SEG.

关键词： Wave equations

来源：评论

学校读者我要写书评

暂无评论

GNEA: A Novel GCN-based Network Embedding Algorithm for Semantic Social Network 10

GNEA: A Novel GCN-based Network Embedding Algorithm for Sema...

引用

10th International Symposium on System security, Safety, and Reliability, ISSSR 2024

作者： Zhao, Jinbo He, Jinling Du, Yuanhan Tang, Ming Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China

ISBN: (纸本)9798350362930

With the development of semantic social networks, social networks become more complex and their size expands rapidly, which brings significant challenges to social network analysis. Network Embedding can transform the network from a high-dimensional adjacency matrix to a low-dimensional one, which has excellent foreground in link prediction, vertex classification, and graph visualization. Nowadays, most algorithms are proposed for static networks with little consideration of the dynamic changes in the network. However, most real-world networks change over time. Directly applying static network embedding algorithms to dynamic networks will result in poor stability, flexibility, and efficiency. Because of these shortcomings, we propose a graph convolution-based dynamic network representation learning algorithm (GNEA), which combines Graph Convolutional Network (GCN) with Long Short-Term Memory (LSTM) to train the time series networks. GCN is applied to extract features in the network, and LSTM is utilized to capture temporal information. GNEA can not only perform characterization learning on the network but also obtain more abundant information during the dynamic evolution of the network. GNEA is compared with several typical algorithms on the datasets Stochastic Block Model (SBM), Autonomous Systems (AS), and Digital Bibliography and Library Project (DBLP). The results prove that GNEA has good performance in MAP and precision@k. © 2024 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Deep Closest Point Method for Point Cloud Registration

Semi-supervised Deep Closest Point Method for Point Cloud Re...

引用

2021 International Conference on Robotics Automation and intelligent Control, ICRAIC 2021

作者： Wu, Yong Shen, Lingfeng Li, Ping Jiangsu Power Transmission and Transformation Co. Ltd. Nanjing211106 China College of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

Point cloud registration is one of the key issues in fields that need 3D scenes with global vision, including 3D scene reconstruction in robot technology, high-accuracy 3D map reconstruction in automatic driving, 3D reconstruction of real-time monitoring underground tunnel. Recently, point cloud registration methods based on deep neural networks have made great progress by learning from a large amount of well-aligned point cloud pairs. However, these large-scale labelled samples are usually difficult to obtain in the real-world applications such as visual simultaneous location and mapping of mobile robots which obtains unlabelled scene images in real time. To solve this problem, we propose a deep point cloud registration method based on the semi-supervised learning. Specifically, for the problem of less supervised data, we use Iterative Closest Point (ICP) algorithm to generate pseudo labels for the point cloud samples with unknown rigid transformations, effectively increasing the number of supervised data;in order to amend the pseudo labels, we design an alternating optimization algorithm to jointly learn the pseudo labels and deep point cloud registration model. The deep point cloud registration model and ICP are used alternately to continuously improve the precision of pseudo labels and the performance of the deep model. Experimental results show that this method can still obtain a reliable point cloud registration model even when just observing a small amount of point cloud samples with ground truth labels. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Surface measurement

来源：评论

学校读者我要写书评

暂无评论

Learning Task-aware Robust Deep Learning Systems

arXiv

引用

arXiv 2020年

作者： Han, Keji Li, Yun Long, Xianzhong Ge, Yao Nanjing University of Posts and Telecommunications China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing

Many works demonstrate that deep learning system is vulnerable to adversarial attack. A deep learning system consists of two parts: the deep learning task and the deep model. Nowadays, most existing works investigate the impact of the deep model on robustness of deep learning systems, ignoring the impact of the learning task. In this paper, we adopt the binary and interval label encoding strategy to redefine the classification task and design corresponding loss to improve robustness of the deep learning system. Our method can be viewed as improving the robustness of deep learning systems from both the learning task and deep model. Experimental results demonstrate that our learning task-aware method is much more robust than traditional classification while retaining the accuracy. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：