{"title":"Design, Realization, and Evaluation of FastDIM to Prevent Memory Corruption Attacks","authors":"Jian Huang;Yanbo Li;Hao Han","doi":"10.23919/cje.2024.00.218","DOIUrl":"https://doi.org/10.23919/cje.2024.00.218","url":null,"abstract":"Software vulnerabilities, particularly memory corruption, are significant sources of security breaches. Traditional security measures like data-execution prevention, address space layout randomization, control-flow integrity, code-pointer integrity/separation, and data-flow integrity provide insufficient protection or lead to considerable performance degradation. This research introduces, develops, and scrutinizes FastDIM, a novel approach designed to safeguarding user applications from memory corruption threats. FastDIM encompasses an low-level virtual machine (LLVM) instrumentation mechanism and a distinct memory monitoring module. This system modifies applications in user space into a more secure variant, proactively reporting vital memory operations to a memory monitoring component within the kernel to ensure data integrity. Distinctive features of FastDIM compared to prior methodologies are twofold: FastDIM's integrated out-of-band monitoring system that secures both control-flow and non-control data within program memory, and the creation of a dedicated shared memory space to enhance monitoring efficiency. Testing a prototype of FastDIM with a broad spectrum of real-life applications and standard benchmarks indicates that FastDIM's runtime overhead is acceptable, at 4.4% for the SPEC CPU 2017 benchmarks, while providing the defense against memory corruption attacks.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1233-1246"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151235","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Novel Deterministic Secure Semi-Quantum Communication Based on GHZ-State Entanglement Compression Technology","authors":"Xiao-Xue Zhang;Ri-Gui Zhou;Wen-Shan Xu","doi":"10.23919/cje.2024.00.256","DOIUrl":"https://doi.org/10.23919/cje.2024.00.256","url":null,"abstract":"Semi-quantum communication, serving as transitional technology between quantum communication and classical communication, bridges fully quantum-capable users with “classical” users who have limited quantum capabilities. It provides practical solution for application scenarios that struggle to bear high costs of quantum resources. This paper designs a novel deterministic secure semi-quantum communication protocol that significantly enhances communication efficiency by utilizing Greenberger-Horne-Zeilinger (GHZ) states for entanglement compression. The protocol consists of two core components: eavesdropping detection mechanism and transmission process for compressed and encrypted information sequences. During the eavesdropping detection phase, the protocol incorporates decoy photon technology to effectively expose and prevent potential eavesdropping attempts. In the secret information transmission phase, the protocol combines the advantages of a pseudo-random number generator driven by one-way hash function and GHZ-state-based entanglement compression technology to randomly rearrange and compress-encrypt the secret information, ensuring its high security and integrity during transmission. Ultimately, the receiver can accurately decrypt and restore the original secret information using a pre-agreed key. The protocol not only successfully integrates multiple advanced technologies to resist various attacks and ensure the absolute secure transmission of secret information, but also provides strong support for practical applications with its communication efficiency of up to 50% and high practicality.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1172-1184"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151174","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bosong Huang;Weiting Zhang;Ruibin Guo;Nian Tang;Wenhao Ye;Jian Jin
{"title":"Industrial Deterministic Computation and Networking Resource Scheduling via Deep Reinforcement Learning","authors":"Bosong Huang;Weiting Zhang;Ruibin Guo;Nian Tang;Wenhao Ye;Jian Jin","doi":"10.23919/cje.2024.00.014","DOIUrl":"https://doi.org/10.23919/cje.2024.00.014","url":null,"abstract":"In this paper, a dueling double deep Q network (D3QN)-based resource scheduling algorithm is proposed for industrial Internet of things (IoT) to achieve the flexible adaptation of network resources. In the considered network scenario, the time-sensitive networking (TSN)-fifth generation (TSN-5G) network architecture, primarily composed of TSN switches and 5G base stations, is designed accordingly. Simulation results show that when network resources are limited, the D3QN-based resource scheduling algorithm can significantly improve the efficiency of task allocation, making it an ideal solution for reducing latency and optimizing resource utilization in industrial IoT.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1275-1283"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151185","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning Robust Adaptive Bitrate Algorithms with Adversarial Inverse Reinforcement Learning","authors":"Ling Yi;Yongbin Qin","doi":"10.23919/cje.2024.00.202","DOIUrl":"https://doi.org/10.23919/cje.2024.00.202","url":null,"abstract":"Adaptive bitrate (ABR) algorithms are crucial for video streaming services by dynamically adjusting video bitrate based on current network conditions to ensure better quality of experience (QoE). However, traditional ABR algorithms often face challenges in adapting to diverse network environments and fail to fully utilize expert knowledge. In this study, we propose a novel approach using adversarial inverse reinforcement learning (AIRL) to learn ABR algorithms. Unlike traditional methods, AIRL can effectively leverage expert demonstrations to learn robust reward functions and generate stable ABR policies. Simultaneously, the learned ABR policy adjusts based on the updated reward function, aiming to closely emulate the video bitrate decision-making behavior of experts. Moreover, by decoupling the reward function, we can develop a more robust ABR strategy that can effectively adapt video bitrates to significant fluctuations in network conditions, while also optimizing different video QoE objectives. We conducted experiments across various network conditions, demonstrating that the proposed method exhibits stable and superior performance.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1309-1320"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151225","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xin Zhang;Haoyang Zhang;Ruizhe Yang;Lilin Li;Donglin Su
{"title":"GPU-Accelerated MEDO Algorithm with Differential Grouping (DG-GMEDO) for High-Dimensional Electromagnetic Optimization Problems","authors":"Xin Zhang;Haoyang Zhang;Ruizhe Yang;Lilin Li;Donglin Su","doi":"10.23919/cje.2024.00.228","DOIUrl":"https://doi.org/10.23919/cje.2024.00.228","url":null,"abstract":"High-dimensional electromagnetic optimization problems, such as array antenna design, pose significant challenges due to their complexity and high dimensionality. The Maxwell's equations derived optimization (MEDO) algorithm, a novel optimization method with strong performance in electromagnetics, experiences a decline in efficiency as the problem dimensionality increases. To address these challenges, graphics processing unit (GPU)-accelerated MEDO algorithm with differential grouping (DG-GMEDO) is proposed in this paper, which builds on the MEDO algorithm through the integration of an enhanced differential grouping strategy and GPU-based parallel acceleration. This approach allows for more effective management of variable interactions while leveraging high computational speeds. Comparative evaluations with traditional algorithms like particle swarm optimization and genetic algorithm, as well as state-of-the-art methods such as MAES2-EDG, GTDE, RCI-PSO, and CCFR2-IRRG, highlight its competitive performance in terms of both accuracy and efficiency. Furthermore, DG-GMEDO demonstrates significant runtime acceleration and achieves promising results in high-dimensional settings, as validated through its application in array antenna radiation patterns optimization.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1052-1063"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151224","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Representative OSD with Local Constraints of CA-Polar Codes","authors":"Yiwen Wang;Qianfan Wang;Jifan Liang;Xiao Ma","doi":"10.23919/cje.2024.00.220","DOIUrl":"https://doi.org/10.23919/cje.2024.00.220","url":null,"abstract":"In this paper, we propose an algorithm to transform a generator matrix of a linear block code into a minimum weight staircase generator matrix (MWSGM). This allows us to apply the representative ordered statistics decoding with local constraints (LC-ROSD) algorithm to cyclic redundancy check (CRC) aided polar (CA-polar) codes. Distinguished from the conventional ordered statistics decoding (OSD), the LC-ROSD implements parallel Gaussian elimination (GE) for MWSGM instead of serial GE for a general matrix, potentially reducing the decoding latency. Numerical results show that the performance of 5G CA-polar codes under LC-ROSD is better than that of CRC aided successive cancellation list (CA-SCL) decoding and can approach the corresponding maximum likelihood (ML) lower bounds at different code rates. The numerical results also show that the LC-ROSD with MWSGM has lower decoding complexity than the CA-SCL decoding in the high signal-to-noise ratio (SNR) region.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1111-1119"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151187","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Bandpass Filtering Switch with Reconfigurable Notched Band","authors":"Li Chen;Wenjie Feng;Wenquan Che;Quan Xue","doi":"10.23919/cje.2024.00.261","DOIUrl":"https://doi.org/10.23919/cje.2024.00.261","url":null,"abstract":"In this paper, a novel filtering switch with three operating states is proposed. The proposed structure consists of two coupling paths, a multi-mode bandpass filter, and an E-shaped notched band structure. A new transmission zero can be introduced through the source load coupling structure. Positive-intrinsic-negative (PIN) diodes are loaded at both ends of the branches of the multi-mode resonator and the branches of the notched band structure to switch different operating modes. The measured results show that the dual-band bandpass filter mode is centered at 2.35/3.23 GHz with 3-dB fractional bandwidth (FBW) of 10.20%/19.8%, and the minimal insertion isolation within the passband of 1.8/1.28 dB. The single-band bandpass filter mode is centered at 2.9 GHz, and the insertion loss is lower than 2.3 dB with FBW of 46.9%. The all-stop filter mode has an attenuation better than 27 dB from 1 GHz to 7 GHz. Simulated results and measured results show good agreement.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1091-1099"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151247","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Min Liu;Xiaoping Fan;Guiyun Liu;Dewei Liao;Junjie Yu;Jiale Huang
{"title":"An Epidemic Model with Two Impulses for the Propagation of Malware in Heterogeneous Wireless Sensor Networks","authors":"Min Liu;Xiaoping Fan;Guiyun Liu;Dewei Liao;Junjie Yu;Jiale Huang","doi":"10.23919/cje.2025.00.016","DOIUrl":"https://doi.org/10.23919/cje.2025.00.016","url":null,"abstract":"This paper focuses on enhancing the security of wireless sensor networks and analyzing the propagation of malware among nodes. It investigates an impulse susceptible-infectious-recovered (SILR-P, susceptible, infected, low-energy, recovered with impulses) model considering different communication connectivities. By using the next generation matrix, a threshold parameter similar to the basic reproduction number is derived. Combining this threshold parameter, the global stability of disease-free periodic solutions is examined. Additionally, the persistence of malware propagation is verified. To curb the spread of malware, an optimal control strategy based on the Pontryagin maximum principle is proposed. In numerical simulations, the impact of cross infection on malware propagation is specifically considered. Finally, partial rank correlation coefficients are utilized for sensitivity analysis of the proposed threshold parameter.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1357-1374"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151236","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New Constructions of Binary Cross Z-Complementary Sequence Sets Based on Boolean Functions for Training in Generalized Spatial Modulation","authors":"Chunlei Xie;Yu Sun;Liupiao Zhang;Hui Ge","doi":"10.23919/cje.2024.00.303","DOIUrl":"https://doi.org/10.23919/cje.2024.00.303","url":null,"abstract":"This paper introduces a novel kind of cross Z-complementary sequence sets, characterized by zero correlation zones at both the front-end and tail-end shifts in their aperiodic correlation sums. Initially, we propose a direct approach to constructing mutually orthogonal complementary sequence sets through the Boolean functions. Subsequently, we present a direct construction of cross Z-complementary sequence sets featuring large set sizes and flexible lengths based on Boolean functions. These sequence sets hold potential applications in the design of training sequences for broadband generalized spatial modulation (GSM) systems operating over frequency-selective channels.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1146-1155"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151176","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DTI-GNet: Dynamic Topology Inferenced Graph Convolution Network for Dance Action Recognition","authors":"Honghong Yang;Sai Wang;Lu Jiang;Yumei Zhang;Xiaojun Wu","doi":"10.23919/cje.2024.00.184","DOIUrl":"https://doi.org/10.23919/cje.2024.00.184","url":null,"abstract":"As an extension of human action recognition, dance action recognition has been a significant research area with potential applications in dance education, entertainment, artistic protection, and cultural heritage preservation. However, the current human action recognition methods face challenges in capturing rich geometric and physical characteristics of dance actions due to their diversity, high complexity, and individual variation in execution. In this paper, a dynamic topology inferenced graph convolution network (DTI-GNet) is proposed for dance action recognition. First, a bone-joint features embedding encoding module is devised to infer the geometric and physical characteristics hidden in spatial structures and temporal dynamics during action performance, aiming to capture action-specific bone-joint dependencies. Second, a spatial-temporal dynamic topological encoding module is specifically designed to exploit joint-bone geometric and physical properties, relaxing the restrictions of the fixed topology and overcoming oversmoothing problems encountered by stracked graph convolution layer with rigid topology. Finally, a dynamic topology inferenced spatial-temporal graph convolution layer is developed as a fundamental unit to construct DTI-GNet, exploring the co-occurrence features and inter-dependencies between joints. Experimental results on two dance action datasets, MSDanceAction and InDanceAction, demonstrate the superiority of the proposed method for dance action recognition.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 4","pages":"1284-1299"},"PeriodicalIF":3.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11151181","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144990313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}