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

5th IEEE International Conference on Electronic information and Communication Technology, ICEICT 2022

作者： Li, Nana Pan, Xueli Yang, Lixia Huang, Zhixiang Wu, Zhenhua Zhang, Xianqi Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Hefei China Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Hefei China East China Institute of Optoelectronic Integrated Devices Suzhou China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

Due to the non-uniformity of ship target scattering, speckle noises and side lobes, synthetic aperture radar (SAR) ship target detection is facing great challenges. Therefore, to improve the detection performance in this scenario, the ship detection method based on the local saliency enhancement is proposed in this paper. Firstly, the proposed method improves the target-to-clutter ratio (TCR) by combining the relative differences of multi-features between ship target and the clutter background, and the threshold segmentation is performed based on the final local enhancement results. The experimental results show that the proposed method can suppress clutter background and speckle noises, improve the TCR and the algorithm has a high detection rate and a low false alarm rate in the complex background and multi-target marine environment. © 2022 IEEE.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

A Cloud computing User Experience Focused Load Balancing Method Based on Modified CMA-ES Algorithm 18th

A Cloud Computing User Experience Focused Load Balancing Met...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Preprocessed GMRES for fast solution of linear equations

arXiv

引用

arXiv 2024年

作者： Zhang, Juan Luo, Yiyi Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University China

The article mainly introduces preprocessing algorithms for solving linear equation systems. This algorithm uses three algorithms as inner iterations, namely RPCG algorithm, ADI algorithm, and Kaczmarz algorithm. Then, it uses BA-GMRES as an outer iteration to solve the linear equation system. These three algorithms can indirectly generate preprocessing matrices, which are used for solving equation systems. In addition, we provide corresponding convergence analysis and numerical examples. Through numerical examples, we demonstrate the effectiveness and feasibility of these preprocessing methods. Furthermore, in the Kaczmarz algorithm, we introduce both constant step size and adaptive step size, and extend the parameter range of the Kaczmarz algorithm to α ∈ (0, ∞). We also study the solution rate of linear equation systems using different step sizes. Numerical examples show that both constant step size and adaptive step size have higher solution efficiency than the solving algorithm without preprocessing. © 2024, CC BY.

关键词： Linear equations

来源：评论

学校读者我要写书评

暂无评论

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 2023, IRC 2023

作者： Cao, Yice Zhu, Dayi Wu, Zhenhua Chen, Jie Huang, Zhixiang Yang, Lixia Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University Hefei230601 China 38th Research Institute China Electronics Technology Group Corporation Hefei230088 China

ISBN: (纸本)9781839539954

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. © The Institution of Engineering & Technology 2023.

关键词： Polarimeters

来源：评论

学校读者我要写书评

暂无评论

On book thickness parameterized by the vertex cover number

引用

Science China(information Sciences) 2022年第4期65卷 112-113页

作者： Yunlong LIU Jie CHEN Jingui HUANG School of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University

Dear editor,Book thickness for graphs forms a major theme in graph theory and has a broad application in the fields of sorting permutations, fault tolerant VLSI design, parallel computing, and others. The book Thickness problem, even if the vertex order is taken as part of the input, was shown to be NP-complete in general [1, 2]. Just because of this, parameterized algorithms have been proposed to deal with it [3].

关键词： Book Thickness Vertex Cover Number Linear Order 1-page embedding graph kernel

来源：评论

学校读者我要写书评

暂无评论

Relaxing Distillation Constraints for Improved New Class Learning in Continual Semantic Segmentation

Relaxing Distillation Constraints for Improved New Class Lea...

引用

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

作者： Zheng Ti Xuze Hao Renhai Chen College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Continual Semantic Segmentation (CSS) aims to continuously learn new classes while mitigating catastrophic forgetting. Existing CSS methods primarily address this challenge through knowledge distillation. While they focus on maintaining stability for old classes, this emphasis often restricts plasticity in learning new ones. In this work, we propose two plug-and-play methods to better balance stability and plasticity. First, for feature map distillation, we replace pixel-level constraints with statistical information extraction within a window, improving the learning of new classes while preserving structural integrity to overcome forgetting. Second, we use relative ranks of predictions to replace exact probabilistic values to loosen the constraints in the logit distribution of old classes. Extensive experiments demonstrate that our methods outperform state-of-the-art methods when integrating into several baselines across various CSS scenarios.

关键词： Semantic segmentation Semantics Signal processing Feature extraction Probabilistic logic information retrieval Acoustics Data mining Speech processing

来源：评论

学校读者我要写书评

暂无评论

Dual-layer Broadband High-gain Circularly Polarized Patch Antenna with L-shaped Stub

Dual-layer Broadband High-gain Circularly Polarized Patch An...

引用

2023 IEEE International Workshop on Electromagnetics: Applications and Student Innovation Competition, iWEM 2023

作者： Li, Wen Xue, Wei Li, Yingsong Loh, Tian Hong Chung, Kwok L. Harbin Engineering University College of Information and Communication Engineering Harbin150001 China Anhui University The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China National Physical Laboratory Electromagnetic and Eletrochemical Technologies Department Middlesex United Kingdom Huizhou University School of Computing Science and Engineering Huizhou516007 China

ISBN: (纸本)9798350336740

This paper introduced a dual-layer broadband high-gain circularly polarized (CP) antenna. The proposed broadband CP antenna consists of the radiating patch and couping structure, which is made up of opening slot patch and L-shaped stub. An axial-ratio bandwidth of 26 % (4.36-5.66 GHz) is shown by this proposed dual-layer CP patch antenna with a simulated -10-dB reflection coefficient bandwidth of 37 % (4.23-6.15 GHz). The broadband characteristics offered by this CP antenna are promising for a wide range of future applications. © 2023 IEEE.

关键词： Microstrip antennas

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based Transaction Scheme for Massive MIMO Channel Estimation 11

Blockchain-based Transaction Scheme for Massive MIMO Channel...

引用

11th International Conference on networks, Communication and computing, ICNCC 2022

作者： Huang, Yu Zhi, Hui Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China School of Electronic and Information Engineering Anhui University Hefei230601 China

ISBN: (纸本)9781450398039

In wireless communication systems, accurate channel estimation is essential to ensure the performance of wireless communication systems. Massive Multiple Input Multiple Output (M-MIMO) systems have a dramatic increase in the number of channels to be estimated due to the large number of antennas, which poses a great challenge to the computing resources of the base station, and one solution is offloading these computing tasks of channel estimation to other computing nodes with more computing resources (such as servers). However, in real life, computing nodes are not willing to participate in channel estimation because of their equipment and operation cost. In order to solve this problem, this paper introduces blockchain technology and designs a blockchain-based transaction scheme for channel estimation (BTS-CE) to solve the problem of computing resources transaction for massive MIMO channel estimation, and designs the specific process of the scheme. In order to solve the problem that computing nodes cannot complete the computation task due to failure or malicious disconnection, a task allocation model is designed to assign a computation task to multiple computation nodes. The security of the transactions is guaranteed through the blockchain. Practical Byzantine Fault Tolerance (PBFT) consensus mechanism cannot be applied to the public chain due to its low performance caused by a large number of nodes participating in consensus, this problem is solved by selecting some active nodes as consensus nodes. Simulation results show that improved PBFT(IPBFT) is lower in transaction delay and higher in throughput than PoW consensus mechanism. © 2022 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：