120 resultados para FORMALISMS
Resumo:
BACKGROUND: Qualitative frameworks, especially those based on the logical discrete formalism, are increasingly used to model regulatory and signalling networks. A major advantage of these frameworks is that they do not require precise quantitative data, and that they are well-suited for studies of large networks. While numerous groups have developed specific computational tools that provide original methods to analyse qualitative models, a standard format to exchange qualitative models has been missing. RESULTS: We present the Systems Biology Markup Language (SBML) Qualitative Models Package ("qual"), an extension of the SBML Level 3 standard designed for computer representation of qualitative models of biological networks. We demonstrate the interoperability of models via SBML qual through the analysis of a specific signalling network by three independent software tools. Furthermore, the collective effort to define the SBML qual format paved the way for the development of LogicalModel, an open-source model library, which will facilitate the adoption of the format as well as the collaborative development of algorithms to analyse qualitative models. CONCLUSIONS: SBML qual allows the exchange of qualitative models among a number of complementary software tools. SBML qual has the potential to promote collaborative work on the development of novel computational approaches, as well as on the specification and the analysis of comprehensive qualitative models of regulatory and signalling networks.
Resumo:
We study spacetime diffeomorphisms in the Hamiltonian and Lagrangian formalisms of generally covariant systems. We show that the gauge group for such a system is characterized by having generators which are projectable under the Legendre map. The gauge group is found to be much larger than the original group of spacetime diffeomorphisms, since its generators must depend on the lapse function and shift vector of the spacetime metric in a given coordinate patch. Our results are generalizations of earlier results by Salisbury and Sundermeyer. They arise in a natural way from using the requirement of equivalence between Lagrangian and Hamiltonian formulations of the system, and they are new in that the symmetries are realized on the full set of phase space variables. The generators are displayed explicitly and are applied to the relativistic string and to general relativity.
Resumo:
The equivalence between the Lagrangian and Hamiltonian formalism is studied for constraint systems. A procedure to construct the Lagrangian constraints from the Hamiltonian constraints is given. Those Hamiltonian constraints that are first class with respect to the Hamiltonian constraints produce Lagrangian constraints that are FL-projectable.
Resumo:
We calculate the spectra of produced thermal photons in Au + Au collisions taking into account the nonequilibrium contribution to photon production due to finite shear viscosity. The evolution of the fireball is modeled by second-order as well as by divergence-type 2 + 1 dissipative hydrodynamics, both with an ideal equation of state and with one based on Lattice QCD that includes an analytical crossover. The spectrum calculated in the divergence-type theory is considerably enhanced with respect to the one calculated in the second-order theory, the difference being entirely due to differences in the viscous corrections to photon production. Our results show that the differences in hydrodynamic formalisms are an important source of uncertainty in the extraction of the value of eta/s from measured photon spectra. The uncertainty in the value of eta/s associated with different hydrodynamic models used to compute thermal photon spectra is larger than the one occurring in matching hadron elliptic flow to RHIC data. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Recently, the superstring was covariantly quantized using the BRST-like operator Q = ∮ λαdα where λα is a pure spinor and dα are the fermionic Green-Schwarz constraints. By performing a field redefinition and a similarity transformation, this BRST-like operator is mapped to the sum of the Ramond-Neveu-Schwarz BRST operator and η0 ghost. This map is then used to relate physical vertex operators and tree amplitudes in the two formalisms. Furthermore, the map implies the existence of a b ghost in the pure spinor formalism which might be useful for loop amplitude computations.
Resumo:
Although it is not known how to covariantly quantize the Green-Schwarz (GS) superstring, there exists a semi-light-cone gauge choice in which the GS superstring can be quantized in a conformally invariant manner. In this paper, we prove that BRST quantization of the GS superstring in semi-light-cone gauge is equivalent to BRST quantization using the pure spinor formalism for the superstring © SISSA/ISAS 2005.
Resumo:
Bio-molecular computing, 'computations performed by bio-molecules', is already challenging traditional approaches to computation both theoretically and technologically. Often placed within the wider context of ´bio-inspired' or 'natural' or even 'unconventional' computing, the study of natural and artificial molecular computations is adding to our understanding of biology, physical sciences and computer science well beyond the framework of existing design and implementation paradigms. In this introduction, We wish to outline the current scope of the field and assemble some basic arguments that, bio-molecular computation is of central importance to computer science, physical sciences and biology using HOL - Higher Order Logic. HOL is used as the computational tool in our R&D work. DNA was analyzed as a chemical computing engine, in our effort to develop novel formalisms to understand the molecular scale bio-chemical computing behavior using HOL. In our view, our focus is one of the pioneering efforts in this promising domain of nano-bio scale chemical information processing dynamics.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
The field of Semantic Web Services (SWS) has been recognized as one of the most promising areas of emergent research within the Semantic Web initiative, exhibiting an extensive commercial potential and attracting significant attention from both industry and the research community. Currently, there exist several different frameworks and languages for formally describing a Web Service: Web Ontology Language for Services (OWL-S), Web Service Modelling Ontology (WSMO) and Semantic Annotations for the Web Services Description Language (SAWSDL) are the most important approaches. To the inexperienced user, choosing the appropriate platform for a specific SWS application may prove to be challenging, given a lack of clear separation between the ideas promoted by the associated research communities. In this paper, we systematically compare OWL-S, WSMO and SAWSDL from various standpoints, namely, that of the service requester and provider as well as the broker-based view. The comparison is meant to help users to better understand the strengths and limitations of these different approaches to formalizing SWS, and to choose the most suitable solution for a given application. Copyright © 2015 John Wiley & Sons, Ltd.
Resumo:
The field of Semantic Web Services (SWS) has been recognized as one of the most promising areas of emergent research within the Semantic Web (SW) initiative, exhibiting an extensive commercial potential, and attracting significant attention from both industry and the research community. Currently, there exist several different frameworks and languages for formally describing a Web Service: OWL-S (Web Ontology Language for Services), WSMO (Web Service Modeling Ontology) and SAWSDL (Semantic Annotations for the Web Services Description Language) are the most important approaches. To the inexperienced user, choosing the appropriate paradigm for a specific SWS application may prove to be challenging, given a lack of clear separation between the ideas promoted by the associated research communities. In this paper, we systematically compare OWL-S, WSMO and SAWSDL from various standpoints, namely that of the service requester and provider as well as the broker based view. The comparison is meant to help users to better understand the strengths and limitations of these different approaches to formalising SWS, and to choose the most suitable solution for a given use case. © 2013 IEEE.