Results 81 to 90 of about 632,681 (338)
Move-optimal schedules for parallel machines to minimize total weighted completion time [PDF]
, 2005 We study the minimum total weighted completion time problem on identical machines, which is known to be strongly $\mathcal{NP}$-hard. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be
Brueggemann, T., Hurink, J.L., Kern, W.
core +1 more source
Two-particle propagator and magnetic susceptibility in the Hubbard model- An improved treatment
, 2003 We treat the two-particle Green's function in the Hubbard model using the recently developed tau-CPA, a hybrid treatment that applies the coherent-potential approximation (CPA) up to a time tau related to the inverse of the band width, after which the ...
A Uldry +5 more
core +1 more source
Molecular 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
Weighted Thresholding and Nonlinear Approximation
, 2017 We present a new method for performing nonlinear approximation with redundant dictionaries. The method constructs an $m-$term approximation of the signal by thresholding with respect to a weighted version of its canonical expansion coefficients, thereby ...
Nielsen, Morten, Ottosen, Emil Solsbæk
core
Approximation theory for weighted Sobolev spaces on curves [PDF]
, 2001 17 pages, no figures.-- MSC2000 codes: 41A10, 46E35, 46G10.MR#: MR1882649 (2003c:42002)In this paper we present a definition of weighted Sobolev spaces on curves and find general conditions under which the spaces are complete.
Pestana, Domingo +3 more
core +2 more sources
Fast Routing Table Construction Using Small Messages
, 2012 We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD denote the hop diameter of the graph, i.e., the diameter of the graph ...
Lenzen, Christoph, Patt-Shamir, Boaz
core +1 more source
Molecular 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
Journal of Function Spaces, 2020 We define the notions of weighted λ,μ-statistical convergence of order γ1,γ2 and strongly weighted λ,μ-summability of γ1,γ2 for fuzzy double sequences, where ...
Abdullah Alotaibi
doaj +1 more source
Molecular Oncology, EarlyView.Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang +12 more
wiley +1 more source
New Characterization for Nonlinear Weighted Best Simultaneous Approximation
International Journal of Mathematics and Mathematical Sciences, 2009 This paper is concerned with the problem of a wide class of weighted best simultaneous approximation in normed linear spaces, and it establishes a new characterization result for the class of approximation by virtue of the notion of simultaneous regular ...
Xianfa Luo, Delin Wu, Jinsu He
doaj +1 more source