Results 61 to 70 of about 892,017 (284)
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
, 2017 This paper gives drastically faster gossip algorithms to compute exact and approximate quantiles. Gossip algorithms, which allow each node to contact a uniformly random other node in each round, have been intensely studied and been adopted in many ...
Haeupler, Bernhard +2 more
core +1 more source
Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma
Molecular Oncology, EarlyView.The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic +5 more
wiley +1 more source
A family of global convergent inexact secant methods for nonconvex constrained optimization
Journal of Algorithms & Computational Technology, 2018 We present a family of new inexact secant methods in association with Armijo line search technique for solving nonconvex constrained optimization. Different from the existing inexact secant methods, the algorithms proposed in this paper need not compute ...
Zhujun Wang, Li Cai, Zheng Peng
doaj +1 more source
Modified Gerchberg–Saxton (G-S) Algorithm and Its Application
Entropy, 2020 The Gerchberg–Saxton (G-S) algorithm is a phase retrieval algorithm that is widely used in beam shaping and optical information processing. However, the G-S algorithm has difficulty obtaining the exact solution after iterating, and an approximate ...
Tieyu Zhao, Yingying Chi
doaj +1 more source
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
CPSP-tools – Exact and complete algorithms for high-throughput 3D lattice protein studies
BMC Bioinformatics, 2008 Background The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. lattice proteins.
Will Sebastian +2 more
doaj +1 more source
New Soliton Solutions for the Higher-Dimensional Non-Local Ito Equation
Nonlinear Engineering, 2021 In this article, (2+1)-dimensional Ito equation that models waves motion on shallow water surfaces is analyzed for exact analytic solutions. Two reliable techniques involving the simplest equation and modified simplest equation algorithms are utilized to
Inc Mustafa +5 more
doaj +1 more source
Molecular Oncology, EarlyView.CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak +10 more
wiley +1 more source
Improved exact algorithms for MAX-SAT [PDF]
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jianer, Kanj, Iyad A
openaire +2 more sources
Efficiency comparison of exact and approximate algorithms for solving set covering problem
Advanced Engineering Research, 2017 Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits.
Igor S. Konovalov +2 more
doaj +1 more source