Pub Date : 2024-11-11DOI: 10.23919/cje.2023.00.332
Yousheng Zhou;Zhonghan Wang;Yuanni Liu
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.
{"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}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.299
Binhao Hu;Jianpeng Zhang;Hongchang Chen
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.
{"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}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.365
Honghong Yang;Hongxi Liu;Yumei Zhang;Xiaojun Wu
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.
{"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}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.345
Zhongtao Cui;Xuesong Yuan;Xiaotao Xu;Dongrui Chen;Yifan Zu;Matthew Thomas Cole;Qingyun Chen;Yang Yan
A traveling-wave, extended interaction amplifier is herein investigated for use in millimeter-wave and terahertz amplification sources. By placing engineered extended interaction cavities between the traveling wave structures, higher gain is obtained with a shorter high frequency circuit, compared with conventional traveling wave tubes architectures. The bandwidth of the device is significantly increased relative to extended interaction klystrons. A D-band beam wave interaction circuit of 26 mm long has been designed. Particle-in-cell simulations at 21.5-kV operating voltage, 0.3-A beam current, and 5-mW input power show that the maximum output power reaches 351 W, with a gain of 48.4 dB and 3-dB bandwidth of 1.42 GHz.
本文研究了一种用于毫米波和太赫兹放大源的行波扩展交互放大器。与传统的行波管结构相比，通过在行波结构之间放置工程扩展相互作用空腔，以更短的高频电路获得更高的增益。与扩展交互 klystrons 相比，该设备的带宽显著增加。我们设计了一个 26 毫米长的 D 波段束波交互电路。在 21.5 kV 工作电压、0.3 A 束电流和 5 mW 输入功率条件下进行的粒子内电池模拟显示，最大输出功率达到 351 W，增益为 48.4 dB，3 dB 带宽为 1.42 GHz。
{"title":"Theoretical Research on a D-Band Traveling Wave Extended Interaction Amplifier","authors":"Zhongtao Cui;Xuesong Yuan;Xiaotao Xu;Dongrui Chen;Yifan Zu;Matthew Thomas Cole;Qingyun Chen;Yang Yan","doi":"10.23919/cje.2022.00.345","DOIUrl":"https://doi.org/10.23919/cje.2022.00.345","url":null,"abstract":"A traveling-wave, extended interaction amplifier is herein investigated for use in millimeter-wave and terahertz amplification sources. By placing engineered extended interaction cavities between the traveling wave structures, higher gain is obtained with a shorter high frequency circuit, compared with conventional traveling wave tubes architectures. The bandwidth of the device is significantly increased relative to extended interaction klystrons. A D-band beam wave interaction circuit of 26 mm long has been designed. Particle-in-cell simulations at 21.5-kV operating voltage, 0.3-A beam current, and 5-mW input power show that the maximum output power reaches 351 W, with a gain of 48.4 dB and 3-dB bandwidth of 1.42 GHz.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1487-1491"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748542","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600179","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-11-11DOI: 10.23919/cje.2022.00.128
Anhua Ma;Su Pan;Weiwei Zhou
This paper proposes a Markov decision process based service migration algorithm to satisfy quality of service (QoS) requirements when the terminals leave the original server. Services were divided into real-time services and non-real-time services, each type of them has different requirements on transmission bandwidth and latency, which were considered in the revenue function. Different values were assigned to the weight coefficients of QoS parameters for different service types in the revenue and cost functions so as to distinguish the differences between the two service types. The overall revenue was used for migration decisions, rather than fixed threshold or instant revenue. The Markov decision process was used to maximize the overall revenue of the system. Simulation results show that the proposed algorithm obtained more revenue compared with the existing works.
{"title":"Service Migration Algorithm Based on Markov Decision Process with Multiple Service Types and Multiple System Factors","authors":"Anhua Ma;Su Pan;Weiwei Zhou","doi":"10.23919/cje.2022.00.128","DOIUrl":"https://doi.org/10.23919/cje.2022.00.128","url":null,"abstract":"This paper proposes a Markov decision process based service migration algorithm to satisfy quality of service (QoS) requirements when the terminals leave the original server. Services were divided into real-time services and non-real-time services, each type of them has different requirements on transmission bandwidth and latency, which were considered in the revenue function. Different values were assigned to the weight coefficients of QoS parameters for different service types in the revenue and cost functions so as to distinguish the differences between the two service types. The overall revenue was used for migration decisions, rather than fixed threshold or instant revenue. The Markov decision process was used to maximize the overall revenue of the system. Simulation results show that the proposed algorithm obtained more revenue compared with the existing works.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1515-1525"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748538","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600350","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}
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.
{"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}
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.
{"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}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.387
Hanbing Yu;Qunxiong Zheng
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.
{"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}
Pub Date : 2024-11-11DOI: 10.23919/cje.2023.00.040
Xueshi Dong
In the fields of intelligent transportation and multi-task cooperation, many practical problems can be modeled by colored traveling salesman problem (CTSP). When solving large-scale CTSP with a scale of more than 1000 dimensions, their convergence speed and the quality of their solutions are limited. This paper proposes a new hybrid ITÖ (HITÖ) algorithm, which integrates two new strategies, crossover operator and mutation strategy, into the standard ITÖ. In the iteration process of HITÖ, the feasible solution of CTSP is represented by the double chromosome coding, and the random drift and wave operators are used to explore and develop new unknown regions. In this process, the drift operator is executed by the improved crossover operator, and the wave operator is performed by the optimized mutation strategy. Experiments show that HITÖ is superior to the known comparison algorithms in terms of the quality solution.
{"title":"Hybrid ITÖ Algorithm for Large-Scale Colored Traveling Salesman Problem","authors":"Xueshi Dong","doi":"10.23919/cje.2023.00.040","DOIUrl":"https://doi.org/10.23919/cje.2023.00.040","url":null,"abstract":"In the fields of intelligent transportation and multi-task cooperation, many practical problems can be modeled by colored traveling salesman problem (CTSP). When solving large-scale CTSP with a scale of more than 1000 dimensions, their convergence speed and the quality of their solutions are limited. This paper proposes a new hybrid ITÖ (HITÖ) algorithm, which integrates two new strategies, crossover operator and mutation strategy, into the standard ITÖ. In the iteration process of HITÖ, the feasible solution of CTSP is represented by the double chromosome coding, and the random drift and wave operators are used to explore and develop new unknown regions. In this process, the drift operator is executed by the improved crossover operator, and the wave operator is performed by the optimized mutation strategy. Experiments show that HITÖ is superior to the known comparison algorithms in terms of the quality solution.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1337-1345"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748549","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600157","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
扫码关注我们
求助内容：
应助结果提醒方式：