Results 71 to 80 of about 5,064,874 (383)
One-way quantum computing in superconducting circuits
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, while ...
Albarrán-Arriagada, F. +6 more
core +1 more source
A neural network for shortest path computation [PDF]
This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem.
F. Araújo, B. Ribeiro, L. Rodrigues
openaire +3 more sources
Computational paths - a weak groupoid
Abstract On the basis of a labelled deduction system (LND$_{ED-}$TRS), we demonstrate how to formalize the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. This has allowed us to carry out a formal counterpart to equality between paths which is dealt with in homotopy theory, but ...
Tiago M L de Veras +3 more
openaire +1 more source
Effective therapeutic targeting of CTNNB1‐mutant hepatoblastoma with WNTinib
WNTinib, a Wnt/CTNNB1 inhibitor, was tested in hepatoblastoma (HB) experimental models. It delayed tumor growth and improved survival in CTNNB1‐mutant in vivo models. In organoids, WNTinib outperformed cisplatin and showed enhanced efficacy in combination therapy, supporting its potential as a targeted treatment for CTNNB1‐mutated HB.
Ugne Balaseviciute +17 more
wiley +1 more source
Efficient implicit simulation for incremental forming [PDF]
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
When the path is never shortest: a reality check on shortest path biocomputation
Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky +28 more
core +1 more source
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Inferring Microscopic Kinetic Rates from Stationary State Distributions. [PDF]
We present a principled approach for estimating the matrix of microscopic transition probabilities among states of a Markov process, given only its stationary state population distribution and a single average global kinetic observable.
Dill, Ken A, Dixit, Purushottam D
core +2 more sources
A general model for analysis of linear and hyperbolic enzyme inhibition mechanisms
We developed a general enzyme kinetic model that integrates these six basic inhibition mechanism onto a single one. From this model, we deduced a general enzyme kinetic equation that through modulation of simple parameters, γ (the relative inhibitor affinity for two binding sites) and β (the reactivity of the enzyme–substrate–inhibitor complex), is ...
Rafael S. Chagas, Sandro R. Marana
wiley +1 more source
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang +5 more
doaj +1 more source

