Zobrazeno 1 - 10
of 2 280
pro vyhledávání: '"P. Fages"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
August Rafanell
Publikováno v:
Caplletra: Revista Internacional de Filologia, Vol 0, Iss 3, Pp 83-94 (2015)
Abstract: Notes on some linguistic and sociolinguistic aspects of the Valencian "translation".
Externí odkaz:
https://doaj.org/article/afc1cc3d577340f3ab7e5e4d27baf98a
Autor:
Buscemi, Hugo, Fages, François
Publikováno v:
Proc. 22nd International Conference on Computational Methods in Systems Biology, CMSB 2024., Sep 2024, Pisa (IT), Italy
Complex systems can be advantageously modeled by formal reaction systems (RS), a.k.a. chemical reaction networks in chemistry. Reaction-based models can indeed be interpreted in a hierarchy of semantics, depending on the question at hand, most notabl
Externí odkaz:
http://arxiv.org/abs/2406.18126
Autor:
Maria Ferraro, Serena Di Vincenzo, Claudia Sangiorgi, Stefania Leto Barone, Sebastiano Gangemi, Luigi Lanata, Elisabetta Pace
Publikováno v:
Pharmaceuticals, Vol 15, Iss 2, p 218 (2022)
Patients with Chronic Obstructive Pulmonary Disease (COPD) periodically experience acute exacerbation (AECOPD). Carbocysteine represents a valid add on therapy in COPD by exerting antioxidant and anti-inflammatory activities. The in vivo effects of c
Externí odkaz:
https://doaj.org/article/d2efd8129c3b4788b27948ae3206c250
We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection with the em
Externí odkaz:
http://arxiv.org/abs/cs/0003042
Autor:
Fages, François
Constraint logic programming emerged in the late 80's as a highly declarative class of programming languages based on first-order logic and theories with decidable constraint languages, thereby subsuming Prolog restricted to equality constraints over
Externí odkaz:
http://arxiv.org/abs/2402.17286
Autor:
Hemery, Mathieu, Fages, François
The Turing completeness of continuous Chemical Reaction Networks (CRNs) states that any computable real function can be computed by a continuous CRN on a finite set of molecular species, possibly restricted to elementary reactions, i.e. with at most
Externí odkaz:
http://arxiv.org/abs/2310.14721
Autor:
Greugny, Eléa Thibault, Fages, François, Radulescu, Ovidiu, Szmolyan, Peter, Stamatas, Georgios
The skin microbiome plays an important role in the maintenance of a healthy skin. It is an ecosystem, composed of several species, competing for resources and interacting with the skin cells. Imbalance in the cutaneous microbiome, also called dysbios
Externí odkaz:
http://arxiv.org/abs/2310.15201
Autor:
Steve Fuller
Publikováno v:
Socio, Vol 3, Pp 165-177 (2014)
My response to Fages and Saint-Martin contests their premise that my public defence of Intelligent Design (ID), both in a landmark 2005 US court case and in subsequent writings, has been a disaster. I admit that my Science and Technology Studies (STS
Externí odkaz:
https://doaj.org/article/dfed40973c9f43688dc9c3586caba374
Autor:
Hemery, Mathieu, Fages, François
The online estimation of the derivative of an input signal is widespread in control theory and engineering. In the realm of chemical reaction networks (CRN), this raises however a number of specific issues on the different ways to achieve it. A CRN p
Externí odkaz:
http://arxiv.org/abs/2307.04397