Chinese Journal of Electronics最新文献_第10页

Confidential Image Super-Resolution with Privacy Protection 具有隐私保护功能的机密图像超级分辨率

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2023.00.034

Yiran Han;Jianwei Liu;Xin Deng;Junpeng Jing;Yanting Zhang

{"title":"Confidential Image Super-Resolution with Privacy Protection","authors":"Yiran Han;Jianwei Liu;Xin Deng;Junpeng Jing;Yanting Zhang","doi":"10.23919/cje.2023.00.034","DOIUrl":"https://doi.org/10.23919/cje.2023.00.034","url":null,"abstract":"Nowadays, people are getting used to upload images to a third party for post-processing, such as image denoising and super-resolution. This may easily lead to the disclosure of the privacy in the confidential images. One possible solution is to encrypt the image before sending it to the third party, the encrypted image can be easily detected by a malicious attacker in the transmission channel. We propose a confidential image super-resolution method named HSR-Net which firstly hide the secret image and then super-resolve it in the hidden domain. The method is composed of three important modules: image hiding module (IHM), image super-resolution module (ISM), and image revealing module (IRM). The IHM aims to encode secret image and hide it into a cover image to generate the stego image. The stego image looks similar to the cover image but contains the information of the secret image. The third party uses the ISM to perform image super-resolution on the stego image. The user can reveal the super-resolved secret image from the stego image. The proposed HSR-Net method has two advantages. It ensures that the third party cannot directly operate on the secret image, thus protecting the user's privacy. Due to the similarity between the stego image and cover image, we can reduce the attacker's suspicion to further improve the image security. The experimental results were tested on DIV2K dataset and Flickr2K dataset. The peak signal-to-noise ratios (PSNR) of IHM, ISM, and IRM are 38.81 dB, 28.91 dB, and 23.51 dB, respectively, which verify that the proposed HSR-Net method is able to achieve image super-resolution and protect user's privacy simultaneouly.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1447-1457"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748534","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600377","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}

引用次数: 0

Collaborative Service Provisioning for UAV-Assisted Mobile Edge Computing 无人机辅助移动边缘计算的协作服务供应

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2021.00.323

Yuben Qu;Zhenhua Wei;Zhen Qin;Tao Wu;Jinghao Ma;Haipeng Dai;Chao Dong

{"title":"Collaborative Service Provisioning for UAV-Assisted Mobile Edge Computing","authors":"Yuben Qu;Zhenhua Wei;Zhen Qin;Tao Wu;Jinghao Ma;Haipeng Dai;Chao Dong","doi":"10.23919/cje.2021.00.323","DOIUrl":"https://doi.org/10.23919/cje.2021.00.323","url":null,"abstract":"Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC), as a way of coping with delay-sensitive and computing-intensive tasks, is considered to be a key technology to solving the challenges of terrestrial MEC networks. In this work, we study the problem of collaborative service provisioning (CSP) for UAV-assisted MEC. Specifically, taking into account the task latency and other resource constraints, this paper investigates how to minimize the total energy consumption of all terrestrial user equipments, by jointly optimizing computing resource allocation, task offloading, UAV trajectory, and service placement. The CSP problem is a non-convex mixed integer nonlinear programming problem, owing to the complex coupling of mixed integral variables and non-convexity of CSP. To address the CSP problem, this paper proposes an alternating optimization-based solution with the convergence guarantee as follows. We iteratively deal with the joint service placement and task offloading subproblem, and UAV movement trajectory subproblem, by branch and bound and successive convex approximation, respectively, while the closed form of the optimal computation resource allocation can be efficiently obtained. Extensive simulations validate the effectiveness of the proposed algorithm compared to three baselines.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1504-1514"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748536","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600176","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}

引用次数: 0

Contents 2024 内容 2024

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/CJE.2024.10748570

引用次数: 0

A Lattice-Based Method for Recovering the Unknown Parameters of Truncated Multiple Recursive Generators with Constant 一种基于网格的方法，用于恢复具有常数的截断多重递归发生器的未知参数

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2022.00.387

Hanbing Yu;Qunxiong Zheng

{"title":"A Lattice-Based Method for Recovering the Unknown Parameters of Truncated Multiple Recursive Generators with Constant","authors":"Hanbing Yu;Qunxiong Zheng","doi":"10.23919/cje.2022.00.387","DOIUrl":"https://doi.org/10.23919/cje.2022.00.387","url":null,"abstract":"Multiple recursive generators with constant, as the high-order extension of linear congruence generators, form an important class of pseudorandom number generators that are widely used in cryptography. The predictability of truncated sequences output by multiple recursive generators with constant that predicts the whole sequences by the truncated high-order bits of the sequences, is a crucial problem in cryptography. This paper studies the predictability of truncated multiple recursive generators with constant. Given a few truncated digits of high-order bits output by a multiple recursive generator with constant, we first convert the multiple recursive generator with constant to multiple recursive generator and then adopt the method we proposed recently to recover the modulus, the coefficients, and the differences of initial state. In particular, we give an estimation of the number of truncated digits required for recovering the differences of initial state by using the expected norm of target vector. We prove by exponential sums that the number of truncated digits required for uniquely determining both the initial state and the constant is finite and give an upper bound. Extensive experiments confirm the correctness of our method.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1458-1467"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748545","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600379","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}

引用次数: 0

Hybrid ITÖ Algorithm for Large-Scale Colored Traveling Salesman Problem 大规模彩色旅行推销员问题的混合 ITÖ 算法

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2023.00.040

Xueshi Dong

引用次数: 0

A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand 计算麻将手牌不足数的快速算法

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2022.00.259

Xueqing Yan;Yongming Li;Sanjiang Li

引用次数: 0

Wideband Circularly Polarized Substrate-Integrated Waveguide Aperture-Coupled Metasurface Antenna Array for Millimeter-Wave Applications 用于毫米波应用的宽带圆极化基底集成波导孔径耦合元面天线阵列

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2023.00.029

Jiwei Lian;Chun Geng;Xue Lu;Dazhi Ding

{"title":"Wideband Circularly Polarized Substrate-Integrated Waveguide Aperture-Coupled Metasurface Antenna Array for Millimeter-Wave Applications","authors":"Jiwei Lian;Chun Geng;Xue Lu;Dazhi Ding","doi":"10.23919/cje.2023.00.029","DOIUrl":"https://doi.org/10.23919/cje.2023.00.029","url":null,"abstract":"A wideband circularly polarized (CP) aperture-coupled metasurface antenna operating at millimeter-wave frequency spectrum in substrate-integrated waveguide (SIW) technology is proposed. The proposed metasurface antenna is composed of two substrates. The first substrate contains an end-shorted SIW section with a slot etched. The introduced metasurface is printed on the top of the second substrate. The metasurface is comprised of \u0000<tex>$3 times 3$</tex>\u0000 unit cells, each of which contains two interconnected patches and two parasitic patches. The working mechanism of the proposed metasurface antenna is illustrated in details. The proposed metasurface antenna has wide impedance bandwidth and axial ratio (AR) bandwidth, which are 66.7% and 40%, respectively. Using the proposed metasurface antenna, a \u0000<tex>$4 times 4$</tex>\u0000 CP metasurface antenna array with an impedance bandwidth of 24%, an AR bandwidth of 30%, and a peak gain of 18.7 dBic in simulation is developed in this paper for millimeter-wave applications.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1468-1477"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748535","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600177","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}

引用次数: 0

Virtual Coupling Trains Based on Multi-Agent System Under Communication Delay 通信延迟下基于多代理系统的虚拟耦合列车

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2022.00.253

Guodong Qin;Xiangxi Meng;Tao Wen;Baigen Cai

引用次数: 0

Federated Offline Reinforcement Learning with Proximal Policy Evaluation 具有近端策略评估功能的联合离线强化学习

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2023.00.288

Sheng Yue;Yongheng Deng;Guanbo Wang;Ju Ren;Yaoxue Zhang

{"title":"Federated Offline Reinforcement Learning with Proximal Policy Evaluation","authors":"Sheng Yue;Yongheng Deng;Guanbo Wang;Ju Ren;Yaoxue Zhang","doi":"10.23919/cje.2023.00.288","DOIUrl":"https://doi.org/10.23919/cje.2023.00.288","url":null,"abstract":"Offline reinforcement learning (RL) has gathered increasing attention in recent years, which seeks to learn policies from static datasets without active online exploration. However, the existing offline RL approaches often require a large amount of pre-collected data and hence are hardly implemented by a single agent in practice. Inspired by the advancement of federated learning (FL), this paper studies federated offline reinforcement learning (FORL), whereby multiple agents collaboratively carry out offline policy learning with no need to share their raw trajectories. Clearly, a straightforward solution is to simply retrofit the off-the-shelf offline RL methods for FL, whereas such an approach easily overfits individual datasets during local updating, leading to instability and subpar performance. To overcome this challenge, we propose a new FORL algorithm, named model-free (MF)-FORL, that exploits novel “proximal local policy evaluation” to judiciously push up action values beyond local data support, enabling agents to capture the individual information without forgetting the aggregated knowledge. Further, we introduce a model-based variant, MB-FORL, capable of improving the generalization ability and computational efficiency via utilizing a learned dynamics model. We evaluate the proposed algorithms on a suite of complex and high-dimensional offline RL benchmarks, and the results demonstrate significant performance gains over the baselines.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1360-1372"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748547","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600180","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}

引用次数: 0

Model Checking Computation Tree Logic Over Multi-Valued Decision Processes and Its Reduction Techniques 多值决策过程的计算树逻辑模型检查及其还原技术

IF 1.6 4区计算机科学

Chinese Journal of Electronics Pub Date : 2024-11-11 DOI: 10.23919/cje.2021.00.333

Wuniu Liu;Junmei Wang;Qing He;Yongming Li

{"title":"Model Checking Computation Tree Logic Over Multi-Valued Decision Processes and Its Reduction Techniques","authors":"Wuniu Liu;Junmei Wang;Qing He;Yongming Li","doi":"10.23919/cje.2021.00.333","DOIUrl":"https://doi.org/10.23919/cje.2021.00.333","url":null,"abstract":"Model checking computation tree logic based on multi-valued possibility measures has been studied by Li et al. on Information Sciences in 2019. However, the previous work did not consider the nondeterministic choices inherent in systems represented by multi-valued Kripke structures (MvKSs). This nondeterminism is crucial for accurate system modeling, decision making, and control capabilities. To address this limitation, we draw inspiration from the generalization of Markov chains to Markov decision processes in probabilistic systems. By integrating nondeterminism into MvKS, we introduce multi-valued decision processes (MvDPs) as a framework for modeling MvKSs with nondeterministic choices. We investigate the problems of model checking over MvDPs. Verifying properties are expressed by using multi-valued computation tree logic based on schedulers. Our primary objective is to leverage fixpoint techniques to determine the maximum and minimum possibilities of the system satisfying temporal properties. This allows us to identify the optimal or worst-case schedulers for decision making or control purposes. We aim to develop reduction techniques that enhance the efficiency of model checking, thereby reducing the associated time complexity. We mathematically demonstrate three reduction techniques that improve model checking performance in most scenarios.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1399-1411"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748381","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600139","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}

引用次数: 0