Currently, it has become a consensus to enhance privacy protection. Randomized response(RR) technique, as the mainstream perturbation mechanism for local differential privacy, has been widely studied. However,most of ...
详细信息
Currently, it has become a consensus to enhance privacy protection. Randomized response(RR) technique, as the mainstream perturbation mechanism for local differential privacy, has been widely studied. However,most of the research in literature managed to modify existing RR schemes and propose new mechanisms with better privacy protection and utility, which are illustrated only by numerical experiments. We study the properties of generalized binary randomized response mechanisms from the perspectives of Lanke privacy and utility. The mathematical expressions of privacy and utility for the binary RR mechanism are given respectively. Moreover, the comparison principle for privacy and utility of any two mechanisms is proved. Finally, the optimization problem of the binary RR mechanism is discussed. Our work is based on a rigorous mathematical proof of privacy and utility for the general binary RR mechanism, and numerical verification illustrates the correctness of the conclusions. It can provide theoretical support for the design of binary RR mechanism and can be applied in data collection, analysis and publishing.
In this paper, we design a distributed stochastic source seeking algorithm based on time-delay measurements to implement source seeking and formation control, so that vehicles can achieve and maintain a specific forma...
详细信息
In this paper, we design a distributed stochastic source seeking algorithm based on time-delay measurements to implement source seeking and formation control, so that vehicles can achieve and maintain a specific formation during the source seeking process. First, we present continuous-time stochastic averaging theorems for nonlinear delay-differential systems with stochastic perturbations. Then, based on the stochastic extremum seeking method and the leaderless formation strategy,we design a distributed stochastic source seeking algorithm based on time-delay measurements to navigate multiple velocity-actuated vehicles to search for an unknown source while achieving and maintaining a predefined formation, and the effect of the delay is eliminated by adopting the one-stage sequential predictor approach. Moreover, based on our developed stochastic averaging theorems, we prove that the average position of vehicles exponentially converges to a small neighborhood of the source in the almost sure sense, and vehicles can achieve and maintain a predefined formation. Finally, we provide numerical examples to verify the effectiveness of our proposed algorithm.
Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for ...
详细信息
Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for impulse effects. Firstly, to address the inequality constraints,the penalty method is introduced. Then, a novel optimization strategy is developed, which only requires that the team objective function be strongly convex.
Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theo...
Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention...
详细信息
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.
Keystroke biometrics is a promising approach for user identification and verification, leveraging the unique patterns in individuals’ typing behavior. In this paper, we propose a Transformer-based network that employ...
详细信息
This paper presents a new scheme for energy-efficient clustering in Internet of Things (IoT) networks by employing an optimized evolutionary rate water cycle algorithm (OERWCA), aiming to address crucial issues, such ...
详细信息
Dialogue-based relation extraction(DialogRE) aims to predict relationships between two entities in dialogue. Current approaches to dialogue relationship extraction grapple with long-distance entity relationships in di...
详细信息
Dialogue-based relation extraction(DialogRE) aims to predict relationships between two entities in dialogue. Current approaches to dialogue relationship extraction grapple with long-distance entity relationships in dialogue data as well as complex entity relationships, such as a single entity with multiple types of connections. To address these issues, this paper presents a novel approach for dialogue relationship extraction termed the hypergraphs and heterogeneous graphs model(HG2G). This model introduces a two-tiered structure, comprising dialogue hypergraphs and dialogue heterogeneous graphs, to address the shortcomings of existing methods. The dialogue hypergraph establishes connections between similar nodes using hyper-edges and utilizes hypergraph convolution to capture multi-level features. Simultaneously, the dialogue heterogeneous graph connects nodes and edges of different types, employing heterogeneous graph convolution to aggregate cross-sentence information. Ultimately, the integrated nodes from both graphs capture the semantic nuances inherent in dialogue. Experimental results on the DialogRE dataset demonstrate that the HG2G model outperforms existing state-of-the-art methods.
With digitisation globally on the rise, corporates are compelled to better understand the usage of their websites. In doing so, corporates will be empowered to better understand consumers, and make necessary adjustmen...
详细信息
Extracting road information from high-resolution remote sensing images has become a research hotspot in remote sensing image processing due to its cost-effectiveness and efficiency. Current road extraction methods gen...
详细信息
暂无评论