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

An Incentive Mechanism Considering Privacy Metric for Personalized Application

IEEE Transactions on Consumer Electronics 2025年

作者： Xie, Yun Li, Peng Zhang, Jindan Attar, Razaz Waheeb Arya, Varsha Gupta, Brij B. Nanjing Vocational College of Information Technology Jiangsu Province Service Customization Network Application Engineering Research Center Jiangsu Province Service Customization Network Application Engineering Research Center Nanjing210023 China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing210023 China Xianyang Polytechnic Institute China Princess Nourah bint Abdulrahman University College of Business Administration Management Department Riyadh11671 Saudi Arabia Hong Kong Metropolitan University Hong Kong Hong Kong Center for Interdisciplinary Research Dehradun India Asia University Department of Computer Science and Information Engineering Taichung413 Taiwan China Medical University Hospital China Medical University Department of Medical Research Taichung Taiwan Pune India Korea University School of Cybersecurity Seoul Korea Republic of Kyung Hee University Kyungheedae-ro Seoul26 Korea Republic of

Edge-based federated learning (EFL) is a solution for personalized applications. It addresses the limitations of cloud-based consumer service systems, such as data privacy and network latency. To further enhance the EFL system’s ability to protect data privacy, differential privacy (DP) is introduced. It is crucial to motivate high-quality collaboration among participants for optimal performance of the DP-EFL system. Researchers primarily focus on efficient learning algorithms, optimized resource scheduling, and user-oriented incentive mechanisms. Existing research exhibits notable limitations in modeling and analyzing the heterogeneity of resource costs (e.g., communication costs), particularly failing to comprehensively account for the additional costs imposed by participants’ privacy protection mechanisms‌. To address this gap, we propose a novel market transaction model based on Stackelberg game theory. This framework integrates incentive-driven reward allocation mechanisms to rigorously investigate the collaborative behaviors and strategic interactions between edge nodes (ENs) and the cloud server (CS)‌. We incorporate privacy costs into the multidimensional costs of participants with privacy metric, and based on this, derived collaboration strategies between ENs and CS, thus solving the Stackelberg game problem by theoretical analysis. Furthermore, numerical experiments validated the rationality of our proposed model, the impact of strategies on the performance of collaborators, and the advantages over other incentive mechanisms. © 2025 IEEE. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

DVO + LCLMF: A web service recommendation mechanism with QoS privacy preservation

引用

Concurrency and Computation: Practice and Experience 2022年第18期34卷 e7003-e7003页

作者： Li, Kui Ji, Yi-mu Liu, Shang-dong Wu, Fei Yao, Hai-chang He, Jing Liu, Qiang Liu, Yan-lan Shao, Si-si You, Shuai School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Nantong Bigdata Research Key Laboratory for Rehabilitation Medicine The Second People's Hospital of Nantong Nantong China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China Institute of High Performance Computing and Bigdata Nanjing University of Posts and Telecommunications Nanjing China Jiangsu HPC and Intelligent Processing Engineer Research Center Nanjing China School of Software and Electrical Engineering Swinburne University of Technology MelbourneVIC Australia

QoS-aware based web service recommendation is one of the crucial solutions to help users find high-quality web services. To accurately predict the QoS values of candidate services, it is usually required to collect historical QoS data of users (QoS data for short). If these collected QoS data are improperly processed, QoS data privacy may be threatened. However, how to accurately predict the QoS values of candidate services while protecting QoS data privacy has not been well studied. In response to the situation, we propose a hybrid web service recommendation mechanism, which is divided into three parts. In the first part, the QoS data privacy preservation algorithm, which called DVO, is proposed based on keeping the cosine similarity of QoS data unchanged, that is, to realize the confusion of QoS data while ensuring the availability of QoS data remains unchanged. In the second part, a hybrid matrix factorization model based on location information and service features, which called LCLMF, is proposed to improve the accuracy of QoS values prediction. According to DVO and LCLMF, the DVO + LCLMF is designed in the third part, which can accurately predict QoS values while protecting QoS data privacy. The experimental results show that DVO + LCLMF can accurately predict the QoS values of candidate services on the basis of attaining QoS data privacy protection. © 2022 John Wiley & Sons, Ltd.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Model Incorporating Knowledge Representation Vectors and Its Application in Diabetes Prediction

引用

Disease Markers 2022年第1期2022卷 7593750页

作者： Xu, He Zheng, Qunli Zhu, Jingshu Xie, Zuoling Cheng, Haitao Li, Peng Ji, Yimu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Province Nanjing 210023 China Institute of High Performance Computing and Big Data Nanjing University of Posts and Telecommunications Nanjing 210023 China Nanjing Center of HPC China Nanjing 210023 China Jiangsu Research Engineering of HPC and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Department of Endocrinology Zhongda Hospital Southeast University Nanjing 210009 China

The deep learning methods for various disease prediction tasks have become very effective and even surpass human experts. However, the lack of interpretability and medical expertise limits its clinical application. This paper combines knowledge representation learning and deep learning methods, and a disease prediction model is constructed. The model initially constructs the relationship graph between the physical indicator and the test value based on the normal range of human physical examination index. And the human physical examination index for testing value by knowledge representation learning model is encoded. Then, the patient physical examination data is represented as a vector and input into a deep learning model built with self-attention mechanism and convolutional neural network to implement disease prediction. The experimental results show that the model which is used in diabetes prediction yields an accuracy of 97.18% and the recall of 87.55%, which outperforms other machine learning methods (e.g., lasso, ridge, support vector machine, random forest, and XGBoost). Compared with the best performing random forest method, the recall is increased by 5.34%, respectively. Therefore, it can be concluded that the application of medical knowledge into deep learning through knowledge representation learning can be used in diabetes prediction for the purpose of early detection and assisting diagnosis. © 2022 He Xu et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A polynomial-time algorithm for simple undirected graph isomorphism

A polynomial-time algorithm for simple undirected graph isom...

引用

作者： He, Jing Chen, Jinjun Huang, Guangyan Cao, Jie Zhang, Zhiwang Zheng, Hui Zhang, Peng Zarei, Roozbeh Sansoto, Ferry Wang, Ruchuan Ji, Yimu Fan, Weibei Xie, Zhijun Wang, Xiancheng Guo, Mengjiao Chi, Chi-Hung de Souza, Paulo A. Zhang, Jiekui Li, Youtao Chen, Xiaojun Shi, Yong Green, David Kersi, Taraporewalla Van Zundert, André Institute of Information Technology Nanjing University of Finance and Economics Nanjing China Swinburne Data Science Research Institute Swinburne University of Technology Melbourne Australia School of Information Technology Deakin University Melbourne Australia Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing University of Posts and Telecommunications Nanjing China Department of Information Science and Engineering Ningbo University Ningbo China Ningbo Institute of Technology Zhejiang University Ningbo China CSIRO TAS Australia JingQi Smart Healthcare Pty Ltd Hefei China Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong Research Center on Fictitious Economy and Data Sciences Chinese Academy of Sciences Beijing China Faculty of Information Technology Monash University Melbourne Australia Royal Brisbane and Women's Hospital Herston Australia

The graph isomorphism problem is to determine two finite graphs that are isomorphic which is not known with a polynomial-time solution. This paper solves the simple undirected graph isomorphism problem with an algorithmic approach as NP=P and proposes a polynomial-time solution to check if two simple undirected graphs are isomorphic or not. Three new representation methods of a graph as vertex/edge adjacency matrix and triple tuple are proposed. A duality of edge and vertex and a reflexivity between vertex adjacency matrix and edge adjacency matrix were first introduced to present the core idea. Beyond this, the mathematical approval is based on an equivalence between permutation and bijection. Because only addition and multiplication operations satisfy the commutative law, we propose a permutation theorem to check fast whether one of two sets of arrays is a permutation of another or not. The permutation theorem was mathematically approved by Integer Factorization Theory, Pythagorean Triples Theorem, and Fundamental Theorem of Arithmetic. For each of two n-ary arrays, the linear and squared sums of elements were respectively calculated to produce the results. © 2019 John Wiley & Sons, Ltd.

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

SEBF: A single-chain based extension model of blockchain for fintech 29

SEBF: A single-chain based extension model of blockchain for...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Ji, Yimu Gu, Weiheng Chen, Fei Xiao, Xiaoying Sun, Jing Liu, Shangdong He, Jing Li, Yunyao Zhang, Kaixiang Mei, Fen Wu, Fei School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China Institue of High Performance Computing and Bigdata Nanjing University of Posts and Telecommunications Nanjing China Nanjing Center of HPC China Nanjing China Jiangsu HPC and Intelligent Processing Engineer Research Center Nanjing China Institute of Information Technology Nanjing University of Finance and Economics Nanjing China School of Software and Electrical Engineering Swinburne University of Technology Hawthorn Australia WeBank Co. Ltd. Shenzhen China College of Automation Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9780999241165

The traditional blockchain has the shortcoming that a single-chain can only deal with one or a few specific data types. The research question of how to make blockchain be able to deal with various data types has not been well studied. In this paper, we propose a single-chain based extension model of blockchain for fintech (SEBF). In the financial environment, we design a four-layer architecture for this model. By employing the external trusted oracle group and a financial regulator agency, a variety types of data can be effectively stored in the blockchain, such that the data type extension based on a single-chain is realized. The experimental results indicate that the proposed model can improve the efficiency of simplified payment verification. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Compressed Sensing MRI via a Multi-scale Dilated Residual Convolution Network

arXiv

引用

arXiv 2019年

作者： Dai, Yuxiang Zhuang, Peixian Jiangsu Key Laboratory of Meteorological Observation and Information Processing Jiangsu Technology and Engineering Center of Meteorological Sensor Network School of Electronic and Information Engineering Nanjing University of Information Science and Technology Nanjing210044 China

Magnetic resonance imaging (MRI) reconstruction is an active inverse problem which can be addressed by conventional compressed sensing (CS) MRI algorithms that exploit the sparse nature of MRI in an iterative optimization-based manner. However, two main drawbacks of iterative optimization-based CSMRI methods are time-consuming and are limited in model capacity. Meanwhile, one main challenge for recent deep learning-based CSMRI is the trade-off between model performance and network size. To address the above issues, we develop a new multi-scale dilated network for MRI reconstruction with high speed and outstanding performance. Comparing to convolutional kernels with same receptive fields, dilated convolutions reduce network parameters with smaller kernels and expand receptive fields of kernels to obtain almost same information. To maintain the abundance of features, we present global and local residual learnings to extract more image edges and details. Then we utilize concatenation layers to fuse multi-scale features and residual learnings for better reconstruction. Compared with several non-deep and deep learning CSMRI algorithms, the proposed method yields better reconstruction accuracy and noticeable visual improvements. In addition, we perform the noisy setting to verify the model stability, and then extend the proposed model on a MRI super-resolution task. Keywords: MRI Reconstruction, Dilated Convolution, Residual Learning, Copyright © 2019, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

QoE-Driven Big Data Management in Pervasive Edge Computing Environment

引用

Big Data Mining and Analytics 2018年第3期1卷 222-233页

作者： Qianyu Meng Kun Wang Xiaoming He Minyi Guo Jiangsu Engineering Research Center of Communication and Network Technology Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing University of Posts and Telecommunications Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai Jiao Tong University

In the age of big data, services in the pervasive edge environment are expected to offer end-users better Quality-of-Experience(QoE) than that in a normal edge environment. However, the combined impact of the storage, delivery, and sensors used in various types of edge devices in this environment is producing volumes of high-dimensional big data that are increasingly pervasive and redundant. Therefore, enhancing the QoE has become a major challenge in high-dimensional big data in the pervasive edge computing environment. In this paper, to achieve high QoE, we propose a QoE model for evaluating the qualities of services in the pervasive edge computing environment. The QoE is related to the accuracy of high-dimensional big data and the transmission rate of this accurate data. To realize high accuracy of high-dimensional big data and the transmission of accurate data through out the pervasive edge computing environment, in this study we focused on the following two ***, we formulate the issue as a high-dimensional big data management problem and test different transmission rates to acquire the best QoE. Then, with respect to accuracy, we propose a Tensor-Fast Convolutional Neural Network(TF-CNN) algorithm based on deep learning, which is suitable for high-dimensional big data analysis in the pervasive edge computing environment. Our simulation results reveal that our proposed algorithm can achieve high QoE performance.

关键词： Quality-of-Experience(QoE) high-dimensional big data management deep learning pervasive edge computing

来源：评论

学校读者我要写书评

暂无评论

Correction to: Underwater image enhancement using an edge-preserving filtering Retinex algorithm

引用

Multimedia Tools and Applications 2020年第25期79卷 17279-17279页

作者： Peixian Zhuang Xinghao Ding Jiangsu Key Laboratory of Meteorological Observation and Information Processing Jiangsu Technology and Engineering Center of Meteorological Sensor Network School of Electronic and Information Engineering Nanjing University of Information Science and Technology Nanjing China Fujian Key Laboratory of Sensing and Computing for Smart City School of Information Science and Engineering Xiamen University Xiamen China

In the original publication, Equations were incorrectly presented. The original article has been corrected.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computation Offloading and Resource Allocation for MEC in C-RAN: A Deep Reinforcement Learning Approach 19

Computation Offloading and Resource Allocation for MEC in C-...

引用

19th IEEE International Conference on Communication technology, ICCT 2019

作者： Jin, Xiaoyan Zhang, Jun Sun, Xinghua Zhang, Ping Cai, Shu Jiangsu Key Laboratory of Wireless Communications Nanjing University of Posts and Telecommunications Nanjing210003 China Engineering Research Center of Health Service System Based on Ubiquitous Wireless Networks Ministry of Education Nanjing University of Posts and Telecommunications Nanjing210003 China School of Electronics and Communication Engineering Sun Yat-sen University Guangzhou510006 China Key Laboratory of Wireless Sensor Network and Communication Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai200050 China Key Laboratory of Computer Application Technology Anhui Polytechnic University Wuhu241000 China

ISBN: (纸本)9781728105352

Mobile edge computing (MEC) technology has become a promising example for cloud radio access networks (CRAN) to provide close-range services, thereby reducing service delays and saving energy consumption. In this paper, we consider a multi-user MEC system and solve the problem of the computation offloading strategies and resource allocation policies. We set the total cost of delays and energy consumption as our optimization goal. However, getting an optimal strategy in a dynamic environment is challenging. Reinforcement learning (RL) aims at long-term cumulative rewards, which are essential for time-varying dynamic systems. Therefore, we propose an optimization framework based on deep RL to solve these problems. The deep neural network (DNN) is used to estimate the value function of the critics, thereby reducing the state space complexity of the optimization target. The actor part uses another DNN to represent a parametritis stochastic strategy and improve the strategy with the help of critics. Compared with other schemes, the simulation results show that the scheme significantly reduces the total cost. © 2019 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Load Feedback-Based Resource Scheduling and Dynamic Migration-Based Data Locality for Virtual Hadoop Clusters in OpenStack-Based Clouds

引用

Tsinghua Science and technology 2017年第2期22卷 149-159页

作者： Dan Tao Zhaowen Lin Bingxu Wang School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003China Network and Information Center Institute of Network TechnologyScience and Technology on Information Transmission and Dissemination in Communication Networks LaboratoryNational Engineering Laboratory for Mobile Network SecurityBeijing University of Posts and TelecommunicationsBeijing 100876China

With cloud computing technology becoming more mature, it is essential to combine the big data processing tool Hadoop with the Infrastructure as a Service（Iaa S） cloud platform. In this study, we first propose a new Dynamic Hadoop Cluster on Iaa S（DHCI） architecture, which includes four key modules： monitoring,scheduling, Virtual Machine（VM） management, and VM migration modules. The load of both physical hosts and VMs is collected by the monitoring module and can be used to design resource scheduling and data locality solutions. Second, we present a simple load feedback-based resource scheduling scheme. The resource allocation can be avoided on overburdened physical hosts or the strong scalability of virtual cluster can be achieved by fluctuating the number of VMs. To improve the flexibility, we adopt the separated deployment of the computation and storage VMs in the DHCI architecture, which negatively impacts the data locality. Third, we reuse the method of VM migration and propose a dynamic migration-based data locality scheme using parallel computing entropy. We migrate the computation nodes to different host（s） or rack（s） where the corresponding storage nodes are deployed to satisfy the requirement of data locality. We evaluate our solutions in a realistic scenario based on Open *** experimental results demonstrate the effectiveness of our solutions that contribute to balance the workload and performance improvement, even under heavy-loaded cloud system conditions.

关键词： Hadoop resource scheduling data locality Infrastructure as a Service（Iaas） OpenStack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：