A positivity preserving scheme for Poisson-Nernst-Planck Navier-Stokes equations and its error analysis

We consider in this paper a numerical approximation of Poisson-Nernst-Planck-Navier- Stokes (PNP-NS) system. We construct a decoupled semi-discrete and fully discrete scheme that enjoys the properties of positivity preserving, mass conserving, and unconditionally energy stability. Then, we establish the well-posedness and regularity of the initial and (periodic) boundary value problem of the PNP-NS system under suitable assumptions on the initial data, and carry out a rigorous convergence analysis for the fully discretized scheme. We also present some numerical results to validate the positivity-preserving property and the accuracy of our scheme

Optical Trapping and Separation of Metal Nanoparticles by Cylindrical Metalenses With Phase Gradients

We proposed a method for driving metal nanoparticles in the focal field by cylindrical metalens with phase gradient. It was found that the introduced gradient phase would not affect the formation of the focal line, where metal nanoparticles can be trapped. While being driven along the direction with the phase gradient, Ag nanoparticles with different sizes, and nanoparticles with different materials (Au and Ag) were successfully separated, respectively. The induced driving force has an approximately linear relationship with the phase gradient. This kind of planar thin structure can be combined with a microfluidic chip to form a miniaturized system for label-free and non-contact sorting of particles or biological cells, and it may find potential applications in biomedicine

Towards Efficient and Certified Recovery from Poisoning Attacks in Federated Learning

Federated learning (FL) is vulnerable to poisoning attacks, where malicious clients manipulate their updates to affect the global model. Although various methods exist for detecting those clients in FL, identifying malicious clients requires sufficient model updates, and hence by the time malicious clients are detected, FL models have been already poisoned. Thus, a method is needed to recover an accurate global model after malicious clients are identified. Current recovery methods rely on (i) all historical information from participating FL clients and (ii) the initial model unaffected by the malicious clients, leading to a high demand for storage and computational resources. In this paper, we show that highly effective recovery can still be achieved based on (i) selective historical information rather than all historical information and (ii) a historical model that has not been significantly affected by malicious clients rather than the initial model. In this scenario, while maintaining comparable recovery performance, we can accelerate the recovery speed and decrease memory consumption. Following this concept, we introduce Crab, an efficient and certified recovery method, which relies on selective information storage and adaptive model rollback. Theoretically, we demonstrate that the difference between the global model recovered by Crab and the one recovered by train-from-scratch can be bounded under certain assumptions. Our empirical evaluation, conducted across three datasets over multiple machine learning models, and a variety of untargeted and targeted poisoning attacks reveals that Crab is both accurate and efficient, and consistently outperforms previous approaches in terms of both recovery speed and memory consumption

Research on the optimal capacity configuration of green storage microgrid based on the improved sparrow search algorithm

Green storage plays a key role in modern logistics and is committed to minimizing the environmental impact. To promote the transformation of traditional storage to green storage, research on the capacity allocation of wind-solar-storage microgrids for green storage is proposed. Firstly, this paper proposes a microgrid capacity configuration model, and secondly takes the shortest payback period as the objective function, and uses the improved sparrow search algorithm (ISSA) for optimization. Firstly, the Logistic-Tent compound chaotic mapping method is added to the population initialization of the sparrow search algorithm (SSA). Secondly, the adaptive t-distribution mutation is used to improve the discoverer, and the overall optimization ability of the algorithm is improved. Finally, the hybrid decreasing strategy is adopted in the process of vigilance position update. The ISSA can improve the search efficiency of the algorithm, avoid premature convergence and enhance the robustness of the algorithm, which is helpful to better apply to the optimal configuration of wind-solar-storage microgrid capacity in green storage. By analyzing the optimal capacity allocation results of two typical days, the system can better adapt to the dynamic storage requirements and improve the flexibility and sustainability of the supply chain

A Survey on Federated Unlearning: Challenges, Methods, and Future Directions

In recent years, the notion of ``the right to be forgotten" (RTBF) has evolved into a fundamental element of data privacy regulations, affording individuals the ability to request the removal of their personal data from digital records. Consequently, given the extensive adoption of data-intensive machine learning (ML) algorithms and increasing concerns for personal data privacy protection, the concept of machine unlearning (MU) has gained considerable attention. MU empowers an ML model to selectively eliminate sensitive or personally identifiable information it acquired during the training process. Evolving from the foundational principles of MU, federated unlearning (FU) has emerged to confront the challenge of data erasure within the domain of federated learning (FL) settings. This empowers the FL model to unlearn an FL client or identifiable information pertaining to the client while preserving the integrity of the decentralized learning process. Nevertheless, unlike traditional MU, the distinctive attributes of federated learning introduce specific challenges for FU techniques. These challenges lead to the need for tailored design when designing FU algorithms. Therefore, this comprehensive survey delves into the techniques, methodologies, and recent advancements in federated unlearning. It provides an overview of fundamental concepts and principles, evaluates existing federated unlearning algorithms, reviews optimizations tailored to federated learning, engages in discussions regarding practical applications, along with an assessment of their limitations, and outlines promising directions for future research

MacFormer: Map-Agent Coupled Transformer for Real-time and Robust Trajectory Prediction

Predicting the future behavior of agents is a fundamental task in autonomous vehicle domains. Accurate prediction relies on comprehending the surrounding map, which significantly regularizes agent behaviors. However, existing methods have limitations in exploiting the map and exhibit a strong dependence on historical trajectories, which yield unsatisfactory prediction performance and robustness. Additionally, their heavy network architectures impede real-time applications. To tackle these problems, we propose Map-Agent Coupled Transformer (MacFormer) for real-time and robust trajectory prediction. Our framework explicitly incorporates map constraints into the network via two carefully designed modules named coupled map and reference extractor. A novel multi-task optimization strategy (MTOS) is presented to enhance learning of topology and rule constraints. We also devise bilateral query scheme in context fusion for a more efficient and lightweight network. We evaluated our approach on Argoverse 1, Argoverse 2, and nuScenes real-world benchmarks, where it all achieved state-of-the-art performance with the lowest inference latency and smallest model size. Experiments also demonstrate that our framework is resilient to imperfect tracklet inputs. Furthermore, we show that by combining with our proposed strategies, classical models outperform their baselines, further validating the versatility of our framework.Comment: Accepted by IEEE Robotics and Automation Letters. 8 Pages, 9 Figures, 9 Tables. Video: https://www.youtube.com/watch?v=XY388iI6sP

First detection of Cryptosporidium spp. in red-bellied tree squirrels (Callosciurus erythraeus) in China

Cryptosporidium spp. are opportunistic pathogens that cause diarrhea in a variety of animal hosts. Although they have been reported in many animals, no information has been published on the occurrence of Cryptosporidium spp. in red-bellied tree squirrels (Callosciurus erythraeus). A total of 287 fecal specimens were collected from Sichuan province in China; the prevalence of Cryptosporidium spp., measured by nested-PCR amplification of the partial small-subunit (SSU) rRNA gene, was 1.4% (4/287). Three different Cryptosporidium species or genotypes were identified: Cryptosporidium parvum (n = 1), Cryptosporidium wrairi (n = 1), and Cryptosporidium rat genotype II (n = 2). The present study is the first report of Cryptosporidium infection in red-bellied tree squirrels in China. Although there is a relatively low occurrence of Cryptosporidium, the presence of C. parvum and C. wrairi, which were previously reported in humans, indicates that red-bellied tree squirrels may be a source of zoonotic cryptosporidiosis in China

Characterization of an aspartate aminotransferase encoded by YPO0623 with frequent nonsense mutations in Yersinia pestis

Yersinia pestis, the causative agent of plague, is a genetically monomorphic bacterial pathogen that evolved from Yersinia pseudotuberculosis approximately 7,400 years ago. We observed unusually frequent mutations in Y. pestis YPO0623, mostly resulting in protein translation termination, which implies a strong natural selection. These mutations were found in all phylogenetic lineages of Y. pestis, and there was no apparent pattern in the spatial distribution of the mutant strains. Based on these findings, we aimed to investigate the biological function of YPO0623 and the reasons for its frequent mutation in Y. pestis. Our in vitro and in vivo assays revealed that the deletion of YPO0623 enhanced the growth of Y. pestis in nutrient-rich environments and led to increased tolerance to heat and cold shocks. With RNA-seq analysis, we also discovered that the deletion of YPO0623 resulted in the upregulation of genes associated with the type VI secretion system (T6SS) at 26°C, which probably plays a crucial role in the response of Y. pestis to environment fluctuations. Furthermore, bioinformatic analysis showed that YPO0623 has high homology with a PLP-dependent aspartate aminotransferase in Salmonella enterica, and the enzyme activity assays confirmed its aspartate aminotransferase activity. However, the enzyme activity of YPO0623 was significantly lower than that in other bacteria. These observations provide some insights into the underlying reasons for the high-frequency nonsense mutations in YPO0623, and further investigations are needed to determine the exact mechanism