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

Investigation on ULA Fitting Promoting Low Coupling Sparse Arrays

学校读者我要写书评

暂无评论

Investigation on ULA Fitting Promoting Low Coupling Sparse A...

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Yichang Yao Wanlu Shi Yingsong Li Zhixiang Huang Guohui Yang Kuang Zhang College of Information and Communication Engineering Harbin Engineering University 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 School of Electronics and Information Engineering Harbin Institute of Technology Harbin China

A low coupling sparse array (LCSA) is presented, analyzed and discussed on the basis of the recent proposed uniform linear array (ULA) fitting scheme with close-expressions, and its performance with different uniform subarrays in the basic layer is investigated via parameter estimation like direction-of-arrival(DOA). The results gives a superior performance for the presented LCSA.

关键词： Couplings Mutual coupling Direction-of-arrival estimation Fitting Estimation Computational electromagnetics

Some bounds on the cardinality of the b-symbol weight spectrum of codes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Hongwei Li, Shitao Shi, Minjia Xia, Shu-Tao Solé, Patrick Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen518055 China School of Mathematical Sciences Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Centrale Marseille CNRS I2M Aix Marseille University Marseille13009 France State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the b-symbol distance spectrum. We examine this question for various types of codes, including unrestricted codes, additive codes, linear codes, and cyclic codes, successively. For the first three cases, we determine the maximum size of the b-symbol distance spectra of these codes smoothly. For the case of cyclic codes, we introduce three approaches to characterize the upper bound for the cardinality of the b-symbol weight spectrum of cyclic codes, namely the period distribution approach, the primitive idempotent approach, and the b-symbol weight formula approach. As two by-products of this paper, the maximum number of symplectic weights of linear codes is determined, and a basic inequality among the parameters [n, k, dH(C)]q of cyclic codes is provided. © 2024, CC0.

关键词： Hamming distance

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mec...

International Conference on Computer Supported Cooperative Work in Design

作者： Yuejia Wu Jian-Tao Zhou College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models.

关键词：

CRSOT: Cross-Resolution Object Tracking using Unaligned Frame and Event Cameras

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Yabin Wang, Xiao Li, Chenglong Jiang, Bo Zhu, Lin Huang, Zhixiang Tian, Yonghong Tang, Jin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University China School of Computer Science and Technology Anhui University China School of Artificial Intelligence Anhui University China Beijing Institute of Technology Beijing China School of Electronic and Information Engineering Anhui University China Peng Cheng Laboratory Shenzhen China School of Computer Science Peking University Beijing China School of Electronic and Computer Engineering Peking University Shenzhen China

Existing datasets for RGB-DVS tracking are collected with DVS346 camera and their resolution (346 × 260) is low for practical applications. Actually, only visible cameras are deployed in many practical systems, and the newly designed neuromorphic cameras may have different resolutions. The latest neuromorphic sensors can output high-definition event streams, but it is very difficult to achieve strict alignment between events and frames on both spatial and temporal views. Therefore, how to achieve accurate tracking with unaligned neuromorphic and visible sensors is a valuable but unresearched problem. In this work, we formally propose the task of object tracking using unaligned neuromorphic and visible cameras. We build the first unaligned frame-event dataset CRSOT collected with a specially built data acquisition system, which contains 1,030 high-definition RGB-Event video pairs, 304,974 video frames. In addition, we propose a novel unaligned object tracking framework that can realize robust tracking even using the loosely aligned RGB-Event data. Specifically, we extract the template and search regions of RGB and Event data and feed them into a unified ViT backbone for feature embedding. Then, we propose uncertainty perception modules to encode the RGB and Event features, respectively, then, we propose a modality uncertainty fusion module to aggregate the two modalities. These three branches are jointly optimized in the training phase. Extensive experiments demonstrate that our tracker can collaborate the dual modalities for high-performance track- Copyright © 2024, The Authors. All rights reserved.

关键词： Cameras

Interactive Prototype Learning and Self-Learning for Few-Shot Medical Image Segmentation

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Song, Yuhui Xu, Chenchu Wang, Boyan Du, Xiuquan Chen, Jie Zhang, Yanping Li, Shuo School of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230051 China Department of Computer Science and Technology Tsinghua University Beijing100084 China School of Engineering Case Western Reserve University Cleveland44106 United States

Few-shot learning alleviates the heavy dependence of medical image segmentation tasks on large-scale labeled data, but it shows a strong performance gap when dealing with new targets and new tasks compared with traditional deep learning. Existing few-shot medical image segmentation models mainly realize segmentation by learning the semantic class knowledge of a few known (support) samples and extending it to unknown (query) samples. However, the neglect of the differences between known and unknown samples leads to a certain deviation in the transfer of class knowledge, and the trained model tends to overfit the class knowledge of training classes, which greatly reduces the segmentation and generalization performance of few-shot model. In this work, we propose an interactive prototype learning and self-learning network to alleviate the above problems. Specifically, we propose an interactive prototype learning network to promote feature consistency between support images and query images to improve the accuracy of prototype metric learning. In addition, to avoid overfitting the training class knowledge and reduce the over-dependence of query segmentation on the class knowledge, we introduce a query features-guided self-learning network to achieve the finer segmentation of query images through its rich feature information. Our model obtained the competitive segmentation results on three multi-organ and multi-modal public datasets that show a substantial improvement in generalization ability. © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

Using Rough Sets to Improve the High-dimensional Data Anomaly Detection Method Based on Extended Isolation Forest

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional Data Anomal...

International Conference on Computer Supported Cooperative Work in Design

作者： Hanlin Liu Jiantao Zhou Hua Li College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods.

关键词：

On the coset graph construction of distance-regular graphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Shi, Minjia Krotov, Denis S. Solé, Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Sobolev Institute of Mathematics Novosibirsk630090 Russia I2M CNRS Centrale Marseille University of Aix-Marseille Marseille France

We show that no more new distance-regular graphs in the tables of the book of (Brouwer, Cohen, Neumaier, 1989) can be produced by using the coset graph of additive completely regular codes over finite *** Codes 05E30,... 详细信息

关键词： Graph theory

Constructing MRD codes by switching

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Shi, Minjia Krotov, Denis S. Özbudak, Ferruh Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Anhui Hefei230601 China Sobolev Institute of Mathematics Novosibirsk630090 Russia Department of Mathematics Institute of Applied Mathematics Middle East Technical University Ankara Turkey

MRD codes are maximum codes in the rank-distance metric space on m-by-n matrices over the finite field of order q. They are diameter perfect and have the cardinality qm(n-d+1) if m ≥ n. We define switching in MRD codes as replacing special MRD subcodes by other subcodes with the same parameters. We consider constructions of MRD codes admitting such switching, including punctured twisted Gabidulin codes and direct-product codes. Using switching, we construct a huge class of MRD codes whose cardinality grows doubly exponentially in m if the other parameters (n, q, the code distance) are fixed. Moreover, we construct MRD codes with different affine ranks and aperiodic MRD *** Codes 94B25 Copyright © 2022, The Authors. All rights reserved.

关键词： Switching

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