Results 61 to 70 of about 14,956 (263)

Topological Study of Zeolite Socony Mobil-5 via Degree-Based Topological Indices

open access: yesJournal of Chemistry, 2021
Graph theory is a subdivision of discrete mathematics. In graph theory, a graph is made up of vertices connected through edges. Topological indices are numerical parameters or descriptors of graph.
Nouman Saeed   +4 more
doaj   +1 more source

Conversion of Transplanted Mature Hepatocytes into Afp+ Reprogrammed Cells for Liver Regeneration After Injury

open access: yesAdvanced Science, EarlyView.
Donor‐derived tdTomato+ mature hepatocytes were FACS‐isolated and transplanted into Fah−/− host mice. During regeneration, these cells convert into proliferative, unipotent Afp+ rHeps. Their plasticity is governed by a PPARγ/AFP‐dependent metabolic switch, segregating into pro‐proliferative Afplow and pro‐survival Afphigh subpopulations.
Ting Fang   +12 more
wiley   +1 more source

Xanthatin Targets CISD1 to Drive Ferroptosis and Mitophagy as a Dual Anticancer Strategy in Triple‐Negative Breast Cancer

open access: yesAdvanced Science, EarlyView.
Triple‐negative breast cancer has a poor prognosis. Xanthatin directly targets and degrades CISD1, triggering ferroptosis through iron dysregulation. The concurrently activated mitophagy synergistically amplifies ferroptotic cell death. Xanthatin also demonstrates potent in vivo anti‐tumor efficacy with minimal toxicity, highlighting its therapeutic ...
Qinwen Liu   +9 more
wiley   +1 more source

Global Nitrogen Deposition Promotes Carbon Sink Formation in Terrestrial Ecosystems

open access: yesAdvanced Science, EarlyView.
Nitrogen deposition alleviates ecosystem N limitation and enhances carbon sinks. Using 829 observations, we show 36% of deposited N is retained globally (39.15 Tg N yr−1), with distinct NHx and NOy contributions. This retention drives a terrestrial C sink of 0.88 Pg C yr−1 (25.48%), highlighting the importance of pool‐specific C:N stoichiometry ...
Lei Li   +6 more
wiley   +1 more source

Rapid Assignment of Chemical Shifts From Crystal Structures in Solid‐State NMR

open access: yesAngewandte Chemie, EarlyView.
Chemical shift assignment in solids is a long and tedious process that relies on complex 1D and 2D NMR experiments. With prior knowledge of the 3D structure, this process can be significantly sped up by a Bayesian probabilistic assignment approach based on predicted chemical shifts.
Ruben Rodriguez‐Madrid   +2 more
wiley   +2 more sources

Triangular Mesh Surface Subdivision Based on Graph Neural Network

open access: yesApplied Sciences
Mesh subdivision is a common mesh-processing algorithm used to improve model accuracy and surface smoothness. Its classical scheme adopts a fixed linear vertex update strategy and is implemented iteratively, which often results in excessive mesh ...
Guojun Chen, Rongji Wang
doaj   +1 more source

A Study on C-Exponential Mean Labeling of Graphs

open access: yesJournal of Mathematics, 2022
A function h is mentioned as a C-exponential mean labeling of a graph GV,E that has s vertices and r edges if h:VG⟶1,2,3,⋯,r+1 is injective and the generated function h∗:EG⟶2,3,4,⋯,r+1 defined by h∗ab=1/ehbhb/haha1/hb−ha, for all ab∈EG, is bijective.
Thamaraiselvi Baskaran   +1 more
doaj   +1 more source

Unsupervised Hierarchical Symbolic Regression for Interpretable Property Modeling in Complex Multi‐Variable Systems

open access: yesAdvanced Science, EarlyView.
UHSR translates complex chemical behavior into clear and explainable equations. Applied to thin‐layer chromatography, it automatically uncovers the mathematical rules linking a molecule's structure to its polarity. This approach matches the accuracy of advanced AI while providing interpretable results, earning greater trust from chemists. The method is
Siyu Lou   +4 more
wiley   +1 more source

Recursively-regular subdivisions and applications

open access: yesJournal of Computational Geometry, 2016
We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron) introducing the class of recursively-regular subdivisions.
Rafel Jaume, Günter Rote
doaj   +1 more source

Spanning subdivisions in Dirac graphs

open access: yesCombinatorics, Probability and Computing, 2023
AbstractWe show that for every $n\in \mathbb N$ and $\log n\le d\lt n$ , if a graph $G$ has $N=\Theta (dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$ , then it contains a spanning subdivision of every $n$ -vertex $d$ -regular graph.
openaire   +2 more sources

Home - About - Disclaimer - Privacy