This paper proposes a novel approach for the low-error reconstruction of directional functions with spherical harmonics. We introduce a modified version of Spherical Gaussians with adaptive narrowness and amplitude to...
详细信息
Given a point set S in Rd, a family of sets is S-intersecting if its members have a point in common in S. Recently, Edwards and Soberón proved a fractional version of Halman’s theorem for axis-parallel boxes, sh...
Rotatable antenna (RA) is an emerging technology that has great potential to exploit additional spatial degrees of freedom (DoFs) by flexibly altering the three-dimensional (3D) orientation/boresight of each antenna. ...
详细信息
Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the secu...
详细信息
ISBN:
(纸本)9798400712746
Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d
Traditional methods for analyzing Broken Access Control (BAC) vulnerabilities have limitations regarding low coverage of access control rules, high false positive rate (FPR). Additionally, state-of-the-art strategies ...
详细信息
Traditional methods for analyzing Broken Access Control (BAC) vulnerabilities have limitations regarding low coverage of access control rules, high false positive rate (FPR). Additionally, state-of-the-art strategies for repairing BAC vulnerabilities utilizing statement-level replacement as a repair method may introduce new logical errors. To address these challenges, we propose a novel approach called DRacv (Detect and Repair Access Control Vulnerabilities) to identify and auto-repair vulnerabilities in Role-Based Access Control (RBAC) mode used in web applications. To detect vulnerabilities, DRacv first constructs a Fine-grained Global Multi-attribute Architectural Navigation Graph model (FG-MANG) for web applications through dynamic execution and static analysis, which characterizes full relationships between roles, privileges, and accessible page resources. Based on access control rules extracted from FG-MANG, DRacv generates targeted attack payloads to detect BAC vulnerabilities, significantly reducing FPR and eliminating redundant attack payloads. To auto-repair the identified vulnerabilities, DRacv first precisely extracts access control privilege parameters, validation functions, and contextual statements to construct the patch code templates. These templates generate user- and role-level verification patch codes for different users and roles. Instead of changing the vulnerable code, the patch codes behave like firewalls. They are added as separate files and invoked by the web page with vulnerability to defend against access control compromises. DRacv was evaluated on 12 popular open-source web applications in PHP and JAVA. From the applications, DRacv identified 35 vulnerabilities (11 were new) with only one false positive, achieving an FPR of 2.78%. We also compared DRacv's detection results with state-of-the-art studies. Results show that DRacv outperforms those studies regarding the number of vulnerabilities detected and FPR. Among the 35 vulnerabilities
Retinex theory-based low-light image enhancement methods have received increasing attention and achieved tremendous advancements. However, there still exist two seldom-explored issues: 1) The above methods only formal...
详细信息
With recent advances in Large Language Models (LLMs), Agentic AI has become phenomenal in real-world applications, moving toward multiple LLM-based agents to perceive, learn, reason, and act collaboratively. These LLM...
One of the significant challenges in advancing RFMEMS switch technology is achieving low actuation voltage and high capacitance ratio, simultaneously. Reducing the structural spring constant and integrating Metal-Insu...
详细信息
ISBN:
(数字)9798350393002
ISBN:
(纸本)9798350393019
One of the significant challenges in advancing RFMEMS switch technology is achieving low actuation voltage and high capacitance ratio, simultaneously. Reducing the structural spring constant and integrating Metal-Insulator-Metal (MIM) capacitors have been recognized as optimal strategies for lowering actuation voltage; while significantly improving the capacitance ratio in RF-MEMS switches. This study aims to design and development of an RF-MEMS shunt switch in which a cantilever microbeam with a MIM capacitor is integrated to enhance the RF performance in mm-wave frequency band. Simulation using COMSOL®, revealed that the actuation voltage, von mises stress, first resonance frequency mode, switch mass, and the spring constant of the designed switch is about $2.3 ~\mathrm{V}, 5.16 \text{MPa}, 1352 ~\text{Hz}$ , $1.62 \mu ~\mathrm{g}$ , and $0.017 ~\mathrm{N}. \mathrm{m}^{-1}$ , respectively; which are promising results. The switch's performance was evaluated across a wide frequency range from 1 to 100 GHz using ANSYS HFSS® simulation The simulation results indicate excellent radio frequency characteristics, i.e. isolation of -52 dB across the frequency range of 70 GHz to 75 GHz, with an insertion loss of -1 dB at 73 GHz and capacitance ratio of 142. These results highlight the favorable RF performance of the proposed switch, which is suitable for next-generation mm-wave applications.
Nowadays, the grid computing environment faces many difficulties executing new jobs, especially jobs requiring large resource requirements and long execution times. This motivates researchers and scholars to find chea...
详细信息
ISBN:
(数字)9798331523657
ISBN:
(纸本)9798331523664
Nowadays, the grid computing environment faces many difficulties executing new jobs, especially jobs requiring large resource requirements and long execution times. This motivates researchers and scholars to find cheap and fast methods to improve the efficiency of grid environments. One of the cheap and fast methods is to implement job scheduling algorithms based on cheap and fast techniques. This paper proposes a new job ranking backfilling algorithm based on the job's weight and back propagation neural network. To define the weight of the job, first, the proposed model will use a clustering algorithm to cluster the job's dataset into groups, and then the groups will be ranked using an experimental ranking equation. A discrete event simulator is used to validate the proposed algorithm's capability and robustness. The average results revealed that the new algorithm outperforms previous algorithms. The improvement of the studied metrics is between 1.19 and 6.30, respectively. The results proved that the proposed model is efficient and can be used with low overhead in a real environment.
暂无评论