检索结果-内蒙古大学图书馆

Congestion Control Method for Campus Opportunity Network Based on Ant Colony Algorithm

Chinese Journal of Electronics 2025年第2期34卷 576-585页

作者： Li Peng Cao Yumei Jia Huan Wang Xiaoming Wu Xiaojun School of Computer Science Shaanxi Normal University Xi’an 710119 China Key Laboratory of Intelligent Computing and Service Technology for Folk Song Ministry of Culture and Tourism Xi’an 710119 China Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an 710062 China Engineering Laboratory of Teaching Information Technology of Shaanxi Province Xi’an 710119 China Xi’an Key Laboratory of Cultural Tourism Resources Development and Utilization Xi’an 710062 China

Due to the limited storage resources of portable devices, congestion control has become a hot direction in opportunity networks. To address the issue of heavy loads on certain nodes, which can impact routing efficiency and overall network performance, this paper proposes a load-balancing opportunity routing algorithm based on ant colony optimization (LBOR) in a campus environment. The congestion status is represented by the ratio of message drop receptions within a certain period and the occupancy of the cache. Path selection is based on the concentration of pheromones and the pheromones on the path are updated when a data transmission is completed. In the event of congestion, the algorithm prevents a large amount of data from entering the node and unloads the data to other nodes, even if they are not the optimal relay nodes. Experimental results demonstrate that the proposed algorithm effectively improves data transmission success rates, reduces network loads, and decreases the number of packet losses, especially under low latency conditions.

关键词： Opportunity network Routing protocol Congestion control Cache management

来源：评论

学校读者我要写书评

暂无评论

AN ACCELERATED MANN-TYPE METHOD FOR SPLIT COMMON FIXED POINT PROBLEM IN HILBERT SPACES

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2024年第1期86卷 3-16页

作者： Yang, Lan Zhu, Li-Jun Postolache, Mihai School of Mathematics and Information Science North Minzu University Yinchuan750021 China The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province North Minzu University Yinchuan750021 China Bucharest060042 Romania Health Big Data Research Institute of North Minzu University Yinchuan750021 China Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy Bucharest050711 Romania

In this paper, we introduce a new method to solve split common fixed point problem of demicontractive operators in Hilbert spaces, which is based on the Wang method, inertial method and Mann method. Strong convergence result of the suggested algorithm is proved, and our results are utilized to study split feasibility problem and split variational inequality problem in Hilbert spaces. Finally, we compare the convergence speed of our algorithm with the Wang algorithm by a numerical example. © 2024, Politechnica University of Bucharest. All rights reserved.

关键词： Hilbert spaces

来源：评论

学校读者我要写书评

暂无评论

Modeling Route Representation With Mixed-Scale Hierarchical Transformer

Modeling Route Representation With Mixed-Scale Hierarchical ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Hanyuan Zhang Yuqi Chen Xinyu Zhang Qize Jiang Liang Li Baihua Zheng Weiwei Sun School of Computer Science Fudan University Shanghai Key Laboratory of Data Science Fudan University Shanghai Institute of Intelligent Electronics & Systems School of Computing and Information Systems Singapore Management University

Modeling route representation aims to obtain contextual representations of an entire route for various traffic-related tasks. In reality, spatial-temporal data often exhibits multi-scale characteristics, which are utilized by many studies to enhance their performance. However, there is still a lack of in-depth research on how to effectively incorporate the multi-scale spatial-temporal information into transformer structure to adequately model route representation. In this paper, we propose a novel hierarchical route representation framework called RouteMT, which effectively captures multi-scale spatial-temporal characteristics of routes and leverages a mixed-scale transformer architecture to fuse intra and interroute features. Experiments on real data confirm RouteMT’s superior performance and versatility.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Load Balancing Strategy Of "Container Virtual Machine" Cloud Microservice Based On Deadline Limit 14

A Load Balancing Strategy Of "Container Virtual Machine" Clo...

引用

14th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2022

作者： Xia, Hong Liu, MengDi Chen, YanPing Jin, XiaoMin Wang, ZhongMin Wang, FengWei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China ZTE Corporation No.55 Hi-tech Road South Shenzhen518057 China

ISBN: (纸本)9781665499781

Aiming at the problem of workflow scheduling under the "container virtual machine" two-tier structure in cloud microservice workflow application, a "container virtual machine" load balancing strategy based on deadline limit (container virtual machine load) is proposed. Balance strategy), CV LBMs strategy first obtains the optimal economic configuration of the corresponding instance of the micro service according to historical data, and calculated the list of remaining resources in the leased virtual machine;Determined whether the virtual machine is on the virtual machine according to the container image list in the virtual machine. Whether a corresponding container image exists, and create a new container on the virtual machine that already has a container image to reduce the time to extract the container image. The workflow simulation results showed that compared with the existing algorithms, the C-V LBMs strategy had the ability to meet the deadline success rate and reduced the cost. © 2022 IEEE

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

ALEDAR: An Attentions-based Encoder-Decoder and Autoregressive model for workload Forecasting of Cloud data Center 25

ALEDAR: An Attentions-based Encoder-Decoder and Autoregressi...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Sun, Wei Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing School of Computer Science Nanjing China

ISBN: (纸本)9781665405270

Effective workload forecasting can provide a reference for resource scheduling in cloud data centers. Compared with the normal single data center, the multi-data center has a more complicated architecture design and provides more diverse computing services. The traditional load forecasting models need too much manual intervention to set up the parameters, meanwhile, the emerging neural network methods are not sensitive to the prediction scale and cannot capture the long-term associations between input features. To address these challenges, we propose a hybrid model named Attentions-based LSTM Encoder-Decoder network and Autoregressive model (ALEDAR), which combines neural network and statistical learning methods, to analyze the linear and nonlinear characteristics of the load sequence over time in a multi-cloud data center environment. ALEDAR uses a dual attention-based Encoder-Decoder architecture to extract the relationships between historical workload data, the design can also avoid the deterioration of prediction effect caused by long-range data scale, the output layer is composed of a three-layer perceptron. Moreover, ALEDAR employs an autoregressive module to capture the linear trend of the load sequence and eliminate scale insensitivity of input and output data. The experimental results show that our approach is adaptive and can improve the performance of host workload prediction in both single cloud data center and multi-cloud data center environments. We evaluate the performance of the proposed algorithm on real-world data sets and observe consistent improvement of 9.7% - 34.2% over the state-of-the-art baselines. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Consistency-aware unsupervised label learning for cross-domain person re-identification

引用

Multimedia Tools and Applications 2024年 1-20页

作者： Geng, Yanbing Lian, Yongjian Cui, Fangshu Zhang, Xiaowei Zhou, Mingliang Zhang, Geao School of Data Science and Technology North University of China Shanxi Taiyuan030051 China Shandong Key Laboratory of Intelligent Information Processing School of Computer Science and Technology Qingdao University Qingdao266071 China School of Computer Science Chongqing University 174 Shazheng Street Shapingba District Chongqing400044 China College of Information Science and Engineering Northeastern University 11 Lane 3 Wenhua Road Heping District Liaoning Shenyang110819 China

Un-refined pseudo labels always disturb the cross-domain Re-ID performance in unsupervised clustering methods. In this paper, we propose a consistency-aware unsupervised label learning network to refine noisy labels for promising domain adaptation. Specifically, we use a hetero-generated label consistency constraint to mine possible label information, keep a reference consistency of the target pairs on the relative comparative characteristics. We then use a cross-granularity attention consistency constraint to refine the pseudo labels meanwhile learning multi-granularity discriminative representation, keeping a self-similarity consistency of the corresponding parts on the discriminative regions. Our model is fine-tuned by the refined pseudo-labels to reduce the domain gap while coping with the intra-domain variation. Experimental results demonstrate that the proposed method can achieve superior performance on several benchmark datasets. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Simulation analysis of erosion characteristics of slurry pipelines based on CFD-DDPM pipeline parameters

Simulation analysis of erosion characteristics of slurry pip...

引用

第43届中国控制会议

作者： Haoran Yuan Jiande Wu Xin Xiong Faculty of Information Engineering and Automation Kunming University of Science and Technology Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Yunnan Key Laboratory of Intelligent Control and Application Kunming University of Science and Technology

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

In order to explore the impact of pipe diameter, bend-diameter ratio and bend angle on the erosion of slurry pipe, a numerical simulation method approach grounded in Computational Fluid Dynamics-Dense Discrete Phase Model(CFD-DDPM)is proposed. Firstly, the geometric models of bends with different pipe diameters, bend-diameter ratios, and bend angles are constructed;secondly, the slurry pipe erosion model based on Dense Discrete Phase Model(DDPM) is constructed;then, model validation is conducted on the slurry pipe erosion model to affirm the accuracy of the model;finally, the computational fluid dynamics method is employed to simulate the erosion and wear behavior of the pipeline, to investigate the impact of pipe diameter, bend-diameter ratio and bend angle on the erosion and wear of the slurry pipeline. At the same time, gray correlation analysis was also used to analyze the significant relationship between the three pipeline factors and erosion and wear. The results show that the main erosion area is not determined, with the change of the pipeline parameters, the most serious erosion area will move;the effect of different pipeline parameter variations on the erosion rate is different, in which the pipe diameter of the largest impact, the second largest bend-diameter ratio, the smallest impact of the bend angle. Therefore, in the design of slurry pipeline, should first consider the influence of pipe diameter factors.

关键词： Slurry pipeline Erosion wear Numerical simulation Computational Fluid Dynamics

来源：评论

学校读者我要写书评

暂无评论

A Sparsity Knowledge Transfer-Based Evolutionary Algorithm for Large-Scale Multitasking Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Wu, Chengming Tian, Ye Zhang, Limiao Xiang, Xiaoshu Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230039 China Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China

Multitasking multi-objective evolutionary algorithms (MMEAs) have been extensively studied in the past decade, which mainly concentrate on multitasking multi-objective optimization problems (MMOPs) with dozens of decision variables. Nevertheless, many real-world MMOPs have thousands of decision variables and are of sparse nature, which are regarded as large-scale MMOPs (LSMMOPs) in this study. To address LSMMOPs, a sparsity knowledge transfer-based evolutionary multi-objective algorithm, termed EMO-SKT, is proposed for efficiently finding high-quality sparse solutions of LSMMOPs. For each target optimization task, a sparsity knowledge transfer strategy extracts sparse distribution information from a source task and incorporates the information into the target task for two types of sparsity knowledge: variable importance and sparse degree. The variable importance is utilized to produce high-quality sparse solutions during the evolutionary search for EMO-SKT, while the sparse degree facilitates the reduction of search space and thus speeds up the convergence of the evolutionary search. Experimental results on eight benchmark problems and six practical LSMMOPs demonstrate the effectiveness of the sparsity knowledge transfer strategy. Furthermore, the proposed EMO-SKT is capable of efficiently finding high-quality sparse solutions on an LSMMOP with over 1000 decision variables. In comparison with five state-of-the-art multitasking or sparse optimization algorithms, the proposed EMO-SKT exhibits superior performance in terms of both solution quality and search efficiency. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Single Image 3D Reconstruction Algorithm Based on Parallel Double-Branch Pyramid Stacking Network 5

Single Image 3D Reconstruction Algorithm Based on Parallel D...

引用

2023 5th International Conference on Artificial Intelligence Technologies and Applications, ICAITA 2023

作者： Ku, Yintao Zhang, Yumei Yang, Honghong Zhao, Yanqing Li, Jinshan Zhou, Yulin Wu, Xiaojun Key Laboratory of Modern Teaching Technology Ministry of Education Shaanxi Normal University Xi'an China School of Computer Science Shaanxi Normal University Xi'an China Key Laboratory of Intelligent Computing and Service Technology for Folk Song Ministry of Culture and Tourism Xi'an China

Limited visual information contained in single images and complex motion models of objects may lead to severe fragmentation and confusion of model backbone in the 3D reconstruction of objects. In order to fully extract feature information in a single image and reduce noise interference caused by environmental factors in 3D reconstruction, a Parallel Dual-Branch Pyramid Stacking Network (PDB-PSN) model is proposed. A parallel dual-branch network model is used to construct an encoder-decoder framework based on cascaded feature extraction, encode/decode high and low-resolution features in a single image, and then convert from 2D to 3D through implicit functions to achieve the 3D reconstruction of target objects in a single image. A cascaded feature extraction network is used as a low-resolution feature extraction network to extract global features of objects. In the high-resolution feature extraction branch, three concatenated hourglass networks and dilated convolutions are used in the hourglass network to increase the receptive field and obtain more global information in order to maintain the integrity of the reconstructed object limbs. A threshold processing module is set to remove irrelevant information and ensure the integrity of global information, and meanwhile, to reduce the interference of irrelevant noise information. Simulation experiments on a self-built terracotta dataset show that the PDB-PSN model can completely reconstruct the 3D model in a single image and effectively eliminate model fragmentation in the reconstruction results. © Published under licence by IOP Publishing Ltd.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

LSTM-based Pedestrian Trajectory Prediction Model under the General Direction Mechanism: DIR-LSTM 3

LSTM-based Pedestrian Trajectory Prediction Model under the ...

引用

3rd International Conference on Electronic InformationTechnology and Smart Agriculture, ICEITSA 2023

作者： Luo, Junyuan Fu, Qiongfang Xiao, Jianhua Xiao, Hongbo Liao, Jiyong School of Computer Science and Engineering Huaihua University Hunan Huaihua China Key Laboratory of Wuling-Mountain Health Big Data Intelligent Processing Application in Hunan Province Universities Hunan Huaihua China Key Laboratory of Intelligent Control Technology for Wuling-Mountain Ecological Agriculture in Hunan Province Hunan Huaihua418000 China

ISBN: (纸本)9798400716775

Accurate prediction of future traffic flow trends is essential to solve urban transportation problems. However, traffic flow prediction faces great challenges due to the multimodal nature of pedestrian behavior and the complexity of the traffic environment. Although a large number of studies have been conducted to investigate these issues in depth, there are still some limitations. In order to address these challenges more effectively, we propose a pedestrian trajectory prediction model based on long-short-term memory networks (LSTMs): the DIR-LSTM. The model introduces an innovative generalized direction mechanism and a self-attention mechanism, which captures pedestrian movement patterns more comprehensively and accurately by predicting overall directional movements first and then gradually subdividing them into individual directions of movement. The DIR-LSTM is designed to address the challenges posed by the diversity of pedestrian behaviors and the complexity of urban environments. To validate the state-of-the-art of the model, we conducted experiments using the publicly available ETH [10] and UCY [9] datasets. The experiments demonstrate that DIR-LSTM performs better in terms of accuracy compared to other models, providing a more reliable prediction tool for future urban traffic management. © 2023 ACM.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：