A customized RISC-V ISA with integrated digital accelerators offers a promising solution to improve energy efficiency in neural network inference.However, it often requires multiple instructions per accelerator operation, which limits computational efficiency during deep neural network inference.To overcome the instruction overhead, this design introduces a dedicated instruction set that enables scalable and fine-grained accelerator control.By incorporating the pattern-driven instruction mode, this design exploits the neural layer regularity to support efficient instruction iteration.Furthermore, this digital accelerator leverages hardware reuse for logic operations, forming a fusion-style architecture that integrates reconfigurable components.Experimental results demonstrate that the custom RISC-V ISA achieves an average runtime speedup of 8.26× and reduces the instruction count by 14.71×.This design also yields an average 8.73× reduction in cycles per instruction across MobileNetV2, ResNet50, VGG19, EfficientNet, and DenseNet-BC, validating its effectiveness across representative benchmarks.Additionally, it improves average energy efficiency by 1.74×, outperforming state-of-the-art designs.

Devising diffusion graph to learn user representations is a crucial step in studying information propagation prediction. However, previous works mainly focused on structural and temporal features. To better incorporate content features, we introduce the Backward Decomposition and Forward Preservation mechanisms. The former involves decomposing content features for initializing node signals in the diffusion graph, thus fusing user features with content features. The latter aims to maintain node features generated by graph encoder consistent with the original content features. A series of experiments demonstrate that our model outperforms state-of-the-art models, and both mechanisms significantly enhance the prediction performance. Furthermore, our methods enables the features generated by the diffusion graph to more effectively incorporate features from various semantic spaces, whether encoded by language models or generated by graph embedding algorithms.

Malware Knowledge Graph (MKG) serves as an essential auxiliary tool for malware detection and analysis. However, the construction of MKG faces several challenges, such as inadequate dataset quality, incomplete entity feature extraction, and the limitations imposed by deep learning techniques. To address these issues, we present an Efficient Framework for constructing a malware knowledge graph (EFwork). Firstly, we build a High-Quality Dataset (HQDataset) and introduce a metric for data quality assessment based on knowledge coverage, timeliness, and density. Subsequently, we develop a Named Entity Recognition (NER) model that extracts character features, part-of-speech features, and word features from the data, leveraging deep learning models to identify malware-related entities. Finally, we implement a rule-based filtering mechanism, utilizing a comprehensive Rule Database to eliminate entities that do not conform to predefined rules. Experimental result shows that our HQDataset demonstrates superior data quality when compared to other open-source datasets. Furthermore, our NER model combined with our Rule Database outperforms existing models, achieving improvements of 0.67%, 0.74%, and 0.69% in Precision, Recall, and F1-Score, respectively.

The TLS encryption protocol plays a vital role in securing data transmission, but it also presents challenges for payload-based Network Intrusion Detection Systems (NIDS). Existing methods utilize statistical characteristics of side-channel features, such as the mean packet length, to identify encrypted traffic. However, packet lengths are constrained by the Maximum Segment Size (MSS) of the TCP protocol. This constraint causes the length-varied sequence to be encapsulated into segments of equal length, resulting in information loss. Moreover, flow-level statistical features are vulnerable to interference from noisy packets, making it challenging to detect malicious traffic injected with benign packets effectively. In this paper, we propose an encrypted traffic detection model based on Record length and frEquency Domain Analysis (REDA). First, we reconstruct the TLS Record Length Sequence (TRLS), which is a length-varied sequence, to capture differences in traffic content during transmission. Second, we employ the Discrete Fourier Transform (DFT) to extract frequency domain features of the TRLS, which are resistant to attacker interference. Finally, an improved One-Class Support Vector Machine (OCSVM) algorithm is devised for the unsupervised detection of malicious traffic, enabling the identification of unknown attacks. Experiments show that REDA is superior to other state-of-the-art methods in terms of accuracy by 2.44%.