Results 101 to 110 of about 142,209 (249)
A food‐grade cooling composite made from starch and recycled eggshell powder offers a scalable, ultra‐low‐cost solution for passive daytime radiative cooling. Easily prepared using basic kitchen tools, this material empowers communities, even in areas with limited infrastructure, to stay cooler during worsening summer heat waves.
Qimeng Song+3 more
wiley +1 more source
Solving Vertex Cover Problem Using DNA Tile Assembly Model
DNA tile assembly models are a class of mathematically distributed and parallel biocomputing models in DNA tiles. In previous works, tile assembly models have been proved be Turing-universal; that is, the system can do what Turing machine can do. In this
Zhihua Chen+3 more
doaj +1 more source
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj +1 more source
Garnet‐like luminescence upon Ce3+‐activation is found in the first six representatives Li9RESi4N4O8 (RE = Y, La, Gd, Dy, Yb, Lu) of the substance class of lithium rare‐earth oxonitridolithosilicates, which also show a novel structure type. High‐temperature solid‐state synthesis yielded crystalline samples for single‐crystal X‐ray diffraction‐based ...
Kilian M. Rießbeck+5 more
wiley +1 more source
This study reveals how vorticity—a swirling flow pattern—enhances platelet aggregation and thrombus formation in high‐shear conditions. Using a custom microfluidic model, it is shows that vorticity promotes vWF–GPIbα interactions and calcium signaling, providing new insights into thrombosis mechanobiology and informing safer blood‐contacting medical ...
Jianfang Ren+13 more
wiley +1 more source
Approximating vertex cover in dense hypergraphs
We consider the minimum vertex cover problem in hypergraphs in which every hyperedge has size k (also known as minimum hitting set problem, or minimum set cover with element frequency k). Simple algorithms exist that provide k-approximations, and this is believed to be the best possible approximation achievable in polynomial time.
Cardinal, Jean+3 more
openaire +3 more sources
Microphysiological Systems for Comorbidity Studies: Chronic Kidney Disease and Osteoarthritis
This review highlights the potential of organ‐on‐a‐chip systems for studying comorbidities, using chronic kidney disease (CKD) and osteoarthritis (OA) as examples. It summarizes recent advances in kidney‐on‐a‐chip and joint‐on‐a‐chip models and discusses their current and potential application in investigating CKD, OA, and CKD‐OA comorbidity, aiming to
Mingying Han+7 more
wiley +1 more source
On estimation of extremal entries of the principal eigenvector of a graph
Let [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component ...
Prohelika Das, Bipanchy Buzarbarua
doaj +1 more source
Generalized vertex covering in interval graphs
The following decision problem is treated in the paper: Given a graph \(G\) and two integers \(i\geq 2\), \(k\geq 1\), is it possible to find \(k\) vertices of the graph such that any complete subgraph of \(G\) with \(i\) vertices contains (at least) one of these distinguished vertices. This problem is NP-complete even for chordal graphs. In this paper
R. Ravi+2 more
openaire +2 more sources
Porosity governs transport mechanics in hydrogels, yet characterization in its native state remains challenging. This work harnesses particle tracking to uncover three‐dimensional pore geometric features in polyethylene glycol hydrogels. Measurements in the native state reveal pores characteristics are comparable to those obtained by cryogenic scanning
M. A. Kristine Tolentino+5 more
wiley +1 more source