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

arXiv 2024年

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

In this paper, we focus on using optimization methods to solve matrix equations by transforming the problem of solving the Sylvester matrix equation or continuous algebraic Riccati equation into an optimization problem. Initially, we use a constrained convex optimization method (CCOM) to solve the Sylvester matrix equation with 2,1-norm, where we provide a convergence analysis and numerical examples of CCOM;however, the results show that the algorithm is not efficient. To address this issue, we employ classical quasi-Newton methods such as DFP and BFGS algorithms to solve the Sylvester matrix equation and present the convergence and numerical results of the algorithm. Additionally, we compare these algorithms with the CG algorithm and AR algorithm, and our results demonstrate that the presented algorithms are effective. Furthermore, we propose a unified framework of the alternating direction multiplier method (ADMM) for directly solving the continuous algebraic Riccati equation (CARE), and we provide the convergence and numerical results of ADMM. Our experimental results indicate that ADMM is an effective optimization algorithm for solving CARE. Finally, to improve the effectiveness of the optimization method for solving Riccati equation, we propose the Newton-ADMM algorithm framework, where the outer iteration of this method is the classical Newton method, and the inner iteration involves using ADMM to solve Lyapunov matrix equations inexactly. We also provide the convergence and numerical results of this algorithm, which our results demonstrate are more efficient than ADMM for solving CARE. Copyright © 2024, The Authors. All rights reserved.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Low-rank generalized alternating direction implicit iteration method for solving matrix equations

arXiv

引用

arXiv 2024年

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

This paper presents an effective low-rank generalized alternating direction implicit iteration (R-GADI) method for solving large-scale sparse and stable Lyapunov matrix equations and continuous-time algebraic Riccati matrix equations. The method is based on generalized alternating direction implicit iteration (GADI), which exploits the low-rank property of matrices and utilizes the Cholesky factorization approach for solving. The advantage of the new algorithm lies in its direct and efficient low-rank formulation, which is a variant of the Cholesky decomposition in the Lyapunov GADI method, saving storage space and making it computationally effective. When solving the continuous-time algebraic Riccati matrix equation, the Riccati equation is first simplified to a Lyapunov equation using the Newton method, and then the R-GADI method is employed for computation. Additionally, we analyze the convergence of the R-GADI method and prove its consistency with the convergence of the GADI method. Finally, the effectiveness of the new algorithm is demonstrated through corresponding numerical experiments. Copyright © 2024, The Authors. All rights reserved.

关键词： Riccati equations

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity Prosodic Speech Synthesis with Grammar Information

SSRN

引用

SSRN 2024年

作者： Zhou, Jian Liu, Jiahui Fan, Cunhang Zheng, Wenming Lv, Zhao Tao, Liang Kwan, Hon Keung The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China Ministry of Education School of Biological Science and Medical Engineering Southeast University Nanjing210096 China The Department of Electrical and Computer Engineering University of Windsor WindsorN9B 3P4 Canada

Personalized speech synthesis involves learning an individual's unique speaking patterns from a reference audio to generate speech that mimics the speaker's habitual rhythm. However, the one-to-many mapping between text and speech, combined with the dynamic nature of personalized speech style characteristics in the reference audio, poses significant challenges for accurate personalized speech synthesis. In this paper, we propose a Grammar Infused Multi-granularity Prosody Network (GMG ProsodyNet) for personalized speech synthesis. Specifically, 1) We model prosodic features hierarchically at the levels of utterance, content syntax, word, and phoneme. We utilize the utterance-level prosodic feature to guide the prediction of fine-grained prosodic features according to the hierarchical property of prosodic features. We introduce a context syntax encoder to improve the prediction accuracy of duration, pitch, and energy characteristics in the synthesized audio. The proposed word-level prosodic encoder can efficiently extract valuable pitch dynamic and speech continuity features from the word spectrum. For controlling subtle prosodic nuances, we employ phoneme-level prosodic modeling. 2) We extract syntax level prosodic features from the syntax graph constructed by Graph Neural Network (GNN) with word as node, exploiting grammatical dependencies between distant words. Experimental results demonstrate that the proposed GMG ProsodyNet can effectively encode delicate and personalized prosodic features, leading to improved speech synthesis quality, fluency, and naturalness. © 2024, The Authors. All rights reserved.

关键词： Speech synthesis

来源：评论

学校读者我要写书评

暂无评论

A general alternating direction implicit iteration method for solving complex symmetric linear systems

arXiv

引用

arXiv 2024年

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

We have introduced the generalized alternating direction implicit iteration (GADI) method for solving large sparse complex symmetric linear systems and proved its convergence properties. Additionally, some numerical results have demonstrated the effectiveness of this algorithm. Furthermore, as an application of the GADI method in solving complex symmetric linear systems, we utilized the flattening operator and Kronecker product properties to solve Lyapunov and Riccati equations with complex coefficients using the GADI method. In solving the Riccati equation, we combined inner and outer iterations, first simplifying the Riccati equation into a Lyapunov equation using the Newton method, and then applying the GADI method for solution. Finally, we provided convergence analysis of the method and corresponding numerical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Riccati equations

来源：评论

学校读者我要写书评

暂无评论

Transformer RGBT Tracking with Spatio-Temporal Multimodal Tokens

arXiv

引用

arXiv 2024年

作者： Sun, Dengdi Pan, Yajie Lu, Andong Li, Chenglong Luo, Bin The Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education School of Artificial Intelligence Anhui University Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230026 China The Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China

Many RGBT tracking researches primarily focus on modal fusion design, while overlooking the effective handling of target appearance changes. While some approaches have introduced historical frames or fuse and replace initial templates to incorporate temporal information, they have the risk of disrupting the original target appearance and accumulating errors over time. To alleviate these limitations, we propose a novel Transformer RGBT tracking approach, which mixes spatio-temporal multimodal tokens from the static multimodal templates and multimodal search regions in Transformer to handle target appearance changes, for robust RGBT tracking. We introduce independent dynamic template tokens to interact with the search region, embedding temporal information to address appearance changes, while also retaining the involvement of the initial static template tokens in the joint feature extraction process to ensure the preservation of the original reliable target appearance information that prevent deviations from the target appearance caused by traditional temporal updates. We also use attention mechanisms to enhance the target features of multimodal template tokens by incorporating supplementary modal cues, and make the multimodal search region tokens interact with multimodal dynamic template tokens via attention mechanisms, which facilitates the conveyance of multimodal-enhanced target change information. Our module is inserted into the transformer backbone network and inherits joint feature extraction, search-template matching, and cross-modal interaction. Extensive experiments on three RGBT benchmark datasets show that the proposed approach maintains competitive performance compared to other state-of-the-art tracking algorithms while running at 39.1 FPS. Copyright © 2024, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Generalized-Extended-State-Observer and Equivalent-Input-Disturbance Methods for Active Disturbance Rejection: Deep Observation and Comparison

引用

IEEE/CAA Journal of Automatica Sinica 2023年第4期10卷 957-968页

作者： Jinhua She Kou Miyamoto Qing-Long Han Min Wu Hiroshi Hashimoto Qing-Guo Wang School of Engineering Tokyo University of TechnologyHachiojiTokyo 192-0982Japan K.Miyamoto is with the Institute of Technology Shimizu CorporationKotoTokyo 135-0044Japan School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia School of Automation China University of GeosciencesWuhan 430074 Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of EducationWuhan 430074China School of Industrial Technology Advanced Institute of Industrial TechnologyTokyo 140-0011Japan Institute of Artificial Intelligence and Future Networks Beijing Normal UniversityZhuhai 519087 Guangdong Key Lab of AI and Multi-Modal Data Processing Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNUHKBU United International College Zhuhai 519087China

Active disturbance-rejection methods are effective in estimating and rejecting disturbances in both transient and steady-state *** paper presents a deep observation on and a comparison between two of those methods:the generalized extended-state observer(GESO)and the equivalent input disturbance(EID)from assumptions,system configurations,stability conditions,system design,disturbance-rejection performance,and extensibility.A time-domain index is introduced to assess the disturbance-rejection performance.A detailed observation of disturbance-suppression mechanisms reveals the superiority of the EID approach over the GESO method.A comparison between these two methods shows that assumptions on disturbances are more practical and the adjustment of disturbance-rejection performance is easier for the EID approach than for the GESO method.

关键词： Active disturbance-rejection control(ADRC) disturbance observer(DOB) equivalent input disturbance(EID) extendedstate observer(ESO) generalized extended-state observer(GESO)

来源：评论

学校读者我要写书评

暂无评论

Critical Node Detection for Sequential Attacks in Complex Networks via Multi-objective Optimization 2

Critical Node Detection for Sequential Attacks in Complex Ne...

引用

2nd International Conference on Industrial Artificial Intelligence, IAI 2020

作者： Zhang, Lei Liu, Qing Xia, Jiajun Yang, Haipeng Zhang, Xingyi Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University China

ISBN: (纸本)9781728182162

The critical node detection for sequential attacks based on cascading failure model is an important way for analyzing network vulnerability, which has attracted the attention of many researchers in the field of complex network recently. However, most of the existing cascading critical node detection algorithms focus on designing effective attack strategies leading to the maximal damage to the network (i.e. attack effect), while ignoring the cost of attacks. To this end, we transform the cascading critical node detection for sequential attacks as a bi-objective optimization problem (named BCVNDSeq), where the attack cost and the attack effect are simultaneously optimized. In order to solve the transformed problem, we propose a multiobjective cascading critical node detection algorithm (named MO-BCVNDSeq), which can provide decision makers with a holistic view for analyzing the network vulnerability. In MO-BCVNDSeq, a local search strategy based on sequential matrix is proposed to accelerate the population convergence and an individual repairing strategy is also suggested to further improve the search efficiency. Finally, the experimental results on 6 real-world complex networks demonstrate the effectiveness of the proposed algorithm compared with several representative baselines. © 2020 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Data Fusion Based on Temporal-Spatial Composite Sequential Three-Way Decision

SSRN

引用

SSRN 2022年

作者： Xu, Yi Qiu, Ziheng Sun, Xiaojun Department of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

Three-way decision is the representative of trisecting-acting-outcome(TAO) model. Considering the temporality, in dynamic information systems, the objects may be inserted or deleted,attributes may be added or removed, and attributes values may be updated or modified. These variations can be reflected by the TAO model, which cares about consideration at different levels, acquisition of strategies, and handling of issues based on Strategies. Considering the spatiality, different levels, and different perspectives of granular structure are created by the sequential approach of three-way decision. In this paper, in order to fuse hybrid data, a sequential three-way decision is proposed by the combination of temporality and spatiality. Firstly, We present the frameworks of spatiality-based and temporality-based and focus on temporal-spatial three-way decision. Then we provide three operations to construct the composite POS structure by combining a family of approximations. Based on the composite POS structure, three different strategies for the fusion of dynamic hybrid data are adopted. Finally, we design the algorithm and implement a series of comparison experiments to verify our model is effective. © 2022, The Authors. All rights reserved.

关键词： Data fusion

来源：评论

学校读者我要写书评

暂无评论

A correlation-breaking interleaving of polar codes in concatenated systems

引用

Science China(Information Sciences) 2021年第10期64卷 270-271页

作者： Ya MENG Liping LI Chuan ZHANG Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education of China Anhui University National Mobile Communications Research Laboratory Southeast University Purple Mountain Laboratories

Dear editor,Polar codes, along with a low complexity successive cancellation(SC) decoding, were discovered in [1] by Ar?kan. It is shown in [2] that the bit errors with the SC decoding are correlated. To improve the performance, other decoding techniques [3, 4] and concatenation schemes [5, 6] were studied. In this study, the theoretical aspects of the error correlation are investigated to improve the decoding performance of polar codes. This is the first attempt to utilize the error correlation to improve the performance of polar codes.

关键词： Information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

A NOVEL CONVOLUTIONAL NEURAL NETWORK BASED ON ADAPTIVE MULTI-SCALE AGGREGATION AND BOUNDARY-AWARE FOR LATERAL VENTRICLE SEGMENTATION ON MR IMAGES 47

A NOVEL CONVOLUTIONAL NEURAL NETWORK BASED ON ADAPTIVE MULTI...

引用

2022 IEEE International Conference on Acoustics, Speech and signal processing, ICASSP 2022

作者： Ye, Fei Wang, Zhiqiang Zhu, Sheng Li, Xuanya Hu, Kai Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan411105 China Department of Radiology Affiliated Hospital of Xiangnan University Chenzhou423000 China Key Laboratory of Medical Imaging and Artificial Intelligence of Hunan Province Xiangnan University Chenzhou423000 China Baidu Inc. Beijing100085 China

ISBN: (纸本)9781665405409

In this paper, we propose a novel convolutional neural network based on adaptive multi-scale feature aggregation and boundary-aware for lateral ventricle segmentation (MB-Net), which mainly includes three parts, i.e., an adaptive multi-scale feature aggregation module (AMSFM), an embedded boundary refinement module (EBRM), and a local feature extraction module (LFM). Specifically, the AMSFM is used to extract multi-scale features through the different receptive fields to effectively solve the problem of distinct target regions on magnetic resonance (MR) images. The EBRM is intended to extract boundary information to effectively solve blurred boundary problems. The LFM can make the extraction of local information based on spatial and channel attention mechanisms to solve the problem of irregular shapes. Finally, extensive experiments are conducted from different perspectives to evaluate the performance of the proposed MB-Net. Furthermore, we also verify the robustness of the model on other public datasets, i.e., COVID-SemiSeg and CHASE DB1. The results show that our MB-Net can achieve competitive results when compared with state-of-the-art methods. © 2022 IEEE

关键词： Magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：