Results 71 to 80 of about 10,839,512 (369)
Ubiquity symposium: The science in computer science: unplugging computer science to find the science [PDF]
Ubiquity, 2014 The Computer Science Unplugged project provides activities that enable students to engage with concepts from computer science without having to program. Many of the activities provide the basis of a scientific exploration of computer science, and thus help students to see the relationship of the discipline with science.
openaire +3 more sources
FoxO1 signaling in B cell malignancies and its therapeutic targeting
FEBS Letters, EarlyView.FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac +3 more
wiley +1 more source
Formal Languages, Formally and Coinductively [PDF]
Logical Methods in Computer Science, 2017 Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and elegant proofs ...
Dmitriy Traytel
doaj +1 more source
Insights into PI3K/AKT signaling in B cell development and chronic lymphocytic leukemia
FEBS Letters, EarlyView.This Review explores how the phosphoinositide 3‐kinase and protein kinase B pathway shapes B cell development and drives chronic lymphocytic leukemia, a common blood cancer. It examines how signaling levels affect disease progression, addresses treatment challenges, and introduces novel experimental strategies to improve therapies and patient outcomes.
Maike Buchner
wiley +1 more source
Distributed high-fidelity graphics using P2P [PDF]
, 2012 In the field of three-dimensional computer graphics, rendering refers to the process of generating images of a scene from a particular viewpoint. There are many different ways to do this, from the highly interactive real-time rendering methods to the ...
Computer Science Annual Workshop CSAW’12 +1 more
core
Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints [PDF]
Logical Methods in Computer ScienceIn game theory, mechanism design is concerned with the design of incentives so that a desired outcome of the game can be achieved. In this paper, we explore the concept of equilibrium design, where incentives are designed to obtain a desirable ...
Julian Gutierrez +3 more
doaj +1 more source
An Effect System for Algebraic Effects and Handlers [PDF]
Logical Methods in Computer Science, 2014 We present an effect system for core Eff, a simplified variant of Eff, which is an ML-style programming language with first-class algebraic effects and handlers. We define an expressive effect system and prove safety of operational semantics with respect
Andrej Bauer, Matija Pretnar
doaj +1 more source
Making tau amyloid models in vitro: a crucial and underestimated challenge
FEBS Letters, EarlyView.This review highlights the challenges of producing in vitro amyloid assemblies of the tau protein. We review how accurately the existing protocols mimic tau deposits found in the brain of patients affected with tauopathies. We discuss the important properties that should be considered when forming amyloids and the benchmarks that should be used to ...
Julien Broc, Clara Piersson, Yann Fichou
wiley +1 more source
Collaborative rendering over peer-to-peer networks [PDF]
, 2013 Physically-based high-fidelity rendering pervades areas like engineering, architecture, archaeology and defence, amongs others. The computationally intensive algorithms required for such visualisation benefit greatly from added computational resources ...
Bugeja, Keith +1 more
core
Finite state verifiers with constant randomness [PDF]
Logical Methods in Computer Science, 2014 We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its ...
Cem Say, Abuzer Yakaryilmaz
doaj +1 more source