ArchiveAs the breaker of Moore’s Law, Chiplet technology has high expectations in the integrated circuit industry. Chiplet technology can combine multiple small chips with specific functions into a Chiplet integrated chip through high-speed interconnection technology, whose core technology is the Chiplet interconnection technology that can achieve Chiplet combination and expansion. We analyze and discuss the Chiplet interconnection protocol, interconnection architecture, fault-tolerant mechanism, typical interconnection Chiplets, and testability design based on the interconnection Chiplet. Firstly, we provide a detailed comparison and analysis of domestic and foreign Chiplet interconnection protocols, and provide the layers and functions of each protocol. Secondly, we introduce three typical Chiplet interconnection architectures, and analyze the characteristics and advantages of each architecture. Afterwards, the Chiplet fault-tolerant mechanism is introduced, including fault-tolerant encoding of interconnection interfaces, fault-tolerant topology, and fault-tolerant routing. Then, three types of interconnection Chiplet design schemes are presented, including programmable interconnection Chiplets, path programmable interconnection Chiplets, and fully customized interconnection Chiplets. Finally, a testability design testing scheme based on the interconnection Chiplet is introduced. This paper focuses on Chiplet interconnection and aims to help readers have a systematic understanding of Chiplet interconnection technology.
The rise and development of large-scale neuromorphic platforms require network-on-chip to support efficient data transmission mechanisms. Although many efforts have been made to develop high performance topology architectures and routing schemes, they still suffer from single transmission mode or poor scalability, making them stay on a low efficiency in neuromorphic computing. Inspired by the small-world properties of human brain networks, this brief proposes an efficient region-broadcast (ReB) routing scheme to support unicast, multicast, and broadcast transmission modes. Besides, a synaptic connections indexing method is deployed to accommodate the ReB routing scheme and support this hybrid-mode packet transmission. This method replaces the traditional multicast routing table, effectively improving network scalability and reducing power consumption. Experimental results show that compared with existing work, the ReB routing scheme reduces the peak spike traffic and link load standard deviation by 11.5% and 20.4%, respectively. The ReB routing scheme brings improvements in latency, throughput, and energy under the validation of synthetic traffic, spiking neural network applications and brain cortical networks. Various synthetic traffic patterns are used in the experiments. The datasets used in spiking neural network applications include MNIST, QTDB, Ev-object, and DVS-Gesture. Finally, the proposed ReB router has an excellent bandwidth of 0.24 spike/cycle and only consumes an area of 0.014 mm2.
The high-performance global routing results can effectively meet the design specifications and greatly improve the efficiency of the detailed routing phase. As the signal transmitted in the chip increases through the bus, the bus gradually becomes a key factor affecting the performance of the chip. If the bus topology structure is not considered during the global routing stage, coupling phenomena will occur when the bus transmission information is transmitted, resulting in a large timing deviation of signal transmission. Therefore, in order to optimize the consistency of bus topology structure in 2D global routing, an effective multi-strategy bus topology aware global routing algorithm is proposed. First, a topology reconstruction strategy based on congestion is designed to optimize the two-pin net and improve the utilization rate of routing space effectively. Second, a heuristic reroute model is constructed to realize the reroute of multi-signal bit bus. Third, a routing algorithm considering topology structure is added to the rip-up and reroute model to adjust the topology structure of the same bus net group and improve the consistency of bus topology. Finally, an iterative method to adjust the cost of bus topology is designed to further optimize the consistency of bus topology. Experimental results show that the proposed algorithm can effectively optimize the bus topology consistency of 2D routing solution.
Knowledge graphs often face the challenge of incompleteness, which can be alleviated by completing missing information through link prediction tasks. However, most knowledge graph completion work overly focuses on extracting embedding features without sufficiently considering the complex semantics contained in the predicted node neighborhood information, global feature information, and directional feature information, making it difficult to accurately predict the missing information. We propose a general representation learning semantic enhancement framework, ASFR, which utilizes an attention mechanism to extract local association information of the knowledge graph and structural features of the knowledge graph, and enhances existing knowledge graph representation learning models by incorporating positional information. By embedding these three types of additional knowledge graph information into the entity vectors of the knowledge graph, the quality of the knowledge graph representation vectors is improved. Comparative experiments are conducted using five different categories of classical methods, and the results indicate that this framework can effectively enhance the predictive capability of models, achieving an improvement of 6.89% on three public datasets.
Multimodal sentiment analysis aims to utilize the multimodal customer comments and other data to identify users’ sentimental tendencies. To realize cross-domain application with the domain bias, commonly used solutions are unsupervised domain adaptation methods. Nevertheless, this type of solutions focuses on the extraction of domain-invariant features, and it neglects the significance of domain-specific features at the target domain. Thus, a meta-optimization based domain-invariant and domain-specific feature disentanglement network is proposed. First, by embedding adapters into the pre-trained large model with fine-tuning fitting, the image-text fused sentiment feature encoder is accordingly constructed. Then, a feature disentanglement module is constructed on the basis of the factorization operation, which utilizes domain adversary and domain classification, together with collaborative independence constraints, respectively, to achieve knowledge-transferable domain-invariant feature embedding while extracting the domain-specific features to enhance the performance of sentiment classification at the target domain. To ensure the consistency of the overall optimization tendency for feature disentanglement and sentiment classification, a meta-learning-based meta-optimization training strategy is put forward to synergistically optimize the sentiment analysis network. Comparative experiments on bidirectional sentiment transfer tasks constructed by MVSA and Yelp datasets demonstrate that compared with other advanced image-text sentiment transfer algorithms, the proposed algorithm achieves superior performance on bidirectional sentiment transfer tasks in terms of three consensus metrics: Precision, Recall and F1 score.
Feature selection is an effective technique of dimensionality reduction in the field of machine learning. In the era of big data, data security has become an issue of great concern nowadays, and how to perform the feature selection task under the premise of privacy protection is a challenging scientific problem that needs to be solved urgently. Rough hypercuboid is an uncertainty approximation computational model combining rough set theory and hypercuboid learning, which provides an efficient feature selection method for numerical approximate classification problems by introducing supervised information granulation technique and multiple feature evaluation criteria. In this paper, we propose a novel multi-party federated feature selection algorithm under privacy protection, based on the rough hypercuboid model and particle swarm optimization algorithm. Firstly, a centralized (client/server) federated feature selection architecture for multi-party participation is established. Based on the architecture, the rough hypercuboid model and the particle swarm optimization algorithm are used to search the optimal feature subset on the client, and a novel global feature subset evaluation strategy for multiple participants is proposed on the server. Then, the ability of the proposed algorithm to select features in collaboration with multiple participants is improved by designing a particle initialization strategy in a federated environment. Finally, experimental results on the twelve UCI benchmark datasets show that compared with the other six traditional feature selection algorithms, the subset of features selected by the proposed algorithm has higher classification performance on each participant under the premise of satisfying the data privacy protection.
At present, end-to-end speech neural codecs, represented by SoundStream, have demonstrated outstanding performance in reconstructed speech quality. However, these methods require extensive convolutional computations, leading to lengthy encoding times. To address this issue, we introduce a neural speech codec method based on Mel spectrogram and squeeze-excitation-weighted quantization. This method aims to maintain high speech perceptual quality while reducing computational costs and increasing operational speed, thereby minimizing latency. Specifically, we utilize Mel spectrogram features as input, capitalize on the temporal compression properties during Mel spectrogram extraction, and combine a lower-layer convolutional encoder to simplify the computation process. Additionally, inspired by squeezed excitation network concepts, we extract excitation weights for each dimension of the output features from the encoder’s final layer. These weights are used as the weighting coefficients for each dimension of the compressed features when calculating codebook distances in the quantizer, thus enabling the learning of correlations between features and enhancing the performance of quantization. Experimental results on the LibriTTS and VCTK datasets indicate that this method significantly enhances the computational speed of the encoder and improves the reconstructed speech quality at lower bit rates (≤3 Kbps). For instance, at a bitrate of 1.5 Kbps, the real-time factor (RTF) of encoding computations can increase by up to 4.6 times. Regarding perceptual quality, at a bitrate of 0.75 Kbps, objective metrics such as short-time objective intelligibility (STOI) and virtual speech quality objective listener (VISQOL) show an average improvement of 8.72% compared with the baseline. Additionally, ablation studies not only demonstrate that the optimization effect of compressed excitation weight methods is inversely correlated with bitrate, but also reveal that, compared with the periodic activation function Snake, the Relu activation function can significantly speed up processing while maintaining comparable speech perceptual quality.
Transformer has gradually become the preferred solution for computer vision tasks, which has promoted the development of its interpretability methods. Traditional interpretation methods mostly use the perturbation mask generated by the Transformer encoder’s final layer to generate an interpretable map. However, these methods ignore uncertain information on the mask and the information loss in the upsampling and downsampling processes, which can result in rough and incomplete positioning of the object area. To overcome the mentioned problems, a Transformer explanation method based on sequential three-way and attention fusion (SAF-Explainer) is proposed. SAF-Explainer mainly includes the sequential three-way mask (S3WM) module and attention fusion (AF) module. The S3WM module processes the mask by applying strict threshold conditions to avoid the uncertainty information in the mask from damaging the interpretation results, so as to effectively locate the object position. Subsequently, AF module uses attention matrix aggregation to generate a relationship matrix for cross-layer information interaction, which is used to optimize the detailed information in the interpretation results and generates clear and complete interpretation results. To verify the effectiveness of the proposed SAF-Explainer, comparative experiments are conducted on three natural image datasets and one medical image dataset. The results show that SAF-Explainer has better explainability. This work advances visual explanation techniques by providing more accurate and clinically relevant interpretability for Transformer-based vision systems, particularly in medical diagnostic applications where precise region identification is crucial.
Collaborative filtering-based recommender systems that only rely on single-behavior data often encounter serious sparsity problems in practical applications, resulting in poor performance. Multi-behavior recommendation (MBR) is a method that seeks to learn user preferences, represented as vector embeddings, from auxiliary behavior interaction data. By leveraging these preferences for target behavior recommendations, MBR can mitigate the data sparsity challenge and enhance predictive precision for recommendations. We introduce MB-HGCN, a novel recommendation method designed to exploit multi-behavior data. The method leverages a hierarchical graph convolutional network to learn user and item embeddings from a coarse-grained global level to a fine-grained behavior-specific level. Our method learns global embeddings from a unified homogeneous graph constructed by the interactions of all behaviors, which are then used as initialized embeddings for behavior-specific embedding learning in each behavior graph. Moreover, we also emphasize the distinct of the user and item behavior-specific embeddings and design two simple-yet-effective strategies to aggregate the behavior-specific embeddings for users and items, respectively. Finally, we adopt multi-task learning for optimization. Extensive experimental results on three real-world benchmark datasets show that MB-HGCN can substantially outperform the state-of-the-art methods, achieving a relative improvement of 73.93% and 74.21% for HR@10 and NDCG@10, respectively, on Tmall dataset.
Satellite Internet of things (SatIoT), positioned as the core evolutionary direction in sixth-generation (6G) mobile network architectures, is establishing a globally seamless ubiquitous IoT connectivity framework with integrated service capabilities through space-terrestrial collaborative networking technologies. Multiple access technology, as a key technology supporting dynamic access for large-scale users in SatIoT, primarily aims to achieve on-demand, orderly, and reliable concurrent access services for massive user terminals through intelligent allocation mechanisms of wireless resources. We review the evolutionary trajectory of ALOHA-based multiple access technologies, categorize existing access technologies into two major technical lineages—slotted random multiple access and unslotted random multiple access—from the perspective of time constraints on data transmission, and conduct a classified analysis of their technical characteristics, delving deeply into the physical layer implementation principles and protocol properties of various technical approaches. Regarding the direction of convergent innovation, we summarize the design paradigms and research achievements of novel hybrid random multiple access technologies, and collate cutting-edge research progress from dimensions such as protocol architectures, spectrum sensing, and service modeling. Finally, we identify future technological directions and development trends in areas including on-demand access control, simplify random multi-access, multi-access edge computing (MEC)-enabled random multi-access, and data-model co-driven model and scenario verification.
The industrial Internet of things (IIoT) faces increasingly severe security threats, and traditional perimeter-based security models are no longer adequate to address evolving and complex demands. Zero trust, an emerging security model centered on the core principle of “never trust, always verify,” has gradually gained attention. However, the research and application of zero trust in the IIoT domain are still in their early stages, necessitating more comprehensive and systematic exploration. We provide a systematic review of the development and applications of zero trust in the industrial sector, with a focus on analyzing its core technologies and practical scenarios while identifying current research trends and future directions. We introduce the basic concepts and principles of industrial zero trust, establishing a theoretical foundation for subsequent discussions. We then systematically outline the migration strategies and evaluation methods for industrial zero trust architectures and summarize key technologies, including authentication, software-defined perimeters, micro-segmentation, secure communication channels, and trust evaluation, collectively forming the core supporting framework of industrial zero trust. Furthermore, we delve into the critical role of access control within the zero trust model and its value in fine-grained permission management. By examining typical IIoT application scenarios, we further explore the practical advantages of zero trust in complex environments. Finally, we identify existing challenges in industrial zero trust and discuss potential future development directions.
With the rapid development of artificial intelligence generated content (AIGC) technologies and the widespread deployment of large language models (LLMs), networks in artificial intelligence data centers are encountering significant challenges. Flow control is a crucial approach for optimizing network performance, providing extremely high bandwidth and ultra-low latency. This paper reviews key issues and solutions in the field of fine-grained flow control, focusing on advances in three key areas: adaptive load balancing mechanisms that dynamically distribute traffic making full use of network resources to avoid congestion, proactive congestion control strategies designed to predict and alleviate potential congestion, and out-of-order packet reordering techniques that ensure data integrity despite non-sequential arrivals. We summarize the mainstream implementation solutions and provide a detailed comparison. Building on this, we discuss the key technical solutions currently adopted by leading artificial intelligence data centers, along with the network devices that support fine-grained flow control. We also identify unresolved challenges in this field, propose potential solutions, and explore future development trends, especially as AI technologies continue to evolve and demand more sophisticated network infrastructures. This review offers valuable insights for researchers and practitioners to optimize network performance in AI-driven applications and highlights important directions for future research in fine-grained flow control.
Softwareization of network function (NF) provides flexibility for the implementation and deployment of new network applications. However, duo to more complex program structure and running environment compared with NF hardware, NF software introduces various performance issues, such as, short-term throughput anomalies and long-tail delays, and degrades user experience. Once NF performance problem occurs, it is necessary to quickly locate problematic modules and determine the cause of the problems through performance measurement. Facing to complex operating environments of NF, increasingly expanding code size, and diverse root causes of problems, coarse-grained performance measurement cannot meet the requirement of problem location and analysis. More efficient fine-grained NF performance measurement is necessary. For the two types of widely used NF performance measurement methods: sampling-based and instrumentation-based, we first prove through actual measurement analysis that, the sampling-based performance measurement method is not suitable for fine-grained NF performance measurement, and the instrumentation-based method will generate a large amount of additional measurement overhead, affecting the measurement results. To this end, we propose a function-level dynamic instrumentation method that combines dynamic library piling and function-level fast breakpoints. Compared with static instrumentation, dynamic instrumentation can execute instrumentation on demand in runtime. It is more suitable for use in the production environment. Our dynamic instrumentation method reduces the instrumentation overhead by an average of 70% compared with baseline fast breakpoints. On this basis, we design and implement the packet-level NF performance measurement method LProfile, based on lightweight probes and storage optimization. Compared with TAU, a general-purpose performance measurement tool, LProfile reduces the single-point measurement overhead by 82%.
In crowdsensing systems, users complete sensing tasks by providing data, but variations in sensor precision, user behavior, and environmental factors lead to significant differences in data quality. Truth discovery techniques mitigate the impact of low-quality data by aggregating multiple user inputs with weighted mechanisms. However, existing methods often overlook personalized privacy needs, exposing sensitive user information. Meanwhile, encryption-based privacy protection mechanisms, though secure, suffer from high computational and communication overhead, making them impractical for large-scale crowdsensing applications. To address these challenges, we propose personalized differential privacy truth discovery (PDPTD), a framework that integrates local differential privacy (LDP) with truth discovery, ensuring both strong privacy protection and high-quality data aggregation. Specifically, PDPTD employs a randomized response mechanism, enabling users to dynamically adjust their data perturbation levels based on personalized privacy budgets. This flexible approach balances privacy protection and data utility, allowing users to contribute valuable data while safeguarding sensitive information. On the server side, PDPTD incorporates a weighted aggregation strategy that compensates for information loss caused by perturbation, effectively improving inference accuracy. Additionally, PDPTD introduces a dynamic user weighting mechanism, which assigns weights based on data quality. This ensures that even if some users select higher perturbation levels, the system can still infer results closed to the true values, maintaining data reliability and consistency.Theoretical analysis and experimental results demonstrate that PDPTD complies with LDP principles while ensuring high accuracy in final inferred results. This makes it a practical and efficient solution for large-scale crowdsensing applications, where balancing privacy, data utility, and computational efficiency is crucial.
To address the limitations in search expressiveness and the inadequacy of verification mechanisms in existing searchable encryption methods, we propose a verifiable Boolean searchable encryption scheme based on blockchain index (VBSE-BI). The scheme first constructs a security model supporting verifiable Boolean search, and based on this model, designs an incremental secure index construction method utilizing blockchain storage structures and achieves efficient search while ensuring the tamper-proof nature of the index structure. Moreover, the scheme introduces an efficient dynamic update mechanism for the secure index, effectively avoiding the significant storage and update overhead caused by auxiliary update structures. To meet the integrity verification requirements of Boolean searches, the scheme defines the unforgeability of Boolean search results and proposes a Boolean operation integrity verification algorithm based on bilinear map accumulators and the extended Euclidean algorithm. Security analysis demonstrates that VBSE-BI scheme can resist dynamic chosen keyword attacks in the random oracle model and satisfy unforgeability under the bilinear q-strong Diffie-Hellman assumption. Compared with similar schemes, VBSE-BI not only supports more expressive Boolean search statements but also significantly reduces the user’s computational complexity to log n (where n is the number of keywords). Experimental results show that by optimizing the verification algorithm, the scheme keeps the user’s verification time consistently low (1.0−1.8 s), accounting for only 9.98%−14.03% of the server-side computation time. These findings indicate that VBSE-BI is highly suitable for resource-constrained mobile devices, providing a solid theoretical foundation and efficiency assurance for the practical application of searchable encryption.
The multi-level blockchains architecture is an architecture that organizes multiple blockchains into a tree, where each blockchain can control and manage part of the functions and on-chain data of the next level of the blockchains to which it is connected by cross-chain technology. However, the cross-chain transfer of assets under this architecture is a multi-hop cross-chain problem, where the evidence of successful execution of a cross-chain transaction needs to be transmitted and verified in multiple hops on the path from the source chain to the target chain, resulting in longer execution latency of the cross-chain transaction, higher evidence transmission overhead and verification overhead. Therefore, we propose a lightweight and efficiently verified assets cross-chain transfer method for multi-level blockchains architecture, which introduces a top-level witness chain connecting each multi-level architecture and deploys a witness contract on each chain, so that the parent chains of the source and target chains in a cross-chain transaction act as witness chains to drive the completion of the cross-chain transaction. We also introduce a cross-chain transaction verification evidence based on Verkle tree, the method organizes the cross-chain transaction information to be processed in the same block in a Verkle tree employing KZG polynomial commitment, and adds the KZG commitment and the proof data into the evidence, and proves the execution state of the cross-chain transaction by verifying the evidence, so as to optimize the transmission and verification of the evidence. Theoretical analysis and experiments on the prototype of the method prove that the method reduces the execution latency of the cross-chain transaction and reduces the evidence verification overhead compared with the scheme using SPV without increasing the evidence transmission overhead, which is lightweight and efficiently verified.