اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSymmetry invariance for adapting biological systems
226
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study in this paper certain properties of the responses of dynamical systems to external inputs. The motivation arises from molecular systems biology. and, in particular, the recent discovery of an important transient property, related to Webers law in psychophysics: fold-change detection in adapting systems, the property that scale uncertainty does not affect responses. FCD appears to play an important role in key signaling transduction mechanisms in eukaryotes, including the ERK and Wnt pathways, as well as in E.coli and possibly other prokaryotic chemotaxis pathways. In this paper, we provide further theoretical results regarding this property. Far more generally, we develop a necessary and sufficient characterization of adapting systems whose transient behaviors are invariant under the action of a set (often, a group) of symmetries in their sensory field. A particular instance is FCD, which amounts to invariance under the action of the multiplicative group of positive real numbers. Our main result is framed in terms of a notion which extends equivariant actions of compact Lie groups. Its proof relies upon control theoretic tools, and in particular the uniqueness theorem for minimal realizations.
قيم البحث
اقرأ أيضاً
This paper generalizes the Lasalle-Yoshizawa Theorem to switched nonsmooth systems. Filippov and Krasovskii regularizations of a switched system are shown to be contained within the convex hull of the Filippov and Krasovskii regularizations of the su
bsystems, respectively. A candidate common Lyapunov function that has a negative semidefinite derivative along the trajectories of the subsystems is shown to be sufficient to establish LaSalle-Yoshizawa results for the switched system. Results for regular and non-regular candidate Lyapunov functions are presented using an appropriate generalization of the time derivative. The developed generalization is motivated by adaptive control of switched systems where the derivative of the candidate Lyapunov function is typically negative semidefinite.
In many large systems, such as those encountered in biology or economics, the dynamics are nonlinear and are only known very coarsely. It is often the case, however, that the signs (excitation or inhibition) of individual interactions are known. This
paper extends to nonlinear systems the classical criteria of linear sign stability introduced in the 70s, yielding simple sufficient conditions to determine stability using only the sign patterns of the interactions.
Network reconstruction is the first step towards understanding, diagnosing and controlling the dynamics of complex networked systems. It allows us to infer properties of the interaction matrix, which characterizes how nodes in a system directly inter
act with each other. Despite a decade of extensive studies, network reconstruction remains an outstanding challenge. The fundamental limitations governing which properties of the interaction matrix (e.g., adjacency pattern, sign pattern and degree sequence) can be inferred from given temporal data of individual nodes remain unknown. Here we rigorously derive necessary conditions to reconstruct any property of the interaction matrix. These conditions characterize how uncertain can we be about the coupling functions that characterize the interactions between nodes, and how informative does the measured temporal data need to be; rendering two classes of fundamental limitations of network reconstruction. Counterintuitively, we find that reconstructing any property of the interaction matrix is generically as difficult as reconstructing the interaction matrix itself, requiring equally informative temporal data. Revealing these fundamental limitations shed light on the design of better network reconstruction algorithms, which offer practical improvements over existing methods.
The issues of robust stability for two types of uncertain fractional-order systems of order $alpha in (0,1)$ are dealt with in this paper. For the polytope-type uncertainty case, a less conservative sufficient condition of robust stability is given;
for the norm-bounded uncertainty case, a sufficient and necessary condition of robust stability is presented. Both of these conditions can be checked by solving sets of linear matrix inequalities. Two numerical examples are presented to confirm the proposed conditions.
This paper proposes a fully distributed robust state-estimation (D-RBSE) method that is applicable to multi-area power systems with nonlinear measurements. We extend the recently introduced bilinear formulation of state estimation problems to a robus
t model. A distributed bilinear state-estimation procedure is developed. In both linear stages, the state estimation problem in each area is solved locally, with minimal data exchange with its neighbors. The intermediate nonlinear transformation can be performed by all areas in parallel without any need of inter-regional communication. This algorithm does not require a central coordinator and can compress bad measurements by introducing a robust state estimation model. Numerical tests on IEEE 14-bus and 118-bus benchmark systems demonstrate the validity of the method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
