scholarly journals Interval Constraint Satisfaction and Optimization for Biological Homeostasis and Multistationarity

2020 ◽  
Author(s):  
Aurélien Desoeuvres ◽  
Gilles Trombettoni ◽  
Ovidiu Radulescu

AbstractHomeostasis occurs in a biological or chemical system when some output variable remains approximately constant as one or several input parameters change over some intervals. We propose in this paper a new computational method based on interval techniques to find species in biochemical systems that verify homeostasis. A somehow dual and equally important property is multistationarity, which means that the system has multiple steady states and possible outputs, at constant parameters. We also propose an interval method for testing multistationarity. We have tested homeostasis, absolute concentration robustness and multistationarity on a large collection of biochemical models from the Biomodels and DOCSS databases. The codes used in this paper are publicly available at: https://github.com/Glawal/IbexHomeo.

2018 ◽  
Vol 2018 ◽  
pp. 1-14
Author(s):  
Pierre-Alain Yvars ◽  
Laurent Zimmer

We test the relevance of a model-based approach for sizing and optimizing complex systems. Classically a model-based approach is characterized by a clear partition between the problem description and the solving process. In the case of a design problem, we show that the sizing task could be systematically characterized and therefore could lead to a declarative model combining both system description and design requirements. Once translated into a constraint satisfaction problem, the resulting model can be solved with interval constraint programming methods and algorithms. Our first contribution to this approach is to precisely characterize the sizing task in design. The resulting terminology enables us to easily and systematically express the problem as a constraint satisfaction problem (CSP) which combines in the same model the system description and the design requirements. We have tested the approach on the optimal sizing problem of a power transmission system. Previous authors have described this scalable case study. They provide a mathematical formulation of the problem and solve it with an evolutionary algorithm. Starting from their description, we apply our methodology to model the problem as a CSP and then solve it with interval constraint programming algorithms. Our solutions are more adequate both in computational time and in optimization results than those published in the literature on the same problem. Moreover the declarative nature of constraint programming makes modifications or extensions easier than with evolutionary programming. The explanation of these results is our second contribution to the approach. However some important modelling issues remain to address in order to capture more and more complex system specifications. Further research is presented at the end of this paper.


Author(s):  
Eero Hyvönen

AbstractSpreadsheets are difficult to use in applications, where only incomplete or inexact data (e.g., intervals) are available-a typical situation in various design and planning tasks. It can be argued that this is due to two fundamental shortcomings of the computational paradigm underlying spreadsheets. First, the distinction between input and output cells has to be fixed before computations. Second, cells may have only exact values. As a result, spread-sheets support the user only with primitive iterative problem solving schemes based on trial-and-error methods. A constraint-based computational paradigm for next generation interval spreadsheets is presented. The scheme makes it possible to exploit incomplete/inexact data (intervals), and it can support problem solving in a top-down fashion. Current spreadsheets constitute a special case of the more general interval constraint spreadsheets proposed.


Author(s):  
Timothy P. Darr ◽  
William P. Birmingham

AbstractThis paper presents a novel formulation of the configuration-design problem that achieves the benefits of the concurrent engineering (CE) design paradigm. In CE, all design concerns (manufacturability, testability, etc.) are applied to an evolving design throughout the design cycle. CE identifies conflicts early on, avoids costly redesign, and leads to better products. Our formulation is based on a distributed dynamic interval constraint-satisfaction problem (DDICSP) model. Persistent catalog agents map onto DDICSP variables and constraint agents map onto DDICSP constraints. These agents use a set of operations and heuristics to navigate the design space to eliminate sets of designs until a solution is found. Experimental results show that an architecture where each catalog agent resides on a separate computer has performance advantages over nondistributed approaches.


Sign in / Sign up

Export Citation Format

Share Document