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

5th International Symposium on Artificial Intelligence for Medicine Science, ISAIMS 2024

作者： Luo, Yunying Zeng, Weiming Key Laboratory for Digital Imaging Processing and Intelligent Computing School of Information Engineering Shanghai Maritime University Shanghai China

ISBN: (纸本)9798400717826

Functional Magnetic Resonance Imaging (fMRI) stands out in brain science research due to its non-invasive, non-intrusive, radiation-free, high spatial resolution, and precise localization advantages. However, the BOLD-fMRI signals it generates exhibit a several-second delay compared to neural activity, making it unable to reflect brain neural activity directly. This discrepancy may lead to differences from the actual situation. Therefore, this study aims to enhance the deconvolution of fMRI by refining existing methods to reconstruct the brain’s neural signals more faithfully. Building upon the foundation of particle filtering deconvolution, this paper introduced a novel approach to deconvolving resting-state fMRI data: the polynomial resampling particle filtering deconvolution (PRPFD). They adapted the particle distribution better to match the actual state through weight computation and resampling. We performed a simulation-based experiment to validate the feasibility of our approach. Besides, we validated the performance of our method using group data, focusing on both effective connectivity and functional connectivity, providing strong evidence for the usability and stability of our approach, and compared our method with other deconvolution techniques, demonstrating improvements in accuracy and computational efficiency. © 2024 Copyright held by the owner/author(s).

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Audio-guided self-supervised learning for disentangled visual speech representations

引用

Frontiers of Computer Science 2024年第6期18卷 277-279页

作者： Dalu FENG Shuang YANG Shiguang SHAN Xilin CHEN Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China

1 *** visual speech representations from talking face videos is an important problem for several speech-related tasks,such as lip reading,talking face generation,and audiovisual speech separation[1,2].The key difficulty lies in tackling speech-irrelevant factors presented in the videos,such as lighting,resolution,viewpoints,and head motion.

关键词： such dis visual

来源：评论

学校读者我要写书评

暂无评论

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

引用

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

作者： Xu, Panpan Chang, Huan Wang, Fei Gao, Ran Guo, Dong Zhu, Lei Li, Zhipei Zhou, Sitong Xu, Qi Chen, Jing Xin, Xiangjun Beijing100081 China National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China Beijing100876 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 Cn2 = 1 × 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. © 2025 Optica Publishing Group. All rights, including for text and data mining (TDM), Artificial Intelligence (AI) training, and similar technologies, are reserved.

关键词： Fiber to the x

来源：评论

学校读者我要写书评

暂无评论

An Algebraic Multigrid-Based Physical Factorization Preconditioner for the Multi-Group Radiation Diffusion Equations in Three Dimensions

引用

Numerical Mathematics(Theory,Methods and Applications) 2023年第2期16卷 410-432页

作者： Xiaoqiang Yue Zekai Zhang Xiaowen Xu Shuying Zhai Shi Shu National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing&Information Processing of Ministry of EducationHunan Key Laboratory for Computation and Simulation in Science and EngineeringXiangtan UniversityXiangtan 411105China Laboratory of Computational Physics Institute of Applied Physics and Computational MathematicsBeijing 100094China School of Mathematical Sciences Huaqiao UniversityQuanzhou 362021China.

The paper investigates the robustness and parallel scaling properties of a novel physical factorization preconditioner with algebraic multigrid subsolves in the iterative solution of a cell-centered finite volume discretization of the threedimensional multi-group radiation diffusion *** key idea is to take advantage of a particular kind of block factorization of the resulting system matrix and approximate the left-hand block matrix selectively spurred by parallel processing *** spectral property of the preconditioned matrix is then *** practical strategy is considered sequentially and in ***,numerical results illustrate the numerical robustness,computational efficiency and parallel strong and weak scalabilities over the real-world structured and unstructured coupled problems,showing its competitiveness with many existing block preconditioners.

关键词： Radiation diffusion equations physical factorization preconditioning algebraic multigrid parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

An Improved Compressive Sensing-Based Model for Efficient Analysis of Monostatic Electromagnetic Scattering Problems

引用

IEEE Microwave and Wireless Technology Letters 2025年第4期35卷 388-391页

作者： Qi, Qi Fan, Yunuo Cao, Xinyuan Liu, Yi Kong, Meng Huang, Zhixiang Wu, Xianliang Hefei Normal University Anhui Province Key Laboratory of Simulation Calculation and Design for Electronic Information System Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei230601 China

To further accelerate the analysis of monostatic electromagnetic (EM) scattering problems of objects, an improved compressive sensing (CS)-based model is proposed. First, an orthogonal subspace spanned by the wide-angle induced currents is identified by means of the wide-angle incident sources. Then, the sparse transform of the induced currents is replaced by the subspace projection. In addition, an optimal number of measurements is determined, only slightly larger than the dimension of the subspace. Finally, the recovery algorithm is simplified to the least-squares method to solve the resulting overdetermined system. Compared with the traditional CS-based model, the proposed model significantly improves the efficiency of the recovery step and optimizes both the requirement for and the way of determining the number of measurements. © 2023 IEEE.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

On book thickness parameterized by the vertex cover number

引用

Science China(information Sciences) 2022年第4期65卷 112-113页

作者： Yunlong LIU Jie CHEN Jingui HUANG School of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University

Dear editor,Book thickness for graphs forms a major theme in graph theory and has a broad application in the fields of sorting permutations, fault tolerant VLSI design, parallel computing, and others. The book Thickness problem, even if the vertex order is taken as part of the input, was shown to be NP-complete in general [1, 2]. Just because of this, parameterized algorithms have been proposed to deal with it [3].

关键词： Book Thickness Vertex Cover Number Linear Order 1-page embedding graph kernel

来源：评论

学校读者我要写书评

暂无评论

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

引用

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

作者： keyu Zhong Fen Xiao Xieping Gao Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

引用

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

来源：评论

学校读者我要写书评

暂无评论

DisenGCD: A Meta Multigraph-assisted Disentangled Graph Learning Framework for Cognitive Diagnosis 38

DisenGCD: A Meta Multigraph-assisted Disentangled Graph Lear...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Yang, Shangshang Chen, Mingyang Wang, Ziwen Yu, Xiaoshan Zhang, Panpan Ma, Haiping Zhang, Xingyi Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Anhui Hefei230601 China Anhui Province Key Laboratory of Intelligent Computing and Applications China Department of Information Materials and Intelligent Sensing Laboratory of Anhui Province China

Existing graph learning-based cognitive diagnosis (CD) methods have made relatively good results, but their student, exercise, and concept representations are learned and exchanged in an implicit unified graph, which makes the interaction-agnostic exercise and concept representations be learned poorly, failing to provide high robustness against noise in students' interactions. Besides, lower-order exercise latent representations obtained in shallow layers are not well explored when learning the student representation. To tackle the issues, this paper suggests a meta multigraph-assisted disentangled graph learning framework for CD (DisenGCD), which learns three types of representations on three disentangled graphs: student-exercise-concept interaction, exercise-concept relation, and concept dependency graphs, respectively. Specifically, the latter two graphs are first disentangled from the interaction graph. Then, the student representation is learned from the interaction graph by a devised meta multigraph learning module;multiple learnable propagation paths in this module enable current student latent representation to access lower-order exercise latent representations, which can lead to more effective nad robust student representations learned;the exercise and concept representations are learned on the relation and dependency graphs by graph attention modules. Finally, a novel diagnostic function is devised to handle three disentangled representations for prediction. Experiments show better performance and robustness of DisenGCD than state-of-the-art CD methods and demonstrate the effectiveness of the disentangled learning framework and meta multigraph module. The source code is available at https://***/BIMK/intelligent-Education/tree/main/DisenGCD. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：