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

Surface Simulation and Design of C-band Energy Selective Surface

学校读者我要写书评

暂无评论

Surface Simulation and Design of C-band Energy Selective Sur...

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Shangyu Lu Guohui Yang Kuang Zhang Yingsong Li School of Electronics and Information Engineering Harbin Institute of Technology Harbin China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

Based on the equivalent circuit model of PIN diode and the full wave simulation method of CST software, the system performance of finite large energy selective surface (ESS) is simulated and analyzed when the number of cells is small. The simulation results show that the working performance of ESS will be degraded by the slight surface deformation caused by external force but not fail completely. Therefore, in the practical application of ESS, attention should be paid to avoid deformation caused by external force extrusion, which will reduce the shielding performance of ESS. The simulation results provide reference value for the practical design and application of energy selective surface.

关键词： Analytical models Deformation Surface waves PIN photodiodes Simulation System performance Force

Self-Organizing Coverage Method of Swarm Robots Based on Dynamic Virtual Force

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Wang, Qiuzhen Zheng, Yue Zou, Juan Liu, Yuan Jianquan, Ouyang Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science School of Cyberspace Science of Xiangtan University Hunan Province Xiangtan China Faculty of School of Computer Science School of Cyberspace Science of Xiangtan University Xiangtan411105 China

Swarm robots often cover designated areas to complete specific tasks, such as forest firefighting or ocean oil spill cleaning. The robot has the ability for local perception and limitedcommunication with surrounding robots, then it is difficult to cope with coverage tasks indynamic environments. This paper proposes a self-organization algorithm for swarm robotsbased on Dynamic Virtual Force (DVF) to cover the dynamic area. One robot in the swarmcan locally perceive the surrounding robots and dynamically select some adjacent robots togenerate virtual repulsion to control its own movement. The swarm robot can be deployed quicklyand uniformly in unknown areas, while being able to adapt itself to changes in dynamic ***, it can adaptively cover parts of an area with different densities, which are dividedaccording to the needs of the area, and different densities require different numbers of robots tobe assigned. We design several groups of simulation experiments, and the results show that thealgorithm achieves good coverage performance and verifies the effectiveness and superiority ofthe method based on DVF. © 2024, The Authors. All rights reserved.

关键词： Robots

High order SF-SFDTD method for solving the time-dependent Schrödinger equation

学校读者我要写书评

暂无评论

High order SF-SFDTD method for solving the time-dependent Sc...

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Pan Pan Guoda Xie Zhixiang Huang Guilin Hou Ziheng Song School of Electronic and Information Engineering Anhui university Hefei China Education of Anhui Province. Anhui Province Key Laboratory of Target Recognition and Feature Extraction Luan Anhui China Ministry of Education. the Key Laboratory of Intelligent Computing and Signal Processing Hefei China Key Laboratory of Electromagnetic Environmental Sensing Anhui Province Anhui University Hefei China Anhui university Hefei China

A high-order spatial filtering-symplectic finite difference time domain (SF-SFDTD) scheme with controllable stability condition is proposed to solve the time-dependent Schrödinger equation (TDSE). Firstly, the higher-order symplectic framework for the discretization of Schrödinger equation is described, and then the spatial filtering method is carried out to extend the stability of the standard SFDTD method. Finally, a numerical example is given to evaluate the correctness of the SF-SFDTD method in numerical solving Schrödinger equation.

关键词： Filtering Filtering algorithms Computational electromagnetics Mathematical models Time-domain analysis Numerical stability Standards

Pyramid Convolution and Multi-Frequency Spatial Attention for Fine-Grained Visual Categorization

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Xu, Qin Li, Yun Zhang, Mengquan Tao, Zhifu Luo, Bin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China School of Big Data and Statistics Anhui University Hefei230601 China

Learning diverse detailed feature is crucial for fine-grained visual categorization (FGVC). However, most of existing methods for FGVC use the standard convolution for feature extraction which leads to the loss of many subtle but important features. Besides, in the existing attention models for FGVC, the features are aggregated by a simple global average pooling operation, which is unable to characterize complex feature information. To address these problems, we propose pyramid convolution and multi-frequency spatial attention (PCMFSA) for FGVC. To capture spatial context dependencies of different levels and avoid the loss of the subtle features, pyramid convolution, which uses convolution kernels with various sizes, is introduced in the backbone network. To reduce the influence of background noise and obtain diverse fine-grained feature information, we propose multi-frequency spatial attention (MFSA) module, in which two channel-wise grouping operations are designed and discrete cosine transform (DCT) in the frequency domain is adopted to enhance features of different spatial positions. Moreover, to mine more valuable regions, peak suppression is used to suppress high-response regions after MFSA. A large number of experimental results show that our method achieves state-of-the-art results on four popularly FGVC datasets. © 2022, The Authors. All rights reserved.

关键词： Convolution

RGBT Tracking via Progressive Fusion Transformer with Dynamically Guided Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhu, Yabin Li, Chenglong Wang, Xiao Tang, Jin Huang, Zhixiang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Key Laboratory of Electromagnetic Environmental Sensing of Anhui Higher Education Institutes School of Electronic and Information Engineering Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China

Existing Transformer-based RGBT tracking methods either use cross-attention to fuse the two modalities, or use self-attention and cross-attention to model both modality-specific and modality-sharing information. However, the significant appearance gap between modalities limits the feature representation ability of certain modalities during the fusion process. To address this problem, we propose a novel Progressive Fusion Transformer called ProFormer, which progressively integrates single-modality information into the multimodal representation for robust RGBT tracking. In particular, ProFormer first uses a self-attention module to collaboratively extract the multimodal representation, and then uses two cross-attention modules to interact it with the features of the dual modalities respectively. In this way, the modality-specific information can well be activated in the multimodal representation. Finally, a feed-forward network is used to fuse two interacted multimodal representations for the further enhancement of the final multimodal representation. In addition, existing learning methods of RGBT trackers either fuse multimodal features into one for final classification, or exploit the relationship between unimodal branches and fused branch through a competitive learning strategy. However, they either ignore the learning of single-modality branches or result in one branch failing to be well optimized. To solve these problems, we propose a dynamically guided learning algorithm that adaptively uses well-performing branches to guide the learning of other branches, for enhancing the representation ability of each branch. Extensive experiments demonstrate that our proposed ProFormer sets a new state-of-the-art performance on RGBT210, RGBT234, LasHeR, and VTUAV datasets. In particular, the improvements of ProFormer on the LasHeR dataset are up to +6.2%/+ 4.1% in PR/SR compared with existing best RGBT tracker. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning algorithms

HSIGene: A Foundation Model for Hyperspectral Image Generation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Pang, Li Cao, Xiangyong Tang, Datao Xu, Shuang Bai, Xueru Zhou, Feng Meng, Deyu The School of Computer Science and Technology The Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China The School of Mathematics and Statistics Northwestern Polytechnical University Shaanxi Xi’an710021 China The National Laboratory of Radar Signal Processing Xidian University Xi’an710071 China The Key Laboratory of Electronic Information Countermeasure and Simulation of the Education Ministry of China Xidian University Xi’an710071 China The School of Mathematics and Statistics The Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Guangdong Guangzhou510555 China

Hyperspectral image (HSI) plays a vital role in various fields such as agriculture and environmental monitoring. However, due to the expensive acquisition cost, the number of hyperspectral images is limited, degenerating the performance of downstream tasks. Although some recent studies have attempted to employ diffusion models to synthesize HSIs, they still struggle with the scarcity of HSIs, affecting the reliability and diversity of the generated images. Some studies propose to incorporate multi-modal data to enhance spatial diversity, but spectral fidelity cannot be ensured. In addition, existing HSI synthesis models are typically uncontrollable or only support single-condition control, limiting their ability to generate accurate and reliable HSIs. To alleviate these issues, we propose HSIGene, a novel HSI generation foundation model which is based on latent diffusion and supports multi-condition control, allowing for more precise and reliable HSI generation. To enhance the spatial diversity of the training data while preserving spectral fidelity, we propose a new data augmentation method based on spatial super-resolution, in which HSIs are upscaled first, and thus abundant training patches could be obtained by cropping the high-resolution HSIs. In addition, to improve the perceptual quality of the augmented data, we introduce a novel two-stage HSI super-resolution framework, which first applies RGB bands super-resolution and then utilizes our proposed Rectangular Guided Attention Network (RGAN) for guided HSI super-resolution. Experiments demonstrate that the proposed model is capable of generating a vast quantity of realistic HSIs for downstream tasks such as denoising and super-resolution. The code and models are available at https://***/LiPang/HSIGene. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

Tiny Object Tracking: A Large-scale Dataset and A Baseline

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhu, Yabin Li, Chenglong Liu, Yao Wang, Xiao Tang, Jin Luo, Bin Huang, Zhixiang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Key Laboratory of Electromagnetic Environmental Sensing Anhui Higher Education Institutes Anhui Provincial Key Laboratory of Multimodal Cognitive Computation Anhui University Hefei230601 China Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China School of Computer Science and Technology Anhui University Hefei230601 China Peng Cheng Laboratory Shenzhen China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Key Laboratory of Electromagnetic Environmental Sensing Anhui Higher Education Institutes Anhui University Hefei230601 China

Tiny objects, frequently appearing in practical applications, have weak appearance and features, and receive increasing interests in meany vision tasks, such as object detection and segmentation. To promote the research and development of tiny object tracking, we create a large-scale video dataset, which contains 434 sequences with a total of more than 217K frames. Each frame is carefully annotated with a high-quality bounding box. In data creation, we take 12 challenge attributes into account to cover a broad range of viewpoints and scene complexities, and annotate these attributes for facilitating the attribute-based performance analysis. To provide a strong baseline in tiny object tracking, we propose a novel Multilevel Knowledge Distillation Network (MKDNet), which pursues three-level knowledge distillations in a unified framework to effectively enhance the feature representation, discrimination and localization abilities in tracking tiny objects. Extensive experiments are performed on the proposed dataset, and the results prove the superiority and effectiveness of MKDNet compared with state-of-the-art methods. The dataset, the algorithm code, and the evaluation code are available at https://***/mmic-lcl/Datasets-andbenchmark-code. Copyright © 2022, The Authors. All rights reserved.

关键词： Distillation

Phase behavior of symmetric diblock copolymers under 3D soft confinement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： He, Zhijuan Huang, Jin Jiang, Kai Shi, An-Chang School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education 411105 China Laboratory of Mathematics and Complex Systems Ministry of Education School of Mathematical Sciences Beijing Normal University Beijing100875 China Department of Physics and Astronomy McMaster University HamiltonONL8S 4M1 Canada

The phase behavior of symmetric diblock copolymers under three-dimensional (3D) soft confinement is investigated using the self-consistent field theory. The soft confinement is realized in binary blends composed AB diblock copolymers and C homopolymers, where the copolymers self-assemble to form a droplet embedded in the homopolymer matrix. The phase behavior of the confined block copolymers is regulated by the degree of confinement and the selectivity of the homopolymers, resulting in a rich variety of novel structures. When the C homopolymers are neutral to the A- and B-blocks, stacked lamellae (SL) are formed where the number of layers increases with the droplet volume, resulting in a morphological transition sequence from Janus particle to square SL. When the C homopolymers are strongly selective to the B-blocks, a series of non-lamellar morphologies, including onion-, hamburger-, cross-, ring-, and cookie-like structures, are observed. A detailed free energy analysis reveals a first-order reversible transformation between SL and onion-like (OL) structures when the selectivity of the homopolymers is changed. Our results provide a comprehensive understanding of how various factors, such as the copolymer concentration, homopolymer chain length, degree of confinement, homopolymer selectivity, affect the self-assembled structures of diblock copolymers under soft 3D confinement. Copyright © 2024, The Authors. All rights reserved.

关键词： Free energy

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for Data Consistency

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional...

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy Data preprocessing Software algorithms Distributed databases Parallel processing Software Partitioning algorithms