Results 51 to 60 of about 156,901 (262)
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
A note on irreducible Heegaard diagrams
International Journal of Mathematics and Mathematical Sciences, 2006 We construct a Heegaard diagram of genus three for the real projective 3-space, which has no waves and pairs of complementary handles. The first example was given by Im and Kim but our diagram has smaller complexity.
Alberto Cavicchioli, Fulvia Spaggiari
doaj +1 more source
Towards a Proof Theory of G\"odel Modal Logics [PDF]
Logical Methods in Computer Science, 2011 Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
George Metcalfe, Nicola Olivetti
doaj +1 more source
On the Complexity of Finding Narrow Proofs [PDF]
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012 Full version of the FOCS 2012 ...
openaire +2 more sources
Molecular Oncology, EarlyView.Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang +12 more
wiley +1 more source
On the Complexity of Optimal k-Anonymity: A New Proof Based on Graph Coloring
IEEE AccessPrivacy is a complex balancing problem between risks and utility of data. K-anonymity, a fundamental model for preserving privacy, guarantees that an item cannot be differentiated from at least k-1 other items.
Yavuz Canbay
doaj +1 more source
Proof Compression and NP Versus PSPACE II
Bulletin of the Section of Logic, 2020 We upgrade [3] to a complete proof of the conjecture NP = PSPACE that is known as one of the fundamental open problems in the mathematical theory of computational complexity; this proof is based on [2].
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
On the complexity of Gödel's proof predicate [PDF]
The Journal of Symbolic Logic, 2010 AbstractThe undecidability of first-order logic implies that there is no computable bound on the length of shortest proofs of valid sentences of first-order logic. Some valid sentences can only have quite long proofs. How hard is it to prove such “hard” valid sentences?
Chen, Yijia, Flum, Jörg
openaire +2 more sources
Molecular Oncology, EarlyView.Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch +13 more
wiley +1 more source
TWO-FACTOR AUTHENTICATION PROTOCOL IN ACCESS CONTROL SYSTEMS
Information and Telecommunication Sciences, 2023 Background. To ensure the protection of the biometric access control system used in unsecured communication channels, it is necessary to exclude the storage and transfer, transfer of biometric data as well as sequences generated on their basis. The paper
Ірина Стрелковська +2 more
doaj +1 more source