International Conference on Algorithms, Microchips and Network Applications最新文献_第6页

Radar signal detection under low SNR using stacked auto-encoder and time-frequency domain features 利用堆叠自动编码器和时频域特征在低信噪比条件下检测雷达信号

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3032046

Yuan Huang, Tao Liu, Ke Li

引用次数: 0

A distributed on-demand routing algorithm for large-scale low Earth orbit constellation 大规模低地球轨道星座分布式按需路由算法

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031951

Hefei Hu, siyan lv, Jun He, Simin Feng

引用次数: 0

Timing algorithm design based on digital twin airport 基于数字孪生机场的计时算法设计

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031969

Wei Wang, Hairui Song, Liping Yan, Senping Song

引用次数: 0

Design of an efficient hybrid cache coherence protocol on chiplet architecture 在芯片组架构上设计高效的混合高速缓存一致性协议

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031958

Ruqing Wang, Lixin Yu, Zhuang Wei

{"title":"Design of an efficient hybrid cache coherence protocol on chiplet architecture","authors":"Ruqing Wang, Lixin Yu, Zhuang Wei","doi":"10.1117/12.3031958","DOIUrl":"https://doi.org/10.1117/12.3031958","url":null,"abstract":"With the continuous development of semiconductor technology, monolithic integration faces problems such as high design costs and long research period. The chiplet effectively improves the yield rate and shortens the research and development cycle by splitting a single die into multiple dies with different functions for advanced packaging integration. However, compared to monolithic integration, inter-die communication is limited by pin density and physical distance, and die interconnects bring higher latency. At the same time, each die has an independent structure, and accessing the same address space will cause system-level cache coherence issues. Therefore, we design a system-level cache based on the directory-based hybrid consistency protocol, and use optimization strategies such as shared bit and add interconnection channels between dies to improve the efficiency of inter-core coherence maintenance. We use GEM5 in conjunction with the SPLASH-2 benchmark to compare with an unoptimized directory-based hybrid coherence protocol. The results show that the program running speed is increased by 19.3%, the average memory access time is reduced by 23.3%, and the consistency protocol traffic is reduced by 37.8%.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141370001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exploiting sequence characteristics for long-term workload prediction in cloud data centers 利用序列特征预测云数据中心的长期工作量

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3032105

Zongxiao Chen, Weijian Zheng, Yusong Zhou, Huile Wang, Weiping Zheng

{"title":"Exploiting sequence characteristics for long-term workload prediction in cloud data centers","authors":"Zongxiao Chen, Weijian Zheng, Yusong Zhou, Huile Wang, Weiping Zheng","doi":"10.1117/12.3032105","DOIUrl":"https://doi.org/10.1117/12.3032105","url":null,"abstract":"In the realm of cloud computing, long sequence prediction of workloads plays a pivotal role, crucial for optimizing resource allocation and enhancing system performance. However, current research of long-sequence workload forecasting faces a series of challenges, mainly due to the high randomness and instability characteristics of long workload sequences, making it difficult for traditional machine learning methods to provide accurate results. Therefore, we designed a novel approach for long sequence forecasting, thoroughly considering the latent characteristics of cloud workload sequences. Initially, we employ convolution kernels of varying sizes to perform multiscale sequence decomposition, better capturing contextual information and periodic features in long sequence. Furthermore, through fast Fourier transformation, we convert one-dimensional sequences into two-dimensional space, leveraging dilated convolutions to extract effective features within the intra-period and inter-period variations. Ultimately, we introduce an attention mechanism, effectively integrating the intra-period and inter-period variation features into the proposed model. Our method has undergone comprehensive evaluation on publicly available datasets from Google, Alibaba, and Microsoft. Experimental results demonstrate superior accuracy and robustness of our model across various workload types, showcasing its excellent adaptability to dynamic and complex workload scenarios.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multidomain A* algorithm research 多域 A* 算法研究

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031937

Peitao Guo, Zhihong Xi, Guanhua Wang, Fenghao Zheng, Kexin Zhang

引用次数: 0

SP-ADMM: a distributed optimization method of SFC placement for 5G-MEC networks SP-ADMM：5G-MEC 网络 SFC 布置的分布式优化方法

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031950

Zhibo Zhang, Hui-qiang Wang, Shuangyue Niu, Hongwu Lv

{"title":"SP-ADMM: a distributed optimization method of SFC placement for 5G-MEC networks","authors":"Zhibo Zhang, Hui-qiang Wang, Shuangyue Niu, Hongwu Lv","doi":"10.1117/12.3031950","DOIUrl":"https://doi.org/10.1117/12.3031950","url":null,"abstract":"Recently, the combination of a service function chain (SFC) with network function virtualization (NFV) and softwaredefined networking (SDN) has provided customers with flexible and efficient services. The emergence of multi-access edge computing (MEC) further enhances the level of service customization. However, achieving joint optimization of virtual network function (VNF) deployment and flow allocation in resource-constrained scenarios while meeting the diverse requirements of 5G verticals is challenging. Current research rarely addresses dedicated service provisioning for edge servers and considers the additional instantiation overhead introduced by adjusting cloud server parameters. In fact, this is a non-negligible issue during SFC deployment in 5G-MEC scenarios. Based on the above considerations, this paper constructs a joint SFC deployment problem for edge-cloud networks with the goal of maximizing network utility. We first propose a univariate modeling method based on meta-links that effectively avoids the variable coupling problem in traditional multivariate modeling approaches and reduce the problem size by at least half. Subsequently, to solve the NPhard integer nonlinear problem (INLP), we propose a distributed computing architecture named SP-ADMM, which improves the speed and quality of SFC deployment in large-scale scenarios via convex combinatorial formulations and a Viterbi-based heuristic algorithm (PAC-GREP). Finally, we experimentally verify the convergence and approximation of the algorithms. Our solution demonstrates advantages in terms of network utility and convergence speed under the same network resources, increasing service capacity by at least 39%.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The [1,2]-set properties and algorithm analysis of tree 树的[1,2]集特性和算法分析

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031908

Chao Zhang, Tao Chen

引用次数: 0

Distance measure based on geometric compression of Pythagorean fuzzy sets 基于毕达哥拉斯模糊集几何压缩的距离测量法

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3032001

Haoxin Gai, Xiaozhuan Gao

{"title":"Distance measure based on geometric compression of Pythagorean fuzzy sets","authors":"Haoxin Gai, Xiaozhuan Gao","doi":"10.1117/12.3032001","DOIUrl":"https://doi.org/10.1117/12.3032001","url":null,"abstract":"Pythagorean fuzzy sets (PFS) as a generation of Fuzzy sets has the greater representation space in handling uncertain information, which is applied to many fields. Distance between PFS which can measure the difference or discrepancy grade. Obviously, the distance between (1,0) and (0,1) is different from that between (0,0) and (0,1). However, some distance measure methods violate this result. To address above problem, the paper proposes a new distance measure based on geometric compression. In FPS, the sum of squares of membership, non-membership and hesitant is 1. In new method, membership, non-membership and hesitant information are regarded as x, y, z-axis to establish a space rectangular coordinate system. Based on the unit circle, the membership, non-membership and hesitant information are compressed to get the deformable ellipsoid. For hesitant information, it can be regarded to contain membership and non-membership information from the view of Dempster-Shafer evidence theory. What’s more, new distance measure not only satisfies the axiomatic definition of distance measure but also has nonlinear characteristics. In addition, the advantages of new method are indicated by comparing with other distance measure methods. Finally, the paper apply new method in the Multiattribute decision making problem, which provides a promising solution for addressing decision-making problems.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141370727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

NGA-Net: an ECG waveform segmentation algorithm based on semisupervised learning NGA-Net：基于半监督学习的心电图波形分割算法

International Conference on Algorithms, Microchips and Network Applications Pub Date : 2024-06-08 DOI: 10.1117/12.3031916

Nan Lin, Yongpeng Niu, Kaipeng Tang, Hao Duan, Yingkang Han

{"title":"NGA-Net: an ECG waveform segmentation algorithm based on semisupervised learning","authors":"Nan Lin, Yongpeng Niu, Kaipeng Tang, Hao Duan, Yingkang Han","doi":"10.1117/12.3031916","DOIUrl":"https://doi.org/10.1117/12.3031916","url":null,"abstract":"Targeting the challenge where the substantial labeling expense of ECG data contributes to the present dearth of labeled ECG datasets and the subpar segmentation precision of contemporary models, this paper proposes an ECG segmentation model NGA-Net,the model is based on RRU-Net, with the addition of the ASPNL module and the improved Ghost module, in which the improved Ghost module is designed to generate an increased quantity of feature maps using a reduced parameter set, thereby boosting computational efficiency; The ASPNL module can capture ECG signal features from multiple scales to enhance the efficiency of feature extraction. Experimental evidence indicates that the ECG segmentation model, NGA-Net, introduced in this research, exhibits superior performance in comparison to other methodologies when tested on the publicly available LUDB dataset, which demonstrates the effectiveness of NGANet.In this research, we adopt a semi-supervised learning strategy for training the NGA-Net in scenarios with small sample sizes, leveraging data augmentation and consistency training methodologies. The experimental findings corroborate the effectiveness of semi-supervised learning in augmenting the performance of deep learning models.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0