Results 71 to 80 of about 252,020 (311)
Optimizing energy-efficiency for multi-core packet processing systems in a compiler framework [PDF]
, 2012 Network applications become increasingly computation-intensive and the amount of traffic soars unprecedentedly nowadays. Multi-core and multi-threaded techniques are thus widely employed in packet processing system to meet the changing requirement ...
Huang, Jing
core
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
Computing the dependence of graph energy on nullity: The method of siblings [PDF]
Discrete Mathematics Letters, 2021 Ivan Gutman
doaj +1 more source
Seidel Laplacian Energy of Fuzzy graphs
EAI Endorsed Transactions on Energy WebThe energy of a graph is related to its spectrum, which is equal to the total of the latent values of the pertinent adjacency matrix. In this research work, we proposed some of the features and the energy of the Seidel Laplacian of a fuzzy graph.
K Sivaranjani +2 more
doaj +1 more source
Energy Conditions for Hamiltonian and Traceable Graphs
Universal Journal of Mathematics and Applications, 2019 A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
Note on the Randic energy of graphs [PDF]
Kragujevac Journal of Mathematics, 2018 Summary: If \(G\) is a graph on \(n\) vertices, and \(d_i\) is the degree of its \(i\)-th vertex, then the Randic matrix of \(G\) is the square matrix of order \(n\) whose \((i, j)\)-entry is equal to \(1/\sqrt{d_id_j}\) if the \(i\)-th and \(j\)-th vertex of \(G\) are adjacent, and zero otherwise.
He, Jun, Liu, Yan-Min, Tian, Jun-Kang
openaire +2 more sources
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]
, 2013 We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core +1 more source
Molecular Oncology, EarlyView.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
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source