Results 91 to 100 of about 165,258 (315)

Cool Kitchen: Processing Starch and Eggshell Powder into Sustainable Coatings for Passive Daytime Cooling

open access: yesAdvanced Functional Materials, EarlyView.
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

Monitoring Layout and Optimisation Method Based on Minimum Weighted Vertices of Roads

open access: yesApplied Sciences
By analyzing the coverage model of cameras, a surveillance camera network model based on road vertex coverage is proposed, and an optimized deployment method for cameras based on the Minimum Weighted Vertex Cover (MWVC) model is given.
Li Wang   +3 more
doaj   +1 more source

A 3D Biofabricated Disease Model Mimicking the Brain Extracellular Matrix Suitable to Characterize Intrinsic Neuronal Network Alterations in the Presence of a Breast Tumor Disseminated to the Brain

open access: yesAdvanced Functional Materials, EarlyView.
A 3D disease model is developed using customized hyaluronic‐acid‐based hydrogels supplemented with extracellular matrix (ECM) proteins resembling brain ECM properties. Neurons, astrocytes, and tumor cells are used to mimic the native brain surrounding.
Esra Türker   +16 more
wiley   +1 more source

Solving Vertex Cover Problem Using DNA Tile Assembly Model

open access: yesJournal of Applied Mathematics, 2013
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

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
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

Realization of Complex‐Shaped Magnetic Nanotubes with 3D Printing and Electrodeposition

open access: yesAdvanced Functional Materials, EarlyView.
Complex‐shaped magnetic nanotubes were fabricated by coating three‐dimensional nanoscaffolds fabricated with focused electron beam induced deposition with a magnetic coating via electrodeposition. X‐ray magnetic microscopy and simulations revealed an azimuthal magnetic configuration within the nanotubes and pinning of domain walls at curved vertices ...
Claudia Fernández‐González   +15 more
wiley   +1 more source

On estimation of extremal entries of the principal eigenvector of a graph

open access: yesAKCE International Journal of Graphs and Combinatorics
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

Exploiting Two‐Photon Lithography, Deposition, and Processing to Realize Complex 3D Magnetic Nanostructures

open access: yesAdvanced Functional Materials, EarlyView.
Two‐photon lithography (TPL) enables 3D magnetic nanostructures with unmatched freedom in geometry and material choice. Advances in voxel control, deposition, and functionalization open pathways to artificial spin ices, racetracks, microrobots, and a number of additional technological applications.
Joseph Askey   +5 more
wiley   +1 more source

Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem

open access: yesTheory and Applications of Graphs, 2017
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy