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

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

来源：评论

学校读者我要写书评

暂无评论

SwinNet: Swin Transformer Drives Edge-Aware RGB-D and RGB-T Salient Object Detection

arXiv

引用

arXiv 2022年

作者： Liu, Zhengyi Tan, Yacheng He, Qian Xiao, Yun Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Anhui University Hefei China

Convolutional neural networks (CNNs) are good at extracting contexture features within certain receptive fields, while transformers can model the global long-range dependency features. By absorbing the advantage of transformer and the merit of CNN, Swin Transformer shows strong feature representation ability. Based on it, we propose a cross-modality fusion model, SwinNet, for RGB-D and RGB-T salient object detection. It is driven by Swin Transformer to extract the hierarchical features, boosted by attention mechanism to bridge the gap between two modalities, and guided by edge information to sharp the contour of salient object. To be specific, two-stream Swin Transformer encoder first extracts multi-modality features, and then spatial alignment and channel re-calibration module is presented to optimize intra-level cross-modality features. To clarify the fuzzy boundary, edge-guided decoder achieves inter-level cross-modality fusion under the guidance of edge features. The proposed model outperforms the state-of-the-art models on RGB-D and RGB-T datasets, showing that it provides more insight into the cross-modality complementarity ***://***/liuzywen/SwinNet © 2022, CC0.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A RIS-Aided MIMO Secure Communication Scheme Based on Subarray Partition

A RIS-Aided MIMO Secure Communication Scheme Based on Subarr...

引用

International Conference on Computer and Communications (ICCC)

作者： Suzhen Wang Hui Zhi Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China School of Electronic and Information Engineering Anhui University Hefei China

Subarray partition of reconfigurable intelligent surface (RIS) can significantly reduce the computational complexity of solving optimal reflection coefficients. However, there is no research about the RIS subarray partition of RIS-aided multiple-input multiple-output (MIMO) communication for the eavesdropper scenario. In this paper, we intend to solve the optimization subarray partition problem for the eavesdropper scenario, design a RIS-aided MIMO secure communication scheme based on subarray partition (RSC-SP). We consider minimizing the number of subarrays while satisfying secrecy rate requirements. First, this problem is described as a nonconvex combinatorial optimization problem, then we solve it by combining alternating optimization and bisection. In this scheme, we derive the closed expressions of the optimal transmit covariance matrix and the optimal reflection coefficients of RIS. The alternating optimization algorithm is used to jointly optimize the transmit covariance matrix and the reflection coefficients of RIS, the bisection method is used to calculate the minimum number of subarrays. Simulation results show that compared with the traditional scheme without subarray partition, RSC-SP can significantly reduce the computational complexity while meeting secrecy rate requirements.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Step-Size Sparse Millimeter Wave Imaging Algorithm Based on Approximate Observations

Adaptive Step-Size Sparse Millimeter Wave Imaging Algorithm ...

引用

International Conference on Computer Science and Network Technology (ICCSNT)

作者： Dianhao Wang Xinqi Huang Canping Yu Qi Mao Yingsong Li College of Information and Communication Engineering Harbin Engineering University Harbin China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

The currently constructed millimeter wave imaging system has the problems of long sampling time and more sampling points of antenna units, and the use of compressed perception algorithm can improve the imaging quality when the number of sampling points are much smaller than the Nyquist distance sampling. The traditional compressed perception algorithm can achieve better sparse recovery than the matched filter imaging algorithm, but there is a large dimension of the measurement matrix and high computational complexity. For the problems of difficult data processing and large dimensions of measurement matrix, a sparse imaging regularization model is constructed based on approximate observation, and an improved soft threshold iterative algorithm is used with adaptive step size, which improves the convergence performance, reduces the computational complexity of the sparse recovery dramatically and achieves a better quality of sparse imaging than the traditional compressed perception algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Affine-Projection Maximum Asymmetric Correntropy Criterion Algorithm Under System Identifications

Affine-Projection Maximum Asymmetric Correntropy Criterion A...

引用

International Conference on Computer Science and Network Technology (ICCSNT)

作者： Yan Peng Xinqi Huang Canping Yu Qi Mao Yingsong Li College of Information and Communication Engineering Harbin Engineering University Harbin China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

The Affine-Projection Maximum Asymmetric Correntropy Criterion (APMACC) is constructed, drawing upon the fundamental principles of the maximum asymmetric correntropy criterion and an affine-projection scheme. The APMACC algorithm incorporates the asymmetric Gaussian model as a kernel function within the Affine-Projection (AP) algorithm framework, thereby endowing it with robustness against asymmetrically distributed noise. Furthermore, the bound for step-size is established in the literature. Simulation results demonstrate that the APMACC has fast convergence and low steady-state.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Complex-valued cross-domain few-shot learning network for PolSAR image classification

Complex-valued cross-domain few-shot learning network for Po...

引用

IET International Radar Conference (IRC 2023)

作者： Yice Cao Dayi Zhu Zhenhua Wu Jie Chen Zhixiang Huang Lixia Yang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University Hefei 230601 People's Republic of China

ISBN: (数字)9781837240982

Gathering reliable labeled samples for polarimetric synthetic aperture (PolSAR) image classification is laborious. Moreover, applying a trained classifier to new domains often leads to noticeable performance degradation due to domain disparities. Therefore, this paper proposes the novel complex-valued cross-domain (CD) few-shot learning classification (CCFSLC) method for PolSAR images to address these issues. Firstly, the transferrable knowledge learning module (TKLM) with a complex-valued feature encoder (CVFE) is trained using source data with sufficient labeled samples. Then, the deep few-shot learning module (DFSLM), constructed using the pre-trained CVFE, is trained by episodes in both source and target domains, with only minimal target labeled samples. Meanwhile, the adversarial domain adaptation module (ADAM) is employed to eliminate domain shift. The proposed CCFSLC mainly focuses on exploring discriminative information from raw PolSAR data, while reducing the domain gap to recognize novel categories in unseen domains with only a few annotated samples. Experiments on typical PolSAR datasets validate the effectiveness of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：