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

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Huang, Yao Yu, Zhongyuan Wang, Guijuan Chai, Baobao Zhang, Hongliang Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250353 China School of Information Science and Engineering Lanzhou University Lanzhou730000 China School of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

ISBN: (纸本)9789819615414

Many sophisticated cloud platforms are available to provide services such as storage and computation for Internet of Things (IoT) applications. However, with the concerns about the semi-trusted nature of cloud platforms, data security and privacy have been gaining broad attention. In this paper, we propose a blockchain-assisted verifiable data sharing scheme (BAV-DSS) for IoT. The BAV-DSS features fine-grained access control, fast encryption, and outsourced decryption with verifiability. Specifically, with the application of ciphertext-policy attribute-based encryption (CP-ABE), flexible access control is enabled. Blockchain is employed to store public keys, generate account addresses, and perform data verification. Furthermore, the selective replayable chosen ciphertext attacks (sRCCA) security of BAV-DSS is proved, and the simulation results indicate that BAV-DSS obtains high efficiency and practicality compared to other schemes. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

AoI-Delay Tradeoff in Mobile Edge Caching: A Lyapunov Optimization-Based Method

引用

IEEE Internet of Things Journal 2025年第11期12卷 16266-16281页

作者： Li, Ran Huang, Chuan Qin, Xiaoqi Fu, Zhanhong Yang, Lei Yang, Dong The Future Network of Intelligence Institute The Chinese University of HongKong Shenzhen518172 China The Department of Information Engineering The Chinese University of Hong Kong Hong Kong The School of Science and Engineering The Future Network of Intelligence Institute The Chinese University of HongKong Shenzhen518172 China The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China SF Technology Shenzhen518052 China The Department of Computer Science and Engineering University of Nevada RenoNV89557 United States The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China

Mobile edge caching (MEC) is a promising technique to improve the quality of service (QoS) for mobile users (MU) by bringing data to the network edge. However, optimizing the crucial QoS aspects of message freshness and service promptness, measured by age of information (AoI) and service delay, respectively, entails a tradeoff due to their competition for shared edge resources. This paper investigates this tradeoff by formulating their weighted sum minimization as a sequential decision-making problem, incorporating high-dimensional, discrete-valued, and linearly constrained design variables. First, to assess the feasibility of the considered problem, we characterize the corresponding achievable region by deriving its superset with the rate stability theorem and its subset with a novel stochastic policy, and develop a sufficient condition for the existence of solutions. Next, to efficiently solve this problem, we propose a mixed-order drift-plus-penalty algorithm by jointly considering the linear and quadratic Lyapunov drifts and then optimizing them with dynamic programming (DP). Finally, by leveraging the Lyapunov optimization technique, we demonstrate that the proposed algorithm achieves an O(1/V) versus O(V) tradeoff for the average AoI and average service delay. © 2014 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for MEC in Ultra-dense networks

引用

Journal of computers (Taiwan) 2025年第1期36卷 143-162页

作者： Ma, Huan Li, Shuyun Wang, Zhihui Dou, Xubing Zhang, Xinchang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China Shandong Normal University Jinan China

In the complex context of 5G ultra-dense networks, the unprecedented growth in traffic and computing demand has made the interaction between edge devices and edge servers extremely intricate due to the time-varying nature of the network environment and resource heterogeneity. The combination of UDN and Mobile Edge Computing not only significantly improves network performance but also expands application scenarios and enhances user experience, marking it as one of the crucial trends in future network development. In this paper, we review recent results and research progress on MEC-based resource allocation in 5G ultra-dense networks. We analyze resource allocation strategies from multiple dimensions, including user association, interference management, energy efficiency optimization, delay reduction, access selection, and user mobility. Finally, we discuss the challenges and open issues that need to be addressed for future development in this area. © 2025 Codon Publications. All rights reserved.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

DCGSD: Low-Light Image Enhancement with Dual-Conditional Guidance Sparse Diffusion Model

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Jin, Haiyan Wang, Jing Zuo, Fengyuan Su, Haonan Xiao, Zhaolin Wang, Bin Zhang, Yuanlin Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Department of Computer Science and Engineering NO. 5 South Jinhua Road Shaanxi Xi'an710048 China

When restoring low-light images, most methods largely overlook the ambiguity due to dark noise and lack discrimination for region and shape representations, resulting in invalid feature enhancement. In this work, we propose a physically explainable and prior guidance model for low-light image enhancement, termed Dual-Conditional Guidance Sparse Diffusion (DCGSD). Specifically, we introduce an elaborately designed Luminance Structure Guidance Head, which can be easily plugged into the existing diffusion model to emphasize the value of the luminance and structural representation. Furthermore, for reliable noise analysis, we provide a novel Sparse Attention Enhancement Module that is adaptively empowered to exploit the most useful region-to-region dependencies. This dynamic selection makes the diffusion process from dense to sparse, thus improving the efficiency of the reasoning noise distributions. To avoid noise amplification, we further present a Skip Calibration Module, which can be used to refine the local neighborhood that contains noisy and structural information. Extensive experiments have been performed to verify the superiority of the proposed method. DCGSD shows that leveraging dual-conditional guidance can support the diffusion model to produce sharper and more realistic results. © 1991-2012 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

THC-DL: Three-Party Homomorphic Computing Delegation Learning for Secure Optimization

引用

IEEE Internet of Things Journal 2025年

作者： Yang, Ze Tian, Youliang Xiong, Jinbo Niu, Kun Li, Mengqian Zhang, Xinyu Ma, Jianfeng Guizhou University Guizhou Provincial Key Laboratory of Cryptography and Blockchain Technology College of Computer Science and Technology Guiyang550025 China Guizhou University College of Big Data and Information Engineering Guiyang550025 China Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou350117 China Xidian University State Key Laboratory of Integrated Services Network Xi’an710071 China Xidian University State Key Laboratory of Integrated Services Network School of Cyber Engineering Xi’an710071 China

Delegation Learning(DL) flourishes data sharing, enabling agents to delegate data to the cloud for model training. To preserve privacy, homomorphic encryption (HE) offers an effective solution for privacy-preserving machine learning (PPML) in delegation learning, yet faces critical challenges in functionality (non-linear activation support), practicality (ciphertext blow-up from iterative computations), and security (data leakage risks caused by public knowledge of the mathematical principles applied in model training). To tackle these challenges, we propose THC-DL, a three-party HE framework addressing these challenges holistically for the first time. We elaborately design the ciphertext secure comparison (DL-CSC) protocol to satisfy secure comparison with private inputs, enabling efficient non-linear operations with O(1) communication complexity that reduces runtime to 12.5% of the DGK (Dolev-Greensmith-Kent protocol, the well-known comparison protocol). Second, we construct a Truncation-Mapping (Tru-Map) scheme, a mechanism that transforms input data by truncating and mapping it into a domain that facilitates more efficient processing, and the addition of truncated mapped data to resolve ciphertext blow-up by adaptively scaling ciphertexts during iterative training, ensuring correctness. Third, we formalize data leakage risks in HE-based quadratic convex optimization (standard in ML) and apply THC-DL to construct a secure optimization scheme. Theoretical analysis confirms THC-DL’s resilience against input recovery attacks, even when adversaries exploit public model parameters. Experiments on a real-world platform validate DL-CSC’s efficiency and scalability while reducing the computational complexity and communication complexity from O(n) to O(1) where n denotes the length of the input bits. © 2014 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of cooperative multi-agent based on MAPPO 5

Design and implementation of cooperative multi-agent based o...

引用

5th International Conference on Telecommunications, Optics, and computer Science, TOCS 2024

作者： Wang, Haolong Fei, Rong Chen, Ruizhu School of Computer Science and Engineering Xi'an University of Technology Xi'an China Shannxi Key Laboratory for Network Computing and Security Technology Xi'an University of Technology Xi'an China

ISBN: (纸本)9781510691667

In the past few years, with the continuous development of deep reinforcement learning, the application of deep reinforcement has been set off within the realms of self-driving vehicle technology, game games, and natural language processing, and the proximal policy optimization algorithm has emerged as a focal point in the sphere of deep reinforcement learning research. In this paper, the Proximal Policy Optimization (PPO) algorithm and the Multi-Agent Proximal Policy Optimization (MAPPO) algorithm are studied, and a cooperative multi-agent system is designed and implemented based on the MAPPO algorithm in the field of StarCraft game, which is compared with the popular Q-Value Mixing (QMIX) reinforcement learning algorithm in recent years, and proposes a direction for subsequent system improvement. In the proximal policy optimization algorithm, the traditional policy gradient algorithm, natural policy gradient algorithm, trust domain policy optimization algorithm, proximal policy optimization algorithm, and independent proximal policy optimization algorithm are studied. In the multi-agent proximal policy optimization algorithm, the centralized training decentralized execution architecture, athlete critic method, value standardization, experience playback, and GAE (GAE) adopted by the MAPPO algorithm are studied. Designing and implementing a cooperative multi-agent system, introducing the StarCraft environmental campaign. Regarding the specifics of the training process, the policy gradient algorithm is used to update the policy network, the time series difference algorithm is improved, and the generalized advantage estimation is used to update the value network. Compared with the QMIX learning algorithm, the model trained by the MAPPO algorithm has the advantages of faster convergence and better stability. © 2025 SPIE.

关键词： deep reinforcement learning generalized advantage estimation Proximal policy optimization temporal difference

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and Computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HIAWSC: An Immune Algorithm Based Heuristic Web Service Composition Framework

引用

Chinese Journal of Electronics 2025年第3期23卷 579-585页

作者： Jiuyun Xu Reiff-Marganiec Stephan School of Computer and Communication Engineering China University of Petroleum Qingdao China Network and Switch Technology Key Laboratory Beijing University of Posts and Telecommunication Beijing China Department of Computer Science University of Leicester Leicester UK

The introduction of of web services has led to web service composition being a focus of many researchers. Composing web services using workflows is seen as the most realistic method from an industrial view-point. Amongst other method, the use of natural computing methods has been proposed previously to automate web service composition. The need for a fast response when computing the most suitable sequence of services is addressed in this paper. In particular, we propose a novel heuristic immune algorithm with an efficient encoding and mutation method. The algorithm involves two steps: an immune selection operation, which is maintaining antibody population diversity and the clonal selection. The use of a vaccine during the evolution provides heuristic information that accelerates the convergence. Our experimental results illustrate that the proposed heuristic immune algorithm is very effective in improving the convergence speed. We also provide a schema analysis for this method.

关键词： Web services Heuristic algorithms Antibodies Encoding Vaccines Convergence

来源：评论

学校读者我要写书评

暂无评论

Source-free Domain Adaptation with Multiple Alignment for Efficient Image Retrieval

Source-free Domain Adaptation with Multiple Alignment for Ef...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jinghui Ni Hui Cui Lihai Zhao Fengling Li Xiaohui Han Lijuan Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Quan Cheng Laboratory Shandong Open University University of Technology Sydney

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Domain adaptation techniques help models generalize to target domains by addressing domain discrepancies between the source and target domain data distributions. These techniques are particularly valuable for cross-domain hashing retrieval, as they reduce training costs while maintaining high retrieval efficiency. However, existing unsupervised domain adaptative hashing methods often require access to both source and target domain data, which may raise privacy concerns regarding source domain data. To address these concerns, restricting access to source domain data is crucial, but this restriction also makes the alignment process between domains more challenging. In this paper, we propose a Source-free Domain Adaptive Hashing with Multiple Alignment (SFDAH-MA) approach for image retrieval. SFDAH-MA integrates model structure alignment, class moment alignment, and semantic relationship alignment to maximize inter-domain knowledge transfer. This comprehensive alignment strategy not only enhances retrieval performance across domains but also minimizes reliance on source domain data, thereby supporting data privacy protection. Extensive experiments show that SFDAH-MA achieves state-of-the-art performance in source-free settings and achieves comparable results to existing unsupervised domain adaptive hashing methods under conventional settings. The source codes of our method are available at: https://***/Nikphyc/SFDAH-MA.

关键词： Training Data privacy Adaptation models Source coding Semantics Image retrieval Signal processing Protection Speech processing Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

A two Stage Mixed Integer Programming Model for Distributionally Robust State Based Non-Intrusive Load Monitoring

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Zhang, Chen Chai, Zimo Yang, Linfeng University of Shanghai for Science and Technology School of Mechanical Engineering Shanghai China Guangxi University School of Computer Electronics and Information the Guangxi Key Laboratory of Multimedia Communication and Network Technology Nanning China

This paper presents a non-intrusive load monitoring (NILM) model based on two-stage mixed-integer linear programming theory. Compared with other mixed integer optimization-based models, this paper model introduces fewer integer variables and richer absolute error function of load decomposition, which makes the power state selection of each device more accurate and the power consumption more accurate fitting. First, to tackle the issues related to noisy load data, an innovative load feature extraction model based on Kullback-Leibler distributionally robust optimization principles is introduced. Then the key features (power boundary/fluctuation features) of each device identified through this robust model are integrated into the constraints of the two-stage NILM model. The two-stage complementary framework includes: the determination of device state interval in the first stage;and the accurate fitting of device power consumption within the device state interval in the second stage. Comparative validation against existing optimization-based models on the AMPds, REFIT, and actual laboratory data sets demonstrate that our proposed model significantly enhances power decomposition accuracy and computational efficiency. In addition, the two-stage complementary framework and load feature extraction model can be applied to other optimization-based models of NILM to improve the computational efficiency of each model and the accuracy of load decomposition. © 2025 IEEE.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：