Results 51 to 60 of about 36,227 (305)

Partitioning Graph Clustering With User-Specified Density

open access: yesIEEE Access, 2023
Graph clustering has attracted many interests in recent years, with numerous applications ranging from the clustering of computer networks to the detection of social communities.
Rohi Tariq   +3 more
doaj   +1 more source

pH‐mediated activation of the lysosomal arginine sensor SLC38A9

open access: yesFEBS Letters, EarlyView.
Cells monitor nutrient levels via the lysosomal transporter SLC38A9 to activate the mechanistic target of rapamycin complex 1 (mTORC1). This study reveals that SLC38A9 function is regulated by pH. We identified histidine 544 as a critical pH sensor that undergoes conformational changes to control amino acid efflux from lysosomes; therefore, it ...
Xuelang Mu, Ampon Sae Her, Tamir Gonen
wiley   +1 more source

Property Graph Partition Algorithm Based on Label Propagation and Sand Cat Swarm Optimization [PDF]

open access: yesJisuanji gongcheng
The graphs are widely applied in social networks and communication networks, and the distributed graph processing systems have been used more frequently in processing and analyzing large-scale graphs with the increase of the scale of the graphs.
CUI Huanqing, WU Yifan, DONG Kezhen, ZHOU Shengqing
doaj   +1 more source

An effective data placement strategy for XML documents

open access: yes, 2001
As XML is increasingly being used in Web applications, new technologies need to be investigated for processing XML documents with high performance. Parallelism is a promising solution for structured document processing and data placement is a major ...
Lü, K, Yuanling Zhu, Kevin Lü, Zhu, Y
core   +1 more source

A Tabu Search Based Approach for Graph Layout [PDF]

open access: yes, 2014
This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core   +1 more source

Tverberg Partition Graphs

open access: yesSIAM Journal on Discrete Mathematics
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum
Déborah Oliveros   +3 more
openaire   +3 more sources

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat   +8 more
wiley   +1 more source

Dual Clustering-Based Method for Geospatial Knowledge Graph Partitioning

open access: yesApplied Sciences
Geospatial knowledge graphs provide critical technology for integrating geographic information and semantic knowledge, which are very useful for geographic data analysis.
Yuxuan Chen   +7 more
doaj   +1 more source

Boundary Vertices Sensitive Vertex-Cut Partitioning Algorithm

open access: yesJISR on Computing, 2015
Graph Partitioning is one of the favorite research topics among researchers since the 70s. It attracts a diverse group of researchers from various fields such as engineering, science and mathematics. In the last decade, the graphs have increased in size
Asad Feroz Ali, Syed Saif ur Rahman
doaj   +1 more source

Overlapping community detection in networks based on link partitioning and partitioning around medoids.

open access: yesPLoS ONE, 2021
In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids).
Alexander Ponomarenko   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy