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

arXiv 2019年

作者： Hao, Yixue Miao, Yiming Tian, Yuanwen Hu, Long Shamim Hossain, M. Muhammad, Ghulam Amin, Syed Umar Huazhong University of Science and Technology Department of Software Engineering College of Computer and Information Sciences King Saud University Department of Computer Engineering College of Computer and Information Sciences King Saud University

The development of mobile communication technology, hardware, distributed computing, and artificial intelligence (AI) technology has promoted the application of edge computing in the field of heterogeneous Internet of Things (IoT). In order to overcome the defects of the traditional cloud computing model in the era of big data. In this article, we first propose a new AI-enabled smart edge with heterogeneous IoT architecture which combines edge computing, caching, and communication. Then, we propose the Smart-Edge-CoCaCo algorithm. To minimize total delay and confirm the computation offloading decision, Smart-Edge-CoCaCo uses joint optimization of the wireless communication model, the collaborative filter caching model in edge cloud, and the computation offloading model. Finally, we built an emotion interaction testbed to perform computational delay experiments in real environments. The experiment results showed that the computation delay of the Smart-Edge-CoCaCo algorithm is lower than that of traditional cloud computing model with the increase of computing task data and the number of concurrent users. Copyright © 2019, The Authors. All rights reserved.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

NERank+: a graph-based approach for entity ranking in document collections

引用

计算机科学前沿 2018年第3期12卷 504-517页

作者： Chengyu WANG Guomin ZHOU Xiaofeng HE Aoying ZHOU Shanghai Key Laboratory of Trustworthy Computing School of Computer Science and Software EngineeringEast China Normal University Shanghai 200062 China Department of Computer and Information Technology Zhejiang Police College Hangzhou 310053 China School of Data Science and Engineering East China Normal University Shanghai 200062 China

Most entity ranking research aims to retrieve a ranked list of entities from a Web corpus given a user *** rank order of entities is determined by the relevance between the query and contexts of ***,entities can be ranked directly based on their relative importance in a document collection,independent of any *** this paper,we introduce an entity ranking algorithm named NERank+.Given a document collection,NERank+ first constructs a graph model called Topical Tripartite Graph,consisting of document,topic and entity *** design separate ranking functions to compute the prior ranks of entities and topics,respectively.A meta-path constrained random walk algorithm is proposed to propagate prior entity and topic ranks based on the graph *** evaluate NERank+ over real-life datasets and compare it with *** results illustrate the effectiveness of our approach.

关键词： entity ranking Topical Tripartite Graph prior rank estimation meta-path constrained random walk

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Clustering of Complex Symbolic Data and Application for Emitter Identification

引用

Journal of computer science & Technology 2018年第4期33卷 807-822页

作者： Xin Xu Jiaheng Lu Wei Wang Laboratory of Science and Technology on Information System Engineering Nanjing Research Institute of Electronics Engineering Nanjing 21000~ China Department of Computer Science University of Helsinki Helsinki 00014 Finland State Key Laboratory for Novel Software and Technology Nanjing University Nanjing 210046 China

It is well-known that the values of symbolic variables may take various forms such as an interval, a set of stochastic measurements of some underlying patterns or qualitative multi-values and so on. However, the majority of existing work in symbolic data analysis still focuses on interval values. Although some pioneering work in stochastic pattern based symbolic data and mixture of symbolic variables has been explored, it still lacks flexibility and computation efficiency to make full use of the distinctive individual symbolic variables. Therefore, we bring forward a novel hierarchical clustering method with weighted general Jaccard distance and effective global pruning strategy for complex symbolic data and apply it to emitter identification. Extensive experiments indicate that our method has outperformed its peers in both computational efficiency and emitter identification accuracy.

关键词： symbolic data analysis stochastic pattern fuzzy interval hierarchical clustering emitter identification

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving image retrieval based on additive secret sharing

arXiv

引用

arXiv 2020年

作者： Xia, Zhihua Gu, Qi Xiong, Lizhi Zhou, Wenhao Weng, Jian Engineering Research Center of Digital Forensics Ministry of Education School of Computer and Software Jiangsu Engineering Center of Network Monitoring Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology Nanjing University of Information Science & Technology Nanjing210044 China Jinan University Guangzhou510632 China

The rapid growth of digital images motivates individuals and organizations to upload their images to the cloud server. To preserve the privacy, image owners would prefer to encrypt the images before uploading, but it would strongly limit the efficient usage of images. Plenty of existing schemes on privacy-preserving Content-Based Image Retrieval (PPCBIR) try to seek the balance between security and retrieval ability. However, compared to the advanced technologies in CBIR like Convolutional Neural Network (CNN), the existing PPCBIR schemes are far deficient in both accuracy and efficiency. With more cloud service providers, the collaborative secure image retrieval service provided by multiple cloud servers becomes possible. In this paper, inspired by additive secret sharing technology, we propose a series of additive secure computing protocols on numbers and matrices with better efficiency, and then show their application in PPCBIR. Specifically, we extract CNN features, decrease the dimension of features and build the index securely with the help of our protocols, which include the full process of image retrieval in plaintext domain. The experiments and security analysis demonstrate the efficiency, accuracy and security of our scheme. Copyright © 2020, The Authors. All rights reserved.

关键词： Additives

来源：评论

学校读者我要写书评

暂无评论

Fingerprint-based access to personally controlled health records in emergency situations

引用

science China(information sciences) 2018年第5期61卷 338-340页

作者： Shaopeng GUAN Yongyu WANG Jian SHEN School of Information and Electronic Engineering Shandong Institute of Business and Technology Haian High-Tech Research Institute of Nanjing University School of Computer and Software Nanjing University of Information Science and Technology

Dear editor,Medical records are the original diagnosis and treatment calendar of the patient in medical institutions,including the patient’s personal information,diagnosis results,treatment methods,prescriptions,and medical *** records not only form the basis for the treatment of patients,but also provide a reference for future ***,medical records are handwritten by *** the application of information and network technology in the medical

关键词： Fingerprint-based access to personally controlled health records in emergency situations

来源：评论

学校读者我要写书评

暂无评论

Group Recommendation with Latent Voting Mechanism

Group Recommendation with Latent Voting Mechanism

引用

International Conference on Data engineering

作者： Lei Guo Hongzhi Yin Qinyong Wang Bin Cui Zi Huang Lizhen Cui Shandong Normal University Jinan China School of Information Technology and Electrical Engineering The University of Queensland Australia Department of Computer Science & Key Laboratory of High Confidence Software Technologies (MOE) Peking University Shandong University Jinan China

ISBN: (数字)9781728129037

ISBN: (纸本)9781728129044

Group Recommendation (GR) is the task of suggesting relevant items/events for a group of users in online systems, whose major challenge is to aggregate the preferences of group members to infer the decision of a group. Prior group recommendation methods applied predefined static strategies for preference aggregation. However, these static strategies are insufficient to model the complicated decision making process of a group, especially for occasional groups which are formed adhoc. Compared to conventional individual recommendation task, GR is rather dynamic and each group member may contribute differently to the final group decision. Recent works argue that group members should have non-uniform weights in forming the decision of a group, and try to utilize a standard attention mechanism to aggregate the preferences of group members, but they do not model the interaction behavior among group members, and the decision making process is largely *** this work, we study GR in a more general scenario, that is Occasional Group Recommendation (OGR), and focus on solving the preference aggregation problem and the data sparsity issue of group-item interactions. Instead of exploring new heuristic or vanilla attention-based mechanism, we propose a new social self-attention based aggregation strategy by directly modeling the interactions among group members, namely Group Self-Attention (GroupSA). In GroupSA, we treat the group decision making process as multiple voting processes, and develop a stacked social self-attention network to simulate how a group consensus is reached. To overcome the data sparsity issue, we resort to the relatively abundant user-item and user-user interaction data, and enhance the representation of users by two types of aggregation methods. In the training process, we further propose a joint training method to learn the user/item embeddings in the group-item recommendation task and the user-item recommendation task simultaneously. Finally, we

关键词： Task analysis Decision making Training Aggregates Optimization Feeds Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Full-Blind Delegating Private Quantum Computation

引用

computers, Materials & Continua 2018年第8期56卷 211-223页

作者： Wenjie Liu Zhenyu Chen Jinsuo Liu Zhaofeng Su Lianhua Chi Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science&TechnologyNanjing210044China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China State Grid Electric Power Research Institute NARI Group CorporationNanjing210003China Centre for Quantum Software and Information Faculty of Engineering and Information TechnologyUniversity of Technology SydneyNSW2007Australia Department of Computer Science and Information Technology La Trobe UniversityVIC3086Australia

The delegating private quantum computation(DQC)protocol with the universal quantum gate set{X,Z,H,P,R,CNOT}was firstly proposed by Broadbent et al.[Broadbent(2015)],and then Tan et al.[Tan and Zhou(2017)]tried to put forward a half-blind DQC protocol(HDQC)with another universal set{H,P,CNOT,T}.However,the decryption circuit of Toffoli gate(i.e.T)is a little redundant,and Tan et al.’s protocol[Tan and Zhou(2017)]exists the information *** addition,both of these two protocols just focus on the blindness of data(*** client’s input and output),but do not consider the blindness of computation(*** delegated quantum operation).For solving these problems,we propose a full-blind DQC protocol(FDQC)with quantum gate set{H,P,CNOT,T},where the desirable delegated quantum operation,one of{H,P,CNOT,T},is replaced by a fixed sequence(H,P,CZ,CNOT,T)to make the computation blind,and the decryption circuit of Toffoli gate is also *** shows that our protocol can not only correctly perform any delegated quantum computation,but also holds the characteristics of data blindness and computation blindness.

关键词： Delegating private quantum computation universal quantum gate set full-blind Toffoli gate circuit optimization

来源：评论

学校读者我要写书评

暂无评论

Maximizing Reliability of Data-Intensive Workflow Systems with Active Fault Tolerance Schemes in Cloud

Maximizing Reliability of Data-Intensive Workflow Systems wi...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Weiling Li Xiaoning Sun Kewen Liao Yunni Xia Feifei Chen Qiang He School of Computer Science and Technology Dongguan University of Technology Dongguan China School of Computer Science Chongqing University Chongqing China Discipline of Information Technology Peter Faber Business School Australian Catholic University Sydney Australia School of Information Technology Deakin University Geelong Australia School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia

ISBN: (数字)9781728187808

ISBN: (纸本)9781728187815

Most existing researches on cloud workflow systems have focused on resource scheduling with the aims to minimize system delay under budget constraints or optimize system cost under deadline constraints. However, cloud providers cannot guarantee a failure-free cloud environment, a compact scheduling plan is prone to failure, thus, workflow system reliability has been identified as a critical and challenging issue in the volatile cloud environment. With the ability of cloud, it is easy for users to implement the active fault tolerance schemes, e.g., Scale-Out. However, it will lead to issues like security problem and extra management cost. In this paper, we first investigate Scale-Up and Scale-Hybrid schemes to fully explore the possibilities offered by the ability of cloud. We formally model the problem of optimizing the reliability of a cloud workflow system under budget constraints with these three fault-tolerance schemes. These optimization problems are discrete and non-convex. Thus, we propose a genetic algorithm based method for workflow fault tolerance (GA4WFT). Finally, we evaluate the effectiveness and efficiency of proposed GA4WFT with three different fault-tolerance schemes through experiments conducted on Amazon EC2 data.

关键词： Cloud computing Fault tolerance Fault tolerant systems Delays Security Optimization Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Endurable SSD-Based Read Cache for Improving the Performance of Selective Restore from Deduplication Systems

引用

Journal of computer science & Technology 2018年第1期33卷 58-78页

作者： Jian Liu Yun-Peng Chai Xiao Qin Yao-Hong Liu Division of Computer Science and Engineering Louisiana State University Baton Rouge LA 70803 U.S.A. Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Shelby Center for Engineering Technology Department of Computer Science and Software Engineering Samuel Ginn College of Engineering Auburn University Auburn AL 368~9-53~7 U.S.A.

Deduplication has been commonly used in both enterprise storage systems and cloud storage. To overcome the performance challenge for the selective restore operations of deduplication systems, solid-state-drive-based （i.e., SSD-based） re^d cache cm, be deployed for speeding up by caching popular restore contents dynamically. Unfortunately, frequent data updates induced by classical cache schemes （e.g., LRU and LFU） significantly shorten SSDs＇ lifetime while slowing down I/O processes in SSDs. To address this problem, we propose a new solution -- LOP-Cache to greatly improve tile write durability of SSDs as well as I/O performance by enlarging the proportion of long-term popular （LOP） data among data written into SSD-based cache. LOP-Cache keeps LOP data in the SSD cache for a long time period to decrease the number of cache replacements. Furthermore, it prevents unpopular or unnecessary data in deduplication containers from being written into the SSD cache. We implemented LOP-Cache in a prototype deduplication system to evaluate its pertbrmance. Our experimental results indicate that LOP-Cache shortens the latency of selective restore by an average of 37.3% at the cost of a small SSD-based cache with only 5.56% capacity of the deduplicated data. Importantly, LOP-Cache improves SSDs＇ lifetime by a factor of 9.77. The evidence shows that LOP-Cache offers a cost-efficient SSD-based read cache solution to boost performance of selective restore for deduplication systems.

关键词： data deduplication solid state drive （SSD） flash cache endurance

来源：评论

学校读者我要写书评

暂无评论

A Commodity Review Sentiment Analysis Based on BERT-CNN Model

A Commodity Review Sentiment Analysis Based on BERT-CNN Mode...

引用

International Conference on computers, Communications, and Systems (ICCCS)

作者： Junchao Dong Feijuan He Yunchuan Guo Huibing Zhang Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China Department of Computer Science Xi'an Jiaotong University City College Xi'an China Chinese Academy of Sciences Institute of Information Engineering Beijing China

ISBN: (数字)9781728161365

ISBN: (纸本)9781728161372

Sentiment analysis through the investigation on commodity reviews will be of great importance to commodity quality improvement of the seller and subsequent consumption choice of buyers. The accuracy of the existing sentiment analysis models remains to be further improved, so a BERT-CNN sentiment analysis model, an improvement of the original BERT model, was proposed in this paper in order to improve the accuracy of commodity sentiment analysis. Firstly, BERT model was constructed, and then a representation layer was input into the model to encode the review texts; after then, CNN semantic extraction layer was utilized to extract local features of the review text vectors, BERT semantic extraction layer to extract global features of the review text vectors and semantic connection layer to fuse features extracted by the two complementary models; in the end, a sentiment analysis of online commodity reviews was performed via the sentiment classification layer. The experimental results indicated that in comparison with BERT and CNN models, F1 value of BERTCNN model was elevated by about 14.4% and 17.4%, respectively.

关键词： Analytical models Semantics Sentiment analysis Feature extraction Data mining Bit error rate Context modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：