检索结果-南通市图书馆

Distributed Nonsmooth Convex Optimization over Markovian Switching Random Networks with Two Step-Sizes

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2021年第4期34卷 1324-1344页

作者： yi peng LI Li Department of Control Science and Engineering Tongji Universityand Shanghai Institute of Intelligent Science and TechnologyTongji UniversityShanghai 200092China

This paper investigates the distributed convex optimization problem over a multi-agent system with Markovian switching communication *** objective function is the sum of each agent’s local nonsmooth objective function,which cannot be known by other *** communication network is assumed to switch over a set of weight-balanced directed graphs with a Markovian *** authors propose a consensus sub-gradient algorithm with two time-scale step-sizes to handle the Markovian switching topologies and the absence of global gradient *** proper selection of step-sizes,the authors prove the almost sure convergence of all agents’local estimates to the same optimal solution when the union graph of the Markovian network’states is strongly connected and the Markovian chain is *** convergence rate analysis is also given for specific *** are given to demonstrate the results.

关键词： Distributed optimization random graphs two time-scale algorithm

Global Classical Solutions to the Equations of Two-dimensional MHD Transverse Flow

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2006年第5期22卷 1371-1384页

作者： yi peng SHI State Key Laboratory for Turbulence and Complex System Peking University Beijing 100871 P. R. China

A new method for constructing the symmetric form for the hyperbolic systems is introduced. Then a new symmetric form of the equations of MHD transverse flow is constructed by adding an additional equation. With this new form, we obtain the local existence of smooth solution including the case that the initial density may tend to the vacuum state at infinity. Furthermore, the uniformly a priori estimation for the classical solutions is established and the global smooth solutions for a kind of initial data are obtained.

关键词： MHD transverse flow global classical solution

Research progress and prospects of complete ammonia oxidizing bacteria in wastewater treatment

在线全文

学校读者我要写书评

暂无评论

Frontiers of Environmental Science & Engineering 2022年第9期16卷 151-160页

作者： Shaoping Luo yi peng ying Liu Yongzhen peng National Engineering Laboratory for Advanced Municipal Wastewater Treatment and Reuse Technology Engineering Research Center of BeijingBeijing University of TechnologyBeijing 100124China Xinkai Water Environmental Investment Co.Ltd. Beijing 101101China Zhongshan Public Utilities Water Co.Ltd. Zhongshan 528400China

Complete ammonia oxidizing bacteria,or comammox bacteria(CAOB),can oxidize ammonium to nitrate on its *** discovery revolutionized our understanding of biological nitrification,and its distribution in both natural and artificial systems has enabled a reevaluation of the relative contribution of microorganisms to the nitrogen *** wide distribution,adaptation to oligotrophic medium,and diverse metabolic pathways,means extensive research on CAOB and its application in water treatment can be ***,the energy-saving characteristics of high oxygen affinity and low sludge production may also become frontier directions for wastewater *** paper provides an overview of the discovery and environmental distribution of CAOB,as well as the physiological characteristics of the microorganisms,such as nutrient medium,environmental factors,enzymes,and metabolism,focusing on future research and the application of CAOB in wastewater *** research should be carried out on the physiological characteristics of CAOB,to analyze its ecological niche and impact factors,and explore its application potential in wastewater treatment nitrogen cycle improvement.

关键词： Complete ammonia oxidizing(comammox) bacteria Nitrogen cycle Physiological characteristics Wastewater treatment

Distributed best response dynamics for Nash equilibrium seeking in potential games

在线全文

学校读者我要写书评

暂无评论

Control Theory and Technology 2020年第3期18卷 324-332页

作者： Shijie HUANG peng yi Key Lab of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100190China Department of Control Science&Engineering Tongji UniversityShanghai 201804China Shanghai Institute of Intelligent Science and Technology Tongji UniversityShanghai 201804China

In this paper,we consider distributed Nash equilibrium(NE)seeking in potential games over a multi-agent network,where each agent can not observe the actions of all its *** on the best response dynamics,we design a distributed NE seeking algorithm by incorporating the non-smooth finite-time average tracking dynamics,where each agent only needs to know its own action and exchange information with its neighbours through a communication *** give a sufficient condition for the Lipschitz continuity of the best response mapping for potential games,and then prove the convergence of the proposed algorithm based on the Lyapunov *** simulations are given to verify the resultandillustrate the effectiveness of the algorithm.

关键词： Distributed algorithms Nash equilibrium seeking best response dynamics non-smooth finite-time tracking dynamics potential games

Distributed Gradient Tracking Methods with Finite Data Rates

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2021年第5期34卷 1927-1952页

作者： MA Xiaoyu yi peng CHEN Jie Department of Control Science and Engineering Tongji UniversityShanghai 200082China. Shanghai Research Institute for Intelligent Autonomous Systems Tongji UniversityShanghai 200082China

This paper studies the distributed optimization problem over an undirected connected graph subject to digital communications with a finite data rate,where each agent holds a strongly convex and smooth cost *** agents need to cooperatively minimize the average of all agents’cost *** agent builds an encoder/decoder pair that produces transmitted messages to its neighbors with a finite-level uniform quantizer,and recovers its neighbors’states by a recursive decoder with received quantized *** the adaptive encoder/decoder scheme with the gradient tracking method,the authors propose a distributed quantized *** authors prove that the optimization can be achieved at a linear rate,even when agents communicate at 1-bit data *** examples are also conducted to illustrate theoretical results.

关键词： Distributed optimization gradient tracking method quantization

Electrocatalysts based on metal@carbon core@shell nanocomposites:An overview

在线全文

学校读者我要写书评

暂无评论

Green Energy & Environment 2018年第4期3卷 335-351页

作者： yi peng Shaowei Chen Department of Chemistry and Biochemistry University of California

Developing low-cost, high-performance catalysts is of fundamental significance for electrochemical energy conversion and storage. In recent years, metal@carbon core@shell nanocomposites have emerged as a unique class of functional nanomaterials that show apparent electrocatalytic activity towards a range of reactions, such as hydrogen evolution reaction, oxygen evolution reaction, oxygen reduction reaction, and CO2 reduction reaction, that are important in water splitting, fuel cells and metal-air batteries. The activity is primarily attributed to interfacial charge transfer from the metal core to the carbon shell that manipulate the electronic interactions between the catalyst surface and reaction intermediates, and varies with the structures and morphologies of the metal core(elemental composition, core size, etc.) and carbon shell(doping,layer thickness, etc.). Further manipulation can be achieved by the incorporation of a third structural component. A perspective is also included highlighting the current gap between theoretical modeling and experimental results, and technical challenges for future research.

关键词： Metal@carbon core@shell nanocomposite Electrocatalysis Hydrogen evolution reaction Oxygen evolution reaction Oxygen reduction reaction

New directions in distributed Nash equilibrium seeking based on monotone operator theory

在线全文

学校读者我要写书评

暂无评论

Control Theory and Technology 2020年第3期18卷 333-335页

作者： peng yi Tongyu WANG Department of Control Science&Engineering Tongji UniversityShanghai 201804China Shanghai Institute of Intelligent Science and Technology Tongji UniversityShanghai 201804China

There has been an increasing research interest in modeling,optimization and control of various multi-agent networks that have wide applications in industry,defense,security,and social areas,such as computing clusters,interconnected micro-grid systems,unmanned vessel swarms[1],power systems[2],multiple UAV systems[3]and sensor networks[4].For non-cooperative agents that only concern selfish profit-maximizing,the decision making problem can be modelled and solved with the help of game theory,while Nash equilibrium(NE)seeking is at the core to solve the non-cooperative multi-agent games[5-7].Distributed NE seeking methods are appealing compared with the center-based methods in large-scale networks due to its scalability,privacy protection,and ***,monotone operator theory is explored for distributed NE seeking,which is shown to provide an uniform framework for various algorithms in different *** has been gradually developing into a cutting-edge research field,with the prospect and necessity of future in-depth research.

关键词： seeking monotone operator

Distributed Algorithm for Robust Resource Allocation with Polyhedral Uncertain Allocation Parameters

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2018年第1期31卷 103-119页

作者： ZENG Xianlin yi peng HONG yiguang School of Automation Beijing Institute of Technology Beijing 100081 China Department of Electrical and Systems Engineering Washington University in St. Louis St. Louis MO 63130 USA Key Laboratory of Systems and Control Institute of Systems Science Chinese Academy of Sciences Beijing 100190 China

This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the（nonsmooth） objective function is a sum of local convex objective functions assigned to agents in a multi-agent network. Each agent has a private feasible set and decides a local variable, and all the local variables are coupled with a global affine inequality constraint,which is subject to polyhedral uncertain parameters. With the duality theory of convex optimization,the authors derive a robust counterpart of the robust resource allocation problem. Based on the robust counterpart, the authors propose a novel distributed continuous-time algorithm, in which each agent only knows its local objective function, local uncertainty parameter, local constraint set, and its neighbors＇ information. Using the stability theory of differential inclusions, the authors show that the algorithm is able to find the optimal solution under some mild conditions. Finally, the authors give an example to illustrate the efficacy of the proposed algorithm.

关键词： Distributed optimization resource allocation robust optimization polyhedral uncertain parameters nonsmooth optimization

On a BMAP/G/1 G-queue with Setup Times and Multiple Vacations

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2011年第4期27卷 625-638页

作者： yi peng Xiang-qun YANG School of Mathematical Science and Computing Technology Central South University Changsha 410075 Hunan China College of Mathematics and Computer Science Hunan Normal University Changsha 410081 China

In this paper, we consider a BMAP/G/1 G-queue with setup times and multiple vacations. Arrivals of positive customers and negative customers follow a batch Markovian arrival process （BMAP） and Markovian arrival process （MAP） respectively. The arrival of a negative customer removes all the customers in the system when the server is working. The server leaves for a vacation as soon as the system empties and is allowed to take repeated （multiple） vacations. By using the supplementary variables method and the censoring technique, we obtain the queue length distributions. We also obtain the mean of the busy period based on the renewal theory.

关键词： G-queues batch Markovian arrival process (BMAP) setup times multiple vacations censoring technique Markov chains