Spatio-temporal graphs are powerful tools for modeling complex dependencies in traffic time series. However, the distributed nature of real-world traffic data across multiple stakeholders poses significant challenges in modeling and reconstructing inter-client spatial dependencies while adhering to data locality constraints. Existing methods primarily address static dependencies, overlooking their dynamic nature and resulting in suboptimal performance. In response, we propose Federated Spatio-Temporal Graph with Dynamic Inter-Client Dependencies (FedSTGD), a framework designed to model and reconstruct dynamic inter-client spatial dependencies in federated learning. FedSTGD incorporates a federated nonlinear computation decomposition module to approximate complex graph operations. This is complemented by a graph node embedding augmentation module, which alleviates performance degradation arising from the decomposition. These modules are coordinated through a client-server collective learning protocol, which decomposes dynamic inter-client spatial dependency learning tasks into lightweight, parallelizable subtasks. Extensive experiments on four real-world datasets demonstrate that FedSTGD achieves superior performance over state-of-the-art baselines in terms of RMSE, MAE, and MAPE, approaching that of centralized baselines. Ablation studies confirm the contribution of each module in addressing dynamic inter-client spatial dependencies, while sensitivity analysis highlights the robustness of FedSTGD to variations in hyperparameters.

Private data holds promise for improving LLMs due to its high quality, but its scattered distribution across data silos and the high computational demands of LLMs limit their deployment in federated environments. To address this, the transformer-based federated split models are proposed, which offload most model parameters to the server (or distributed clients) while retaining only a small portion on the client to ensure data privacy. Despite this design, they still face three challenges: 1) Peer-to-peer key encryption struggles to secure transmitted vectors effectively; 2) The auto-regressive nature of LLMs means that federated split learning can only train and infer sequentially, causing high communication overhead; 3) Fixed partition points lack adaptability to downstream tasks. In this paper, we introduce FedSEA-LLaMA, a Secure, Efficient, and Adaptive Federated splitting framework based on LLaMA2. First, we inject Gaussian noise into forward-pass hidden states to enable secure end-to-end vector transmission. Second, we employ attention-mask compression and KV cache collaboration to reduce communication costs, accelerating training and inference. Third, we allow users to dynamically adjust the partition points for input/output blocks based on specific task requirements. Experiments on natural language understanding, summarization, and conversational QA tasks show that FedSEA-LLaMA maintains performance comparable to centralized LLaMA2 and achieves up to 8× speedups in training and inference. Further analysis of privacy attacks and different partition points also demonstrates the effectiveness of FedSEA-LLaMA in security and adaptability.

Retrieval-Augmented Generation (RAG) has become a key paradigm for reducing factual hallucinations in Large Language Models (LLMs), yet little is known about how the order of retrieved documents affects model behavior.We empirically show that under a Top-5 retrieval setting with the gold document included, LLM answers vary substantially across permutations of the retrieved set, even when the gold document is fixed in the first position.This reveals a previously underexplored sensitivity to retrieval permutations.Although existing robust RAG methods focus primarily on enhancing LLM robustness to low-quality retrieval and mitigating positional bias to distribute attention fairly over long contexts, neither approach directly addresses permutation sensitivity.In this paper, we propose Stable-RAG, which exploits permutation sensitivity estimation to mitigate permutation-induced hallucinations.Stable-RAG runs the generator under multiple retrieval orders, clusters hidden states, and decodes from a cluster-center representation that captures the dominant reasoning pattern.It then uses these reasoning results to align hallucinated outputs toward the correct answer, encouraging the model to produce consistent and accurate predictions across document permutations.Experiments on three QA datasets show that Stable-RAG improves answer accuracy, reasoning consistency, and generalization across datasets, retrievers, and input lengths compared with strong baselines 1 .

Current RAG retrievers are designed primarily for human readers, emphasizing complete, readable, and coherent paragraphs. However, Large Language Models (LLMs) benefit more from precise, compact, and well-structured input, which enhances reasoning quality and efficiency. Existing methods rely on reranking or summarization to identify key sentences, but may introduce semantic breaks and unfaithfulness. Thus, efficiently extracting and organizing answer-relevant clues from large-scale documents while reducing LLM reasoning costs remains challenging in RAG systems. Inspired by Occam's razor, we frame LLM-centric retrieval as MinMax optimization: maximizing the extraction of potential clues and reranking them for well-organization, while minimizing reasoning costs by truncating to the smallest sufficient set of clues. In this paper, we propose CompSelect, a compact clue selection mechanism for LLM-centric RAG, consisting of a clue extractor, a reranker, and a truncator. (1) The clue extractor first uses answer-containing sentences as fine-tuning targets, aiming to extract sufficient potential clues; (2) The reranker is trained to prioritize effective clues based on real LLM feedback; (3) The truncator uses the truncated text containing the minimum sufficient clues for answering the question as fine-tuning targets, thereby enabling efficient RAG reasoning. Experiments on three QA datasets demonstrate that CompSelect improves performance while reducing both total and online latency compared to a range of baseline methods. Further analysis also confirms its robustness to unreliable retrieval and generalization across different scenarios.

Due to the broadcasting characteristics of satellite-terrestrial integrated networks (STINs), security vulnerabilities have emerged as a critical concern requiring urgent mitigation strategies. Unlike traditional security methods, federated learning (FL) enables a large number of participants to collaborate without disclosing actual privacy data. Its potential as a framework that combines collaborative model training and covert payload transmission in STINs represents a significant research gap. This paper proposes FedSAT, a novel FL-based covert communication scheme for STINs, in which each participant in the FL process can utilize the shared learning protocol as a covert medium for transmitting arbitrary information in privacy-preserving framework. Our framework leverages the dual capabilities of FL for collaborative model training and covert payload embedding, utilizing Geostationary Earth Orbit (GEO) satellites and distributed terrestrial nodes to embed sensitive data within FL parameter updates. The system maintains model convergence accuracy while implementing strategic encryption to achieve robust sharing and transmission of payloads within the FL framework. Comprehensive simulation tests demonstrate the framework significant efficacy, achieving a 98.7% communication coverage for covert payload transmission under monitoring by low Earth orbit (LEO) surveillance satellites, with only a 0.8% decrease in model accuracy. This breakthrough achievement paves the way for a transformative paradigm in covert cross-domain communication for next-generation networks.

With the rapid advancement of Web 3.0 technologies, public blockchain platforms are witnessing the emergence of novel services designed to enhance user privacy and anonymity. However, the powerful untraceability features inherent in these services inadvertently make them attractive tools for criminals seeking to launder illicit funds. Notably, existing de-anonymization methods face three major challenges when dealing with such transactions: highly homogenized transactional semantics, limited ability to model temporal discontinuities, and insufficient consideration of structural sparsity in account association graphs. To address these, we propose GradWATCH, designed to track anonymous accounts in Ethereum privacy-preserving services. Specifically, we first design a learnable account feature mapping module to extract informative transactional semantics from raw on-chain data. We then incorporate transaction relations into the account association graph to alleviate the adverse effects of structural sparsity. To capture temporal evolution, we further propose an edge-aware sliding-window mechanism that propagates and updates gradients at three granularities. Finally, we identify accounts controlled by the same entity by measuring their embedding distances in the learned representation space. Experimental results show that even under the conditions of unbalanced labels and sparse transactions, GradWATCH still achieves significant performance gains, with relative improvements ranging from 1.62% to 15. 22% in the MRR and from 3. 85% to 7. 31% in the F_1.

Recent advances in surface reconstruction for 3D Gaussian Splatting (3DGS) have enabled remarkable geometric accuracy. However, their performance degrades in photometrically ambiguous regions such as reflective and textureless surfaces, where unreliable cues disrupt photometric consistency and hinder accurate geometry estimation. Reflected light is often partially polarized in a manner that reveals surface orientation, making polarization an optical complement to photometric cues in resolving such ambiguities. Therefore, we propose PolarGS, an optics-aware extension of RGB-based 3DGS that leverages polarization as an optical prior to resolve photometric ambiguities and enhance reconstruction accuracy. Specifically, we introduce two complementary modules: a polarization-guided photometric correction strategy, which ensures photometric consistency by identifying reflective regions via the Degree of Linear Polarization (DoLP) and refining reflective Gaussians with Color Refinement Maps; and a polarization-enhanced Gaussian densification mechanism for textureless area geometry recovery, which integrates both Angle and Degree of Linear Polarization (A&DoLP) into a PatchMatch-based depth completion process. This enables the back-projection and fusion of new Gaussians, leading to a more complete reconstruction. PolarGS is framework-agnostic and achieves superior geometric accuracy compared to state-of-the-art methods.

Neural implicit methods have made remarkable progress in 3D reconstruction. However, previous methods often assume view-independent properties of target objects, which fails to accurately reconstruct objects with challenging characteristics, such as transparency and high reflectivity. To address this limitation, we propose a polarimetric implicit 3D reconstruction method that integrates geometric and polarization information, enabling the production of high-quality meshes in complex scenes. For high-fidelity surface reconstruction, we introduce a view-dependent physical representation that thoroughly analyzes the subtle physical properties of reflections. The reconstruction process is further enhanced by a simple yet effective view-dependent detection algorithm and optimized using the principles of ray tracing and polarization. Experimental results demonstrate the superior performance of the proposed method in both real and synthetic scenarios.

In a real-world RAG system, the current query often involves spoken ellipses and ambiguous references from dialogue contexts, necessitating query rewriting to better describe user's information needs. However, traditional context-based rewriting has minimal enhancement on downstream generation tasks due to the lengthy process from query rewriting to response generation. Some researchers try to utilize reinforcement learning with generation feedback to assist the rewriter, but this sparse rewards provide little guidance in most cases, leading to unstable training and generation results.We find that user's needs are also reflected in the gold documents, retrieved documents and ground-truth. Therefore, by feeding back these multi-aspect dense rewards to query rewriting, more stable and satisfactory responses can be achieved. In this paper, we propose a novel query rewriting method MaFeRw, which improves RAG performance by integrating multi-aspect feedback from both the retrieval process and generated results. Specifically, we first use manual data to train a T5 model for the rewriter initialization. Next, we design three metrics as reinforcement learning feedback: the similarity between the rewritten query and the gold document, the ranking metrics, and ROUGE between the generation and the ground truth. Inspired by RLAIF, we train three kinds of reward models for the above metrics to achieve more efficient training. Finally, we combine the scores of these reward models as feedback, and use PPO algorithm to explore the optimal query rewriting strategy.Experimental results on two conversational RAG datasets demonstrate that MaFeRw achieves superior generation metrics and more stable training compared to baselines.

Federated Learning (FL) is an emerging decentralized machine learning paradigm that addresses the data-silo problem through privacy-preserving collaborative model training, attracting significant attention from academia and industry. However, model trading in FL involves multiple stakeholders, including data owners, model requesters, and the cloud service platform, whose conflicting interests hinder the sustainability and stability of FL. To address these challenges, this paper considers the bounded rationality of the three parties involved in long-term dynamic decision-making and constructs a tripartite evolutionary game model based on evolutionary game theory, further taking into account collusion between data owners and cloud service platforms. We analyze the evolutionary dynamics involved, theoretically revealing the social dilemma of dishonesty in FL model trading. To prevent dishonest behaviors such as free-riding and false reporting, we apply the replicator dynamics and Lyapunov method to analyze the impact of rewards, punishments, and collusion costs on the evolutionary stable strategies of the three parties and propose incentive strategies. Simulation experimental results validate that our incentive model is effective in alleviating dishonest social dilemmas and improving social welfare.

The scaled Web 3.0 digital economy, represented by decentralized finance (DeFi), has sparked increasing interest in the past few years, which usually relies on blockchain for token transfer and diverse transaction logic. However, illegal behaviors, such as financial fraud, hacker attacks, and money laundering, are rampant in the blockchain ecosystem and seriously threaten its integrity and security. In this paper, we propose a novel double graph-based Ethereum account de-anonymization inference method, dubbed DBG4ETH, which aims to capture the behavioral patterns of accounts comprehensively and has more robust analytical and judgment capabilities for current complex and continuously generated transaction behaviors. Specifically, we first construct a global static graph to build complex interactions between the various account nodes for all transaction data. Then, we also construct a local dynamic graph to learn about the gradual evolution of transactions over different periods. Different graphs focus on information from different perspectives, and features of global and local, static and dynamic transaction graphs are available through DBG4ETH. In addition, we propose an adaptive confidence calibration method to predict the results by feeding the calibrated weighted prediction values into the classifier. Experimental results show that DBG4ETH achieves state-of-the-art results in the account identification task, improving the F1-score by at least 3.75% and up to 40.52% compared to processing each graph type individually and outperforming similar account identity inference methods by 5.23 % to 12.91 %.

In the Web 3.0 ecosystem, blockchain and Artificial Intelligence of Things (AIoT) construct the infrastructure, where blockchain transaction semantic detection (BTSD) aims to enhance blockchain security by identifying illegal transactions through distributed miners executing AI algorithms. However, the computational cost of performing semantic detection discourages miners from participating without adequate incentives. Existing studies focus on algorithmic aspects of BTSD, which generally ignore the critical issue of incentive mechanism. To fill this gap, we propose the first incentive-based BTSD framework in the transaction pool phase, emphasizing how incentives affect the behavior of miners and users. We use evolutionary game theory to model miner-user interactions and define three key scenarios to simulate the impact of reward decay and penalty factors on system dynamics. Our results demonstrate that adjusting these parameters significantly influences the number of miners engaging in semantic detection and users initiating legitimate transactions. Under certain conditions, a well-designed incentive mechanism can lead to an Evolutionary Stable Strategy (ESS), thereby achieving systemic stability. This study introduces a novel incentive mechanism for BTSD during the transaction pool phase and validates its effectiveness through both theoretical insights and numerical solutions to enhance blockchain security.

The Uniform Resource Locator (URL) is a primary vector for numerous security threats, including phishing, malware propagation, and spam attacks, making URL-based analysis a critical task in security systems. However, existing research often focuses on static lexical features of individual URLs, overlooking deeper semantic, structural, and behavioral signals that can indicate malicious intent or evasive patterns. In this paper, we propose Behavior-Enhanced Semantic URL Embedding, a novel framework that integrates semantic, structural, and contextual information to improve the detection of security threats embedded in URLs. Our model is composed of three core modules: a semantic understanding module to extract token-level and contextual semantics, a topology structure learning module to capture hierarchical and sequential patterns of URL components, and a downstream multi-task adaptation module that fine-tunes embeddings with supervised contrastive learning for various security detection tasks. We evaluate our method across five public datasets covering key security applications such as malicious URL detection, phishing website identification, and spam filtering, consistently achieving superior performance over existing baselines. Additionally, we demonstrate the extensibility of our approach to related security tasks, showcasing its potential integration into real-world threat detection and security monitoring systems.

In cross-silo federated learning (FL), due to the heterogeneous participants, free-riders can utilize information asymmetry to make profits without performing any local model training. Free-riding attack poses possibilities and opportunities for unfairness and can seriously impair the operation of the FL ecosystem. It motivates our work to explore and characterize the unique features of free-riding attack, which differ from other attacks such as poisoning attacks. In this paper, we propose an evolutionary public goods game-based incentive model (Fed-EPG), which makes the first attempt to construct the interaction model among the participants through the evolutionary public goods game. Specifically, we consider both the public good characteristics of cross-silo FL models as well as the bounded rationality and incomplete information of competitors. We first introduce asymmetric environmental feedback to represent reward and punishment strategies in evolutionary game, and then adopt a multi-segment nonlinear control method to dynamically adjust the rewards and punishments among the participants, which achieves the incentive for the participants to cooperate stably during the training process. Experimental results validate that our incentive model is effective in the mitigation of free-riding. attacks.

Abstract Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw datasets. To enhance privacy in federated learning, multi-party computation can be leveraged for secure communication and computation during model training. This survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy, as well as the corresponding optimization techniques to improve model accuracy and training efficiency. We also pinpoint future directions to deploy federated learning to a wider range of applications.

The blockchain can offer a dependable and secure platform for Internet of Things (IoT) transactions with its distributed and secure network architecture. Unfortunately, it faces challenges, such as limited throughput, excessive computational costs, and high-transaction fees. Off-chain scaling protocols are used to address the scalability of blockchain for their outstanding performance and efficiency. To mitigate the high-cost interactions with blockchain, previous studies only considered moving transactions of payment hubs (PHs) off-chain, utilizing off-chain operators to aggregate multiple transactions. However, existing PHs overly rely on central operators for system maintenance, greatly increasing the risk of central operator failure (COF). Previous solutions allowed operators to submit unsettled state commitments (USCs) to the blockchain and overlooked the pessimistic scenario that could lead to state rollbacks. To address these issues, this article proposes an efficient multiparty payment protocol (HyperPay), aimed at utilizing the off-chain scaling technique to enhance transaction throughput and reduce on-chain cost. Specifically, we first propose a novel off-chain committee and collateral-based verifiable random leader election (C-VRE) to elect leaders fairly, thus mitigating the COF problem. Additionally, we design a new state validation mechanism and one-step fraud challenge (OSFC), enabling verifiers to directly construct fraud proofs and challenges on-chain, thereby preventing leaders from submitting USC. Our evaluation indicates that HyperPay reduces on-chain costs of challenge by 80% and boosts peak throughput by a factor of 10X-283X. A comprehensive theoretical analysis and experimental results substantiate the security and effectiveness of our proposed approach.

The Practical Byzantine Fault Tolerance (PBFT) protocol-supported blockchain can provide decentralized security and trust mechanisms for the Internet of Things (IoT). However, the PBFT protocol is not specifically designed for IoT applications. Consequently, adapting PBFT to the dynamic changes of an IoT environment with incomplete information represents a challenge that urgently needs to be addressed. To this end, we introduce DA-PBFT, a PBFT dynamic adaptive framework based on a multi-agent architecture. DAPBFT divides the dynamic adaptive process into two sub-processes: optimality-seeking and optimization decision-making. During the optimality-seeking process, a PBFT optimization model is constructed based on deep reinforcement learning. This model is designed to generate PBFT optimization strategies for consensus nodes. In the optimization decision-making process, a PBFT optimization decision consensus mechanism is constructed based on the Borda count method. This mechanism ensures consistency in PBFT optimization decisions within an environment characterized by incomplete information. Furthermore, we designed a dynamic adaptive incentive mechanism to explore the Nash equilibrium conditions and security aspects of DA-PBFT. The experimental results demonstrate that DA-PBFT is capable of achieving consistency in PBFT optimization decisions within an environment of incomplete information, thereby offering robust and efficient transaction throughput for IoT applications.

Environmental changes play a critical role in determining the evolution of social dilemmas in many natural or social systems. Generally, the environmental changes include two prominent aspects: the global time-dependent fluctuations and the local strategy-dependent feedbacks. However, the impacts of these two types of environmental changes have only been studied separately, a complete picture of the environmental effects exerted by the combination of these two aspects remains unclear. Here we develop a theoretical framework that integrates group strategic behaviors with their general dynamic environments, where the global environmental fluctuations are associated with a nonlinear factor in public goods game and the local environmental feedbacks are described by the 'eco-evolutionary game'. We show how the coupled dynamics of local game-environment evolution differ in static and dynamic global environments. In particular, we find the emergence of cyclic evolution of group cooperation and local environment, which forms an interior irregular loop in the phase plane, depending on the relative changing speed of both global and local environments compared to the strategic change. Further, we observe that this cyclic evolution disappears and transforms into an interior stable equilibrium when the global environment is frequency-dependent. Our results provide important insights into how diverse evolutionary outcomes could emerge from the nonlinear interactions between strategies and the changing environments.

Stimulation to local areas remarkably affects brain activity patterns, which can be exploited to investigate neural bases of cognitive function and modify pathological brain statuses. There has been growing interest in exploring the fundamental action mechanisms of local stimulation. Nevertheless, how noise amplitude, an essential element in neural dynamics, influences stimulation-induced brain states remains unknown. Here, we systematically examine the effects of local stimulation by using a large-scale biophysical model under different combinations of noise amplitudes and stimulation sites. We demonstrate that noise amplitude nonlinearly and heterogeneously tunes the stimulation effects from both regional and network perspectives. Furthermore, by incorporating the role of the anatomical network, we show that the peak frequencies of unstimulated areas at different stimulation sites averaged across noise amplitudes are highly positively related to structural connectivity. Crucially, the association between the overall changes in functional connectivity as well as the alterations in the constraints imposed by structural connectivity with the structural degree of stimulation sites is nonmonotonically influenced by the noise amplitude, with the association increasing in specific noise amplitude ranges. Moreover, the impacts of local stimulation of cognitive systems depend on the complex interplay between the noise amplitude and average structural degree. Overall, this work provides theoretical insights into how noise amplitude and network structure jointly modulate brain dynamics during stimulation and introduces possibilities for better predicting and controlling stimulation outcomes.

Molecular fingerprints are significant cheminformatics tools to map molecules into vectorial space according to their characteristics in diverse functional groups, atom sequences, and other topological structures. In this paper, we investigate a novel molecular fingerprint Anonymous-FP that possesses abundant perception about the underlying interactions shaped in small, medium, and large-scale atom chains. In detail, the possible atom chains from each molecule are sampled and extended as anonymous atom chains using an anonymous encoding manner. After that, the molecular fingerprint Anonymous-FP is embedded into vectorial space in virtue of the Natural Language Processing technique PV-DBOW. Anonymous-FP is studied on molecular property identification via molecule classification experiments on a series of molecule databases and has shown valuable advantages such as less dependence on prior knowledge, rich information content, full structural significance, and high experimental performance. During the experimental verification, the scale of the atom chain or its anonymous pattern is found significant to the overall representation ability of Anonymous-FP. Generally, the typical scale r = 8 could enhance the molecule classification performance, and specifically, Anonymous-FP gains the classification accuracy to above 93% on all NCI datasets.

Nowadays, graph structure data has played a key role in machine learning because of its simple topological structure, and therefore, the graph representation learning methods have attracted great attention. And it turns out that the low-dimensional embedding representation obtained by graph representation learning is extremely useful in various typical tasks, such as node classification and content recommendation. However, most of the existing methods do not further dig out potential structural information on the original graph structure. Here, we propose wGCN, which utilizes random walk to obtain the node-specific mesoscopic structures (high-order local structure) of the graph and utilizes these mesoscopic structures to enhance the graph and organize the characteristic information of the nodes. Our method can effectively generate node embedding for data of previously unknown categories, which has been proven in a series of experiments conducted on many types of graph networks. And compared to baselines, our method shows the best performance on most datasets and achieves competitive results on others. It is believed that combining the mesoscopic structure to further explore the structural information of the graph will greatly improve the learning efficiency of the graph neural network.

Lattice-based cryptography, as an active branch of post-quantum cryptography (PQC), has drawn great attention from side-channel analysis researchers in recent years. Despite the various side-channel targets examined in previous studies, detail on revealing the secret-dependent information efficiently is less studied. In this paper, we propose adaptive EM side-channel attacks with carefully constructed ciphertexts on Kyber, which is a finalist of NIST PQC standardization project. We demonstrate that specially chosen ciphertexts allow an adversary to modulate the leakage of a target device and enable full key extraction with a small number of traces through simple power analysis. Compared to prior research, our techniques require fewer traces and avoid building complex templates. We practically evaluate our methods using both a reference implementation and the ARM-specific implementation in pqm4 library. For the reference implementation, we target the leakage of the output of the inverse NTT computation and recover the full key with only four traces. For the pqm4 implementation, we develop a message-recovery attack that leads to extraction of the full secret key with between eight and 960 traces, depending on the compiler optimization level. We discuss the relevance of our findings to other lattice-based schemes and explore potential countermeasures.

Structures of genetic regulatory networks are not fixed. These structural perturbations can cause changes to the reachability of systems' state spaces. As system structures are related to genotypes and state spaces are related to phenotypes, it is important to study the relationship between structures and state spaces. However, there is still no method can quantitively describe the reachability differences of two state spaces caused by structural perturbations. Therefore, Difference in Reachability between State Spaces (DReSS) is proposed. DReSS index family can quantitively describe differences of reachability, attractor sets between two state spaces and can help find the key structure in a system, which may influence system's state space significantly. First, basic properties of DReSS including non-negativity, symmetry and subadditivity are proved. Then, typical examples are shown to explain the meaning of DReSS and the differences between DReSS and traditional graph distance. Finally, differences of DReSS distribution between real biological regulatory networks and random networks are compared. Results show most structural perturbations in biological networks tend to affect reachability inside and between attractor basins rather than to affect attractor set itself when compared with random networks, which illustrates that most genotype differences tend to influence the proportion of different phenotypes and only a few ones can create new phenotypes. DReSS can provide researchers with a new insight to study the relation between genotypes and phenotypes.

Abstract The fifth generation (5G) wireless communication networks are being deployed worldwide from 2020 and more capabilities are in the process of being standardized, such as mass connectivity, ultra-reliability, and guaranteed low latency. However, 5G will not meet all requirements of the future in 2030 and beyond, and sixth generation (6G) wireless communication networks are expected to provide global coverage, enhanced spectral/energy/cost efficiency, better intelligence level and security, etc. To meet these requirements, 6G networks will rely on new enabling technologies, i.e., air interface and transmission technologies and novel network architecture, such as waveform design, multiple access, channel coding schemes, multi-antenna technologies, network slicing, cell-free architecture, and cloud/fog/edge computing. Our vision on 6G is that it will have four new paradigm shifts. First, to satisfy the requirement of global coverage, 6G will not be limited to terrestrial communication networks, which will need to be complemented with non-terrestrial networks such as satellite and unmanned aerial vehicle (UAV) communication networks, thus achieving a space-air-ground-sea integrated communication network. Second, all spectra will be fully explored to further increase data rates and connection density, including the sub-6 GHz, millimeter wave (mmWave), terahertz (THz), and optical frequency bands. Third, facing the big datasets generated by the use of extremely heterogeneous networks, diverse communication scenarios, large numbers of antennas, wide bandwidths, and new service requirements, 6G networks will enable a new range of smart applications with the aid of artificial intelligence (AI) and big data technologies. Fourth, network security will have to be strengthened when developing 6G networks. This article provides a comprehensive survey of recent advances and future trends in these four aspects. Clearly, 6G with additional technical requirements beyond those of 5G will enable faster and further communications to the extent that the boundary between physical and cyber worlds disappears.

BACKGROUND: Classification of diseases based on genetic information is of great significance as the basis for precision medicine, increasing the understanding of disease etiology and revolutionizing personalized medicine. Much effort has been directed at understanding disease associations by constructing disease networks, and classifying patient samples according to gene expression data. Integrating human gene networks overcomes limited coverage of genes. Incorporating pathway information into disease classification procedure addresses the challenge of cellular heterogeneity across patients. RESULTS: In this work, we propose a disease classification model LAMP, which concentrates on the layered assessment on modules and pathways. Directed human gene interactions are the foundation of constructing the human gene network, where the significant roles of disease and pathway genes are recognized. The fast unfolding algorithm identifies 11 modules in the largest connected component. Then layered networks are introduced to distinguish positions of genes in propagating information from sources to targets. After gene screening, hierarchical clustering and refined process, 1726 diseases from KEGG are classified into 18 categories. Also, it is expounded that diseases with overlapping genes may not belong to the same category in LAMP. Within each category, entropy is applied to measure the compositional complexity, and to evaluate the prospects for combination diagnosis and gene-targeted therapy for diseases. CONCLUSION: In this work, by collecting data from BioGRID and KEGG, we develop a disease classification model LAMP, to support people to view diseases from the perspective of commonalities in etiology and pathology. Comprehensive research on existing diseases can help meet the challenges of unknown diseases. The results provide suggestions for combination diagnosis and gene-targeted therapy, which motivates clinicians and researchers to reposition the understanding of diseases and explore diagnosis and therapy strategies.

The Internet continues to flourish, while an increasing number of network applications are found deploying Bloom filters. However, the heterogeneity of the Bloom filter realisations complicates the utilisation of relevant applications. Moreover, when applying Bloom filter to traffic that usually has a gigabit capacity, even insignificant delays will accumulate and restrict the effectiveness of the real‐time protocols. In this study, the authors present a Bloom filter construction that can be easily and consistently adopted at network nodes, with also considerable processing speed. Specifically, the authors show that AES‐based hashes are adequate to create Bloom filters correctly. Then they illustrate how AES new instructions (AES‐NI) can be leveraged to accelerate the Bloom filter realisation. According to the authors' experimental results, the proposed Bloom filter enables the best speed performance compared to the competing approaches.

In this paper, we propose a powerful weak learner (Vector Decision Tree (VDT)) and a new Boosted Vector Decision Tree (BVDT) algorithm framework for the task of multi-class classification. Unlike the traditional scalar valued boosting algorithms, the BVDT algorithm directly maps the feature space to the decision space in the multi-class setting, which facilitates convenient implementations of the multi-class classification algorithms using diverse loss functions. By viewing the explicit hard threshold on the leaf node value applied in the LogitBoost as a constraint optimization problem, we further develop two new variants of the BVDT algorithm: the [Formula: see text]-BVDT and the [Formula: see text]-BVDT. The performance of the proposed algorithm is evaluated on different datasets and compared with three state-of-the-art boosting algorithms, [Formula: see text]-Nearest Neighbor (KNN) and Support Vector Machine (SVM). The results show that the performance of the proposed algorithm ranks first in all but one dataset and reduces the test error rate by 4% up to 58% with respect to the state-of-the-art boosting algorithms based on the scalar-valued weak learner. Furthermore, we present a case study on the Abalone dataset by designing a new loss function that combines the negative log-likelihood loss function of classification problem and square loss function of regression problem.

The Internet keeps flourishing and enables unexpected possibilities to all aspects of individuals' life. Such distributed networking systems as wireless sensor networks and Internet of things are widely deployed. Yet, in the meantime secure group communication remains a challenging task in these environments. To address this challenge, this paper aims at lightweight group key establishment with strong security properties. We propose a broadcast encryption scheme based on one-way function trees and specify a dual-evolving approach for dynamic group-membership update. Then we complement the scheme by a content-protection protocol and further optimize the protocol in terms of communication efficiency. As with our analysis, our scheme can successfully prevent a key leakage attack, namely, collusion attack. Through our comprehensive evaluations, we confirm the effectiveness and the adequacy of our solution in distributed networking systems.

In this paper we propose a mechanisable technique for asymptotic stability analysis of continuous dynamical systems. We start from linearizing a continuous dynamical system, solving the Lyapunov matrix equation and then check whether the solution is positive definite. For the cases that the Jacobian matrix is not a Hurwitz matrix, we first derive an algebraizable sufficient condition for the existence of a Lyapunov function in quadratic form without linearization. Then, we apply a real root classification based method step by step to formulate this derived condition as a semi-algebraic set such that the semi-algebraic set only involves the coefficients of the pre-assumed quadratic form. Finally, we compute a sample point in the resulting semi-algebraic set for the coefficients resulting in a Lyapunov function. In this way, we avoid the use of generic quantifier elimination techniques for efficient computation. We prototypically implemented our algorithm based on DISCOVERER. The experimental results and comparisons demonstrate the feasibility and promise of our approach.

We study the uniqueness of Gibbs measures constructed on infinite graphs, in which the vertexes admit certain markov properties related to the connectivity properties of the graphs. Inspired by Weitz and Winklerpsilas work, we generalize Dobrushinpsilas influence of site to site via sites to a more general form of block to block via blocks by path coupling technique. Our condition for uniqueness of Gibbs measure, is a mathematical statement of the spatial correlation decay conjecture.