检索结果-南通市图书馆

Effective distributed algorithm for solving linear matrix equations

Science China(Information Sciences) 2023年第8期66卷 265-266页

作者： Songsong CHENG Jinlong LEI xianlin zeng Yuan FAN Yiguang HONG Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Anhui University Department of Control Science and Engineering Tongji University Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology

Dear editor,Solving linear matrix equations is a basic and important problem in many fields such as the computation of generalized inverses of matrices and(generalized) Sylvester equations. Also, the linear algebraic ...

关键词：

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

电离辐射对鼻咽癌中铁死亡驱动因子SOCS1与抑制因子FTH1表达水平的影响

引用

中国医药导报 2024年第19期21卷 106-111页

作者：金仙槐曾宪琳龙金华贵州医科大学附属医院肿瘤科贵州贵阳550004 贵州医科大学附属肿瘤医院肿瘤科贵州贵阳550004 贵州医科大学临床医学院肿瘤学教研室贵州贵阳550004 贵州医科大学生物与工程学院贵州贵阳550004

目的探索铁死亡驱动因子细胞因子信号转导抑制蛋白1(SOCS1)与抑制因子铁蛋白重链1(FTH1)在鼻咽癌中的表达水平及电离辐射对其的影响。方法分析来自GEO数据库的鼻咽癌数据集GSE53819(18个鼻咽癌样本和18份鼻咽正常组织样本)和GSE12452... 详细信息

目的探索铁死亡驱动因子细胞因子信号转导抑制蛋白1(SOCS1)与抑制因子铁蛋白重链1(FTH1)在鼻咽癌中的表达水平及电离辐射对其的影响。方法分析来自GEO数据库的鼻咽癌数据集GSE53819(18个鼻咽癌样本和18份鼻咽正常组织样本)和GSE12452(31个鼻咽癌样本和10份鼻咽正常组织样本)中SOCS1与FTH1的表达水平,并联合GSE62328(30个鼻咽癌样本)分析不同肿瘤分期、淋巴结转移状态与原发-复发类型中SOCS1和FTH1表达水平;利用GSE48501数据集中放射抵抗性鼻咽癌CNE2-IR细胞和放射敏感性鼻咽癌CNE2细胞中m RNA表达数据,分析SOCS1与FTH1在放射抵抗性和放射敏感性鼻咽癌细胞株中的表达水平;以经2 Gy电离辐射照射后的鼻咽癌C666-1细胞为实验组,0 Gy电离辐射照射的鼻咽癌C666-1细胞为对照组,应用RT-q PCR法分别检测其中SOCS1与FTH1的表达水平。结果 GEO数据库分析显示,鼻咽癌组织中SOCS1与FTH1表达水平高于正常鼻咽组织(P0.05)。RT-PCR结果提示,实验组C666-1细胞中SOCS1表达水平高于对照组,FTH1表达水平低于对照组(P<0.05)。结论铁死亡驱动因子SOCS1与抑制因子FTH1在鼻咽癌中差异表达且可作为鼻咽癌放射治疗潜在靶点。

关键词：细胞因子信号抑制蛋白1 铁蛋白重链1 鼻咽癌铁死亡放射治疗

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Deep Reinforcement Learning Method for Lion and Man Problem

A Deep Reinforcement Learning Method for Lion and Man Proble...

引用

第40届中国控制会议

作者： Jiebang Xing xianlin zeng School of Automation Reijing Institute of Technology

David Gale’s lion and man problem,which is a fundamental pursuit-evasion game,attracts the interest of many *** propose a deep reinforcement learning method based on Deep Deterministic Policy Gradient（DDPG） to solve this *** first improve the exploration strategy by adding guided exploration and dynamic spaces exploration strategies to the greedy *** we introduce a learning reset mechanism to help the agents escape the traps in the learning *** these improvements,our method achieves better performance than the classic DDPG algorithm in the lion and man *** simulation result shows that deep reinforcement learning method may be promising to solve this problem.

关键词： Lion and Man Problem Exploration Strategy Deep Reinforcement Learning

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

2010年首届闽台音乐周·海峡两岸当代音乐创作研讨会综述

引用

人民音乐 2011年第3期 28-29页

作者：曾宪林福建省艺术研究院音乐舞蹈室

2010年11月7—11日，由福建文化厅主办，福建艺术研究院与台湾国际新象文教基金会联合承办的“首届闽台音乐周暨海峡两岸当代音乐创作研讨会”在福州举办。这是在“京、沪、闽现代音乐创作研讨会”基础上的延伸，突破了以往放录音研讨... 详细信息

2010年11月7—11日，由福建文化厅主办，福建艺术研究院与台湾国际新象文教基金会联合承办的“首届闽台音乐周暨海峡两岸当代音乐创作研讨会”在福州举办。这是在“京、沪、闽现代音乐创作研讨会”基础上的延伸，突破了以往放录音研讨的局面，实现了“京、沪、闽、台”作曲家、理论家在福建交流的多年期盼，开创了两岸现代音乐作品在福建首次同台上演的历史篇章。

关键词： 2010年音乐创作海峡两岸当代音乐研讨会综述闽台创作研讨会现代音乐

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Distributed Computation of Common Lyapunov Functions

Distributed Computation of Common Lyapunov Functions

引用

第37届中国控制会议

作者： Xiong zeng xianlin zeng Yiguang Hong LSC Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Beijing Institute of Technology

This paper investigates the distributed computation of common Lyapunov functions over multi-agent networks for switching problems. From an optimization perspective, we present a distributed algorithm for solving the nonlinear convex programming problem by means of the projection method. Then we prove that the proposed algorithm is Lyapunov stable and can converge to an exact optimal solution of the common Lyapunov functions problem.

关键词： Distributed Computation Common Lyapunov Functions Linear Matrix Inequalities Optimization

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

An Exact Penalty Method for Constrained Distributed Optimization

An Exact Penalty Method for Constrained Distributed Optimiza...

引用

第36届中国控制会议

作者： Hongbing Zhou xianlin zeng Yiguang Hong Key Laboratory of Systems and Control Institute of Systems ScienceChinese Academy of Sciences

ISBN: (纸本)9781538629185

This paper focuses on a distributed non-smooth constrained optimization problem,in which the non-smoothness means the continuity but *** optimization deals with optimizing a sum of objective functions,each function is known by one agent due to many reasons such as privacy and *** all the agent reach an global optimal by communicating through an interaction *** proposed an exact penalty algorithm for constrained distributed optimization,which has some good properties when we design a continuous-time *** we rigorously prove the efficiency of this *** also put a numerical example to show the efficacy of the proposed algorithm.

关键词： Exact penalty method distributed algorithm non-smooth optimization continuous-time multi-agent systems

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Continuous-Time Distributed Algorithms for Solving Linear Algebraic Equation

Continuous-Time Distributed Algorithms for Solving Linear Al...

引用

第36届中国控制会议

作者： Kai Cao xianlin zeng Yiguang Hong Key Laboratory of Systems and Control Institute of Systems ScienceChinese Academy of Sciences

ISBN: (纸本)9781538629185

In this paper,a multi-agent distributed continuous-time algorithm is proposed to solve a large-scale linear algebraic equation Ax = *** many existing results assuming each agent knows a few rows of A,the algorithm proposed in this paper assumes each agent knows a few columns of *** solve the linear algebraic equation,the problem is first converted to an optimization problem with a linear ***,a distributed continuous-time algorithm is designed based on the Lagrangian function of the optimization *** algorithm is proved to solve the linear algebraic equation with any initial condition via a Lyapunov *** example is presented to show the efficacy of the proposed algorithm.

关键词： Distributed algorithms Multi-agent systems Linear algebraic equation Lagrangian function

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Multi-agent Network Flow Design to Solve Matrix Equation Based on Nonsmooth Convex Optimization

Multi-agent Network Flow Design to Solve Matrix Equation Bas...

引用

第37届中国控制会议

作者： Wen Deng xianlin zeng Yiguang Hong School of Mathematical Sciences University of Chinese Academy of Sciences LSC Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Automation Beijing Institute of Technology

This paper studies the distributed computation of a linear matrix equation in the form of i=1 Ai X Bi =i=1 Ci,over multi-agent networks from an optimization perspective, with some nonsmooth requirements of the optimization variable X at the same time. In this multi-agent network, agent i can only get access to Ai, Bi, Ci and communicate with its ***, a distributed continuous-time algorithm, from a distributed constrained optimization viewpoint, is proposed to obtain the solution with balance between its least squares bias and requirements of the nonsmooth convex function, where the saddle point method and derivative feedback technique are employed to deal with complicated problem. With help of the Lyapunov stability and semi-stability analysis, we prove the convergence of the algorithm for any initial condition.

关键词： Multi-agent networks distributed algorithm linear matrix equation nonsmooth convex function semi-stability

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Distributed Object Transport of Mobile Manipulators with Optimal Manipulable Coordination

Distributed Object Transport of Mobile Manipulators with Opt...

引用

第37届中国控制会议

作者： Chu Wu Hao Fang xianlin zeng Beijing Institute of Technology

This paper addresses a distributed projected control algorithm for networked mobile manipulators to achieve a task of object transport with optimal manipulable coordination between robot arm and mobile platform. The task is designed as a distributed non-convex optimization problem with time-varying coupled equality constraints. To eliminate the time-varying term in the optimization problem, the task variables are first introduced. The non-convex cost function is then proved convex under a sufficient condition by selecting a proper displacement vector. Moreover, a modified Lagrangian function containing local multipliers and a nonsmooth penalty function is constructed to handle the coupled equality constraints in a distributed ***, a fully distributed projected control algorithm is proposed to achieve the object transport task based on the primaldual subgradient dynamics. We prove the convergence of the algorithm utilizing the Lyapunov stability theory and the invariance principle. Under the proposed control algorithm, the object transport is accomplished with optimal manipulable coordination,which is further validated through numerical simulations.

关键词： Object transport distributed optimization manipulability primal-dual dynamics

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Privacy Preservation for Distributed Nonsmooth Constrained Optimization Based on Pseudo-Subgradient

Privacy Preservation for Distributed Nonsmooth Constrained O...

引用

第37届中国控制会议

作者： xianlin zeng Shu Liang Jie Chen Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing Advanced Innovation Center for Intelligent Robots and Systems (Beijing Institute of Technology) Key Laboratory of Biomimetic Robots and Systems (Beijing Institute of Technology) Ministry of Education

In this paper, we investigate a privacy preservation design in the distributed nonsmooth convex optimization with set constraints. To solve the distributed optimization problem while preserving the privacy, we use pseudo-subgradients involved with（non-integrable） set-valued functions. Based on pseudo-subgradients, we propose distributed nonsmooth optimization algorithms with keeping subgradient information confidential. Then we prove the correctness and convergence of the distributed privacy preservation optimization algorithms to achieve the exact solution of the original optimization problem.

关键词： Distributed nonsmooth convex optimization privacy preservation set constraints pseudo-subgradients

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：