Results 51 to 60 of about 1,003,319 (338)

Iterative Dynamic Critical Path Scheduling: An Efficient Technique for Offloading Task Graphs in Mobile Edge Computing

open access: yesApplied Sciences, 2022
Recent years have witnessed a paradigm shift from centralized cloud computing to decentralized edge computing. As a key enabler technique in edge computing, computation offloading migrates computation-intensive tasks from resource-limited devices to ...
Bo Xu   +5 more
doaj   +1 more source

Explicit Computational Paths

open access: yes, 2016
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are proofs that $a$ and $b$ are equal elements of type $A$.
Ramos, Arthur Freitas   +2 more
openaire   +2 more sources

The zinc finger domains of PARP‐1 are selectively and potently inhibited by the Au(I)‐based drugs sodium aurothiomalate and aurothioglucose

open access: yesFEBS Letters, EarlyView.
PARP‐1 is a key enzyme in the DNA damage response, and its inhibition induces cancer cell death via synthetic lethality. Au(I)‐based drugs, such as aurothioglucose and sodium aurothiomalate, block PARP‐1's DNA‐dependent activity by targeting its zinc finger domains.
Uliana Bashtanova, Melinda Jane Duer
wiley   +1 more source

Memristive Crossbar Arrays for Storage and Computing Applications

open access: yesAdvanced Intelligent Systems, 2021
The emergence of memristors with potential applications in data storage and artificial intelligence has attracted wide attentions. Memristors are assembled in crossbar arrays with data bits encoded by the resistance of individual cells.
Huihan Li   +10 more
doaj   +1 more source

Overcoming device unreliability with continuous learning in a population coding based computing system

open access: yes, 2018
The brain, which uses redundancy and continuous learning to overcome the unreliability of its components, provides a promising path to building computing systems that are robust to the unreliability of their constituent nanodevices.
Grollier, Julie   +3 more
core   +2 more sources

Computing Tutte Paths

open access: yes, 2017
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial.
Schmid, Andreas, Schmidt, Jens M.
openaire   +5 more sources

Disciplines, models, and computers: The path to computational quantum chemistry [PDF]

open access: yesStudies in History and Philosophy of Science Part A, 2014
Many disciplines and scientific fields have undergone a computational turn in the past several decades. This paper analyzes this sort of turn by investigating the case of computational quantum chemistry. The main claim is that the transformation from quantum to computational quantum chemistry involved changes in three dimensions.
openaire   +3 more sources

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra   +10 more
wiley   +1 more source

Efficient implicit simulation for incremental forming [PDF]

open access: yes, 2010
Single Point Incremental Forming (SPIF) is a displacement controlled process performed on a CNC machine. A clamped blank is deformed by the movement of a small sized tool that follows a prescribed tool path.
Boogaard, A.H. van den, Hadoush, A.
core   +1 more source

Home - About - Disclaimer - Privacy