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

作者： Xu, Xiaolong Cai, Qing Zhang, Guoming Zhang, Jie Tian, Wei Zhang, Xiaorui Liu, Alex X. School of Computer and Software Nanjing University of Information Science and Technology Jiangsu China Jiangsu Engineering Centre of Network Monitoring Nanjing University of Information Science and Technology Jiangsu China State Key Laboratory for Novel Software Technology Nanjing University Jiangsu China Department of Computer Science and Engineering Michigan State University MI United States

Crowdsourcing is emerging as a powerful paradigm that utilizes the distributed devices to sense, collect, and upload data to satisfy the requirements of the users. Currently, with the popularity of edge computing, edge device users can act as recruiters or participants to publish or perform crowdsourcing tasks and share feedback. However, due to the individual selfishness, it is still a challenge to maximize the social welfare distribution of all the participants and the recruiters for the crowdsourcing market. In view of this challenge, an incentive mechanism for the crowdsourcing market with social welfare maximization in the cloud-edge computing is designed in this paper. Technically, a double action model under the cloud-edge computing framework is proposed first, which aims to maximize the social welfare maximization and meanwhile meet the demands of incentive compatibility, individual rationality, market clearing, and budget constraint. Secondly, a corresponding incentive mechanism is designed based on the double auction model to achieve the market fairness. Experimental evaluation and comparison analysis are conducted to validate the efficiency and effectiveness of the mechanism. © 2018 John Wiley & Sons, Ltd.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

A Novel Steganography Algorithm Based on Instance Segmentation

引用

computers, Materials & Continua 2020年第4期63卷 183-196页

作者： Ruohan Meng Qi Cui Zhili Zhou Chengsheng Yuan Xingming Sun School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China Jiangsu Engineering Centre of Network Monitoring Nanjing210044China Department of Electrical and Computer Engineering University of WindsorWindsorCanada

Information hiding tends to hide secret information in image area where is rich texture or high frequency,so as to transmit secret information to the recipient without affecting the visual quality of the image and arousing *** take advantage of the complexity of the object texture and consider that under certain circumstances,the object texture is more complex than the background of the image,so the foreground object is more suitable for steganography than the *** the basis of instance segmentation,such as Mask R-CNN,the proposed method hides secret information into each object's region by using the masks of instance segmentation,thus realizing the information hiding of the foreground object without *** method not only makes it more efficient for the receiver to extract information,but also proves to be more secure and robust by experiments.

关键词： Steganography object detection mask R-CNN irregular region

来源：评论

学校读者我要写书评

暂无评论

An efficient and secure arbitrary N-party quantum key agreement protocol using Bell states

arXiv

引用

arXiv 2023年

作者： Liu, Wen-Jie Xu, Yong Yang, Ching-Nung Gao, Pei-Pei Yu, Wen-Bin Nanjing210044 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science & Technology Nanjing210044 China School of Computer and Software Nanjing University of Information Science & Technology Nanjing210044 China Department of Computer Science and Information Engineering National Dong Hwa University Hualien974 Taiwan

Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al. [Quantum Inf. Process. 13, 2391(2014)]. However, Zhu et al. pointed out that there are some security flaws and proposed an improved version[Quantum Inf. Process. 14, 4245(2015)]. In this study, we will show Zhu et al.’s improvement still exists some security problems, and its efficiency is not high enough. For solving these problems, we utilize four Pauli operations {I, Z, X, Y } to encode two bits instead of the original two operations {I, X} to encode one bit, and then propose an efficient and secure arbitrary N-party quantum key agreement protocol. In the protocol, the channel checking with decoy single photons is introduced to avoid the eavesdropper’s flip attack, and a post-measurement mechanism is used to prevent against the collusion attack. The security analysis shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement. © 2023, CC BY.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

Malicious Clients and Contribution Co-Aware Federated Unlearning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Wang, Yang Li, Xue Chen, Siguang Nanjing University of Posts and Telecommunications Jiangsu Engineering Research Center of Communication and Network Technology Nanjing China Women’s Hospital of Nanjing Medical University Nanjing Women and Children’s Healthcare Hospital Department of Dermatology Nanjing China Hohai University College of Computer Science and Software Engineering Nanjing China

Existing federated unlearning methods to eliminate the negative impact of malicious clients on the global model are influenced by unreasonable assumptions (e.g., an auxiliary dataset) or fail to balance model performance and efficiency. To overcome these shortcomings, we propose a malicious clients and contribution co-aware federated unlearning (MCC-Fed) method. Specifically, we introduce a method for detecting malicious clients to reduce their impact on the global model. Next, we design a contribution-aware metric, which accurately quantifies the negative impact of malicious clients on the global calculating their historical contribution ratio. Then, based on this metric, we propose a novel federated unlearning method in which benign clients use the contribution-aware metric as a regularization term to unlearn the influence of malicious clients, and restoring model performance. Experimental results demonstrate that our method effectively addresses the issue of excessive unlearning during the unlearning process, improves the efficiency of performance recovery, and enhances robustness against malicious clients. © 2020 IEEE.

关键词： Federated learning federated unlearning malicious clients

来源：评论

学校读者我要写书评

暂无评论

Quantum Algorithms and Experiment Implementations Based on IBM Q

引用

computers, Materials & Continua 2020年第11期65卷 1671-1689页

作者： Wenjie Liu Junxiu Chen Yinsong Xu Jiahao Tang Lian Tong Xiaoyu Song Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and TechnologyNanjing210044China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China School of Information Engineering Jiangsu Maritime InstituteNanjing211100China Department of Electrical and Computer Engineering Portland State UniversityOregon97207USA

With the rapid development of quantum theory and technology in recent years,especially the emergence of some quantum cloud computing platforms,more and more researchers are not satisfied with the theoretical derivation and simulation verification of quantum computation(especially quantum algorithms),experimental verification on real quantum devices has become a new *** this paper,three representative quantum algorithms,namely Deutsch-Jozsa,Grover,and Shor algorithms,are briefly depicted,and then their implementation circuits are presented,*** program these circuits on python with QISKit to connect the remote real quantum devices(i.e.,ibmqx4,ibmqx5)on IBM Q to verify these *** experimental results not only show the feasibility of these algorithms,but also serve to evaluate the functionality of these devices.

关键词： Quantum algorithms implementation circuit IBM Q QISKit program

来源：评论

学校读者我要写书评

暂无评论

Quantum-based Feature Selection for Multi-Classification Problem in Complex Systems with Edge Computing

arXiv

引用

arXiv 2023年

作者： Liu, Wenjie Chen, Junxiu Wang, Yuxiang Gao, Peipei Lei, Zhibin Ma, Xu Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China 999077 Hong Kong School of Software Qufu Normal University Shandong273165 China

The complex systems with edge computing require a huge amount of multi-feature data to extract appropriate insights for their decision-making, so it is important to find a feasible feature selection method to improve the computational efficiency and save the resource consumption. In this paper, a quantum-based feature selection algorithm for the multi-classification problem, namely QReliefF, is proposed, which can effectively reduce the complexity of algorithm and improve its computational efficiency. First, all features of each sample are encoded into a quantum state by performing operations CMP and Ry, then the amplitude estimation is applied to calculate the similarity between any two quantum states (i.e., two samples). According to the similarities, the Grover-Long method is utilized to find the nearest k neighbor samples, and then the weight vector is updated. After a certain number of iterations through the above process, the desired features can be selected with regards to the final weight vector and the threshold τ. Compared with the classical ReliefF algorithm, our algorithm reduces the complexity of similarity calculation from O(MN) to O(M), the complexity of finding the nearest neighbor from O(M) to O(√M), and resource consumption from O(MN) to O(MlogN). Meanwhile, compared with the quantum Relief algorithm, our algorithm is superior in finding the nearest neighbor, reducing the complexity from O(M) to O(√M). Finally, in order to verify the feasibility of our algorithm, a simulation experiment based on Rigetti with a simple example is performed. © 2023, CC BY.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A Survey of Image Super Resolution Based on CNN 9th

A Survey of Image Super Resolution Based on CNN

引用

9th EAI International Conference on Cloud Computing, CloudComp 2019 and the 4th EAI International Conference on Smart Grid and Innovative Frontiers in Telecommunications, SmartGIFT 2019

作者： Xu, Qianxiong Zheng, Yu School of Computer and Software Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology NanjingJiangsu210044 China

ISBN: (纸本)9783030485122

With the advent of the information age in contemporary society, images are everywhere, no matter in military use or in daily life. Therefore, as a medium for people to obtain information, images have become more and more important. With the fast development of deep convolution neural networks (DCNNs), Single-Image Super-Resolution (SISR) becomes one of the techniques that have made great breakthroughs in recent years. In this paper, we give a brief survey on the task of SISR. In general, we introduce the SR problem, some recent SR methods, public benchmark datasets and evaluation metrics. Finally, we conclude by denoting some points that could be further improved in the future. © 2020, ICST Institute for computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Quantum Two-Party Geometric Intersection

arXiv

引用

arXiv 2023年

作者： Liu, Wen-Jie Xu, Yong Yang, James C.N. Yu, Wen-Bin Chi, Lian-Hua Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science & Technology Nanjing210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer Science and Information Engineering National Dong Hwa University Hualien974 Taiwan Department of Computer Science and Information Technology La Trobe University VIC3086 Australia

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. As an important field, the privacy-preserving geometric intersection (PGI) problem is when each of the multiple parties has a private geometric graph and seeks to determine whether their graphs intersect or not without revealing their private information. In this study, through representing Alice’s (Bob’s) private geometric graph GA (GB ) as the set of numbered grids SA (SB ), an efficient privacy-preserving quantum two-party geometric intersection (PQGI) protocol is proposed. In the protocol, the oracle operation OA (OB ) is firstly utilized to encode the private elements of SA (a0, a1,, aM1) (SB (b0,b1,bN1)) into the quantum states, and then the oracle operation Of is applied to obtain a new quantum state which includes the XOR results between each element of SA and SB . Finally, the quantum counting is introduced to get the amount (t ) of the states ai bj equaling to 0, and the intersection result can be obtained by judging t 0 or not. Compared with classical PGI protocols, our proposed protocol not only has higher security, but also holds lower communication complexity. © 2023, CC BY.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Partial-duplicate image retrieval using spatial and visual contextual clues

Partial-duplicate image retrieval using spatial and visual c...

引用

作者： Sun, Wendi Wang, Tao Zhou, Zhili School of Computer and Software and Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing210044 China

The traditional bag-of-visual-words (BOW) model quantifies the local features to the visual words to achieve efficient content-based image retrieval. However, since it causes considerable quantisation error and ignores the spatial relationships between visual words, the accuracy of partial-duplicate image retrieval based on BOW model is limited. In order to reduce the quantisation error and improve the discriminability of visual words, many partial-duplicate image retrieval methods have been proposed, which make use of the advantages of the geometric clues between visual words. In this paper, we propose a novel partial-duplicate scheme by using both spatial and visual contextual clues for removing the false matches effectively, which not only encodes the relationships of orientation, distance and dominant orientation between the referential visual word and its context, but also takes the colour information between visual words into consideration. Experimental results reveal that our proposed algorithm achieves superior performance to the state-of-the-art methods for partial-duplicate image retrieval. Copyright © 2020 Inderscience Enterprises Ltd.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource provisioning for workflow scheduling under uncertainty in edge computing environment

Dynamic resource provisioning for workflow scheduling under ...

引用

作者： Xu, Xiaolong Cao, Hao Geng, Qingfan Liu, Xihua Dai, Fei Wang, Chuanjian School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China Nanjing University of Information Science and Technology Nanjing China Engineering Research Center of Digital Forensics Ministry of Education Nanjing China School of Big Data and Intelligence Engineering Southwest Forestry University Kunming China College of Information Science and Technology Shihezi University Xinjiang China

Edge computing, an extension of cloud computing, is introduced to provide sufficient computing and storage resources for mobile devices. Moreover, a series of computing tasks in a mobile device are set as structured computing processes and flows to achieve effective management by the workflow. However, the execution uncertainty caused by performance degradation, service failure, and new service additions remains a huge challenge to the user's service experience. In order to address the uncertainty, a software-defined network (SDN)-based edge computing framework and a dynamic resource provisioning (UARP) method are proposed in this paper. The UARP method is implemented in the proposed framework and addresses the uncertainty through the advantages of SDN. In addition, the nondominated sorting genetic algorithm-III is employed to optimize two goals, that is, the energy consumption and the completion time, to obtain balanced scheduling strategies. The comparative experiments are performed and the results show that the UARP method is superior to other methods in addressing the uncertainty, while reducing energy consumption and shortening the completion time. © 2020 John Wiley & Sons, Ltd.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：