Results 61 to 70 of about 768,033 (273)
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
A Partitioning and Index Algorithm for RDF Data of Cloud-Based Robotic Systems
IEEE Access, 2018 Robotic systems generally employ resource description framework (RDF) to express heterogeneous data coming from different sensors. With the access of more terminals, the RDF volume in robotic systems is becoming larger and larger, posing new significant ...
Yonglin Leng +3 more
doaj +1 more source
Scalable graph partitioning for distributed graph processing [PDF]
, 2019 Distributed graph processing systems such as Pregel, PowerGraph, or GraphX have gained popularity due to their superior performance of data analytics on graph-structured data such as social networks, web document graphs, and biological networks.
Mayer, Christian
core +1 more source
Oncogenic DMTF1β promotes cancer cell motility by regulating autophagy through ULK1 stabilization
Molecular Oncology, EarlyView.In the current study, we demonstrate that the oncogene DMTF1β regulates ULK1 stability by reducing its proteasomal degradation in cancer cells. This stabilization enables ULK1 to induce autophagy, which in turn facilitates cancer cell migration. Consequently, reduced DMTF1β levels lead to decreased autophagy and impaired cancer cell migration.
Jun Xu +13 more
wiley +1 more source
Data Science and Engineering, 2019 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
Partitions of Graphs into Trees [PDF]
, 2007 In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with applications e.g. in network reliability and graph theory. In graph drawing there is the still unbeaten (n - 2) ×(n - 2) area planar straight line drawing of maximal planar ...
Therese Biedl, Franz-Josef Brandenburg
openaire +1 more source
Distributed Graph Simulation: Impossibility and Possibility [PDF]
, 2014 This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Improved Algorithm of Graph Partitioning Structure Detection Based on Minimum Description Length [PDF]
Jisuanji gongcheng, 2016 Aiming at the disadvantages of the existing Graph Partitioning Change Detection(GPCD) algorithm like repeated segmentation and ignoring change cost of images,it employs probabilistic trees to represent probabilistic models of graph partitioning ...
WEI Changbao,YAO Ruxian
doaj +1 more source
Unfriendly partitions of a graph
Journal of Combinatorial Theory, Series B, 1990 An unfriendly partition of a graph (V,E) is a partition \(V=V_ 0\cup V_ 1\) such that for every vertex in \(V_ i\), the number of its neighbours in \(V_{1-i}\) is bigger or equal to that of its neighbours in \(V_ i\). The existence of an unfriendly partition of a graph (well-known if the graph is finite) is proved in the case (a) the graph has finitely
Ron Aharoni, E. C. Milner, Karel Prikry
openaire +1 more source