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

A two-way dynamic adaptive pricing resource allocation model based on combinatorial double auctions in computational network

引用

Computer Communications 2025年 238卷

作者： Xu, Yanjun Tian, Chunqi Wang, Wei Bai, Lizhi Xia, Xuhui School of Computer Science and Technology Tongji University Shanghai China School of Data Science and Engineering East China Normal University Shanghai China Embedded System and Service Computing Key Laboratory of Ministry of Education China

Efficient resource allocation in computing networks is essential for managing fluctuating demands and optimizing system performance. Traditional auction and pricing models often fail to adapt to diverse demands and supply–demand fluctuations, resulting in inefficiencies. This paper proposes a bidirectional price-adaptive bundled resource auction model that considers not only the autonomous adjustment of sellers’ quotations in response to supply–demand fluctuations but also the impact of these fluctuations on buyers’ willingness to pay and bidding behavior. The model integrates Combinatorial Double Auction (CDA) mechanism and Genetic Algorithm (GA), constructing a bundled resource auction mechanism that accommodates diverse resource demands and an adaptive pricing strategy that dynamically responds to real-time supply–demand variations. This approach enhances resource allocation accuracy in dynamic and competitive computing network environments. Furthermore, a reserve price mechanism and a delay compensation strategy are introduced to ensure that the proposed mechanism satisfies individual rationality, budget balance, and incentive compatibility while maintaining computational efficiency. Simulation results demonstrate that, compared to traditional methods, the proposed model not only improves allocation efficiency and enhances resource utilization but also helps reduce operational costs. Specifically, resource allocation dispersion decreases by 4.26%, while service providers’ revenue increases by 7.47%. This study provides a scalable and adaptive solution for dynamic resource allocation in cloud and edge computing platforms. It contributes significantly to the development of resource management and flexible pricing strategies in markets characterized by diverse demands and fluctuating conditions. © 2025

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

OUTLIER SYNTHESIS VIA HAMILTONIAN MONTE CARLO FOR OUT-OF-DISTRIBUTION DETECTION

arXiv

引用

arXiv 2025年

作者： Li, Hengzhuang Zhang, Teng National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Out-of-distribution (OOD) detection is crucial for developing trustworthy and reliable machine learning systems. Recent advances in training with auxiliary OOD data demonstrate efficacy in enhancing detection capabilities. Nonetheless, these methods heavily rely on acquiring a large pool of high-quality natural outliers. Some prior methods try to alleviate this problem by synthesizing virtual outliers but suffer from either poor quality or high cost due to the monotonous sampling strategy and the heavy-parameterized generative models. In this paper, we overcome all these problems by proposing the Hamiltonian Monte Carlo Outlier Synthesis (HamOS) framework, which views the synthesis process as sampling from Markov chains. Based solely on the in-distribution data, the Markov chains can extensively traverse the feature space and generate diverse and representative outliers, hence exposing the model to miscellaneous potential OOD scenarios. The Hamiltonian Monte Carlo with sampling acceptance rate almost close to 1 also makes our framework enjoy great efficiency. By empirically competing with SOTA baselines on both standard and large-scale benchmarks, we verify the efficacy and efficiency of our proposed HamOS. Our code is available at: https://***/Fir-lat/HamOS_OOD. © 2025, CC BY.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Against Mobile Collusive Eavesdroppers: Cooperative Secure Transmission and Computation in UAV-Assisted MEC Networks

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5280-5297页

作者： Zhao, Mingxiong Wang, Zirui Guo, Kun Zhang, Rongqian Quek, Tony Q. S. Yunnan University National Pilot School of Software Kunming650500 China Ministry of Education Engineering Research Center of Integration and Application of Digital Learning Technology Beijing100039 China Ministry of Education Engineering Research Center of Cyberspace Kunming650504 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650221 China Yunnan University Yunnan Key Laboratory of Software Engineering Kunming650091 China East China Normal University Shanghai Key Laboratory of Multidimensional Information Processing School of Communications and Electronics Engineering Shanghai200241 China Yunnan University School of Information Science and Engineering Kunming650500 China Singapore University of Technology and Design Information Systems Technology and Design 487372 Singapore

In Uncrewed Aerial Vehicle (UAV)-assisted Mobile Edge computing (MEC) networks, the security of transmission faces significant challenges due to the vulnerabilities of line-of-sight links and potential eavesdropping on two-hop links. This paper addresses these challenges with an innovative Cooperative Secure Transmission and Computation strategy (CSTC), specifically engineered for time-slotted UAV-assisted MEC networks plagued by mobile collusive eavesdroppers. These eavesdroppers significantly bolster their interception capabilities through coordinated and optimized movements, escalating the security threats. To neutralize these risks, the proposed CSTC employs the UAV and remote devices as helper nodes to emit jamming signals, thereby thwarting eavesdropping activities, while simultaneously facilitating the efficient relay of users’ tasks to the base station for advanced processing. The CSTC aims to maximize the sum Secrecy Transmission Rate (STR) satisfying task latency constraints. It involves a joint optimization of UAV trajectory, jamming beamformers, transmit power, and data offloading strategy to expedite task transmission. Additionally, a real-time computation scheduling approach is developed based on a newly defined metric, the Urgency Degree of Users (UDoU), to enhance task processing efficiency. Our extensive simulations validate that the CSTC not only elevates the sum STR but also consistently meets latency constraints, demonstrating its robustness against advanced mobile eavesdropping techniques. © 2002-2012 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

Mitigating Over-Unlearning in Machine Unlearning with Synthetic Data Augmentation 24th

Mitigating Over-Unlearning in Machine Unlearning with Synt...

引用

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

作者： Wang, Baohai Qu, Youyang Gao, Longxiang Li, Conggai Li, Lin Smith, David Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Data61 Commonwealth Science and Industry Research Organization CanberraVIC Australia College of Business and Law Royal Melbourne Institute of Technology MelbourneVIC Australia

ISBN: (纸本)9789819615445

In machine learning, data privacy and security has become an increasingly growing concern. The introduction of machine unlearning offers the ability to address this issue through the removal of personal and sensitive data from trained models to comply with laws, regulations, and user privacy requirements. However, despite the significant benefits of this technique, performing unlearning operations is only sometimes smooth in practice. When we attempt to remove specific data, the model may over-adjust, resulting in its performance on unlearned data. This phenomenon not only reduces the accuracy of the model on known data but also affects its ability to generalize new data, thus weakening the model’s overall performance. Therefore, in this paper, we analyze the phenomenon of over-unlearning;firstly, we explore how to mitigate the effects of over-unlearning by generating synthetic data to fill in the forgotten parts, using data synthesis-based techniques. Secondly, we combine the data synthesis-based compensation strategy with model fine-tuning to further improve the model’s adaptability and generalization capability by further training the model to accommodate synthetic data. Through comprehensive experimentation, we verify the effectiveness of the proposed data synthesis-based compensation strategy. The experimental results show that the data synthesis-based compensation strategy can effectively mitigate the effects of the over-unlearning phenomenon, as well as maintaining the stability and accuracy of the model after removing specific data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Pixel+ and Pixel++: compact and efficient forward-secure multi-signatures for PoS blockchain consensus 24

Pixel+ and Pixel++: compact and efficient forward-secure mul...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Jianghong Wei Guohua Tian Ding Wang Fuchun Guo Willy Susilo Xiaofeng Chen State Key Laboratory of Integrated Service Networks (ISN) Xidian University and State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Integrated Service Networks (ISN) Xidian University College of Cyber Science Nankai University School of Computing and Information Technology University of Wollongong

ISBN: (纸本)9781939133441

Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the security of PoS blockchains once signing keys get corrupted. That is, after an adversary obtains enough signing keys, it can break the immutable nature of PoS blockchains by forking the chain and modifying the history from some point in the past. Forward-secure multi-signature (FS-MS) schemes can overcome this issue by periodically updating signing keys. The only FS-MS construction currently available is Drijvers et al's Pixel, which builds on pairing groups and only achieves forward security at the time period *** this work, we present new FS-MS constructions that either are free from pairing or capture forward security at the individual message level (i.e., fine-grained forward security). Our first construction Pixel+ works for a maximum number of time periods T. Pixel+ signatures consist of only one group element, and can be verified using two exponentiations. It is the first FS-MS from RSA assumption, and has 3.5x and 22.8x faster signing and verification than Pixel, respectively. Our second FS-MS construction Pixel++ is a pairing-based one. It immediately revokes the signing key's capacity of re-signing the message after creating a signature on this message, rather than at the end of the current time period. Thus, it provides more practical forward security than Pixel. On the other hand, Pixel++ is almost as efficient as Pixel in terms of signing and verification. Both Pixel+ and Pixel++ allow for non-interactive aggregation of signatures from independent signers and are proven to be secure in the random oracle model. In addition, they also support the aggregation of public keys, significantly reducing the storage overhead on PoS *** demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we provid

关键词：

来源：评论

学校读者我要写书评

暂无评论

Location Privacy Preservation Crowdsensing With Federated Reinforcement Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 1877-1894页

作者： You, Zhichao Dong, Xuewen Liu, Ximeng Gao, Sheng Wang, Yongzhi Shen, Yulong Xidian University School of Computer Science and Technology The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education Xi'an710071 China Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'an710071 China Fuzhou University College of Computer and Data Science Fuzhou350025 China Central University of Finance and Economics School of Information Beijing102206 China California State Polytechnic University Pomona Department of Computer Information Systems PomonaCA91768 United States Xidian University School of Computer Science and Technology Xi'an710071 China Shaanxi Key Laboratory of Network and System Security Xi'an710071 China

Crowdsensing has become a popular method of sensing data collection while facing the problem of protecting participants' location privacy. Existing location-privacy crowdsensing mechanisms focus on static tasks and participants without considering sensing tasks' time requirements and participants' mobility, which cannot achieve satisfactory collected data quality and task completion in crowdsensing with dynamic tasks and participants. Inspired by this, we proposed a location-preservation crowdsensing mechanism, FedSense, considering dynamic tasks and participants based on federated learning (FL) and reinforcement learning (RL). In FedSense, through RL's outstanding decision-making ability, participants select sensing tasks to perform by well-trained RL models without uploading location information to servers for task allocation. We propose an independent tasks selection environment that defines actions, states, and rewards of RL to enable FedSense to achieve satisfactory task completion and data quality while preserving location privacy. Besides, FedSense applies an asynchronous FL aggregation algorithm that reduces participants' network stabilization and device computing ability requirements. Analysis proves that participants' location information does not leave the local device during the model training and task selection process, effectively avoiding privacy leakage. Simulation shows that compared with existing location-preservation crowdsensing mechanisms, FedSense achieves the highest task completion and sensing accuracy for dynamic tasks and participants. © 2024 IEEE.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and systems 2025年

作者： Wang, Hongfei Wan, Caixue Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

A Double-Shell Structured Ransomware Defense Method Tailored for the RaaS Model 3rd

A Double-Shell Structured Ransomware Defense Method Tailored...

引用

3rd International Conference on Cyberspace Simulation and Evaluation, CSE 2024

作者： Chen, Monan Ji, Tiantian Li, Shudong Zhang, Yuntao Wang, Tian Mao, Kai Sun, Yanwei Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou China Peng Cheng Laboratory Shenzhen China Zhongguancun Laboratory Beijing China

ISBN: (纸本)9789819645022

Ransomware attacks have become a significant cybersecurity threat, with the Ransomware as a service (RaaS) paradigm enabling attackers with limited technical expertise to launch sophisticated campaigns. There is currently a lack of systematic research specifically targeting RaaS-type ransomware. This paper analyzes the operational mechanisms of RaaS ransomware, including its industry chain, attack processes, and technical characteristics. We propose a formalized RaaS attack model, providing a clear understanding of its operational methods. To address the limitations of existing defense methods, we introduce an innovative double-shell structured defense model. Utilizing Hook technology and a token verification mechanism, it effectively prevents ransomware from encrypting user data. We demonstrate the effectiveness of this model through experimental validation with a document protection program named RansomShield, achieving a 100% success rate in defending against real ransomware attacks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Attack Model Double-Shell Defense RaaS Ransomware

来源：评论

学校读者我要写书评

暂无评论

Personalized Medical Federated Learning Based on Mutual Knowledge Distillation in Object Heterogeneous Environment 1st

Personalized Medical Federated Learning Based on Mutual Kno...

引用

1st Conference on Blockchain and Web3.0 technology Innovation and Application, BWTAC 2024

作者： Ni, Lina Song, Chenglin Zhao, Hanmo Tang, Yuncan Ma, Yunshen Zhang, Jinquan College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9789819794119

Federated Learning (FL), hailed as a potent approach in merging medical expertise, promises to elevate collaborative efforts among healthcare institutions while safeguarding the privacy and security of sensitive medical data, thereby energizing the trajectory of intelligent healthcare advancements. However, the diversity in training objectives across medical institutions can diminish their active participation in a unified federated training process. To address this issue of waning enthusiasm due to diverse training goals, in this paper, we propose Personalized Medical Federated Learning method based on Mutual Distillation Knowledge (pFedMKD). Specifically, we propose a similarity-based mutual distillation model selection algorithm that reduces interference among medical institutions with notably diverse data distributions. Moreover, we develop a server-side local model update method leveraging mutual knowledge distillation, enabling each local model to gain beneficial insights for personalization from analogous models. Additionally, we formulate a personalized model update method utilizing knowledge distillation from specifically labeled samples, thereby improving the performance of personalized models. Experimental results demonstrate that compared to the baseline algorithm, pFedMKD can more effectively address the target heterogeneity problem among different medical institutions, enabling each institution to achieve higher personalized performance in federated learning tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

FIRE: combining multi-stage filtering with taint analysis for scalable recurring vulnerability detection 24

FIRE: combining multi-stage filtering with taint analysis fo...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Siyue Feng Yueming Wu Wenjie Xue Sikui Pan Deqing Zou Yang Liu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Cyber Science and Engineering Huazhong University of Science and Technology China Nanyang Technological University Singapore National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Cyber Science and Engineering Huazhong University of Science and Technology China and Jinyinhu Laboratory China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133441

With the continuous development of software open-sourcing, the reuse of open-source software has led to a significant increase in the occurrence of recurring vulnerabilities. These vulnerabilities often arise through the practice of copying and pasting existing vulnerabilities. Many methods have been proposed for detecting recurring vulnerabilities, but they often struggle to ensure both high efficiency and consideration of semantic information about vulnerabilities and patches. In this paper, we introduce FIRE, a scalable method for large-scale recurring vulnerability detection. It utilizes multi-stage filtering and differential taint paths to achieve precise clone vulnerability scanning at an extensive scale. In our evaluation across ten open-source software projects, FIRE demonstrates a precision of 90.0% in detecting 298 recurring vulnerabilities out of 385 ground truth instance. This surpasses the performance of existing advanced recurring vulnerability detection tools, detecting 31.4% more vulnerabilities than VUDDY and 47.0% more than MOVERY. When detecting vulnerabilities in large-scale software, FIRE outperforms MOVERY by saving about twice the time, enabling the scanning of recurring vulnerabilities on an ultra-large scale.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：