Results 51 to 60 of about 742,132 (325)

Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks

open access: yesEntropy, 2019
Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link.
Giuseppe Vettigli   +5 more
doaj   +1 more source

Tumor mutational burden as a determinant of metastatic dissemination patterns

open access: yesMolecular Oncology, EarlyView.
This study performed a comprehensive analysis of genomic data to elucidate whether metastasis in certain organs share genetic characteristics regardless of cancer type. No robust mutational patterns were identified across different metastatic locations and cancer types.
Eduardo Candeal   +4 more
wiley   +1 more source

Approximation Results: Szász–Kantorovich Operators Enhanced by Frobenius–Euler–Type Polynomials

open access: yesAxioms
This research focuses on the approximation properties of Kantorovich-type operators using Frobenius–Euler–Simsek polynomials. The test functions and central moments are calculated as part of this study.
Nadeem Rao, Mohammad Farid, Mohd Raiz
doaj   +1 more source

Colorectal cancer‐derived FGF19 is a metabolically active serum biomarker that exerts enteroendocrine effects on mouse liver

open access: yesMolecular Oncology, EarlyView.
Meta‐transcriptome analysis identified FGF19 as a peptide enteroendocrine hormone associated with colorectal cancer prognosis. In vivo xenograft models showed release of FGF19 into the blood at levels that correlated with tumor volumes. Tumoral‐FGF19 altered murine liver metabolism through FGFR4, thereby reducing bile acid synthesis and increasing ...
Jordan M. Beardsley   +5 more
wiley   +1 more source

Algorithms For Positive Polynomial Approximation [PDF]

open access: yesSIAM Journal on Numerical Analysis, 2019
Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique   +2 more
openaire   +2 more sources

Identification of serum protein biomarkers for pre‐cancerous lesions associated with pancreatic ductal adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns   +10 more
wiley   +1 more source

A New Modification of Baskakov–Schurer–Stancu Operators: Weighted and Pointwise Approximation Theories

open access: yesMathematics
The behavior of a new modification of operators of the Baskakov–Schurer–Stancu variant is discussed in this study. First, we establish certain necessary moment and central moment estimates.
Nadire Fulda Odabaşı   +3 more
doaj   +1 more source

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

open access: yesAlgorithms, 2017
This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing
Sean Yaw, Brendan Mumey
doaj   +1 more source

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

open access: yesMolecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova   +25 more
wiley   +1 more source

Efficient Approximation for Restricted Biclique Cover Problems

open access: yesAlgorithms, 2018
Covering the edges of a bipartite graph by a minimum set of bipartite complete graphs (bicliques) is a basic graph theoretic problem, with numerous applications. In particular, it is used to characterize parsimonious models of a set of observations (each
Alessandro Epasto, Eli Upfal
doaj   +1 more source

Home - About - Disclaimer - Privacy