Results 61 to 70 of about 193,029 (263)
The usage of RISC-based embedded processors, aimed at low cost and low power, is becoming an increasingly popular ecosystem for both hardware and software development.
Erez Manor, Shlomo Greenberg
doaj +1 more source
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
The coarse-grained multicomputer parallel model (CGM for short) has been used for solving several classes of dynamic programming problems. In this paper, we propose a parallel algorithm on the CGM model, with p processors, for solving the optimal binary ...
Vianney Kengne Tchendji +1 more
doaj +1 more source
Isoperimetric Partitioning: A New Algorithm for Graph Partitioning [PDF]
Temporal structure is skilled, fluent action exists at several nested levels. At the largest scale considered here, short sequences of actions that are planned collectively in prefronatal cortex appear to be queued for performance by a cyclic competitive
Grady, Leo, Schwartz, Eric
core +1 more source
Community detection and graph partitioning
Many methods have been proposed for community detection in networks. Some of the most promising are methods based on statistical inference, which rest on solid mathematical foundations and return excellent results in practice.
Newman, M. E. J.
core +1 more source
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
\(k\)-efficient partitions of graphs
Summary: A set \(S = \{u_1,u_2, \dots, u_t\}\) of vertices of \(G\) is an efficient dominating set if every vertex of \(G\) is dominated exactly once by the vertices of \(S\). Letting \(U_i\) denote the set of vertices dominated by \(u_i\), we note that \(\{U_1, U_2, \dots, U_t\}\) is a partition of the vertex set of \(G\) and that each \(U_i ...
Chellali, Mustapha +2 more
openaire +4 more sources
We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
Metformin mediates mitochondrial quality control in Leber's hereditary optic neuropathy (LHON) fibroblasts carrying mtDNA mutations. At therapeutic levels, metformin activates AMPK signaling to restore mitochondrial dynamics by promoting fusion and restraining fission, while preserving mitochondrial mass, enhancing autophagy/mitophagy and biogenesis ...
Chatnapa Panusatid +3 more
wiley +1 more source
PACC: Large scale connected component computation on Hadoop and Spark.
A connected component in a graph is a set of nodes linked to each other by paths. The problem of finding connected components has been applied to diverse graph analysis tasks such as graph partitioning, graph compression, and pattern recognition. Several
Ha-Myung Park +3 more
doaj +1 more source

