Results 21 to 30 of about 2,116,656 (327)

Suppression of Nucleotide Metabolism Underlies the Establishment and Maintenance of Oncogene-Induced Senescence

open access: yesCell Reports, 2013
Oncogene-induced senescence is characterized by a stable cell growth arrest, thus providing a tumor suppression mechanism. However, the underlying mechanisms for this phenomenon remain unknown.
Katherine M. Aird   +10 more
doaj   +1 more source

Problems for combinatorial numbers satisfying a class of triangular arrays

open access: yesLietuvos Matematikos Rinkinys, 2023
Numbers satisfying a class of triangular arrays, defined by a bivariate first-order linear difference equation with linear coefficients, include a wide range of combinatorial numbers: binomial coefficients, Morgan numbers, Stirling numbers of the first ...
Igoris Belovas
doaj   +1 more source

Musings on Encodings and Expressiveness [PDF]

open access: yesEPTCS 89, 2012, pp. 81-98, 2012
This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition with other definitions of encoding and expressiveness found in the literature, and illustrate it on a case study ...
arxiv   +1 more source

A computational study of the Warburg effect identifies metabolic targets inhibiting cancer migration

open access: yesMolecular Systems Biology, 2014
Over the last decade, the field of cancer metabolism has mainly focused on studying the role of tumorigenic metabolic rewiring in supporting cancer proliferation.
Keren Yizhak   +8 more
doaj   +1 more source

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]

open access: yesMath. Struct. Comp. Sci. 26 (2016) 933-968, 2010
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the ...
arxiv   +1 more source

Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions [PDF]

open access: yesEPTCS 334, 2021, pp. 29-45, 2021
Milner (1984) introduced a process semantics for regular expressions as process graphs. Unlike for the language semantics, where every regular (that is, DFA-accepted) language is the interpretation of some regular expression, there are finite process graphs that are not bisimilar to the process interpretation of any regular expression.
arxiv   +1 more source

Comparison of Real-Time Face Detection and Recognition Algorithms [PDF]

open access: yesITM Web of Conferences, 2022
With the phenomenal growth of video and image databases, there is a tremendous need for intelligent systems to automatically understand and examine information, as doing so manually is becoming increasingly difficult.
Borkar Yasar   +3 more
doaj   +1 more source

Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics [PDF]

open access: yesEPTCS 339, 2021, pp. 10-26, 2021
We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynamic logic (PDL), and those extending the modal mu-calculus. This is inspired by the recent discovery of a decidable program logic called Visibly Pushdown Fixpoint Logic with ...
arxiv   +1 more source

A temporal latent topic model for facial expression recognition [PDF]

open access: yes, 2011
Posters: no. 128LNCS v. 6495 is conference proceedings of the 10th Asian Conference on Computer Vision, Queens, ACCVIn this paper we extend the latent Dirichlet allocation (LDA) topic model to model facial expression dynamics. Our topic model integrates
Chan, KP, Shang, L
core   +1 more source

From Computer Science to the Informational Worldview. Philosophical Interpretations of Some Computer Science Concepts

open access: yesFoundations of Computing and Decision Sciences, 2019
In this article I defend the thesis that modern computer science has a significant philosophical potential, which is expressed in a form of worldview, called here informational worldview (IVW).
Stacewicz Paweł
doaj   +1 more source

Home - About - Disclaimer - Privacy