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

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1080-1099页

作者： Mai, Weijian Zhang, Jian Fang, Pengfei Zhang, Zhijun South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Southeast University School of Computer Science and Engineering Nanjing210096 China South China University of Technology Key Library of Autonomous Systems and Network Control Ministry of Education The School of Automation Science and Engineering Guangzhou510640 China Institute for Super Robotics Huangpu Guangzhou510555 China Nanchang University Jiangxi Thousand Talents Plan Nanchang330031 China Jishou University College of Computer Science and Engineering Jishou416000 China Guangdong Artificial Intelligence and Digital Economy Laboratory Pazhou Lab Guangzhou510335 China Shaanxi University of Technology Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Hanzhong723001 China Changsha Normal University School of Information Science and Engineering Changsha410100 China Guangdong University of Petrochemical Technology School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Maoming525000 China

In the era of artificial intelligence generated content (AIGC), conditional multimodal synthesis technologies (e.g., text-to-image) are dynamically reshaping the natural content. Brain signals, serving as potential reflections of how the brain interprets external information, exhibit a distinctive one-to-many correspondence with various external modalities. This correspondence makes brain signals emerge as a promising guiding condition for multimodal synthesis (e.g., image, text, and audio), which is crucial for developing practical brain–computer interface systems and unraveling complex mechanisms underlying human perception. This survey comprehensively examines the emerging field of brain-conditional multimodal synthesis, termed AIGC-brain, to delineate the current landscape and future directions. To begin, related neuroimaging datasets and generative models are introduced as the foundation of AIGC-brain decoding and analysis. Next, we present a comprehensive taxonomy according to AIGC-brain methodologies, followed by task-specific representative work and implementation details to facilitate in-depth comparison and analysis. Quality assessments are then introduced for both qualitative and quantitative evaluation. Finally, this survey explores insights gained, outlining current challenges and prospects of AIGC-brain. As a pioneering survey, this article paves the way for future advances in AIGC-brain research. © 2020 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme

引用

控制理论与技术（英文版） 2015年第4期13卷 333-347页

作者： Peng YI Yiguang HONG Key Lab of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China

In this paper, we consider a distributed convex optimization problem of a multi-agent system with the global objective function as the sum of agents’ individual objective functions. To solve such an optimization problem, we propose a distributed stochastic sub-gradient algorithm with random sleep scheme. In the random sleep scheme, each agent independently and randomly decides whether to inquire the sub-gradient information of its local objective function at each iteration. The algorithm not only generalizes distributed algorithms with variable working nodes and multi-step consensus-based algorithms, but also extends some existing randomized convex set intersection results. We investigate the algorithm convergence properties under two types of stepsizes: the randomized diminishing stepsize that is heterogeneous and calculated by individual agent, and the fixed stepsize that is homogeneous. Then we prove that the estimates of the agents reach consensus almost surely and in mean, and the consensus point is the optimal solution with probability 1, both under randomized stepsize. Moreover, we analyze the algorithm error bound under fixed homogeneous stepsize, and also show how the errors depend on the fixed stepsize and update rates.

关键词： Distributed optimization sub-gradient algorithm random sleep multi-agent systems randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Linear Precoding Design for MIMO-PLC systems

引用

Tsinghua Science and Technology 2015年第2期20卷 155-163页

作者： Jisheng Peng the State Key Lab of Control and Simulation of Power Systems and Generation Equipment Department of Electrical Engineering Tsinghua Uinversity

In this paper, we consider the design of linear precoding in Multiple Input Multiple Output （MIMO） Power Line Communication （PLC） systems with finite-alphabet input. First, we derive mutual information of MIMO-PLC systems with impulsive noise. Considering the non-concavity of the objective function and the low-cost requirement of PLC systems, we choose the lower bound of the mutual information as the objective function. Subsequently, we propose a novel approach to design the precoding scheme to reduce computational complexity. Specifically, our work primarily includes the following two contributions：（1） We design the right unitary matrix that is a product of two fixed unitary matrices, which only depends on the modulation mode. Hence, the results can be saved and require less computations. （2） For the power allocation matrix, we first reduce the space of power allocation using constraints of the optimal power allocation policy. Consequently, we propose a non-linear search method to obtain the optimal power allocation in small space. In regards to the computational complexity of the analysis, we conclude that the proposed precoding matrix design scheme has low complexity and is easy to implement. Moreover, the numerical results are proven to demonstrate the performance of the proposed precoding design scheme.

关键词： precoding design MIMO-PLC impulsive noise finite-alphabet input

来源：评论

学校读者我要写书评

暂无评论

A new transient stability margin based on dynamic security region and its applications

引用

Science China(Technological Sciences) 2008年第6期51卷 751-760页

作者： XUE AnCheng1, 2 & MEI ShengWei1 1 State key lab of Power systems, Department of Electrical Engineering, Tsinghua University, Beijing 100084, China 2 key lab of systems and control, Institute of systems Science, Chinese Academy of Sciences, Beijing 100190, China State Key Lab of Power Systems Department of Electrical Engineering Tsinghua University Beijing 100084 China Key Lab of Systems Control Institute of Systems Science Chinese Academy of Sciences Beijing 100190 China

A new transient stability margin is proposed based on a new expression of dynamic security region (DSR) which is developed from the existing expression of DSR. Applications of the DSR based transient stability margin to contingency ranking and screening are discussed. Simulations in the 10-machine 39-bus New England system are performed to show the effectiveness of the proposed DSR based tran-sient stability margin.

关键词： dynamic security region (DSR) transient stability margin contingency screening

来源：评论

学校读者我要写书评

暂无评论

Approximating the Spectral Abscissa for Switched Linear systems via Coordinate Transformations

引用

Journal of systems Science & Complexity 2016年第2期29卷 350-366页

作者： LIN Meili SUN Zhendong College of Automation Science and Engineering South China University of Technology Key Lab of Systems & Control Academy of Mathematics & Systems ScienceChinese Academy of Sciences

In this paper,an approach of square coordinate transformation is proposed to approximate the spectral abscissa for continuous-time switched linear *** applying elementary transformations iteratively,a series of minimums of least μ1 matrix set measures are obtained,which are utilized to approximate the spectral abscissa of the switched *** approach is developed into tractable numerical algorithms that provide upper bound estimates of the spectral *** simulations show the effectiveness of the proposed method.

关键词： Coordinate transformations matrix set measure spectral abscissa switched linear systems.

来源：评论

学校读者我要写书评

暂无评论

Unconventional topological Weyl-dipole phonon

arXiv

引用

arXiv 2025年

作者： Wang, Jianhua Wang, Yang Zhou, Feng Wang, Wenhong Cheng, Zhenxiang Qian, Shifeng Wang, Xiaotian Yu, Zhi-Ming Institute for Superconducting and Electronic Materials Faculty of Engineering and Information Sciences University of Wollongong Wollongong2500 Australia Institute of Quantum Materials and Devices Tiangong University Tianjin300387 China Beijing Key Lab of Nanophotonics & Ultrafine Optoelectronic Systems School of Physics Beijing Institute of Technology Beijing100081 China Anhui Province Key Laboratory for Control and Applications of Optoelectronic Information Materials Department of Physics Anhui Normal University Anhui Wuhu241000 China

A pair of Weyl points (WPs) with opposite Chern numbers C can exhibit an additional higher-order Z2 topological charge, giving rise to the formation of a Z2 Weyl dipole. Owing to the nontrivial topological charge, Z2 Weyl dipoles should also appear in pairs, and the WPs within each Z2 Weyl dipole can not be annihilated when meeting together. As a novel topological state, the topological Weyl-dipole phase (TWDP) has garnered significant attention, yet its realization in crystalline materials remains a challenge. Here, through first-principles calculations and theoretical analysis, we demonstrate the existence of the Weyl-dipole phase in the phonon spectra of the P63 type Y(OH)3. Particularly, the Weyl dipole in this system is protected by a quantized quadrupole moment, and it distinguished from conventional Weyl dipole, as it comprises an unconventional charge-3 WP with C = −3 and three conventional charge-1 WPs with C = 1. Consequently, the Weyl-dipole phase in Y(OH)3 features unique two-dimensional (2D) sextuple-helicoid Fermi-arc states on the top and bottom surfaces, protected by the Chern number, as well as one-dimensional (1D) hinge states that connect the two Weyl dipoles along the side hinges, guaranteed by the quantized quadrupole moment. Our findings not only introduce a novel higher-order topological phase, but also promote Y(OH)3 as a promising platform for exploring multi-dimensional boundaries and the interaction between first-order and second-order topologies. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TARGET AGGREGATION OF SECOND-ORDER MULTI-AGENT systems WITH SWITCHING INTERCONNECTION

引用

Journal of systems Science & Complexity 2012年第3期25卷 430-440页

作者： Youcheng LOU Yiguang HONG Guodong SHI Key Lab of Systems and Control Institute of Systems ScienceAcademy of Mathematics and Systems ScienceChinese Academy of Sciences ACCESS Linnaeus Centre School of Electrical EngineeringRoyal Institute of Technology

In this paper, the target aggregation is investigated for a multi-agent system consisting of second-order agents and multiple leaders. Sufficient conditions are proposed to make the agents approach the target set spanned by these moving leaders. With the condition on switching interconnection topologies, all mobile agents can asymptotically track the dynamical target set specified by multiple moving leaders with bounded error. Moreover, discussion on the case with static leaders is also given.

关键词： Multi-agent systems multiple leaders switching interconnection topologies target ag-gregation.

来源：评论

学校读者我要写书评

暂无评论

MULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY

引用

Journal of systems Science & Complexity 2009年第4期22卷 722-731页

作者： Yiguang HONG Xiaoli WANG key lab of systems and control,Institute of systems Science,Academy of Mathematics and systems Science,Chinese Academy of Sciences,Beijing 100190,China. Key Lab of Systems and Control Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China

This paper considers a multi-agent tracking problem for a high-dimensional active leaderand variable interconnection topology. The state of the leader not only keeps changing but also maynot be measured. To estimate the state such a leader individually, a neighbor-based local controllertogether with a neighbor-based state-estimation rule is given for each autonomous agent. Then, theauthors prove that, with the help of a constructed common Lyapunov function (CLF), each agent cantrack the active leader with unmeasurable states. Finally, the authors explicitly construct a CLF foran active leader with unknown periodic input for illustration.

关键词： Active leader distributed algorithms multi-agent systems switching topology.

来源：评论

学校读者我要写书评

暂无评论

The Game Theoretical Approach for Multi-phase Complex systems in Chemical Engineering

引用

Journal of systems Science & Complexity 2017年第1期30卷 4-19页

作者： LI Yan MU Yifen YUAN Shuo GUO Lei Beijing National Day School Beijing 100039 China Key Lab of Systems and Control Institute of Systems Science Academy of Mathematics and Systems ScienceChinese Academy of Sciences Beijing 100190 China

This paper explores the application of noncooperative game theory together with the concept of Nash equilibrium to the investigation of some basic problems on multi-scale structure, especially the meso-scale structure in the multi-phase complex systems in chemical engineering. The basis of this work is the energy-minimization-multi-scale （EMMS） model proposed by Li and Kwauk （1994） and Li, et al. （2013） which identifies the multi-scale structure as a result of ＇compromise-in-competition between dominant mechanisms＇ and tries to solve a multi-objective optimization problem. However, the existing methods often integrate it into a problem of single objective optimization, which does not clearly reflect the ＇compromise-in-competition＇ mechanism and causes heavy computation burden as well as uncertainty in choosing suitable weighting factors. This paper will formulate the compromise in competition mechanism in EMMS model as a noncooperative game with constraints, and will describe the desired stable system state as a generalized Nash equilibrium. Then the authors will investigate the game theoretical approach for two typical systems in chemical engineering, the gas-solid fluidiza- tion （GSF） system and turbulent flow in pipe. Two different cases for generalized Nash equilibrinm in such systems will be well defined and distinguished. The generalize Nash equilibrium will be solved accurately for the GSF system and a feasible method will be given for turbulent flow in pipe. These results coincide with the existing computational results and show the feasibility of this approach, which overcomes the disadvantages of the existing methods and provides deep insight into the mechanisms of multi-scale structure in the multi-phase complex systems in chemical engineering.

关键词： Game theory gas-solid fluidization generalized Nash equilibrium multi-phase complexsystems turbulent flow.

来源：评论

学校读者我要写书评

暂无评论

A New Convergent Algorithm for Online Empirical Risk Minimization 36

A New Convergent Algorithm for Online Empirical Risk Minimiz...

引用

第36届中国控制会议

作者： Xinqiang Wang Lei Guo Key Lab.of Systems and Control Institute of Systems ScienceAMSSCAS

ISBN: (纸本)9781538629185

The generalization ability of learning algorithms is the focus of machine learning research,where the empirical risk minimization（ERM） plays an important role when the population distribution of observations is *** of the previous results are mainly based on computational learning theory,which is interested in how many samples are needed to make sure the estimated expected risk satisfies a given accuracy with high *** this paper,we will propose a new algorithm by combining the advantages of both random search and gradient descent algorithms,and show that given an accuracy level of the estimated expected risk,we can generate a hypothesis by our algorithm to guarantee the accuracy with probability 1,and our algorithm will converge in finite *** addition,we will relax the conventional independently and identically distributed（i.i.d.）assumption on the observations to a kind of weakly dependent *** will also provide some simulations to demonstrate our algorithm’s advantages over either random search or gradient descent algorithms.

关键词： ERM random search convergent gradient descent machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：