Hierarchical Federated Learning (HFL) improves the scalability and communication efficiency of the system and achieves load balancing at each level. Incentive mechanisms enhance participant motivation and optimize resource allocation for HFL. However, existing mechanisms mainly focus on maximizing individual utility from the quantity of client data while neglecting to optimize social utility from the learning quality perspective. Meanwhile, strategic behavior and heterogeneous devices can significantly degrade the performance of incentive mechanisms. To this end, we propose a quality-aware incentive mechanism (QAIM) for HFL to improve training efficiency. Specifically, we first systematically evaluate the learning quality of clients based on their training loss and historical records, which allows us to recruit high-quality clients for model updating selectively. Then, we model the cloud-edge-end interaction and cooperation as a three-layer Stackelberg game to analyze the strategies of participants and utilize carefully designed algorithms to derive the solution of the unique Stackelberg Equilibrium (SE). Through the Pareto improvement of client association modeled as a coalition game, we can maximize social utility. Experimental results on both synthetic and real-world datasets demonstrate that our QAIM outperforms the state-of-the-art baselines, with an average increase in accuracy and social utility of 17% and 45%, respectively.

Epidemics pose a significant threat to societal development. Accurately and swiftly identifying the source of an outbreak is crucial for controlling the spread of an epidemic and minimizing its impact. However, existing research on locating epidemic sources often overlooks the fact that epidemics have an incubation period and fails to consider social behaviors like self-isolation during the spread of the epidemic. In this study, we first take into account isolation behavior and introduce the Susceptible-Exposed-Infected-Recovered (SEIR) propagation model to simulate the spread of epidemics. As the epidemic reaches a certain threshold, government agencies or hospitals will report the IDs of some infected individuals and the time when symptoms first appear. The reported individuals, along with their first and second-order neighbors, are then isolated. Using the moment of symptom onset reported by the isolated individuals, we propose a node-level classification method and subsequently develop the node-level-based source identification (NLSI) algorithm. Extensive experiments demonstrate that the NLSI algorithm is capable of solving the source identification problem for single and multiple sources under the SEIR propagation model. We find that the source identification accuracy is higher when the infection rate is lower, and a sparse network structure is beneficial to source localization. Furthermore, we discover that the length of the isolation period has little impact on source localization, while the length of the incubation period significantly affects the accuracy of source localization. This research offers a novel approach for identifying the origin of the epidemic associated with our defined SEIR model.

Accurately locating sources with limited resources plays an important role in suppressing and even predicting the spread of harmful information. Due to the existence of the coupling between layers, compared with simplex networks, many studies have revealed that multiplex networks present many interesting phenomena. However, almost all the works involved in source(s) localization concentrate on simplex networks, while it is unclear how the coupling strength between layers of a multiplex network affects source(s) localization. Here we focus on a linear diffusion process and propose a general framework of multiple sources localization in multiplex networks with minimum measurements by combining the observability theory and compressed sensing theory. One surprise finding is that, for undirected two-layer networks with fully coupling between layers, the messengers placed at the same layer is sufficient to accurately locate all the sources. Different from simplex networks, the diffusion coefficients of linear diffusion process in multiplex networks can affect the minimum number of messengers. Simulation results from various network structures show that the minimum number of messengers is fewer when the coupling strength between layers is higher. Besides, we find the larger the network size the fewer measurements are required for sources localization. We further provide simulations from synthetic networks and one real network demonstrates our framework of sources localization is robust against small amount of data, noise and the coupling strength between layers.

Designing a query-efficient attack strategy to generate high-quality adversarial examples under the hard-label black-box setting is a fundamental yet challenging problem, especially in natural language processing (NLP). The process of searching for adversarial examples has many uncertainties (e.g., an unknown impact on the target model's prediction of the added perturbation) when confidence scores cannot be accessed, which must be compensated for with a large number of queries. To address this issue, we propose TextCheater, a decision-based metaheuristic search method that performs a query-efficient textual adversarial attack task by prohibiting invalid searches. The strategies of multiple initialization points and Tabu search are also introduced to keep the search process from falling into a local optimum. We apply our approach to three state-of-the-art language models (i.e., BERT, wordLSTM, and wordCNN) across six benchmark datasets and eight real-world commercial sentiment analysis platforms/models. Furthermore, we evaluate the Robustly optimized BERT pretraining Approach (RoBERTa) and models that enhance their robustness by adversarial training on toxicity detection and text classification tasks. The results demonstrate that our method minimizes the number of queries required for crafting plausible adversarial text while outperforming existing attack methods in the attack success rate, fluency of output sentences, and similarity between the original text and its adversary.