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

pp2-linear codes: rank and kernel

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Shi, Minjia Wang, Shukai Li, Xiaoxiao Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematics Sciences Anhui University Anhui Hefei China

A code C is called pp2-linear if it is the Gray image of a pp2-additive code, where p > 2 is prime. In this paper, the rank and the dimension of the kernel of pp2-linear codes are studied. Two bounds of the rank of a Z3Z9-linear code and the dimension of the kernel of a pp2-linear code are given, respectively. For each value of these bounds, we give detailed construction of the corresponding code. Finally, pairs of rank and the dimension of the kernel of 39-linear codes are also *** Codes 94B05 © 2022, CC0.

关键词： Additives

A Novel Underdetermined Blind Source Separation Algorithm of Frequency-hopping signals via Time-frequency Analysis

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2023年

作者： Li, Yingsong Wang, Yifan Li, Yibing Sun, Qian The College of Information and Communication Engineering Harbin Engineering University Harbin150001 China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

To address the significant performance degradation of conventional underdetermined blind source separation algorithms for frequency-hopping (FH) signals under time-frequency (TF) overlapping conditions, this paper presents a novel three-stage scheme based on the TF distribution of FH signals. In the first stage, key parameters of the FH signal are estimated using a TF binary graph. In the second step, the initial mixing matrix is estimated for non-overlapping and overlapping carrier frequencies employing density peaks clustering and tensor decomposition methods, respectively. In the third step, the final mixing matrix, directions of arrival (DOA), and source signals are estimated using the expectation-maximization algorithm within the nonnegative matrix factorization model. Finally, different segments of the FH signals are spliced together based on the DOAs of different source signals. Comprehensive experimental results demonstrate the superior performance of the proposed algorithm compared to state-of-the-art algorithms. Even at a signal-to-noise ratio of 5 dB, the correlation coefficient of the estimated source signals can still reach 0.91. © 2023, CC BY.

关键词： Blind source separation

Hyperbolic Hierarchical Knowledge Graph Embeddings for Link Prediction in Low Dimensions

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zheng, Wenjie Wang, Wenxue Zhao, Shu Qian, Fulan Nanjing University of Science and Technology China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

Knowledge graph embeddings (KGE) have been validated as powerful methods for inferring missing links in knowledge graphs (KGs) that they typically map entities into Euclidean space and treat relations as transformations of entities. Recently, some Euclidean KGE methods have been enhanced to model semantic hierarchies commonly found in KGs, improving the performance of link prediction. To embed hierarchical data, hyperbolic space has emerged as a promising alternative to traditional Euclidean space, offering high fidelity and lower memory consumption. Unlike Euclidean, hyperbolic space provides countless curvatures to choose from. However, it is difficult for existing hyperbolic KGE methods to obtain the optimal curvature settings manually, thereby limiting their ability to effectively model semantic hierarchies. To address this limitation, we propose a novel KGE model called Hyperbolic Hierarchical KGE (HypHKGE). This model introduces attention-based learnable curvatures for hyperbolic space, which helps preserve rich semantic hierarchies. Furthermore, to utilize the preserved hierarchies for inferring missing links, we define hyperbolic hierarchical transformations based on the theory of hyperbolic geometry, including both inter-level and intra-level modeling. Experiments demonstrate the effectiveness of the proposed HypHKGE model on the three benchmark datasets (WN18RR, FB15K-237, and YAGO3-10). The source code will be publicly released at https://***/wjzheng96/HypHKGE. Copyright © 2022, The Authors. All rights reserved.

关键词： Knowledge graph

Low Coupling Sparse Array Based on Uniform Linear Array Fitting Method

学校读者我要写书评

暂无评论

Low Coupling Sparse Array Based on Uniform Linear Array Fitt...

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

作者： Yichang Yao Yingsong Li Liping Li Nikola Zlatanov 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 Faculty of Computer and Engineering Sciences Innopolis University Innopolis Russia

ISBN: (数字)9798350384437

ISBN: (纸本)9798350384444

In order to solve the problem that traditional sparse arrays only emphasize high degrees of freedom and ignore low coupling, uniform array fitting method can design arrays with low coupling. However, the existing array coupling based on uniform array fitting method still has room for decline, and the value of weight function is not the minimum, so the performance of array DOA estimation needs to be further optimized. Therefore, based on the uniform matrix fitting method, a uniform matrix fitting 6-base-layer array is designed. By extending the spacing of each subarray of the uniform subarray in the base layer, the number of small array element spacing pairs in the differential cooperative array is reduced, and the coupling between the elements of the whole sparse array is reduced as a whole. The performance of DOA estimation of the designed array is simulated and analyzed by using spatial smoothing multiple signal classification algorithm.

关键词： Couplings Mutual coupling Direction-of-arrival estimation Smoothing methods Simulation Fitting Estimation

Equivalence and Duality of Polycyclic Codes Associated with Trinomials over Finite Fields

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Shi, Minjia Lu, Haodong Zhou, Shuang Xu, Jiarui Zhu, Yuhang The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic codes, and study the self-orthogonal and dual-containing polycyclic codes over F2MSC Codes 94B05, 05E30 © 2022, CC0.

关键词： Algebra

Designing Novel Cognitive Diagnosis Models via Evolutionary Multi-Objective Neural Architecture Search

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yang, Shangshang Ma, Haiping Zhen, Cheng Tian, Ye Zhang, Limiao Jin, Yaochu Zhang, Xingyi The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Anhui University Hefei230039 China The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Anhui Hefei230601 China The Faculty of Technology Bielefeld Unversity Bielefeld33619 Germany

Cognitive diagnosis plays a vital role in modern intelligent education platforms to reveal students’ proficiency in knowledge concepts for subsequent adaptive tasks. However, due to the requirement of high model interpretability, existing manually designed cognitive diagnosis models hold too simple architectures to meet the demand of current intelligent education systems, where the bias of human design also limits the emergence of effective cognitive diagnosis models. In this paper, we propose to automatically design novel cognitive diagnosis models by evolutionary multiobjective neural architecture search (NAS). Specifically, we observe existing models can be represented by a general model handling three given types of inputs and thus first design an expressive search space for the NAS task in cognitive diagnosis. Then, we propose multi-objective genetic programming (MOGP) to explore the NAS task’s search space by maximizing model performance and interpretability. In the MOGP design, each architecture is transformed into a tree architecture and encoded by a tree for easy optimization, and a tailored genetic operation based on four sub-genetic operations is devised to generate offspring effectively. Besides, an initialization strategy is also suggested to accelerate the convergence by evolving half of the population from existing models’ variants. Experiments on two real-world datasets demonstrate that the cognitive diagnosis models searched by the proposed approach exhibit significantly better performance than existing models and also hold as good interpretability as human-designed models. Copyright © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

Gray Images of Cyclic Codes over p2 and pp2

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Xuan Shi, Minjia Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China

In the paper, we firstly study the algebraic structures of ppk-additive cyclic codes and give the generator polynomials and the minimal spanning set of these codes. Secondly, a necessary and sufficient condition for the pp2-additive cyclic code whose Gray image is linear (not necessarily cyclic) over p is given. Moreover, as for some special families of cyclic codes over p2 and pp2, the linearity of the Gray images is *** Codes 94B05 © 2022, CC0.

关键词： Additives

Near-field Source DOA Estimation Algorithm Based on De-impact Function under Impulse Noise

学校读者我要写书评

暂无评论

Near-field Source DOA Estimation Algorithm Based on De-impac...

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

作者： Xingchao Xu Baohe Pang Yingsong Li Liping Li Dingcheng Zou Nikola Zlatanov 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 Faculty of Computer and Engineering Sciences Innopolis University Innopolis Russia

ISBN: (数字)9798350384437

ISBN: (纸本)9798350384444

In addressing the issue of localizing near-field source signals in the presence of impulse noise, this manuscript introduces a novel de-impact function designed for preprocessing received signals to alleviate the interference caused by impulse noise. Simulation experiments verify the effectiveness of the proposed de-impact function in effectively suppressing impulse noise. Furthermore, to augment estimation precision, a novel algorithm for near-field source localization is proposed. Building upon the framework of correlation entropy theory, a new correntropy covariance matrix is formulated to replace the original signal covariance matrix for signal processing. Through a succession of low-bias approximations between near-field and far-field scenarios, the algorithm converts the original 2-D search into 1-D operations. Additionally, the conventional spectral peak search is replaced by polynomial solving to further mitigate the computational complexity of the algorithm.

关键词： Location awareness Direction-of-arrival estimation Noise signal processing algorithms Estimation Interference Approximation algorithms

Structure-constrain Source Free Domain Adaptation with Regularized Knowledge Distillation of Source Model

学校读者我要写书评

暂无评论

Structure-constrain Source Free Domain Adaptation with Regul...

Data Driven Control and Learning Systems (DDCLS)

作者： Dan Yang Xin Peng Cheng Su Dayu Tan Chaoyang Chen Weimin Zhong Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui China School of Information and Electrical Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (数字)9798350361674

ISBN: (纸本)9798350361681

Transfer learning aims to leverage the knowledge of the source domain to help the learning of unlab.led target domain models. However, all conventional transfer learning methods assume that samples from source and target domains are always freely accessible. However, this assumption is rarely plausible in real-world due to data privacy. To combat this challenge, we introduce Structure-constrain Source Free Domain Adaptation with regularized Knowledge Distillation of source model (SSFDA-KD). Our method is based on the observations that a deterministic classification result can be obtained when the target data distribution aligns with the source data distribution, and a well-trained model not only yields a deterministic classification for a sample but also has clear category boundaries, which implies samples that are close together belong to the same category. From those, we first generate the source model with lab.led source data, which is regarded as a well-trained model. Then, we identify target prototypes with lower self-entropy and assign the pseudo-lab.ls to other samples according to the neighborhood structure. Finally, we refine the target model by minimizing prediction loss, constraining internal structure via triplet loss, and reducing knowledge distillation loss. Experiments of fault diagnosis based on WWTPs are conducted to validate its effectiveness.

关键词： Fault diagnosis Learning systems Adaptation models Data privacy Transfer learning Prototypes Predictive models