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

High-precision end-to-end adaptive optics aided orbital angular momentum wireless communication with XFTC-Net

Optics Letters 2025年第10期50卷 3265-3268页

作者： Panpan Xu Huan Chang Fei Wang Ran Gao Dong Guo Lei Zhu Zhipei Li Sitong Zhou Qi Xu Jing Chen Xiangjun Xin School of Information and Electronics Beijing Institute of Technology (BIT) Beijing 100081 China National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China School of Electronic Engineering Beijing University of Posts and Telecommunications (BUPT) Beijing 100876 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology 250353 China

In this Letter, we demonstrate high-precision end-to-end adaptive optics (AO) technique based on the X-Shape Fusion Transformer-convolutional neural network (XFTC-Net) without an additional probe path to compensate for distortions caused by atmospheric turbulence (AT) in orbital angular momentum (OAM) optical wireless communication links. The experimental results show that the XFTC-Net effectively extracts the intensity distribution features of distorted OAM beams, predicting AT phase screens and identifying OAM modes. After XFTC-Net-aided AO compensation, the bit error rate of the OAM optical communication system remains below 3.8 × 10 −3 , staying within $C_{n}^2=1 \times 10^{-15}$ –1 × 10 −13 m −2/3 . Moreover, the optical power with l = 3 increases from 5.08 dBm to 8.23 dBm at a transmission distance of 800 m. These experimental results indicate that the proposed XFTC-Net AO technique effectively compensates for OAM beam distortion in both single- and multiplexed-channel OAM links, which effectively balances the system complexity and transmission performance of OAM-based free space optical (FSO) communication systems, opening up new avenues for enhancing the performances of high-capacity optical communication.

关键词： Adaptive optics Bit error rate Neural networks Optical wireless communication Polarization division multiplexing Space division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Shape Recognition and Retrieval Based on Edit Distance and Dynamic Programming

引用

Tsinghua Science and Technology 2009年第6期14卷 739-745页

作者：潘鸿飞梁栋唐俊王年李薇 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

An important aim in pattern recognition is to cluster the given shapes. This paper presents a shape recognition and retrieval algorithm. The algorithm first extracts the skeletal features using the medial axis transform. Then, the features are transformed into a string of symbols with the similarity among those symbols computed based on the edit distance. Finally, the shapes are identified using dynamic programming. Two public datasets are analyzed to demonstrate that the present approach is better than previous approaches.

关键词： skeletal features medial axis transform edit distance dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Simplicial complexes graph convolution networks with higher-order features learning for limited samples diagnosis

引用

Control Engineering Practice 2025年 162卷

作者： Zhang, Xian-Jie Zhang, Hai-Feng Zhong, Kai Zhang, Xiao-Ming The Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education School of Mathematical Science Anhui University Hefei 230601 Anhui China The Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei 230601 Anhui China

With the advancement of industrial automation, there is an increasing focus on research concerning limited fault samples. Although meta-learning and other methods can address this issue, they often necessitate the incorporation of additional data and are unable to directly diagnose faults using only unlabeled data along with a small amount of labeled data. In response, this article proposes the use of simplicial complexes graph convolutional networks for fault diagnosis, which simultaneously account for both higher-order and lower-order topological structures among samples. This approach effectively addresses the challenge of limited samples by extracting relevant information from unlabeled data without the need to introduce new knowledge. Initially, simplices of varying dimensions are employed within a constructed simple graph to represent different relationships among samples. Subsequently, the simplicial complexes convolutional network is introduced to capture the higher-order information, while the graph convolutional network is utilized to obtain the lower-order information. The combined feature information is then input into a classifier for fault diagnosis. Finally, experiments conducted on two datasets characterized by small sample sizes or imbalanced samples demonstrate the method's commendable diagnostic performance, as well as its robustness and practicality. © 2025 Elsevier Ltd

关键词： Industrial research

来源：评论

学校读者我要写书评

暂无评论

Human-like conceptual representations emerge from language prediction

arXiv

引用

arXiv 2025年

作者： Xu, Ningyu Zhang, Qi Du, Chao Luo, Qiang Qiu, Xipeng Huang, Xuanjing Zhang, Menghan School of Computer Science Fudan University Shanghai China Institute of Modern Languages and Linguistics Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Research Institute of Intelligent Complex Systems Fudan University Shanghai China Shanghai Collaborative Innovation Center of Intelligent Visual Computing Shanghai China Ministry of Education Key Laboratory of Contemporary Anthropology Fudan University Shanghai China

People acquire concepts through rich physical and social experiences and use them to understand the world. In contrast, large language models (LLMs), trained exclusively through next-token prediction over language data, exhibit remarkably human-like behaviors. Are these models developing concepts akin to humans, and if so, how are such concepts represented and organized? To address these questions, we reframed the classic reverse dictionary task to simulate human concept inference in context and investigated the emergence of human-like conceptual representations within LLMs. Our results demonstrate that LLMs can flexibly derive concepts from linguistic descriptions in relation to contextual cues about other concepts. The derived representations converged towards a shared, context-independent structure that effectively predicted human behavior across key psychological phenomena, including computation of similarities, categories and semantic scales. Moreover, these representations aligned well with neural activity patterns in the human brain, even in response to visual rather than linguistic stimuli, providing evidence for biological plausibility. These findings establish that structured, human-like conceptual representations can naturally emerge from language prediction without real-world grounding. More broadly, our work positions LLMs as promising computational tools for understanding complex human cognition and paves the way for better alignment between artificial and human intelligence. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Counting extreme U1 matrices and characterizing quadratic doubly stochastic operators

引用

Frontiers of Mathematics in China 2016年第3期11卷 647-659页

作者： Quanbing ZHANG Shangjun YANG Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University Hefei 230039 China

The U1 matrix and extreme U1 matrix were successfully used to study quadratic doubly stochastic operators by R. Ganikhodzhaev and F. Shahidi [Linear Algebra Appl., 2010, 432： 24-35], where a necessary condition for a U1 matrix to be extreme was given. S. Yang and C. Xu [Linear Algebra Appl., 2013, 438： 3905-3912] gave a necessary and sufficient condition for a symmetric nonnegative matrix to be an extreme U1 matrix and investigated the structure of extreme U1 matrices. In this paper, we count the number of the permutation equivalence classes of the n × n extreme U1 matrices and characterize the structure of the quadratic stochastic operators and the quadratic doubly stochastic operators.

关键词： Extreme U1 matrix quadratic doubly stochastic operator,majorized permutation similar irreducible matrix

来源：评论

学校读者我要写书评

暂无评论

Point Pattern Matching Based on Spectra of Directed Graphs

引用

电子学报(英文版) 2011年第4期20卷 662-666页

作者： LIANG Dong ZHU Ming FAN Yizheng YAN Pu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

We present a novel algorithm for point pattern matching by means of spectra of directed graphs. Given a feature point-set, we construct a weighted directed graph and skew-symmetric matrix associated with the graph. By using spectral decomposition of the matrix, we give a spectral representation of the feature points with half of the eigenvectors. We theoretically analyze that our method can well deal with the matching problem under affine transformation. The expreiments applied to synthetic data and real-world images show the effectiveness of our method.

关键词：点模式匹配图的谱反对称矩阵特征向量匹配问题仿射变换显示方法谱分解

来源：评论

学校读者我要写书评

暂无评论

An Effective Method to Solve the Induced Surface Current for Arbitrary Conducting Objects at Resonant Frequencies

引用

电子学报(英文版) 2010年第1期19卷 66-68页

作者： SONG Kaihong WU Xianliang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

A novel scheme is developed to compute correctly the induced current based on the Electric field integral equation (EFIE) by the Method of moments (MOM) at resonant frequencies. As a First step, the inaccurate induced current is obtained by solving the EFIE. Then, the scattered magnetic field due to the inaccurate induced current is calculated at any given point on the surface of the object. Finally, the accurate induced current at any given point is determined through the total magnetic field. The proposed approach is applied to the case of the infinitely Perfectly electric conducting (PEC) cylinder and PEC sphere to check its accuracy and efficiency. It is found that the numerical results match the analytical solution or the Combined field integral equation (CFIE) solution.

关键词：感应电流共振频率导体目标表面诱导电场积分方程数值结果总磁场

来源：评论

学校读者我要写书评

暂无评论

Single-side-band optical modulation in SCM systems for high-speed optical transmission

引用

Optoelectronics Letters 2009年第1期5卷 48-50页

作者：李忠义廖同庆 Key Laboratory on Intelligent Computing & Signal Processing of Ministry of Education Anhui University

In order to decrease dispersion penalty and increase the optical bandwidth efficiency,an optical single-side-band modulation(SSBM) scheme in sub-carrier multiplexing(SCM) is *** principle of the SSBM is analytically presented,and a configuration for generating optical SSB signal is proposed using a balanced Mach-Zehnder electro-optic modulator.

关键词： Electrooptical devices

来源：评论

学校读者我要写书评

暂无评论

Efficient numerical methods for computing stationary states of spherical Landau-Brazovskii model

arXiv

引用

arXiv 2025年

作者： Qiu, Qun Si, Wei Ji, Guanghua Jiang, Kai School of Mathematical Sciences Beijing Normal University Beijing100875 China School of Mathematics Sciences Peking University Beijing100871 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China

In this paper, we develop a set of efficient methods to compute stationary states of the spherical Landau-Brazovskii (LB) model in a discretization-then-optimization way. First, we discretize the spherical LB energy functional into a finite-dimensional energy function by the spherical harmonic expansion. Then five optimization methods are developed to compute stationary states of the discretized energy function, including the accelerated adaptive Bregman proximal gradient, Nesterov, adaptive Nesterov, adaptive nonlinear conjugate gradient and adaptive gradient descent methods. To speed up the convergence, we propose a principal mode analysis (PMA) method to estimate good initial configurations and sphere radius. The PMA method also reveals the relationship between the optimal sphere radius and the dominant degree of spherical harmonics. Numerical experiments show that our approaches significantly reduce the number of iterations and the computational time. Copyright © 2025, The Authors. All rights reserved.

关键词： Conjugate gradient method

来源：评论

学校读者我要写书评

暂无评论

A tighter bound on the minimum distances for an infinite family of binary BCH codes and its generalization

引用

Finite Fields and their Applications 2025年 108卷

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

In this paper, we improve the bound on the minimum distance for the family of binary cyclic codes proposed by Sun et al. (2024) [8]. The 3-ary analogue is also studied in this paper, which is a nice family of ternary cyclic codes that contains some best known linear codes, and this family has a better lower bound on minimum distance than that of codes proposed by Chen et al. (2023) [2]. © 2025 Elsevier Inc.

关键词： BCH code Cyclic code Linear code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：