Results 91 to 100 of about 453,286 (286)

Detecting modules in dense weighted networks with the Potts method

open access: yes, 2008
We address the problem of multiresolution module detection in dense weighted networks, where the modular structure is encoded in the weights rather than topology.
Arenas A   +14 more
core   +4 more sources

Tail behavior of randomly weighted sums with interdependent summands

open access: yes
We reconsider a classical, well-studied problem from applied probability. This is the max-sum equivalence of randomly weighted sums, and the originality is because we manage to include interdependence among the primary random variables, as well as among primary random variables and random weights, as a generalization of previously published results. As
Konstantinides, Dimitrios G.   +3 more
openaire   +2 more sources

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

A Competitive Genetic Algorithm for Single Row Facility Layout [PDF]

open access: yes
The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities.
Ghosh, Diptesh, Kothari, Ravi
core  

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

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

Perturbed-History Exploration in Stochastic Linear Bandits

open access: yes, 2019
We propose a new online algorithm for minimizing the cumulative regret in stochastic linear bandits. The key idea is to build a perturbed history, which mixes the history of observed rewards with a pseudo-history of randomly generated i.i.d.
Boutilier, Craig   +3 more
core  

RIPK4 function interferes with melanoma cell adhesion and metastasis

open access: yesMolecular Oncology, EarlyView.
RIPK4 promotes melanoma growth and spread. RIPK4 levels increase as skin lesions progress to melanoma. CRISPR/Cas9‐mediated deletion of RIPK4 causes melanoma cells to form less compact spheroids, reduces their migratory and invasive abilities and limits tumour growth and dissemination in mouse models.
Norbert Wronski   +9 more
wiley   +1 more source

An Exact Approach to Early/Tardy Scheduling with Release Dates [PDF]

open access: yes
In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. The problem is decomposed into a weighted earliness subproblem and a weighted tardiness subproblem.
Jorge M. S. Valente, Rui A. F. S. Alves
core  

Quantifying Triadic Closure in Multi-Edge Social Networks

open access: yes, 2019
Multi-edge networks capture repeated interactions between individuals. In social networks, such edges often form closed triangles, or triads. Standard approaches to measure this triadic closure, however, fail for multi-edge networks, because they do not ...
Brandenberger, Laurence   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy