Chinese Journal of Electronics最新文献

A Local Differential Privacy Hybrid Data Clustering Iterative Algorithm for Edge Computing 用于边缘计算的局部差分隐私混合数据聚类迭代算法

IF 1.6 4区计算机科学

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

Yousheng Zhou;Zhonghan Wang;Yuanni Liu

{"title":"A Local Differential Privacy Hybrid Data Clustering Iterative Algorithm for Edge Computing","authors":"Yousheng Zhou;Zhonghan Wang;Yuanni Liu","doi":"10.23919/cje.2023.00.332","DOIUrl":"https://doi.org/10.23919/cje.2023.00.332","url":null,"abstract":"As a new computing method, edge computing not only improves the computing efficiency and processing power of data, but also reduces the transmission delay of data. Due to the wide variety of edge devices and the increasing amount of terminal data, third-party data centers are unable to ensure no user privacy data leaked. To solve these problems, this paper proposes an iterative clustering algorithm named local differential privacy iterative aggregation (LDPIA) based on localized differential privacy, which implements local differential privacy. To address the problem of uncertainty in numerical types of mixed data, random perturbation is applied to the user data at the attribute category level. The server then performs clustering on the perturbed data, and density threshold and disturbance probability are introduced to update the cluster point set iteratively. In addition, a new distance calculation formula is defined in combination with attribute weights to ensure the availability of data. The experimental results show that LDPIA algorithm achieves better privacy protection and availability simultaneously.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1421-1434"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748533","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600158","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

Knowledge Graph Completion Method of Combining Structural Information with Semantic Information 将结构信息与语义信息相结合的知识图谱补全方法

IF 1.6 4区计算机科学

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

Binhao Hu;Jianpeng Zhang;Hongchang Chen

{"title":"Knowledge Graph Completion Method of Combining Structural Information with Semantic Information","authors":"Binhao Hu;Jianpeng Zhang;Hongchang Chen","doi":"10.23919/cje.2022.00.299","DOIUrl":"https://doi.org/10.23919/cje.2022.00.299","url":null,"abstract":"With the development of knowledge graphs, a series of applications based on knowledge graphs have emerged. The incompleteness of knowledge graphs makes the effect of the downstream applications affected by the quality of the knowledge graphs. To improve the quality of knowledge graphs, translation-based graph embeddings such as TransE, learn structural information by representing triples as low-dimensional dense vectors. However, it is difficult to generalize to the unseen entities that are not observed during training but appear during testing. Other methods use the powerful representational ability of pre-trained language models to learn entity descriptions and contextual representation of triples. Although they are robust to incompleteness, they need to calculate the score of all candidate entities for each triple during inference. We consider combining two models to enhance the robustness of unseen entities by semantic information, and prevent combined explosion by reducing inference overhead through structured information. We use a pre-training language model to code triples and learn the semantic information within them, and use a hyperbolic space-based distance model to learn structural information, then integrate the two types of information together. We evaluate our model by performing link prediction experiments on standard datasets. The experimental results show that our model achieves better performances than state-of-the-art methods on two standard datasets.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1412-1420"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748382","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600345","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

FMR-GNet: Forward Mix-Hop Spatial-Temporal Residual Graph Network for 3D Pose Estimation FMR-GNet：用于三维姿态估计的前向混合跳转时空残差图网络

IF 1.6 4区计算机科学

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

Honghong Yang;Hongxi Liu;Yumei Zhang;Xiaojun Wu

{"title":"FMR-GNet: Forward Mix-Hop Spatial-Temporal Residual Graph Network for 3D Pose Estimation","authors":"Honghong Yang;Hongxi Liu;Yumei Zhang;Xiaojun Wu","doi":"10.23919/cje.2022.00.365","DOIUrl":"https://doi.org/10.23919/cje.2022.00.365","url":null,"abstract":"Graph convolutional networks that leverage spatial-temporal information from skeletal data have emerged as a popular approach for 3D human pose estimation. However, comprehensively modeling consistent spatial-temporal dependencies among the body joints remains a challenging task. Current approaches are limited by performing graph convolutions solely on immediate neighbors, deploying separate spatial or temporal modules, and utilizing single-pass feedforward architectures. To solve these limitations, we propose a forward multi-scale residual graph convolutional network (FMR-GNet) for 3D pose estimation from monocular video. First, we introduce a mix-hop spatial-temporal attention graph convolution layer that effectively aggregates neighboring features with learnable weights over large receptive fields. The attention mechanism enables dynamically computing edge weights at each layer. Second, we devise a cross-domain spatial-temporal residual module to fuse multi-scale spatial-temporal convolutional features through residual connections, explicitly modeling interdependencies across spatial and temporal domains. Third, we integrate a forward dense connection block to propagate spatial-temporal representations across network layers, enabling high-level semantic skeleton information to enrich lower-level features. Comprehensive experiments conducted on two challenging 3D human pose estimation benchmarks, namely Human3.6M and MPI-INF-3DHP, demonstrate that the proposed FMR-GNet achieves superior performance, surpassing the most state-of-the-art methods.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1346-1359"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748551","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600378","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

Theoretical Research on a D-Band Traveling Wave Extended Interaction Amplifier D 波段行波扩展交互放大器的理论研究

IF 1.6 4区计算机科学

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

Zhongtao Cui;Xuesong Yuan;Xiaotao Xu;Dongrui Chen;Yifan Zu;Matthew Thomas Cole;Qingyun Chen;Yang Yan

引用次数: 0

Service Migration Algorithm Based on Markov Decision Process with Multiple Service Types and Multiple System Factors 基于马尔可夫决策过程与多种服务类型和多种系统因素的服务迁移算法

IF 1.6 4区计算机科学

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

Anhua Ma;Su Pan;Weiwei Zhou

引用次数: 0

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