Pub Date : 2025-03-01DOI: 10.23919/cje.2024.00.032
Chan Song;Wenling Wu;Lei Zhang
Rocca is an Advanced Encryption Standard (AES)-based authentication encryption scheme proposed in 2021 for beyond the fifth/sixth generation systems. The latest version of Rocca injects the key into the initialization, which makes the key recovery attack on its original version no longer valid here. In this paper, we propose new key recovery attacks based on the idea of meet-in-the-middle. Benefiting from the design of the round function, we can treat each 128-bit block as a unit and then write the expressions of the internal states in terms of the initial state and the final state, respectively. Among them, we focus on the state blocks with relatively concise expressions, which have poor diffusion, and then explore their differential and integral properties. Next, in the key recovery attacks, we first guess a part of the key to calculate the specific values of state blocks at the middle matching positions, and then use the differential or integral properties on these blocks to validate the key guesses. Uniquely, in our integral crypt-analysis, we impose appropriate conditions to constrain the propagation of nonce, which corresponds to the weak keys. Consequently, we present the 9 and 10 rounds of meet-in-the-middle key recovery attacks on Rocca, as well as the weak key recovery attack for the 11-round Rocca based on integral properties, with four sets of weak keys with 2224 keys each.
{"title":"Meet-in-the-Middle Key Recovery Attacks on Rocca Using Differential and Integral Properties","authors":"Chan Song;Wenling Wu;Lei Zhang","doi":"10.23919/cje.2024.00.032","DOIUrl":"https://doi.org/10.23919/cje.2024.00.032","url":null,"abstract":"Rocca is an Advanced Encryption Standard (AES)-based authentication encryption scheme proposed in 2021 for beyond the fifth/sixth generation systems. The latest version of Rocca injects the key into the initialization, which makes the key recovery attack on its original version no longer valid here. In this paper, we propose new key recovery attacks based on the idea of meet-in-the-middle. Benefiting from the design of the round function, we can treat each 128-bit block as a unit and then write the expressions of the internal states in terms of the initial state and the final state, respectively. Among them, we focus on the state blocks with relatively concise expressions, which have poor diffusion, and then explore their differential and integral properties. Next, in the key recovery attacks, we first guess a part of the key to calculate the specific values of state blocks at the middle matching positions, and then use the differential or integral properties on these blocks to validate the key guesses. Uniquely, in our integral crypt-analysis, we impose appropriate conditions to constrain the propagation of nonce, which corresponds to the weak keys. Consequently, we present the 9 and 10 rounds of meet-in-the-middle key recovery attacks on Rocca, as well as the weak key recovery attack for the 11-round Rocca based on integral properties, with four sets of weak keys with 2<sup>224</sup> keys each.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 3","pages":"828-838"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11060049","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519341","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.229
Yuxin Shi;Xinjin Lu;Yifu Sun;Kang An;Yusheng Li
Jamming identification is the key objective behind effective anti-jamming methods. Due to the requirement of low-complexity and the limited number of labeled shots for real jamming identification, it is highly challenging to identify jamming patterns with high accuracy. To this end, we first propose a general framework of cooperative jamming identification among multiple nodes. Moreover, we further propose a novel fusion center (FC) aided self-learning scheme, which uses the guidance of the FC to improve the effectiveness of the identification. Simulation results show that the proposed framework of the cooperative jamming identification can significantly enhance the average accuracy with low-complexity. It is also demonstrated that the proposed FC aided self-learning scheme has the superior average accuracy compared with other identification schemes, which is very effective especially in the few labeled jamming shots scenarios.
{"title":"Cooperative Self-Learning: A Framework for Few-Shot Jamming Identification","authors":"Yuxin Shi;Xinjin Lu;Yifu Sun;Kang An;Yusheng Li","doi":"10.23919/cje.2023.00.229","DOIUrl":"https://doi.org/10.23919/cje.2023.00.229","url":null,"abstract":"Jamming identification is the key objective behind effective anti-jamming methods. Due to the requirement of low-complexity and the limited number of labeled shots for real jamming identification, it is highly challenging to identify jamming patterns with high accuracy. To this end, we first propose a general framework of cooperative jamming identification among multiple nodes. Moreover, we further propose a novel fusion center (FC) aided self-learning scheme, which uses the guidance of the FC to improve the effectiveness of the identification. Simulation results show that the proposed framework of the cooperative jamming identification can significantly enhance the average accuracy with low-complexity. It is also demonstrated that the proposed FC aided self-learning scheme has the superior average accuracy compared with other identification schemes, which is very effective especially in the few labeled jamming shots scenarios.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 2","pages":"722-729"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10982100","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900615","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.222
Qianwen Liu;Lei Zhu;Wenjun Lu
This article presents and develops a simple decoupling method for the planar square patch antenna arrays by virtue of mixed electric and magnetic coupling property. Since the resonant modes of TM10 and TM01 are a pair of degenerate modes in the square patch radiator which are intrinsically orthogonal, a superposed mode of them can be generated to possess consistent field distributions along all the four sides of the patch by adjusting the feeding position. By employing such superposed mode, the mutual coupling between two horizontally adjacent patch elements will become identical to that between two vertical ones, indicating an expected possibility that the complex 2-D decoupling problem in a large-scale antenna patch array can be effectively facilitated and simplified to a 1-D one. Subsequently, metallic pins and connecting strip are properly loaded in each square patch resonator, such that appropriate electric and magnetic coupling strengths can be readily achieved and thus the mutual coupling can get highly decreased. A 1 × 2 antenna array with an edge-to-edge separation of 1 mm, which corresponding to 0.0117λo, is firstly discussed, simulated, and fabricated. The measured results show that the isolation can be highly improved from 4 dB to 17 dB across the entire passband. In final, 1 × 3, 2 × 2, and 4 × 4 antenna array prototypes are constructed and studied for verification of the expansibility and feasibility of the proposed decoupling method to both linear and 2-D antenna arrays.
{"title":"Self-Decoupled Square Patch Antenna Arrays by Exciting and Using Mixed Electric/Magnetic Coupling Between Adjacent Radiators","authors":"Qianwen Liu;Lei Zhu;Wenjun Lu","doi":"10.23919/cje.2023.00.222","DOIUrl":"https://doi.org/10.23919/cje.2023.00.222","url":null,"abstract":"This article presents and develops a simple decoupling method for the planar square patch antenna arrays by virtue of mixed electric and magnetic coupling property. Since the resonant modes of TM<inf>10</inf> and TM<inf>01</inf> are a pair of degenerate modes in the square patch radiator which are intrinsically orthogonal, a superposed mode of them can be generated to possess consistent field distributions along all the four sides of the patch by adjusting the feeding position. By employing such superposed mode, the mutual coupling between two horizontally adjacent patch elements will become identical to that between two vertical ones, indicating an expected possibility that the complex 2-D decoupling problem in a large-scale antenna patch array can be effectively facilitated and simplified to a 1-D one. Subsequently, metallic pins and connecting strip are properly loaded in each square patch resonator, such that appropriate electric and magnetic coupling strengths can be readily achieved and thus the mutual coupling can get highly decreased. A 1 × 2 antenna array with an edge-to-edge separation of 1 mm, which corresponding to 0.0117λ<inf>o</inf>, is firstly discussed, simulated, and fabricated. The measured results show that the isolation can be highly improved from 4 dB to 17 dB across the entire passband. In final, 1 × 3, 2 × 2, and 4 × 4 antenna array prototypes are constructed and studied for verification of the expansibility and feasibility of the proposed decoupling method to both linear and 2-D antenna arrays.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 2","pages":"483-494"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10982048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900627","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}
Network switches are critical elements in any network infrastructure for traffic forwarding and packet priority scheduling, which naturally become a target of network adversaries. Most attacks on switches focus on purposely forwarding packets to the wrong network nodes or generating flooding. However, potential privacy leakage in the multi-level priority queue of switches has not been considered. In this paper, we are the first to discuss the multi-level priority queue security and privacy protection problem in switches. Observing that packet leaving order from a queue is strongly correlated to its priority, we introduce a policy inference attack that exploits specific priority-mapping rules between different packet priorities and priority sub-queues in the multi-level queues. Next, based on the policy inference result and the built-in traffic shaping strategy, a capacity inference attack with the error probability decaying exponentially in the number of attacks is presented. In addition, we propose a differentially private priority scheduling mechanism to defend against the above attacks in OpenFlow switches. Theoretical analysis proves that our proposed mechanism can satisfy ε-differential privacy. Extensive evaluation results show that our mechanism can defend against inference attacks well and achieves up to 2.7 times priority process efficiency than a random priority scheduling strategy.
{"title":"Multi-Level Queue Security in Switches: Adversarial Inference and Differential Privacy Protection in SDN","authors":"Xuewen Dong;Lingtao Xue;Tao Zhang;Zhichao You;Guangxia Li;Yulong Shen","doi":"10.23919/cje.2022.00.373","DOIUrl":"https://doi.org/10.23919/cje.2022.00.373","url":null,"abstract":"Network switches are critical elements in any network infrastructure for traffic forwarding and packet priority scheduling, which naturally become a target of network adversaries. Most attacks on switches focus on purposely forwarding packets to the wrong network nodes or generating flooding. However, potential privacy leakage in the multi-level priority queue of switches has not been considered. In this paper, we are the first to discuss the multi-level priority queue security and privacy protection problem in switches. Observing that packet leaving order from a queue is strongly correlated to its priority, we introduce a policy inference attack that exploits specific priority-mapping rules between different packet priorities and priority sub-queues in the multi-level queues. Next, based on the policy inference result and the built-in traffic shaping strategy, a capacity inference attack with the error probability decaying exponentially in the number of attacks is presented. In addition, we propose a differentially private priority scheduling mechanism to defend against the above attacks in OpenFlow switches. Theoretical analysis proves that our proposed mechanism can satisfy ε-differential privacy. Extensive evaluation results show that our mechanism can defend against inference attacks well and achieves up to 2.7 times priority process efficiency than a random priority scheduling strategy.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 2","pages":"533-547"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10982054","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900643","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.406
Xiang Li;Hao Zhang;Xuhui Yu;Wei Liu
Global navigation satellite systems (GNSSs) have been proven to be susceptible to spoofing signals, presenting a significant threat to the security and stability of nations and societies. Signal quality monitoring (SQM) can be utilized to identify spoofing attacks on GNSS signals. However, traditional SQM metrics exhibit inadequate responsiveness and resolution in detecting spoofing signals, and further the multi-correlator technology based on the traditional SQM metrics needs too high computation cost and still ignores abnormal power problem in the spoofing process. To address these issues, this paper proposed a novel spoofing detection method based on reliability theory for assessing the reliability of GNSS signals. A third-order central moment of GNSS signal correlation peak outputs is selected as the characteristic state equation, and then the reliability metric of GNSS signals is calculated by using the mathematical expectations and standard deviations of the characteristic state equation so as to determine the degree of distortion. After the intermediate spoofing interference dataset of Texas Spoofing Test Battery (TEXBAT) is analyzed experimentally, the proposed reliability metric is demonstrated to detect the presence of spoofing interference more rapidly, thereby mitigating irreversible harm. Additionally, it exhibits superior detection performance, real-time capabilities, and enhanced robustness in terms of identifying spoofing attack.
{"title":"A Robust Reliability-Centric Method for Swift Spoofing Signal Detection in Advanced GNSS Security","authors":"Xiang Li;Hao Zhang;Xuhui Yu;Wei Liu","doi":"10.23919/cje.2023.00.406","DOIUrl":"https://doi.org/10.23919/cje.2023.00.406","url":null,"abstract":"Global navigation satellite systems (GNSSs) have been proven to be susceptible to spoofing signals, presenting a significant threat to the security and stability of nations and societies. Signal quality monitoring (SQM) can be utilized to identify spoofing attacks on GNSS signals. However, traditional SQM metrics exhibit inadequate responsiveness and resolution in detecting spoofing signals, and further the multi-correlator technology based on the traditional SQM metrics needs too high computation cost and still ignores abnormal power problem in the spoofing process. To address these issues, this paper proposed a novel spoofing detection method based on reliability theory for assessing the reliability of GNSS signals. A third-order central moment of GNSS signal correlation peak outputs is selected as the characteristic state equation, and then the reliability metric of GNSS signals is calculated by using the mathematical expectations and standard deviations of the characteristic state equation so as to determine the degree of distortion. After the intermediate spoofing interference dataset of Texas Spoofing Test Battery (TEXBAT) is analyzed experimentally, the proposed reliability metric is demonstrated to detect the presence of spoofing interference more rapidly, thereby mitigating irreversible harm. Additionally, it exhibits superior detection performance, real-time capabilities, and enhanced robustness in terms of identifying spoofing attack.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 3","pages":"774-786"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11060048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519283","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.339
Yihang Zhang;Xiao Wang
The thermal protection system (TPS) is an essential component that guarantees the safe flight of high-speed spacecraft. However, the TPS is bound to suffer various level of damages during flight missions, among which the micro damages are difficult to distinguish from optical images. In this paper, we propose a novel approach to detect tiny surface damages of TPS for spacecraft by using inverse synthetic aperture radar (ISAR) imaging. To accomplish this, the procedure consists of three components: electromagnetic scattering simulation, 2-D ISAR imaging, and damage detection and identification. Different types of common TPS surface micro damages such as debonding, cracks, holes, and warpage are simulated. The obtained high-precision 2-D images prominently display the structure and morphology of micro damages. Finally, a relative entropy-based damage detection and identification method is proposed using the established damage characteristics database. The experimental results have demonstrated that by comparing the differences in the statistical characteristics between the damaged and undamaged models, the monitoring and identification of the micro damages can be successfully realized. Overall, the proposed approach offers a promising solution for monitoring the status of TPS in real time and enhancing the safety of high-speed spacecraft during flight missions.
{"title":"High-Resolution ISAR Imaging for Detection of Micro Damages on Spacecraft Thermal Protection System","authors":"Yihang Zhang;Xiao Wang","doi":"10.23919/cje.2023.00.339","DOIUrl":"https://doi.org/10.23919/cje.2023.00.339","url":null,"abstract":"The thermal protection system (TPS) is an essential component that guarantees the safe flight of high-speed spacecraft. However, the TPS is bound to suffer various level of damages during flight missions, among which the micro damages are difficult to distinguish from optical images. In this paper, we propose a novel approach to detect tiny surface damages of TPS for spacecraft by using inverse synthetic aperture radar (ISAR) imaging. To accomplish this, the procedure consists of three components: electromagnetic scattering simulation, 2-D ISAR imaging, and damage detection and identification. Different types of common TPS surface micro damages such as debonding, cracks, holes, and warpage are simulated. The obtained high-precision 2-D images prominently display the structure and morphology of micro damages. Finally, a relative entropy-based damage detection and identification method is proposed using the established damage characteristics database. The experimental results have demonstrated that by comparing the differences in the statistical characteristics between the damaged and undamaged models, the monitoring and identification of the micro damages can be successfully realized. Overall, the proposed approach offers a promising solution for monitoring the status of TPS in real time and enhancing the safety of high-speed spacecraft during flight missions.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 3","pages":"787-801"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11060054","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519340","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2024.00.086
Fan Zhang;Qiming Xu;Wei Hu;Fei Ma
The Segment Anything Model (SAM) is gaining attention for various applications due to its success in precise segmentation and zero-shot inference across diverse datasets. The image manipulation localization (IML) task, facing a lack of high-quality, diverse datasets, could benefit from SAM's strong generalization ability. However, the unique nature of the IML task presents a significant challenge: the vast distributional disparity between IML data and conventional visual task data makes it seem implausible to effectively transfer a pretrained model like SAM to this task. Models typically either forget previous knowledge or fail to adapt to IML's unique data distribution due to structural mismatches. To address this, we introduce the edge-attention SAM-adapter (EASA), which overcomes catastrophic forgetting and effectively adapts to IML's unique data distribution. Specifically, our EASA method mitigates the issue of catastrophic forgetting by employing adapter tuning strategy and designs a novel edge-attention branch effectively captures the subtle traces of edge manipulations in manipulated regions. In our experiments across six public datasets, our method significantly enhances performance in IML tasks compared to state-of-the-art methods, thus showcasing the potential of SAM in various downstream tasks previously considered challenging.
{"title":"EASA: Fine-Tuning SAM with Edge Attention and Adapters for Image Manipulation Localization","authors":"Fan Zhang;Qiming Xu;Wei Hu;Fei Ma","doi":"10.23919/cje.2024.00.086","DOIUrl":"https://doi.org/10.23919/cje.2024.00.086","url":null,"abstract":"The Segment Anything Model (SAM) is gaining attention for various applications due to its success in precise segmentation and zero-shot inference across diverse datasets. The image manipulation localization (IML) task, facing a lack of high-quality, diverse datasets, could benefit from SAM's strong generalization ability. However, the unique nature of the IML task presents a significant challenge: the vast distributional disparity between IML data and conventional visual task data makes it seem implausible to effectively transfer a pretrained model like SAM to this task. Models typically either forget previous knowledge or fail to adapt to IML's unique data distribution due to structural mismatches. To address this, we introduce the edge-attention SAM-adapter (EASA), which overcomes catastrophic forgetting and effectively adapts to IML's unique data distribution. Specifically, our EASA method mitigates the issue of catastrophic forgetting by employing adapter tuning strategy and designs a novel edge-attention branch effectively captures the subtle traces of edge manipulations in manipulated regions. In our experiments across six public datasets, our method significantly enhances performance in IML tasks compared to state-of-the-art methods, thus showcasing the potential of SAM in various downstream tasks previously considered challenging.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 3","pages":"980-989"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11060045","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519351","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.354
Jian Su;Shijie Chen
The rapidly developing Internet of things technology is gradually being utilized to monitor people's unhealthy behaviors. Sedentary behavior and wrong sitting posture are common health issues that can detrimentally impact the physical and psychological health of teenagers. An effective way to promptly rectify improper sitting postures among teenagers is to use equipment to monitor and recognize the alterations of sitting posture. The majority of conventional sitting posture recognition methods rely on cameras or sensors to recognize sitting posture. The employment of cameras will violate user's privacy, and the utilization of sensors will increase the cost of implementation. A dynamic sitting posture recognition system based on commodity off-the-shelf (COTS) radio frequency identification (RFID) devices is proposed. This system can recognize six common erroneous sitting postures by simply sticking five passive RFID tags on the user's back. We collect phase and received signal strength indicator (RSSI) data of passive RFID tags, then transform them into Doppler shift and RSSI difference data respectively, and finally input them into the established deep residual neural network for the classification of sitting postures. The experiment results show that our system achieves an average recognition accuracy of 99.17% with six sitting postures and is highly robust to different users and different usage environments.
{"title":"Dynamic Sitting Posture Recognition System Using Passive RFID Tags in Internet of Things","authors":"Jian Su;Shijie Chen","doi":"10.23919/cje.2023.00.354","DOIUrl":"https://doi.org/10.23919/cje.2023.00.354","url":null,"abstract":"The rapidly developing Internet of things technology is gradually being utilized to monitor people's unhealthy behaviors. Sedentary behavior and wrong sitting posture are common health issues that can detrimentally impact the physical and psychological health of teenagers. An effective way to promptly rectify improper sitting postures among teenagers is to use equipment to monitor and recognize the alterations of sitting posture. The majority of conventional sitting posture recognition methods rely on cameras or sensors to recognize sitting posture. The employment of cameras will violate user's privacy, and the utilization of sensors will increase the cost of implementation. A dynamic sitting posture recognition system based on commodity off-the-shelf (COTS) radio frequency identification (RFID) devices is proposed. This system can recognize six common erroneous sitting postures by simply sticking five passive RFID tags on the user's back. We collect phase and received signal strength indicator (RSSI) data of passive RFID tags, then transform them into Doppler shift and RSSI difference data respectively, and finally input them into the established deep residual neural network for the classification of sitting postures. The experiment results show that our system achieves an average recognition accuracy of 99.17% with six sitting postures and is highly robust to different users and different usage environments.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 2","pages":"586-599"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10982073","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900508","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.044
Yana Lyu;Xutong Qin;Xiuli Du;Niujie Zhao;Shaoming Qiu
Multi-hop question answering over knowledge graph (KGQA) aims to find the answer entities that are multiple hops away from the entities in the question called seed entities in the knowledge graph. The main methods include rule and template based methods and deep learning based methods. At present, deep learning based methods is in the mainstream, with the advantages of good portability and high utilization of knowledge graph information. A significant challenge is the lack of information on intermediate entities along the reasoning path. However, most deep learning models are unable to learn the correct reasoning path. To address this challenge, we propose a multi-path reasoning model, which selects the correct reasoning path by constraining the consistency of multiple paths from the seed entity to the answer entity. Then, a teacher-student network is adopted for model compression, where the teacher model relies on the proposed multi-path reasoning model. To demonstrate our model's effectiveness on the KGQA task, we compared our model with four baselines on two benchmark datasets. The experimental results revealed that the Hits@1 values of the model reached 77.8% and 60.2% on WebQuestionsSP and Complex WebQuestions 1.1 datasets, respectively.
{"title":"Multi-Path Reasoning for Multi-Hop Question Answering over Knowledge Graph","authors":"Yana Lyu;Xutong Qin;Xiuli Du;Niujie Zhao;Shaoming Qiu","doi":"10.23919/cje.2023.00.044","DOIUrl":"https://doi.org/10.23919/cje.2023.00.044","url":null,"abstract":"Multi-hop question answering over knowledge graph (KGQA) aims to find the answer entities that are multiple hops away from the entities in the question called seed entities in the knowledge graph. The main methods include rule and template based methods and deep learning based methods. At present, deep learning based methods is in the mainstream, with the advantages of good portability and high utilization of knowledge graph information. A significant challenge is the lack of information on intermediate entities along the reasoning path. However, most deep learning models are unable to learn the correct reasoning path. To address this challenge, we propose a multi-path reasoning model, which selects the correct reasoning path by constraining the consistency of multiple paths from the seed entity to the answer entity. Then, a teacher-student network is adopted for model compression, where the teacher model relies on the proposed multi-path reasoning model. To demonstrate our model's effectiveness on the KGQA task, we compared our model with four baselines on two benchmark datasets. The experimental results revealed that the Hits@1 values of the model reached 77.8% and 60.2% on WebQuestionsSP and Complex WebQuestions 1.1 datasets, respectively.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 2","pages":"642-648"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10982074","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900564","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}
Pub Date : 2025-03-01DOI: 10.23919/cje.2023.00.313
Ao Xiong;Wang Zhang;Yu Song;Dong Wang;Da Li;Qinglei Guo;Desheng Bai
Blockchain technology has broad application prospects in many fields due to its unique characteristics such as decentralization, traceability, and tamper-proofing, and has become a research hotspot in recent years. As a key component of blockchain technology, the consensus algorithm is one of the important factors affecting blockchain performance. Many consensus algorithms currently used in consortium chains are based on timing assumptions and lack horizontal scalability. That is to say, these algorithms cannot reach an agreement in an asynchronous network where the receiving time of network packets is uncertain, and their efficiency decreases as the number of nodes increases, which hinders the large-scale application of the consortium chain. In order to solve the above problems, this paper proposes the dynamic sharding Dumbo (DS-Dumbo) algorithm, an asynchronous consensus algorithm that integrates dynamic sharding strategies, based on the currently excellent Dumbo Byzantine fault tolerance (DumboBFT) asynchronous consensus algorithm. The main work of this paper revolves around how to fragment and optimize the consensus process. This paper designs a node asynchronous sharding model based on multi-dimensional weights, so that the re-sharding work of each blockchain node can be executed concurrently with the asynchronous consensus algorithm, reducing the conflict between blockchain sharding and asynchronous consensus algorithms. We also designed an intelligent transaction placement strategy, which calculates the relevance score of each transaction for all shards to determine which shard the transaction is processed in order to reduce the number of complex cross-shard transactions. We optimized the execution process of the DumboBFT algorithm, converted its internal synchronous working mode to an asynchronous working mode, and reduced the consumption of consensus work to a certain extent. The experimental evaluation shows that the DS-Dumbo algorithm has higher throughput and lower delay than the DumboBFT algorithm, can increase the throughput with the increase of nodes, and has the ability of horizontal expansion.
{"title":"Asynchronous Consensus Algorithm Integrating Dynamic Weight Sharding Strategy","authors":"Ao Xiong;Wang Zhang;Yu Song;Dong Wang;Da Li;Qinglei Guo;Desheng Bai","doi":"10.23919/cje.2023.00.313","DOIUrl":"https://doi.org/10.23919/cje.2023.00.313","url":null,"abstract":"Blockchain technology has broad application prospects in many fields due to its unique characteristics such as decentralization, traceability, and tamper-proofing, and has become a research hotspot in recent years. As a key component of blockchain technology, the consensus algorithm is one of the important factors affecting blockchain performance. Many consensus algorithms currently used in consortium chains are based on timing assumptions and lack horizontal scalability. That is to say, these algorithms cannot reach an agreement in an asynchronous network where the receiving time of network packets is uncertain, and their efficiency decreases as the number of nodes increases, which hinders the large-scale application of the consortium chain. In order to solve the above problems, this paper proposes the dynamic sharding Dumbo (DS-Dumbo) algorithm, an asynchronous consensus algorithm that integrates dynamic sharding strategies, based on the currently excellent Dumbo Byzantine fault tolerance (DumboBFT) asynchronous consensus algorithm. The main work of this paper revolves around how to fragment and optimize the consensus process. This paper designs a node asynchronous sharding model based on multi-dimensional weights, so that the re-sharding work of each blockchain node can be executed concurrently with the asynchronous consensus algorithm, reducing the conflict between blockchain sharding and asynchronous consensus algorithms. We also designed an intelligent transaction placement strategy, which calculates the relevance score of each transaction for all shards to determine which shard the transaction is processed in order to reduce the number of complex cross-shard transactions. We optimized the execution process of the DumboBFT algorithm, converted its internal synchronous working mode to an asynchronous working mode, and reduced the consumption of consensus work to a certain extent. The experimental evaluation shows that the DS-Dumbo algorithm has higher throughput and lower delay than the DumboBFT algorithm, can increase the throughput with the increase of nodes, and has the ability of horizontal expansion.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 2","pages":"600-611"},"PeriodicalIF":1.6,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10982076","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900601","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：