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

18th International Conference on Green, Pervasive, and Cloud computing, GPC 2023

作者： Luo, Jihai Dong, Chen Chen, Zhenyi Xu, Li Chen, Tianci College of Computer and Data Science - Fuzhou University Xueyuan Road Fujian Fuzhou360108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Department of Computer Science and Engineering University of South Florida TampaFL33620 United States College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China

ISBN: (纸本)9789819998951

The development of the software and hardware has brought about the abundance and overflow of computing resources. Many Internet companies can lease idle computing resources based on the peak and valley cycles of usage load to provide IaaS service. After the surging development, more and more companies are gradually paying attention to the specific user experience in cloud computing. But there are few works about that aspect in load balance problem. Therefore, we consider the load balancing resource allocation problem, from the perspective of user experience, mainly based on geographical distance and regional Equilibrium, combined with user usage habits, in multiple service periods. A detailed mathematical definition has been established for this problem. This article proposes a mathematical model for the problem, along with an modified CMA-ES (Covariance Matrix Adaptation Evolution Strategy) algorithm, called WS-ESS-CMA-ES algorithm, to allocate computing resources and solve the above problem. The process of using the proposed algorithm to solve the problem of cloud computing resource allocation in real scenarios is simulated, and compared with some other algorithms. The experiment results show that our algorithm performs well. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs

arXiv

引用

arXiv 2024年

作者： Li, Qingya Liu, Shengcai Zou, Juan Tang, Ke Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan411105 China

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most significant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Specifically, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modified benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs

SSRN

引用

SSRN 2024年

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most signiﬁcant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Speciﬁcally, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modiﬁed benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A correlation-breaking interleaving of polar codes in concatenated systems

引用

Science China(Information Sciences) 2021年第10期64卷 270-271页

作者： Ya MENG Liping LI Chuan ZHANG Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education of China Anhui University National Mobile Communications Research Laboratory Southeast University Purple Mountain Laboratories

Dear editor,Polar codes, along with a low complexity successive cancellation(SC) decoding, were discovered in [1] by Ar?kan. It is shown in [2] that the bit errors with the SC decoding are correlated. To improve the performance, other decoding techniques [3, 4] and concatenation schemes [5, 6] were studied. In this study, the theoretical aspects of the error correlation are investigated to improve the decoding performance of polar codes. This is the first attempt to utilize the error correlation to improve the performance of polar codes.

关键词： Information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

Scheduling Multiple Mobile Agents with Abilities of Sensing and Executing Simultaneously

Scheduling Multiple Mobile Agents with Abilities of Sensing ...

引用

Artificial Intelligence of Things and Systems (AIoTSys), International Conference on

作者： Zhipeng Guo Zhiyong Yu Fangwan Huang Chunyu Tu College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

How to schedule public resources to maximize the coverage of crowds has always been a hot topic. There are mainly two types of research. One is the scheduling of static resources, whose coverage efficiency is lower because the resources cannot be moved; the other is the dynamic scheduling of movable public resources, but the existing methods require additional devices to collect crowd volume data. To address this issue, this article introduces a new category of mobile agents that can sense and execute simultaneously. This means that an agent can simultaneously perform crowd volume data collection tasks and crowds coverage tasks in its area. Taking these multi-ability agents as public resources, this article proposes a scheduling method called GE-STMC (Greedy Execute - Spatial and Temporal Monte-Carlo dropout). The method considers the spatiotemporal correlation between areas and evaluates the sensing value and the executing value of areas comprehensively to allocate the agents accordingly. Through the experimental on the real data of Beijing Happy Valley, this method can get 16% larger crowds volume coverage than other baseline methods with the same number of agents.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Privacy-friendly sequential progressive framework for segmented decision making

A Privacy-friendly sequential progressive framework for segm...

引用

Artificial Intelligence of Things and Systems (AIoTSys), International Conference on

作者： Peng Liu Zhiyong Yu Fangwan Huang College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

To achieve progressive and accurate decision-making for long-term time series data while meeting the needs of privacy-friendly and early, this paper proposes a universal framework for sequential progressive decision-making (SPD). This framework first segments the data and sets up multiple columns of neural networks according to the number of segments. Each column can make segmented decisions based on the inputs for the period. Additionally, without sharing the original data, the framework leverages lateral hidden layer connections between preceding and succeeding columns to obtain useful features for subsequent decision-making, gradually improving accuracy while avoiding the risk of data leakage. SPD has the advantages of privacy friendliness, column model diversification, prior knowledge reuse, and easy scalability, making it an effective framework for continuous decision-making. The effectiveness of that was validated using various network models in handwritten digit recognition and electrocardiogram classification tasks. The obtained experimental results reveal that SPD not only enables early decision-making while ensuring accuracy but also achieves accuracy levels comparable to or even surpassing those obtained using complete data, with the added benefit of privacy protection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TransMixer: A Hybrid Transformer and CNN Architecture for Polyp Segmentation

TransMixer: A Hybrid Transformer and CNN Architecture for Po...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Huang, Yanglin Tan, Donghui Zhang, Yuan Li, Xuanya Hu, Kai Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Affiliated Hospital of Xiangnan University Chengzhou423000 China Baidu Inc Beijing100085 China Xiangnan University Key Laboratory of Medical Imaging and Artificial Intelligence of Hunan Province Chenzhou423000 China

ISBN: (纸本)9781665468190

Learning how to fully extract global representations and local features is a key factor in improving the performance of polyp segmentation. In this paper, we explore the potential of combined techniques of Transformers and convolutional neural networks (CNNs) to address the challenges of polyp segmentation. Specifically, we present TransMixer, a hybrid interaction fusion architecture of the Transformer branch and the CNN branch, which is able to enhance the local details of global representations and the global context awareness of local features. To achieve this, we first bridge the semantic gap between the Transformer branch and the CNN branch through the Interaction Fusion Module (IFM), and then make full use of both respective properties to enhance polyp feature representations. After that, we further propose the Hierarchical Attention Module (HAM) to collect polyp semantic information from high-level features to gradually guide the recovery of polyp spatial information in low-level features. Quantitative and qualitative results show that the proposed model is more robust to various complex situations compared to existing methods, and achieves state-of-the-art performance in polyp segmentation. © 2022 IEEE.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Circular Decomposition and Cross-Modal Recombination for Multimodal Sentiment Analysis

Circular Decomposition and Cross-Modal Recombination for Mul...

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Haijian Liang Weicheng Xie Xilin He Siyang Song Linlin Shen School of Computer Science & Software Engineering Computer Vision Institue Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Computing and Mathematical Sciences University of Leicester National Engineering Laboratory for Big Data System Computing Technology Shenzhen University

Multimodal Sentiment Analysis is a burgeoning research area, leveraging various modalities to predict the sentiment score. Nevertheless, previous studies have disregarded the impact of noise interference on specific modal sentiments during video recording, thereby compromising the accuracy of sentiment prediction. In this paper, we propose the Guided Circular Decomposition and Cross-Modal Recombination (GCD-CMR) model, which aims to eliminate contaminated sentiment features in a fine-grained way. To achieve this, we utilize tailored global information specific to each modality to guide the circular decomposing process in the GCD module, to produce a set of sentiment prototypes. Subsequently, in the CMR module, we align cross-modal sentiment prototypes and remove the contaminated prototypes for recombination. Experimental results on two publicly available datasets demonstrate that our model surpasses state-of-the-art models, confirming the effectiveness of our proposed method. We release the code at: https://***/nianhua20/GCD-CMR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Edge-Preserving Multi-Exposure Fusion with Guided Filtering for Structural Patch Decomposition

Edge-Preserving Multi-Exposure Fusion with Guided Filtering ...

引用

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Yang Zhen Junwei Qi Yingsong Li College of Information and Communication Engineering Harbin Engineering University Harbin China College of Computer Science and Technology Harbin Engineering University Harbin China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

Multi-exposure image fusion (MEF) is one of the effective ways to obtain high dynamic range (HDR) images. Multi-scale structural patch decomposition based MEF(MSPD) and edge-preserving structural patch decomposition (MESPD) have achieved state-of-the-art fusion quality. MESPD incorporates edge-preserving factors into MSPD to preserve details in a single-scale setting. However, we find that the edge-preserving factors put too much emphasis on the edge, resulting in artifacts on some edges and loss of details. To tackle this issue, guided filter is introduced into MSPD, which is directly used as an edge-preserving filter instead of mean filter to implicitly decompose images. In addition, we have designed a flexible adaptive weight, which can further maintain details of the light and dark areas. Likewise, we inherit MESPD and MSPD to extend our method to multi-scale framework. Extensive experimental results demonstrate our method can produce satisfactory results in both static and dynamic scenes with fewer artifacts and low computational cost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LEARNING MONOTONIC ATTENTION IN TRANSDUCER FOR STREAMING GENERATION

arXiv

引用

arXiv 2024年

作者： Ma, Zhengrui Feng, Yang Zhang, Min Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Key Laboratory of AI Safety Chinese Academy of Sciences China University of Chinese Academy of Sciences China School of Future Science and Engineering Soochow University China

Streaming generation models are increasingly utilized across various fields, with the Transducer architecture being particularly popular in industrial applications. However, its input-synchronous decoding mechanism presents challenges in tasks requiring non-monotonic alignments, such as simultaneous translation, leading to suboptimal performance in these contexts. In this research, we address this issue by tightly integrating Transducer’s decoding with the history of input stream via a learnable monotonic attention mechanism. Our approach leverages the forward-backward algorithm to infer the posterior probability of alignments between the predictor states and input timestamps, which is then used to estimate the context representations of monotonic attention in training. This allows Transducer models to adaptively adjust the scope of attention based on their predictions, avoiding the need to enumerate the exponentially large alignment space. Extensive experiments demonstrate that our MonoAttn-Transducer significantly enhances the handling of non-monotonic alignments in streaming generation, offering a robust solution for Transducer-based frameworks to tackle more complex streaming generation tasks. Codes: https://***/ictnlp/MonoAttn-Transducer. Copyright © 2024, The Authors. All rights reserved.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：