Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.089
Yangzhe Liao;Lin Liu;Yuanyan Song;Ning Xu
Joint communication-caching-computing resource allocation in wireless inland waterway communications enables resource-constrained unmanned surface vehicles (USVs) to provision computation-intensive and latencysensitive tasks forward beyond fifth-generation (B5G) and sixth-generation (6G) era. The power of such resource allocation cannot be fully studied unless bidirectional data computation is properly managed. A novel intelligent reflecting surface (IRS)-assisted hybrid UAV-terrestrial network architecture is proposed with bidirectional tasks. The sum of uplink and downlink bandwidth minimization problem is formulated by jointly considering link quality, task execution mode selection, UAVs trajectory, and task execution latency constraints. A heuristic algorithm is proposed to solve the formulated challenging problem. We divide the original challenging problem into two subproblems, i.e., the joint optimization problem of USVs offloading decision, caching decision and task execution mode selection, and the joint optimization problem of UAVs trajectory and IRS phase shift-vector design. The Karush-Kuhn-Tucker conditions are utilized to solve the first subproblem and the enhanced differential evolution algorithm is proposed to solve the latter one. The results show that the proposed solution can significantly decrease bandwidth consumption in comparison with the selected advanced algorithms. The results also prove that the sum of bandwidth can be remarkably decreased by implementing a higher number of IRS elements.
{"title":"Joint Communication-Caching-Computing Resource Allocation for Bidirectional Data Computation in IRS-Assisted Hybrid UAV-Terrestrial Network","authors":"Yangzhe Liao;Lin Liu;Yuanyan Song;Ning Xu","doi":"10.23919/cje.2023.00.089","DOIUrl":"10.23919/cje.2023.00.089","url":null,"abstract":"Joint communication-caching-computing resource allocation in wireless inland waterway communications enables resource-constrained unmanned surface vehicles (USVs) to provision computation-intensive and latencysensitive tasks forward beyond fifth-generation (B5G) and sixth-generation (6G) era. The power of such resource allocation cannot be fully studied unless bidirectional data computation is properly managed. A novel intelligent reflecting surface (IRS)-assisted hybrid UAV-terrestrial network architecture is proposed with bidirectional tasks. The sum of uplink and downlink bandwidth minimization problem is formulated by jointly considering link quality, task execution mode selection, UAVs trajectory, and task execution latency constraints. A heuristic algorithm is proposed to solve the formulated challenging problem. We divide the original challenging problem into two subproblems, i.e., the joint optimization problem of USVs offloading decision, caching decision and task execution mode selection, and the joint optimization problem of UAVs trajectory and IRS phase shift-vector design. The Karush-Kuhn-Tucker conditions are utilized to solve the first subproblem and the enhanced differential evolution algorithm is proposed to solve the latter one. The results show that the proposed solution can significantly decrease bandwidth consumption in comparison with the selected advanced algorithms. The results also prove that the sum of bandwidth can be remarkably decreased by implementing a higher number of IRS elements.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 4","pages":"1093-1103"},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606215","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141851665","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 : 2024-07-22DOI: 10.23919/cje.2023.00.264
Jiwei Huang;Fangzheng Liu;Jianbing Zhang
With the evolvement of the Internet of things (IoT), mobile edge computing (MEC) has emerged as a promising computing paradigm to support IoT data analysis and processing. In MEC for IoT, the differentiated requirements on quality of service (QoS) have been growing rapidly, making QoS a multi-dimensional concept including several attributes, such as performance, dependability, energy efficiency, and economic factors. To guarantee the QoS of IoT applications, theories and techniques of multi-dimensional QoS evaluation and optimization have become important theoretical foundations and supporting technologies for the research and application of MEC for IoT, which have attracted significant attention from both academia and industry. This paper aims to survey the existing studies on multi-dimensional QoS evaluation and optimization of MEC for IoT, and provide insights and guidance for future research in this field. This paper summarizes the multi-dimensional and multi-attribute QoS metrics in IoT scenarios, and then several QoS evaluation methods are presented. For QoS optimization, the main research problems in this field are summarized, and optimization models as well as their corresponding solutions are elaborated. We take notice of the booming of edge intelligence in artificial intelligence-empowered IoT scenarios, and illustrate the new research topics and the state-of-the-art approaches related to QoS evaluation and optimization. We discuss the challenges and future research directions.
{"title":"Multi-Dimensional QoS Evaluation and Optimization of Mobile Edge Computing for IoT: A Survey","authors":"Jiwei Huang;Fangzheng Liu;Jianbing Zhang","doi":"10.23919/cje.2023.00.264","DOIUrl":"10.23919/cje.2023.00.264","url":null,"abstract":"With the evolvement of the Internet of things (IoT), mobile edge computing (MEC) has emerged as a promising computing paradigm to support IoT data analysis and processing. In MEC for IoT, the differentiated requirements on quality of service (QoS) have been growing rapidly, making QoS a multi-dimensional concept including several attributes, such as performance, dependability, energy efficiency, and economic factors. To guarantee the QoS of IoT applications, theories and techniques of multi-dimensional QoS evaluation and optimization have become important theoretical foundations and supporting technologies for the research and application of MEC for IoT, which have attracted significant attention from both academia and industry. This paper aims to survey the existing studies on multi-dimensional QoS evaluation and optimization of MEC for IoT, and provide insights and guidance for future research in this field. This paper summarizes the multi-dimensional and multi-attribute QoS metrics in IoT scenarios, and then several QoS evaluation methods are presented. For QoS optimization, the main research problems in this field are summarized, and optimization models as well as their corresponding solutions are elaborated. We take notice of the booming of edge intelligence in artificial intelligence-empowered IoT scenarios, and illustrate the new research topics and the state-of-the-art approaches related to QoS evaluation and optimization. We discuss the challenges and future research directions.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 4","pages":"859-874"},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606193","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841012","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 : 2024-03-31DOI: 10.23919/cje.2022.00.402
Xuanhong Wang;Cong Li;Zengguo Sun;Luying Hui
With the rapid development of deep learning, generative adversarial network (GAN) has become a research hotspot in the field of computer vision. GAN has a wide range of applications in image generation. Inspired by GAN, a series of models of Chinese character font generation have been proposed in recent years. In this paper, the latest research progress of Chinese character font generation is analyzed and summarized. GAN and its development history are summarized. GAN-based methods for Chinese character font generation are clarified as well as their improvements, based on whether the specific elements of Chinese characters are considered. The public datasets used for font generation are summarized in detail, and various application scenarios of font generation are provided. The evaluation metrics of font generation are systematically summarized from both qualitative and quantitative aspects. This paper contributes to the in-depth research on Chinese character font generation and has a positive effect on the inheritance and development of Chinese culture with Chinese characters as its carrier.
随着深度学习的快速发展，生成对抗网络（GAN）已成为计算机视觉领域的研究热点。GAN 在图像生成方面有着广泛的应用。受 GAN 的启发，近年来人们提出了一系列汉字字体生成模型。本文对汉字字体生成的最新研究进展进行了分析和总结。总结了 GAN 及其发展历程。明确了基于 GAN 的汉字字库生成方法，并根据是否考虑了汉字的特定元素对其进行了改进。详细总结了用于字体生成的公共数据集，并提供了字体生成的各种应用场景。从定性和定量两个方面系统地总结了字体生成的评价指标。本文有助于汉字字库生成的深入研究，对以汉字为载体的中华文化的传承与发展具有积极作用。
{"title":"Review of GAN-Based Research on Chinese Character Font Generation","authors":"Xuanhong Wang;Cong Li;Zengguo Sun;Luying Hui","doi":"10.23919/cje.2022.00.402","DOIUrl":"https://doi.org/10.23919/cje.2022.00.402","url":null,"abstract":"With the rapid development of deep learning, generative adversarial network (GAN) has become a research hotspot in the field of computer vision. GAN has a wide range of applications in image generation. Inspired by GAN, a series of models of Chinese character font generation have been proposed in recent years. In this paper, the latest research progress of Chinese character font generation is analyzed and summarized. GAN and its development history are summarized. GAN-based methods for Chinese character font generation are clarified as well as their improvements, based on whether the specific elements of Chinese characters are considered. The public datasets used for font generation are summarized in detail, and various application scenarios of font generation are provided. The evaluation metrics of font generation are systematically summarized from both qualitative and quantitative aspects. This paper contributes to the in-depth research on Chinese character font generation and has a positive effect on the inheritance and development of Chinese culture with Chinese characters as its carrier.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"584-600"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543247","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187363","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 : 2024-03-31DOI: 10.23919/cje.2022.00.234
Junqi Liu;Tao Wen;Guo Xie;Yuan Cao;Clive Roberts
The fault diagnosis of railway point machines (RPMs) has attracted the attention of engineers and researchers. Seldom have studies considered diverse noises along the track. To fulfill this aspect, a multi-time-scale variational mode decomposition (MTSVMD) is proposed in this paper to realize the accurate and robust fault diagnosis of RPMs under multiple noises. MTSVMD decomposes condition monitoring signals after coarse-grained processing in varying degrees. In this manner, the information contained in the signal components at multiple time scales can construct a more abundant feature space than at a single scale. In the experimental validation, a random position, random type, random number, and random length (4R) noise-adding algorithm helps to verify the robustness of the approach. The adequate experimental results demonstrate the superiority of the proposed MTSVMD-based fault diagnosis.
{"title":"Multi-Time-Scale Variational Mode Decomposition-Based Robust Fault Diagnosis of Railway Point Machines Under Multiple Noises","authors":"Junqi Liu;Tao Wen;Guo Xie;Yuan Cao;Clive Roberts","doi":"10.23919/cje.2022.00.234","DOIUrl":"https://doi.org/10.23919/cje.2022.00.234","url":null,"abstract":"The fault diagnosis of railway point machines (RPMs) has attracted the attention of engineers and researchers. Seldom have studies considered diverse noises along the track. To fulfill this aspect, a multi-time-scale variational mode decomposition (MTSVMD) is proposed in this paper to realize the accurate and robust fault diagnosis of RPMs under multiple noises. MTSVMD decomposes condition monitoring signals after coarse-grained processing in varying degrees. In this manner, the information contained in the signal components at multiple time scales can construct a more abundant feature space than at a single scale. In the experimental validation, a random position, random type, random number, and random length (4R) noise-adding algorithm helps to verify the robustness of the approach. The adequate experimental results demonstrate the superiority of the proposed MTSVMD-based fault diagnosis.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"814-822"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543239","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187443","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 : 2024-03-31DOI: 10.23919/cje.2022.00.174
Zixuan Zhang;Yuan Cao;Shuai Su
With rising energy prices and concerns about environmental issues, energy-efficient driving strategies (EEDS) for high-speed trains have received a substantial amount of attention. In particular, energy-saving schemes play a huge role in reducing the energy and operating costs of trains. This article studies the EEDS of high-speed trains at a given time. A well-posed model is formulated, in which the constraints of the checkpoints, in addition to the speed limits, vehicle dynamics, and discrete control throttle, are first considered. For a given control sequence, the Karush-Kuhn-Tucker (KKT) conditions are used to obtain the necessary conditions for an EEDS. According to several key equations of the necessary conditions, the checkpoint constraints are satisfied. Some case studies are conducted based on the data of the Beijing-Shanghai high-speed line to illustrate the effectiveness of the proposed approach.
{"title":"Energy-Efficient Driving Strategy for High-Speed Trains with Considering the Checkpoints","authors":"Zixuan Zhang;Yuan Cao;Shuai Su","doi":"10.23919/cje.2022.00.174","DOIUrl":"https://doi.org/10.23919/cje.2022.00.174","url":null,"abstract":"With rising energy prices and concerns about environmental issues, energy-efficient driving strategies (EEDS) for high-speed trains have received a substantial amount of attention. In particular, energy-saving schemes play a huge role in reducing the energy and operating costs of trains. This article studies the EEDS of high-speed trains at a given time. A well-posed model is formulated, in which the constraints of the checkpoints, in addition to the speed limits, vehicle dynamics, and discrete control throttle, are first considered. For a given control sequence, the Karush-Kuhn-Tucker (KKT) conditions are used to obtain the necessary conditions for an EEDS. According to several key equations of the necessary conditions, the checkpoint constraints are satisfied. Some case studies are conducted based on the data of the Beijing-Shanghai high-speed line to illustrate the effectiveness of the proposed approach.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"847-858"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543245","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187347","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 : 2024-03-31DOI: 10.23919/cje.2023.00.127
Wenxiao Qiao;Siwei Sun;Lei Hu
The rapid development of modern cryptographic applications such as zero-knowledge, secure multi-party computation, fully homomorphic encryption has motivated the design of new so-called arithmetization-oriented symmetric primitives. As designing ciphers in this domain is relatively new and not well-understood, the security of these new ciphers remains to be completely assessed. In this paper, we revisit the security analysis of arithmetization-oriented cipher Grendel. Grendel uses the Legendre symbol as a component, which is tailored specifically for the use in zero-knowledge and efficiently-varifiable proof systems. At FSE 2022, the first preimage attack on some original full GrendelHash instances was proposed. As a countermeasure, the designer adds this attack into the security analysis and updates the formula to derive the secure number of rounds. In our work, we present new algebraic attacks on GrendelHash. For the preimage attack, we can reduce the complexity or attack one more round than previous attacks for some instances. In addition, we present the first collision attack on some round-reduced instances by solving the constrained input/constrained output problem for the underlying permutations.
{"title":"New Algebraic Attacks on Grendel with the Strategy of Bypassing SPN Steps","authors":"Wenxiao Qiao;Siwei Sun;Lei Hu","doi":"10.23919/cje.2023.00.127","DOIUrl":"https://doi.org/10.23919/cje.2023.00.127","url":null,"abstract":"The rapid development of modern cryptographic applications such as zero-knowledge, secure multi-party computation, fully homomorphic encryption has motivated the design of new so-called arithmetization-oriented symmetric primitives. As designing ciphers in this domain is relatively new and not well-understood, the security of these new ciphers remains to be completely assessed. In this paper, we revisit the security analysis of arithmetization-oriented cipher Grendel. Grendel uses the Legendre symbol as a component, which is tailored specifically for the use in zero-knowledge and efficiently-varifiable proof systems. At FSE 2022, the first preimage attack on some original full GrendelHash instances was proposed. As a countermeasure, the designer adds this attack into the security analysis and updates the formula to derive the secure number of rounds. In our work, we present new algebraic attacks on GrendelHash. For the preimage attack, we can reduce the complexity or attack one more round than previous attacks for some instances. In addition, we present the first collision attack on some round-reduced instances by solving the constrained input/constrained output problem for the underlying permutations.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"635-644"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543243","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187365","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 : 2024-03-31DOI: 10.23919/cje.2022.00.342
Wenjie Yan;Ziqi Li;Yongjun Qi
The robustness of graph neural networks (GNNs) is a critical research topic in deep learning. Many researchers have designed regularization methods to enhance the robustness of neural networks, but there is a lack of theoretical analysis on the principle of robustness. In order to tackle the weakness of current robustness designing methods, this paper gives new insights into how to guarantee the robustness of GNNs. A novel regularization strategy named Lya-Reg is designed to guarantee the robustness of GNNs by Lyapunov theory. Our results give new insights into how regularization can mitigate the various adversarial effects on different graph signals. Extensive experiments on various public datasets demonstrate that the proposed regularization method is more robust than the state-of-the-art methods such as $L_1$ -norm, $L_2$ -norm, $L_{21}$ -norm, Pro-GNN, PA-GNN and GARNET against various types of graph adversarial attacks.
{"title":"Robust Regularization Design of Graph Neural Networks Against Adversarial Attacks Based on Lyapunov Theory","authors":"Wenjie Yan;Ziqi Li;Yongjun Qi","doi":"10.23919/cje.2022.00.342","DOIUrl":"https://doi.org/10.23919/cje.2022.00.342","url":null,"abstract":"The robustness of graph neural networks (GNNs) is a critical research topic in deep learning. Many researchers have designed regularization methods to enhance the robustness of neural networks, but there is a lack of theoretical analysis on the principle of robustness. In order to tackle the weakness of current robustness designing methods, this paper gives new insights into how to guarantee the robustness of GNNs. A novel regularization strategy named Lya-Reg is designed to guarantee the robustness of GNNs by Lyapunov theory. Our results give new insights into how regularization can mitigate the various adversarial effects on different graph signals. Extensive experiments on various public datasets demonstrate that the proposed regularization method is more robust than the state-of-the-art methods such as \u0000<tex>$L_1$</tex>\u0000-norm, \u0000<tex>$L_2$</tex>\u0000-norm, \u0000<tex>$L_{21}$</tex>\u0000-norm, Pro-GNN, PA-GNN and GARNET against various types of graph adversarial attacks.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"732-741"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187419","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}
In practical abnormal traffic detection scenarios, traffic often appears as drift, imbalanced and rare labeled streams, and how to effectively identify malicious traffic in such complex situations has become a challenge for malicious traffic detection. Researchers have extensive studies on malicious traffic detection with single challenge, but the detection of complex traffic has not been widely noticed. Queried adaptive random forests (QARF) is proposed to detect traffic streams with concept drift, imbalance and lack of labeled instances. QARF is an online active learning based approach which combines adaptive random forests method and adaptive margin sampling strategy. QARF achieves querying a small number of instances from unlabeled traffic streams to obtain effective training. We conduct experiments using the NSL-KDD dataset to evaluate the performance of QARF. QARF is compared with other state-of-the-art methods. The experimental results show that QARF obtains 98.20% accuracy on the NSL-KDD dataset. QARF performs better than other state-of-the-art methods in comparisons.
{"title":"QARF: A Novel Malicious Traffic Detection Approach via Online Active Learning for Evolving Traffic Streams","authors":"Zequn Niu;Jingfeng Xue;Yong Wang;Tianwei Lei;Weijie Han;Xianwei Gao","doi":"10.23919/cje.2022.00.360","DOIUrl":"https://doi.org/10.23919/cje.2022.00.360","url":null,"abstract":"In practical abnormal traffic detection scenarios, traffic often appears as drift, imbalanced and rare labeled streams, and how to effectively identify malicious traffic in such complex situations has become a challenge for malicious traffic detection. Researchers have extensive studies on malicious traffic detection with single challenge, but the detection of complex traffic has not been widely noticed. Queried adaptive random forests (QARF) is proposed to detect traffic streams with concept drift, imbalance and lack of labeled instances. QARF is an online active learning based approach which combines adaptive random forests method and adaptive margin sampling strategy. QARF achieves querying a small number of instances from unlabeled traffic streams to obtain effective training. We conduct experiments using the NSL-KDD dataset to evaluate the performance of QARF. QARF is compared with other state-of-the-art methods. The experimental results show that QARF obtains 98.20% accuracy on the NSL-KDD dataset. QARF performs better than other state-of-the-art methods in comparisons.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"645-656"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543240","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187420","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 : 2024-03-31DOI: 10.23919/cje.2022.00.196
Yichuan Wang;Wen Gao;Xinhong Hei;Yanning Du
In recent years, the rapid development of Internet technology has constantly enriched people's daily life and gradually changed from the traditional computer terminal to the mobile terminal. But with it comes the security problems brought by the mobile terminal. Especially for Android system, due to its open source nature, malicious applications continue to emerge, which greatly threatens the data security of users. Therefore, this paper proposes a method of trusted embedded static measurement and data transmission protection architecture based on Android to reduce the risk of data leakage in the process of terminal storage and transmission. We conducted detailed data and feasibility analysis of the proposed method from the aspects of time consumption, storage overhead and security. The experimental results show that this method can detect Android system layer attacks such as self-booting of the malicious module and improve the security of data encryption and transmission process effectively. Compared with the native system, the additional performance overhead is small.
{"title":"Method and Practice of Trusted Embedded Computing and Data Transmission Protection Architecture Based on Android","authors":"Yichuan Wang;Wen Gao;Xinhong Hei;Yanning Du","doi":"10.23919/cje.2022.00.196","DOIUrl":"https://doi.org/10.23919/cje.2022.00.196","url":null,"abstract":"In recent years, the rapid development of Internet technology has constantly enriched people's daily life and gradually changed from the traditional computer terminal to the mobile terminal. But with it comes the security problems brought by the mobile terminal. Especially for Android system, due to its open source nature, malicious applications continue to emerge, which greatly threatens the data security of users. Therefore, this paper proposes a method of trusted embedded static measurement and data transmission protection architecture based on Android to reduce the risk of data leakage in the process of terminal storage and transmission. We conducted detailed data and feasibility analysis of the proposed method from the aspects of time consumption, storage overhead and security. The experimental results show that this method can detect Android system layer attacks such as self-booting of the malicious module and improve the security of data encryption and transmission process effectively. Compared with the native system, the additional performance overhead is small.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"623-634"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543246","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187349","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 : 2024-03-31DOI: 10.23919/cje.2022.00.351
Shanmin Wang;Hui Shuai;Lei Zhu;Qingshan Liu
Disentangling facial expressions from other disturbing facial attributes in face images is an essential topic for facial expression recognition. Previous methods only care about facial expression disentanglement (FED) itself, ignoring the negative effects of other facial attributes. Due to the annotations on limited facial attributes, it is difficult for existing FED solutions to disentangle all disturbance from the input face. To solve this issue, we propose an expression complementary disentanglement network (ECDNet). ECDNet proposes to finish the FED task during a face reconstruction process, so as to address all facial attributes during disentanglement. Different from traditional re-construction models, ECDNet reconstructs face images by progressively generating and combining facial appearance and matching geometry. It designs the expression incentive (EIE) and expression inhibition (EIN) mechanisms, inducing the model to characterize the disentangled expression and complementary parts precisely. Facial geometry and appearance, generated in the reconstructed process, are dealt with to represent facial expressions and complementary parts, respectively. The combination of distinctive reconstruction model, EIE, and EIN mechanisms ensures the completeness and exactness of the FED task. Experimental results on RAF-DB, AffectNet, and CAER-S datasets have proven the effectiveness and superiority of ECDNet.
{"title":"Expression Complementary Disentanglement Network for Facial Expression Recognition","authors":"Shanmin Wang;Hui Shuai;Lei Zhu;Qingshan Liu","doi":"10.23919/cje.2022.00.351","DOIUrl":"https://doi.org/10.23919/cje.2022.00.351","url":null,"abstract":"Disentangling facial expressions from other disturbing facial attributes in face images is an essential topic for facial expression recognition. Previous methods only care about facial expression disentanglement (FED) itself, ignoring the negative effects of other facial attributes. Due to the annotations on limited facial attributes, it is difficult for existing FED solutions to disentangle all disturbance from the input face. To solve this issue, we propose an expression complementary disentanglement network (ECDNet). ECDNet proposes to finish the FED task during a face reconstruction process, so as to address all facial attributes during disentanglement. Different from traditional re-construction models, ECDNet reconstructs face images by progressively generating and combining facial appearance and matching geometry. It designs the expression incentive (EIE) and expression inhibition (EIN) mechanisms, inducing the model to characterize the disentangled expression and complementary parts precisely. Facial geometry and appearance, generated in the reconstructed process, are dealt with to represent facial expressions and complementary parts, respectively. The combination of distinctive reconstruction model, EIE, and EIN mechanisms ensures the completeness and exactness of the FED task. Experimental results on RAF-DB, AffectNet, and CAER-S datasets have proven the effectiveness and superiority of ECDNet.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 3","pages":"742-752"},"PeriodicalIF":1.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543219","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187439","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
扫码关注我们
求助内容：
应助结果提醒方式：