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

Adaptive watermark generation mechanism based on time series prediction for stream processing

学校读者我要写书评

暂无评论

Frontiers of computer science 2021年第6期15卷 59-73页

作者： Yang SONG Yunchun LI Hailong YANG Jun XU Zerong LUAN Wei LI Sino-German Joint Software Institute Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China Science and Technology on Space System Simulation Laboratory Beijing Simulation Center Beijing 100854China College of Life Sciences and Bioengineering Beijing University of TechnologyBeijing 100083China

The data stream processing framework processes the stream data based on event-time to ensure that the request can be responded to in *** reality,streaming data usually arrives out-of-order due to factors such as network *** data stream processing framework commonly adopts the watermark mechanism to address the data *** is a special kind of data inserted into the data stream with a timestamp,which helps the framework to decide whether the data received is late and thus be *** watermark generation strategies are periodic;they cannot dynamically adjust the watermark distribution to balance the responsiveness and *** paper proposes an adaptive watermark generation mechanism based on the time series prediction model to address the above *** mechanism dynamically adjusts the frequency and timing of watermark distribution using the disordered data ratio and other lateness properties of the data stream to improve the system responsiveness while ensuring acceptable result *** implement the proposed mechanism on top of Flink and evaluate it with realworld *** experiment results show that our mechanism is superior to the existing watermark distribution strategies in terms of both system responsiveness and result accuracy.

关键词： data stream processing watermark time series based prediction dynamic adjustment

Multi-Objective Optimization Problem With Hardly Dominated Boundaries: Benchmark, Analysis, and Indicator-Based Algorithm

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Wang, Zhenkun Lin, Kangnian Li, Genghui Gao, Weifeng School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen P.R. China College of Computer Science and Software Engineering Shenzhen University Shenzhen P.R. China School of Mathematics and Statistics Xidian University Xi’an China

The hardly dominated boundary (HDB) is commonly observed in multi-objective optimization problems (HDBMOPs). However, there are only a few benchmark problems related to HDB-MOPs in the evolutionary computation community, which is insufficient to validate the performance of multi-objective evolutionary algorithms (MOEAs). In this paper, we first introduce a new set of HDB-MOPs characterized by various shapes of Pareto fronts and scalable HDB sizes. We then systematically analyze the capabilities of several representative existing MOEAs in handling HDB-MOPs and reveal their strengths and weaknesses in solving this type of problem. Finally, based on this insightful analysis, we propose an indicator-based MOEA with an adaptive reference point to effectively address HDB-MOPs. The source codes of the proposed benchmark problems and the IMOEAARP algorithm are available from https://***/CIAMGroup/ EvolutionaryAlgorithm Codes/tree/main/IMOEA-ARP. IEEE

关键词： Evolutionary algorithms

Breaking Barriers in Physical-World Adversarial Examples: Improving Robustness and Transferability via Robust Feature

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Yichen Chou, Yuxuan Zhou, Ziqi Zhang, Hangtao Wan, Wei Hu, Shengshan Li, Minghui National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of School of Software Engineering Huazhong University of Science and Technology China

As deep neural networks (DNNs) are widely applied in the physical world, many researches are focusing on physical-world adversarial examples (PAEs), which introduce perturbations to inputs and cause the model’s incorrect outputs. However, existing PAEs face two challenges: unsatisfactory attack performance (i.e., poor transferability and insufficient robustness to environment conditions), and difficulty in balancing attack effectiveness with stealthiness, where better attack effectiveness often makes PAEs more perceptible. In this paper, we explore a novel perturbation-based method to overcome the challenges. For the first challenge, we introduce a strategy Deceptive RF injection based on robust features (RFs) that are predictive, robust to perturbations, and consistent across different models. Specifically, it improves the transferability and robustness of PAEs by covering RFs of other classes onto the predictive features in clean images. For the second challenge, we introduce another strategy Adversarial Semantic Pattern Minimization, which removes most perturbations and retains only essential adversarial patterns in AEs. Based on the two strategies, we design our method Robust Feature Coverage Attack (RFCoA), comprising Robust Feature Disentanglement and Adversarial Feature Fusion. In the first stage, we extract target class RFs in feature space. In the second stage, we use attention-based feature fusion to overlay these RFs onto predictive features of clean images and remove unnecessary perturbations. Experiments show our method’s superior transferability, robustness, and stealthiness compared to existing state-of-the-art methods. Additionally, our method’s effectiveness can extend to Large Vision-Language Models (LVLMs), indicating its potential applicability to more complex tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

DarkFed: A Data-Free Backdoor Attack in Federated Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Minghui Wan, Wei Ning, Yuxuan Hu, Shengshan Xue, Lulu Zhang, Leo Yu Wang, Yichen School of Software Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Federated learning (FL) has been demonstrated to be susceptible to backdoor attacks. However, existing academic studies on FL backdoor attacks rely on a high proportion of real clients with main task-related data, which is impractical. In the context of real-world industrial scenarios, even the simplest defense suffices to defend against the state-of-the-art attack, 3DFed. A practical FL backdoor attack remains in a nascent stage of development. To bridge this gap, we present DarkFed. Initially, we emulate a series of fake clients, thereby achieving the attacker proportion typical of academic research scenarios. Given that these emulated fake clients lack genuine training data, we further propose a data-free approach to backdoor FL. Specifically, we delve into the feasibility of injecting a backdoor using a shadow dataset. Our exploration reveals that impressive attack performance can be achieved, even when there is a substantial gap between the shadow dataset and the main task dataset. This holds true even when employing synthetic data devoid of any semantic information as the shadow dataset. Subsequently, we strategically construct a series of covert backdoor updates in an optimized manner, mimicking the properties of benign updates, to evade detection by defenses. A substantial body of empirical evidence validates the tangible effectiveness of DarkFed. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

A Review of Semantic-Based Reasoning Framework for Context-Aware Mobile-Crowdsourcing

学校读者我要写书评

暂无评论

A Review of Semantic-Based Reasoning Framework for Context-A...

International Conference on Information Technology in Asia (CITA)

作者： Nana Hauwa Abdulsalam Sufri Muhammad Raihani Mohamed Department of Software Engineering and Information System Universiti Putra Malaysia Serdang Selangor Malaysia Department of Computer Science Universiti Putra Malaysia Serdang Selangor Malaysia

Technology has increased the interest and demand for pervasive systems which require contextual information to function at optimal capacity. There have been numbers of research in context-aware systems that has limited focused on the semantic-based approach in the crowdsourcing domain. Thus, it promotes challenges in the context and service acquisition and representation for reasoning control mechanism. This paper aims to review semantic-based reasoning framework with a focus on the mobile crowdsourcing domain. Different domains acquire different contextual information, either extrinsic or intrinsic. The review of the frameworks has help to formulate a process framework that applied semantic approach that has the important component for context-aware reasoning process. The framework can be used in the context-aware mobile crowdsourcing domain or can be generalized to other domain to aid reasoning control. Its advantage over other crowdsourcing frameworks which is focuses not only on context and service acquisition but also the representation on the acquired information.

关键词：

PATCH: Empowering Large Language Model with Programmer-Intent Guidance and Collaborative-Behavior Simulation for Automatic Bug Fixing

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Yuwei Jin, Zhi Xing, Ying Li, Ge Liu, Fang Zhu, Jiaxin Dou, Wensheng Wei, Jun Affiliated with Nanjing Institute of Software Technology University of Chinese Academy of Sciences Nanjing China Key Laboratory of System Software Chinese Academy of Sciences Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Key Laboratory of High Confidence Software Technologies Peking University Ministry of Education School of Computer Science Peking University Beijing China School of Computer Science Wuhan University Wuhan China School of Intelligent Engineering and Automation Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Complex & Critical Software Environment School of Computer Science and Engineering Beihang University Beijing China

Bug fixing holds significant importance in software development and maintenance. Recent research has made substantial strides in exploring the potential of large language models (LLMs) for automatically resolving software bugs. However, a noticeable gap in existing approaches lies in the oversight of collaborative facets intrinsic to bug resolution, treating the process as a single-stage endeavor. Moreover, most approaches solely take the buggy code snippet as input for LLMs during the patch generation stage. To mitigate the aforementioned limitations, we introduce a novel stage-wise framework named PATCH. Specifically, we first augment the buggy code snippet with corresponding dependence context and intent information to better guide LLMs in generating the correct candidate patches. Additionally, by taking inspiration from bug management practices, we decompose the bug-fixing task into four distinct stages: bug reporting, bug diagnosis, patch generation, and patch verification. These stages are performed interactively by LLMs, aiming to simulate the collaborative behavior of programmers during the resolution of software bugs. By harnessing these collective contributions, PATCH effectively enhances the bug-fixing capability of LLMs. We implement PATCH by employing the powerful dialogue-based LLM ChatGPT. Our evaluation on the widely used bug-fixing benchmark BFP demonstrates that PATCH has achieved better performance than state-of-the-art LLMs. Copyright © 2025, The Authors. All rights reserved.

关键词： computer software maintenance

Preserving Location Privacy of IoT Devices in Heterogeneous Edge Computing Architecture Through Deniability-Based Authentication

学校读者我要写书评

暂无评论

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

DD-UNet: Densely Dilated U-Net for Curvilinear Structure Segmentation in Fundus Image

学校读者我要写书评

暂无评论

DD-UNet: Densely Dilated U-Net for Curvilinear Structure Seg...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yindong Zhang Jie Chen Li Wang Miaohong Chen Guoming Zhang Jianqiang Li College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Shenzhen Eye Hospital China

Retinopathy of Prematurity (ROP) is a retina disorder that affects premature infants with lower weights. If the patient cannot get the treatment in time when the illness reaches the last stage, irreversible vision loss will be caused. Nevertheless, there has been relatively little consideration given to the segmentation of the ridge, the key clinical characteristic of the illness. Additionally, existing research has not adequately addressed several segmentation issues, such as fragmentary topology, class imbalance, and false positives. This paper proposes a Densely Dilated U-Net (DD-UNet) improved from U-Net to tackle these challenges. Furthermore, the post-processing techniques based on the spatial relationship between vessels and ridges, along with the relative pixel counts of ridges and false positive results is integrated to mitigate false positive results in the predicted ridge. To enhance the precision of thin vessel, a sliding window sampling method is introduced for refined training. Compared with the state-of-the-art models in medical image segmentation, DD-UNet performs well in curvilinear structure segmentation of fundus image. For instance, our DD-UNet outperforms the Attention U-Net by 6.26% in terms of sensitivity and exhibits a 1.85% higher dice score in ridge segmentation.

关键词：

FedAA: A Reinforcement Learning Perspective on Adaptive Aggregation for Fair and Robust Federated Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： He, Jialuo Chen, Wei Zhang, Xiaojin 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 Huazhong University of Science and Technology Wuhan430074 China School of Microelectronics and Communication Engineering Chongqing University Chongqing400044 China School of Software Engineering Huazhong University of Science and Technology Wuhan430074 China

Federated Learning (FL) has emerged as a promising approach for privacy-preserving model training across decentralized devices. However, it faces challenges such as statistical heterogeneity and susceptibility to adversarial attacks, which can impact model robustness and fairness. Personalized FL attempts to provide some relief by customizing models for individual clients. However, it falls short in addressing server-side aggregation vulnerabilities. We introduce a novel method called FedAA, which optimizes client contributions via Adaptive Aggregation to enhance model robustness against malicious clients and ensure fairness across participants in non-identically distributed settings. To achieve this goal, we propose an approach involving a Deep Deterministic Policy Gradient-based algorithm for continuous control of aggregation weights, an innovative client selection method based on model parameter distances, and a reward mechanism guided by validation set performance. Empirically, extensive experiments demonstrate that, in terms of robustness, FedAA outperforms the state-of-the-art methods, while maintaining comparable levels of fairness, offering a promising solution to build resilient and fair federated systems. Our code is available at https://***/Gp1g/FedAA. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning