A5044446578- Distributed Control Multi-Agent Systems
- Neural Networks Stability and Synchronization
- Adaptive Dynamic Programming Control
- COVID-19 epidemiological studies
- Mathematical and Theoretical Epidemiology and Ecology Models
- Stability and Control of Uncertain Systems
- Adaptive Control of Nonlinear Systems
- Cellular Automata and Applications
- Protein Degradation and Inhibitors
- Optimization and Variational Analysis
- Ubiquitin and proteasome pathways
- Complex Network Analysis Techniques
- Gene Regulatory Network Analysis
- Control and Stability of Dynamical Systems
- Advanced Data Storage Technologies
- Evolution and Genetic Dynamics
- Opinion Dynamics and Social Influence
- Optimization and Search Problems
- Evolutionary Game Theory and Cooperation
- Caching and Content Delivery
- Influenza Virus Research Studies
- Peptidase Inhibition and Analysis
Central South University
2020-2024
Hangzhou Dianzi University
2018
Meisoindigo (Mei) has long been recognized in chronic myeloid leukemia (CML) treatment. To elucidate its molecular target and mechanisms, we embarked on designing synthesizing a series of Mei-derived PROTACs. Through this endeavor, VHL-type PROTAC 9b was identified to be highly cytotoxic against SW620, SW480, K562 cells. Employing DiaPASEF-based quantitative proteomic analysis, combination with extensive validation assays, unveiled that potently selectively degraded ATM across SW620 SW480...
In this article, a distributed constrained optimization problem is studied with nonconvex input constraints, nonuniform convex state and step sizes for single-integrator multiagent systems. Due to the existence of edge weights between agents are equivalently multiplied different time-varying scaling factors, thus, real interaction relationship cannot be kept balanced, even if original communication graphs balanced. constraints sizes, system contains strong nonlinearities, which coupled...
The epidemic containment game is a formulation to describe voluntary vaccination behaviors before spreading. This relies on the characterization of susceptible-infected- susceptible (SIS) model in terms spectral radius network. Existing researches showed that finding worst Nash Equilibrium (NE) NP-hard and used heuristic algorithm called Low Degree (LDG) estimate maximum social cost under NE (Max cost). By comparing results LDG exhaustive search, we found cannot Max well, thus, proposed new...
This paper addresses the problem of containment control for second-order multi-agent systems with position constraints, time delays, and switching graphs. The approach involves treating constraints a scaling factor transforming system into new one through model transformations. Based on analysis Lyapunov function, it is demonstrated that all followers will eventually enter convex hull formed by leaders, as long there exists at least directed path to leaders in union communication Finally,...
Traditionally, individual intensities to perform games are always assumed be fixed in networks (e.g. depend on the number of their neighbors). However, increase own fitness or payoffs, individuals may adjust reaction external environment changes real scenarios. With this motivation, we have studied adjustment by considering average payoff neighbors network a spatial prisoner’s dilemma game. An will unilaterally (decrease) its intensity between itself and when is greater than equal (lower...
In this brief, the containment problem of double-integrate discrete-time agents network is investigated with control input and velocity constrains. A nonlinear projection algorithm used to converge all follower into a convex hull formed by static leaders, where scaling factor proposed solve constrains such as saturations nonconvex Based on model transformation Lyapunov function, range from proved be nonincreasing under suitable assumption. Finally, after analysis, solved bounded time delays...
Many of the existing papers about containment control problem for multi-agent systems were built under an ideal setting and only a few works concerned physical constraints states inputs agents. The idea this paper is to study set tracking problems system subject convex-position switching topologies. first contribution find condition which ensures each agent have possibility track given when all agents are assumed stay in their own constraint sets. second propose two nonlinear distributed...
In this paper, we investigate the nonconvex L <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> − xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> containment control. The objective is to use local information make all followers move convex hull formed by multiple stationary leaders while satisfying a desired −L performance index and control input of each follower remain in their corresponding constraint set. Based on operator Lyapunov...