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

On four conjectures of Heng-Ding and p-ary linear codes from monomials

IEEE Transactions on Information Theory 2025年

作者： Qian, Liqin Shi, Minjia Anhui University School of Mathematical Sciences Anhui Hefei230601 China Anhui University Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui Hefei230601 China Xidian University State Key Laboratory of Integrated Service Networks Xi'an710071 China

Subfield codes of linear codes over finite fields have recently attracted great attention due to their wide applications in secret sharing schemes, authentication codes and association schemes. There are two major ingredients in this paper. The first ingredient is to solve four conjectures recently proposed by Heng and Ding (IEEE Trans. Inf. Theory, 68(6): 3643-3656, 2022). Besides, we also determine the weight distributions of subfield codes derived from x3 and oval polynomials over F2m. The second ingredient is to obtain two classes of p-ary linear codes from monomials over Fpm. We study the parameters of the constructed codes and determine their weight distributions. Notably, we show that the codes C(p) (xpi, pm) are optimal and almost optimal in many cases with respect to the online Database of Grassl. Finally, we observe that the derived linear codes also have the minimality property for most cases. © 1963-2012 IEEE.

关键词： Linear code monomial oval polynomial subfield code weight distribution

来源：评论

学校读者我要写书评

暂无评论

General Sparse Normalization and Proportionate ASE Algorithms 5

General Sparse Normalization and Proportionate ASE Algorithm...

引用

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

作者： Hadi, Abdul Peng, Yan Qadir, Abdul Li, Yingsong Khan, Khushal College of Information and Communication Engineering Harbin Engineering University Harbin China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China College of Intelligent System and Control Science Engineering Harbin Engineering University China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

Andrew's Sine Estimator (ASE) has recently been used to invent adaptive filtering, which can combat more kind of noises than conventional estimators. Inspired by the LMS and its sparse forms, normalization and proportionate ASE algorithms with Lawson constraints are constructed with the respective given names of Lawson normalization ASE (LNASE) and Lawson proportionate NASE (LPNASE). Simulations are performed to analyze the performance of these algorithms under impulsive noise. © 2022 IEEE.

关键词： Impulse noise

来源：评论

学校读者我要写书评

暂无评论

TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust Clustering 38

TFGDA: Exploring Topology and Feature Alignment in Semi-supe...

引用

38th Conference on Neural Information processing Systems, NeurIPS 2024

作者： Dan, Jun Liu, Weiming Xie, Chunfeng Yu, Hua Dong, Shunjie Tan, Yanchao Zhejiang University China Queen Mary University of London United Kingdom Dalian University of Technology China Shanghai Jiao Tong University China Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China

Semi-supervised graph domain adaptation, as a branch of graph transfer learning, aims to annotate unlabeled target graph nodes by utilizing transferable knowledge learned from a label-scarce source graph. However, most existing studies primarily concentrate on aligning feature distributions directly to extract domain-invariant features, while ignoring the utilization of the intrinsic structure information in graphs. Inspired by the significance of data structure information in enhancing models' generalization performance, this paper aims to investigate how to leverage the structure information to assist graph transfer learning. To this end, we propose an innovative framework called TFGDA. Specially, TFGDA employs a structure alignment strategy named STSA to encode graphs' topological structure information into the latent space, greatly facilitating the learning of transferable features. To achieve a stable alignment of feature distributions, we also introduce a SDA strategy to mitigate domain discrepancy on the sphere. Moreover, to address the overfitting issue caused by label scarcity, a simple but effective RNC strategy is devised to guide the discriminative clustering of unlabeled nodes. Experiments on various benchmarks demonstrate the superiority of TFGDA over SOTA methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performer: A High-Performance Global-Local Model-Augmented with Dual Network Interaction Mechanism

引用

IEEE Transactions on Cognitive and Developmental Systems 2024年

作者： Tan, Dayu Hao, Rui Hua, Linfeng Xu, Qi Su, Yansen Zheng, Chunhou Zhong, Weimin Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education Shanghai200237 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China

In deep learning, Convolutional Neural Networks (CNNs) focus on local information through convolutional kernels, while transformers attend to global information using self-attention mechanisms. The union of these distinct approaches enables a more comprehensive extraction of image features. However, the feature map dimensions of CNN and Transformer differ, leading to dimension mismatch issues when combining these architectures. Additionally, the parameter size of the hybrid model integrating both architectures remains large, making it difficult to train. To further augmenting the interpretation of complex image patterns, we present Performer, a dual-network architecture that seamlessly combines CNNs and transformers, resulting in a novel and efficient representation learning model. In the Performer model, we innovate by devising a unique interaction methodology for CNN and transformer architectures to enhance the image feature extraction capabilities mutually. To counteract issue of dimensionality mismatch, we also introduce a refined transformer block, a advancement over the transformer block of ViT. To validate the effectiveness of Performer, we conduct extensive experiments on both classification and segmentation tasks. Performer achieve an accuracy of 83.37% on the ImageNet-200 dataset. For semantic segmentation, Performer excels on the CamVid and Hippocampus datasets. On CamVid, our model achieves a mean Intersection over Union (mIoU) of 63.27% and Pixel Accuracy of 92.11%, demonstrating superior performance in capturing fine details and handling complex scenes effectively. The code is available at https://***/hlfthh/ Performer. © 2016 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-view Fusion Enhanced Social Text Representation for Depression Detection 11th

Multi-view Fusion Enhanced Social Text Representation for D...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Chen, Jie You, Xuetong Zhao, Shu Xiao, Jingxuan Zhang, Yanping Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui Province Hefei230601 China School of Computer Science and Technology Anhui University Anhui Province Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Province Hefei230601 China Faculty of Innovation Engineering Department of Computer Science Macau University of Science and Technology Macau China

ISBN: (纸本)9783031927409

Depression has become a major global public health challenge. Social media texts reflect users’ emotional and psychological states, providing a valuable data source for depression detection through natural language analysis. However, current research still faces limitations in modeling the collaborative representation of user texts and dynamic behaviors. To address this, we propose MVDep, a model that integrates multi-view features to enhance social text representation for depression detection. Specifically, we enhance text representation by investigating depression from multi-view, including social media texts, user profiles, and social behaviors, enabling more effective depression detection. First, we conduct initial filtering of social media texts using the Diagnostic and Statistical Manual of Mental Disorders (DSM-5), and then screen out the uncertain domain of data samples based on the three-way decision (3WD). Next, we extract quantified user profiles and social behavioral features to enhance the representation of depression tendencies for uncertain domain samples. Finally, we fuse the multi-view features derived from social media texts, user profiles and social behaviors, improving the model’s ability to detect depression. We evaluate our model on the SWDD dataset, demonstrating its superiority over state-of-the-art baseline models in depression detection tasks. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Threshold Credential Management with Fine-Grained Authentication for VANETs

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5818-5831页

作者： Zhang, Jing Wang, Xin Cui, Jie Li, Ru Zhong, Hong Anhui University School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei 230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei 230039 China Anhui University School of Computer Science and Technology Hefei 230039 China

In Vehicular Ad-hoc Networks (VANETs), vehicles must authenticate their identities before accessing services. However, existing authentication schemes based on anonymous credentials still face single-point failure in multi-authority scenarios. In addition, in traditional anonymous credential schemes, the public key of credential authority is used directly to verify the credential, which may increase the risk of vehicle privacy being misused. To address these issues, we propose a decentralized threshold credential management system with fine-grained authentication for VANETs. The decentralized credential management architecture is proposed for VANETs with multiple credential authorities, each credential authority consists of multiple credential managers who issue credentials using the threshold mechanism, effectively solving the single-point failure. Based on this architecture, we design a fine grained, privacy-preserving authentication scheme that allows vehicles to autonomously perform selective attribute disclosure, credential aggregation, and randomization before requesting verification from the Cloud Service Provider, thereby achieving a balance between privacy preservation and authentication efficiency. The security proofs and analysis show that our scheme satisfies the target security properties. Performance evaluations indicate that our scheme enables efficient, flexible credential management and authentication in VANETs while ensuring privacy preservation. © 2005-2012 IEEE.

关键词： anonymous credentials authentication decentralization privacy preservation VANETs

来源：评论

学校读者我要写书评

暂无评论

A New Dual-Population Evolutionary Algorithm Leveraging Objective-Constraint Relationships for Constrained Multi-Objective Optimization

SSRN

引用

SSRN 2025年

作者： Ye, Jialu Tan, Chaogui Xia, Yizhang Hou, Zhanglu Liu, Yuan Zou, Juan Hunan Engineering Research Center of intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan National Applied Mathematics Center China Xiangtan University China

Population co-evolution strategies are widely used to handle constrained multi-objective optimization problems (CMOPs). However, existing coevolutionary algorithms oversimplify population collaboration and are rigid in evolving the auxiliary population, ignoring the importance of maintaining population diversity, especially for CMOPs with irregular feasible regions. To tackle this issue, we propose a new dual-population evolutionary algorithm, denoted as AACMO, which attempts to mine the relational features between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF) to better adapt to CMOPs with various constraints. Specifically, the method is categorized into two phases: a learning phase and an evolving phase. First, the main population (MP) aims to quickly learn the relationships between the UPF and the CPF by leveraging the advantages of different operators, namely, genetic algorithm operators and differential evolution operators, during the learning phase. Secondly, two auxiliary strategies are designed to collaborate with the MP during the evolving phase. These strategies are capable of employing a more effective co-evolution method to assist the MP in maintaining diversity, based on the degree of alignment between the learned UPF and CPF at the end of the learning phase. The effectiveness of AACMO is confirmed through comparative analysis with eight state-of-the-art algorithms across four CMOP benchmark suites. © 2025, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A preconditioned iteration method for solving saddle point problems

arXiv

引用

arXiv 2024年

This paper introduces a preconditioned method designed to comprehensively address the saddle point system with the aim of improving convergence efficiency. In the preprocessor construction phase, a technical approach for solving the approximate inverse matrix of sparse matrices is presented. The effectiveness of the proposed method is demonstrated through numerical examples, emphasizing its efficacy in approximating the inverse matrix. Furthermore, the preprocessing technology includes a low-rank processing step, effectively reducing algorithmic complexity. Numerical experiments validate the effectiveness and feasibility of PSLR-GMRES in solving the saddle point system. © 2024, CC BY.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Comments and extensions on "State-equivalent form and minimum-order compensator design for rectangular descriptor systems"

arXiv

引用

arXiv 2025年

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

This technical note presents a counterexample showing that the equivalence conditions proposed by Geng et al. (IEEE Trans. Automat. Control, 2024), which use a minimum-order compensator (MOC) to achieve desired designs, including generalized regularity or both generalized regularity and free of impulse, are sufficient but not necessary. Furthermore, revised equivalence conditions are introduced, along with an equivalence condition ensuring the closed-loop system remains generalized regular, impulse-free, and stable using MOC. Additionally, it is shown that output feedback can replace the MOC, achieving the same design without increasing dimensionality. These findings are validated through a circuit *** Codes 93B05, 93B52, 15A03 Copyright © 2025, The Authors. All rights reserved.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：