Recently, due to the dual roles of DNA and enzyme, DNAzyme has been widely used in the field of DNA circuit, which has a wide range of applications in bio-engineered system, information processing and biocomputing. In fact, the activity of DNAzymes was regulated by subunits assembly, pH control and metal ions triggers. However, those regulations required to change the sequences of whole DNAzyme, as separating parts and inserting extra DNA sequence. Inspired by the allosteric regulation of proteins in nature, a new allosteric strategy is proposed to regulate the activity of DNAzyme without DNA sequences changes. In this strategy, DNA strand displacement was used to regulate the DNAzyme structure, through which the activity of DNAzyme was well controlled. The strategy was applied to E6-type DNAzymes, and the operations of DNA logic circuit (YES, OR, AND, cascading and feedback) were established and simulated with the dynamic analyses. The allosteric regulation has potential to construct more complicated molecular systems, which can be applied to bio-sensing and detection.

At present, huge amounts of data are being produced every second, a situation that will gradually overwhelm current storage technology. DNA is a storage medium that features high storage density and long-term stability and is now considered to be a feasible storage solution. Errors are easily made during the sequencing and synthesis of DNA, however. In order to reduce the error rate, a novel uncorrelated address constrain are reported, and a Damping Multi-Verse Optimizer (DMVO) algorithm is proposed to construct a set of DNA coding, which is used as the non-payload. The DMVO algorithm exchanges objects through black/white holes in order to achieve a stable state and adds damping factors as disturbances. Compared with previous work, the coding set obtained by the DMVO algorithm is larger in size and of higher quality. The results of this study reveal that the size of the DNA storage coding set obtained by the DMVO algorithm increased by 416%, and the variance of the melting temperature decreased by 318%.

Unmanned Aerial Vehicle (UAV)-enabled mobile edge computing has been proposed as an efficient task-offloading solution for user equipments (UEs). Nevertheless, the presence of heterogeneous UAVs makes centralized navigation policies impractical. Decentralized navigation policies also face significant challenges in knowledge sharing among heterogeneous UAVs. To address this, we present the soft hierarchical deep reinforcement learning network (SHDRLN) and dual-end federated reinforcement learning (DFRL) as a decentralized navigation policy solution. It enhances overall task-offloading energy efficiency for UAVs while facilitating knowledge sharing. Specifically, SHDRLN, a hierarchical DRL network based on maximum entropy learning, reduces policy differences among UAVs by abstracting atomic actions into generic skills. Simultaneously, it maximizes the average efficiency of all UAVs, optimizing coverage for UEs and minimizing task-offloading waiting time. DFRL, a federated learning (FL) algorithm, aggregates policy knowledge at the cloud server and filters it at the UAV end, enabling adaptive learning of navigation policy knowledge suitable for the UAV's performance parameters. Extensive simulations demonstrate that the proposed solution not only outperforms other baseline algorithms in overall energy efficiency but also achieves more stable navigation policy learning under different levels of heterogeneity of different UAV performance parameters.

The emergence of the right to be forgotten has sparked interest in federated unlearning. Researchers utilize federated unlearning to address the issue of removing user contributions. However, practical implementation is challenging when malicious clients are involved. In this paper, we propose FAST, i.e., Adopting F ederated unle A rning to Eliminating Maliciou S T erminals at Server Side, a framework with three main components: 1) eliminating contributions of malicious clients: the central server records and subtracts updates of malicious clients from the global model, 2) judging unlearning efficiency: we model a mechanism to assess unlearning efficiency and prevent over-unlearning, and 3) remedying unlearning model performance: the central server utilizes a benchmark dataset to remedy model bias during unlearning. Experimental results demonstrate that FAST can achieve 96.98% accuracy on the MNIST dataset with 40% malicious clients, offering a 16x speedup to retraining from scratch. Meanwhile, it can recover model utility with high efficiency, and extensive evaluations of four real-world datasets demonstrate the validity of our proposed scheme.