Results 71 to 80 of about 118,666 (308)
Approximate Bayesian Computation with Path Signatures
, 2021 42 pages, 8 ...
Dyer, J, Cannon, P, Schmon, SM
openaire +4 more sources
Molecular Oncology, EarlyView.Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski +12 more
wiley +1 more source
Constrained Shortest Path Computation
, 2005 This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an a-autonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a.
Manolis Terrovitis +3 more
openaire +3 more sources
Molecular Oncology, EarlyView.The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington +10 more
wiley +1 more source
Cooperative path planning and cooperative perception for UAVs swarm [PDF]
, 2012 In this research Pythagorean Hodograph based path planning and camera based cooperative perception are investigated separately and then these two entirely separate areas (Path Planning and Perception) are integrated for the application in online pop-up ...
Shah, M. A.
core
Computing Good Nash Equilibria in Graphical Games
, 2007 This paper addresses the problem of fair equilibrium selection in graphical games. Our approach is based on the data structure called the {\em best response policy}, which was proposed by Kearns et al.~\cite{kls} as a way to represent all Nash equilibria
Edith Elkind +5 more
core +1 more source
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
Computational Paths and the Fundamental Groupoid of a Type
Anais do VI Encontro de Teoria da Computação (ETC 2021), 2021 Using computational paths as the fundamental concept, we show that we can leverage Category Theory to propose the concept of fundamental groupoid of a type.
Arthur F. Ramos +2 more
openaire +3 more sources
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
The Scientific World Journal, 2014 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
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source