Current Issue
lssue 5, 2025
Editors-in-Chief
Yunhe Pan, Aiguo Fei
Advisor Xicheng Lu
ISSN 2095-9184
CN 33-1389/TP
IF (2023 JCR) 2.7
| Submit Now |
- Current Issue
- Cover Articles
- Archive
- Virtual Issues
- Online First
Volume 26 Issue 5，2025
Regular Papers
Abstract：Binary analysis, as an important foundational technology, provides support for numerous applications in the fields of software engineering and security research. With the continuous expansion of software scale and the complex evolution of software architecture, binary analysis technology is facing new challenges. To break through existing bottlenecks, researchers have applied artificial intelligence (AI) technology to the understanding and analysis of binary code. The core lies in characterizing binary code, i.e., how to use intelligent methods to generate representation vectors containing semantic information for binary code, and apply them to multiple downstream tasks of binary analysis. In this paper, we provide a comprehensive survey of recent advances in binary code representation technology, and introduce the workflow of existing research in two parts, i.e., binary code feature selection methods and binary code feature embedding methods. The feature selection section includes mainly two parts: definition and classification of features, and feature construction. First, the abstract definition and classification of features are systematically explained, and second, the process of constructing specific representations of features is introduced in detail. In the feature embedding section, based on the different intelligent semantic understanding models used, the embedding methods are classified into four categories based on the usage of text-embedding models and graph-embedding models. Finally, we summarize the overall development of existing research and provide prospects for some potential research directions related to binary code representation technology.Keywords：Binary analysis;Binary code representation;Binary code feature selection;Binary code feature embedding48|10|0Updated：2025-06-09Regular Papers
Abstract：Subdivision is a widely used technique for mesh refinement. Classic methods rely on fixed manually defined weighting rules and struggle to generate a finer mesh with appropriate details, while advanced neural subdivision methods achieve data-driven nonlinear subdivision but lack robustness, suffering from limited subdivision levels and artifacts on novel shapes. To address these issues, this paper introduces a neural mesh refinement (NMR) method that uses the geometric structural priors learned from fine meshes to adaptively refine coarse meshes through subdivision, demonstrating robust generalization. Our key insight is that it is necessary to disentangle the network from non-structural information such as scale, rotation, and translation, enabling the network to focus on learning and applying the structural priors of local patches for adaptive refinement. For this purpose, we introduce an intrinsic structure descriptor and a locally adaptive neural filter. The intrinsic structure descriptor excludes the non-structural information to align local patches, thereby stabilizing the input feature space and enabling the network to robustly extract structural priors. The proposed neural filter, using a graph attention mechanism, extracts local structural features and adapts learned priors to local patches. Additionally, we observe that Charbonnier loss can alleviate over-smoothing compared to L2 loss. By combining these design choices, our method gains robust geometric learning and locally adaptive capabilities, enhancing generalization to various situations such as unseen shapes and arbitrary refinement levels. We evaluate our method on a diverse set of complex three-dimensional (3D) shapes, and experimental results show that it outperforms existing subdivision methods in terms of geometry quality. See https://zhuzhiwei99.github.io/NeuralMeshRefinement for the project page.Keywords：Geometry processing;Mesh refinement;Mesh subdivision;Disentangled representation learning;Neural network;Graph attention27|9|0Updated：2025-06-09Regular Papers
Abstract：Artificial neural networks (ANNs) have made great strides in the field of remote sensing image object detection. However, low detection efficiency and high power consumption have always been significant bottlenecks in remote sensing. Spiking neural networks (SNNs) process information in the form of sparse spikes, creating the advantage of high energy efficiency for computer vision tasks. However, most studies have focused on simple classification tasks, and only a few researchers have applied SNNs to object detection in natural images. In this study, we consider the parsimonious nature of biological brains and propose a fast ANN-to-SNN conversion method for remote sensing image detection. We establish a fast sparse model for pulse sequence perception based on group sparse features and conduct transform-domain sparse resampling of the original images to enable fast perception of image features and encoded pulse sequences. In addition, to meet accuracy requirements in relevant remote sensing scenarios, we theoretically analyze the transformation error and propose channel self-decaying weighted normalization (CSWN) to eliminate neuron overactivation. We propose S3Det, a remote sensing image object detection model. Our experiments, based on a large publicly available remote sensing dataset, show that S3Det achieves an accuracy performance similar to that of the ANN. Meanwhile, our transformed network is only 24.32% as sparse as the benchmark and consumes only 1.46 W, which is 1/122 of the original algorithm’s power consumption.Keywords：Remote sensing image;Object detection;Spiking neural networks (SNNs);Spiking sequence rapid sensing (SSRS);Channel self-decaying weighted normalization (CSWN)24|14|0Updated：2025-06-09Regular Papers
Abstract：To enhance information security during transmission over public channels, images are frequently employed for binary data hiding. Nonetheless, data are vulnerable to distortion due to Joint Photographic Experts Group (JPEG) compression, leading to challenges in recovering the original binary data. Addressing this issue, this paper introduces a pioneering method for binary data hiding that leverages a combined spatial and channel attention Transformer, termed SCFformer, to withstand JPEG compression. This method employs a novel discrete cosine transform (DCT) quantization truncation mechanism during the hiding phase to bolster the stego image’s resistance to JPEG compression, using spatial and channel attention to conceal information in less perceptible areas, thereby enhancing the model’s resistance to steganalysis. In the extraction phase, the DCT quantization minimizes secret image loss during compression, facilitating easier information retrieval. The incorporation of scalable modules adds flexibility, allowing for variable-capacity data hiding. Experimental findings validate the high security, large capacity, and high flexibility of our scheme, alongside a marked improvement in binary data recovery post-JPEG compression, underscoring our method’s leading-edge performance.Keywords：Binary data hiding;Against JPEG compression;Discrete cosine transform quantization;SCFformer25|6|0Updated：2025-06-09Regular Papers
Abstract：To solve the privacy leakage and identity island problems in cross-chain interaction, we propose an anti-quantum cross-chain identity authentication approach based on dynamic group signature (DGS-AQCCIDAA) for smart education. The relay-based cross-chain model promotes interconnection in heterogeneous consortium blockchains. DGS is used as the endorsement strategy for cross-chain identity authentication. Our approach can ensure quantum security under the learning with error (LWE) and inhomogeneous small integer solution (ISIS) assumptions, and it uses non-interactive zero-knowledge proof (NIZKP) to protect user identity privacy. Our scheme has low calculation overhead and provides anonymous cross-chain identity authentication in the smart education system.Keywords：Cross-chain27|10|0Updated：2025-06-09Regular Papers
Abstract：A federated fusion algorithm of joint multi-Gaussian mixture multi-Bernoulli (JMGM-MB) filters is proposed to achieve optimal fusion tracking of multiple uncertain maneuvering targets in a hierarchical structure. The JMGM-MB filter achieves a higher level of accuracy than the multi-model Gaussian mixture MB (MM-GM-MB) filter by propagating the state density of each potential target in the interactive multi-model (IMM) filtering manner. Within the hierarchical structure, each sensor node performs a local JMGM-MB filter to capture survival, newborn, and vanishing targets. A notable characteristic of our algorithm is a master filter running on the fusion node, which can help identify the origins of state estimates and supplement missed detections. The outputs of all filters are associated into multiple groups of single-target estimates. We rigorously derive the optimal fusion of IMM filters and apply it to merge associated single-target estimates. This optimality is guaranteed by the covariance upper-bounding technique, which can truly eliminate correlations among filters. Simulation results demonstrate that the proposed algorithm outperforms the existing centralized and distributed fusion algorithms in linear and heterogeneous scenarios, and the relative weights of the master and local filters can be adjusted flexibly.Keywords：Uncertain maneuvering targets;Joint multi-Gaussian mixture multi-Bernoulli (JMGM-MB) filter;Hierarchical structure;Optimal fusion;Correlations27|9|0Updated：2025-06-09
SEE MORE
0 1 Hybrid-augmented intelligence: collaboration and cognition
0 3 Applications of artificial intelligence in intelligent manufacturing: a review*
0 5 Challenges and opportunities: from big data to knowledge in AI 2.0
0 6 Recent advances in efficient computation of deep convolutional neural networks
0 7 Terahertz time-domain spectroscopy and micro-cavity components for probing samples: a review
0 8 Cross-media analysis and reasoning: advances and directions
0 9 Current trends in the development of intelligent unmanned autonomous systems
SEE MORE
Videos
-
00:02:512023 Issue 1 | Scalability and efficiency challenges for the exascale supercomputing system: practice of a parallel supporting environment on the Sunway exascale prototype system
2023-12-30Play Total： 22 - 00:02:30
2023 Issue 6 | Model division multiple access for semantic communications
2023-12-30Play Total： 11 - 00:02:15
2022 Issue 10 | Discussion on a new paradigm of endogenous security towards 6G networks
2023-12-30Play Total： 0 - 00:02:22
2022 Issue 12 | Technology trends in large-scale high-efficiency network computing
2023-12-30Play Total： 2 - 00:02:48
2022 Issue 6 | Self-deployed execution environment for high performance computing
2022-08-03Play Total： 7 - 00:02:24
2022 Issue 2 | A full-process intelligent trial system for smart court
2022-05-17Play Total： 7 - 00:02:37
2022 Issue 3 | Automatic protocol reverse engineering for industrial control systems with dynamic taint analysis
2022-05-17Play Total： 4 - 00:05:36
P1 Speech by Academician Baoyan Duan
2022-04-17Play Total： 9 - 00:02:27
P2 Speech by Professor Min Sheng, Xidian University
2022-04-17Play Total： 6 - 00:02:37
P3 Speech by Professor Yunsong Li, Xidian University
2022-04-17Play Total： 10
SEE MORE
- Address：Zhejiang University Press, 148 Tianmushan Road, Hangzhou, China Postal code：310028
- Tel：+86-571-88273162 Email：fitee@zju.edu.cn
- Copyright © 2000 - 2025, Zhejiang University Press 京ICP备09064830号-19
京公网安备11010802024621 - It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
- Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
0