124,990 research outputs found
Setting Parameters for Biological Models With ANIMO
ANIMO (Analysis of Networks with Interactive MOdeling) is a software for
modeling biological networks, such as e.g. signaling, metabolic or gene
networks. An ANIMO model is essentially the sum of a network topology and a
number of interaction parameters. The topology describes the interactions
between biological entities in form of a graph, while the parameters determine
the speed of occurrence of such interactions. When a mismatch is observed
between the behavior of an ANIMO model and experimental data, we want to update
the model so that it explains the new data. In general, the topology of a model
can be expanded with new (known or hypothetical) nodes, and enables it to match
experimental data. However, the unrestrained addition of new parts to a model
causes two problems: models can become too complex too fast, to the point of
being intractable, and too many parts marked as "hypothetical" or "not known"
make a model unrealistic. Even if changing the topology is normally the easier
task, these problems push us to try a better parameter fit as a first step, and
resort to modifying the model topology only as a last resource. In this paper
we show the support added in ANIMO to ease the task of expanding the knowledge
on biological networks, concentrating in particular on the parameter settings
Qualitative and quantitative analysis of systems and synthetic biology constructs using P systems
YesComputational models are perceived as an attractive alternative to mathematical models (e.g., ordinary differential equations). These models incorporate a set of methods for specifying, modeling, testing, and simulating biological systems. In addition, they can be analyzed using algorithmic techniques (e.g., formal verification). This paper shows how formal verification is utilized in systems and synthetic biology through qualitative vs quantitative analysis. Here, we choose two well-known case studies: quorum sensing in P. aeruginosas and pulse generator. The paper reports verification analysis of two systems carried out using some model checking tools, integrated to the Infobiotics Workbench platform, where system models are based on stochastic P systems.EPSR
Handwritten Signature Verification using Deep Learning
Every person has his/her own unique signature that is used mainly for the purposes of personal
identification and verification of important documents or legal transactions. There are two kinds of signature
verification: static and dynamic. Static(off-line) verification is the process of verifying an electronic or document
signature after it has been made, while dynamic(on-line) verification takes place as a person creates his/her
signature on a digital tablet or a similar device. Offline signature verification is not efficient and slow for a large
number of documents. To overcome the drawbacks of offline signature verification, we have seen a growth in
online biometric personal verification such as fingerprints, eye scan etc. In this paper we created CNN model
using python for offline signature and after training and validating, the accuracy of testing was 99.70%
BioDiVinE: A Framework for Parallel Analysis of Biological Models
In this paper a novel tool BioDiVinEfor parallel analysis of biological
models is presented. The tool allows analysis of biological models specified in
terms of a set of chemical reactions. Chemical reactions are transformed into a
system of multi-affine differential equations. BioDiVinE employs techniques for
finite discrete abstraction of the continuous state space. At that level,
parallel analysis algorithms based on model checking are provided. In the
paper, the key tool features are described and their application is
demonstrated by means of a case study
Techniques for automated parameter estimation in computational models of probabilistic systems
The main contribution of this dissertation is the design of two new algorithms for automatically synthesizing values of numerical parameters of computational models of complex stochastic systems such that the resultant model meets user-specified behavioral specifications. These algorithms are designed to operate on probabilistic systems – systems that, in general, behave differently under identical conditions. The algorithms work using an approach that combines formal verification and mathematical optimization to explore a model\u27s parameter space. The problem of determining whether a model instantiated with a given set of parameter values satisfies the desired specification is first defined using formal verification terminology, and then reformulated in terms of statistical hypothesis testing. Parameter space exploration involves determining the outcome of the hypothesis testing query for each parameter point and is guided using simulated annealing. The first algorithm uses the sequential probability ratio test (SPRT) to solve the hypothesis testing problems, whereas the second algorithm uses an approach based on Bayesian statistical model checking (BSMC). The SPRT-based parameter synthesis algorithm was used to validate that a given model of glucose-insulin metabolism has the capability of representing diabetic behavior by synthesizing values of three parameters that ensure that the glucose-insulin subsystem spends at least 20 minutes in a diabetic scenario. The BSMC-based algorithm was used to discover the values of parameters in a physiological model of the acute inflammatory response that guarantee a set of desired clinical outcomes. These two applications demonstrate how our algorithms use formal verification, statistical hypothesis testing and mathematical optimization to automatically synthesize parameters of complex probabilistic models in order to meet user-specified behavioral propertie
- …