Results 111 to 120 of about 520,977 (330)
Modeling the blood–brain tumor barrier is challenging due to complex interactions between brain microvasculature and glioma cells. We present two‐photon polymerized 3D micro‐porous capillary‐like structures that support endothelial alignment, cytoskeletal organization, and pericyte‐endothelial‐glioma tri‐cultures.
Nastaran Barin +9 more
wiley +1 more source
First-order logic with metric betweenness – the case of non-definability of some graph classes
The metric betweenness of a connected graph and arbitrary graphs is FO definable. Moreover, several interesting classes of graphs with strong distance properties are shown to be FO definable using metric betweenness.
Jeny Jacob, Manoj Changat
doaj +1 more source
A Ge2Sb2Te5 (GST)‐based microring resonator is designed and simulated on a ZnSe‐platform that operates in the long‐wave infrared (LWIR) wavelength of 8 μm. The structure demonstrates strong power confinement and high Q‐factor. GST resonator is used for gas and biosensing applications.
Tanzina Rahman +3 more
wiley +1 more source
Almost Perfect Matrices and Graphs [PDF]
We introduce the notions of ω-projection and κ-projection that map almost integral polytopes associated with almost perfect graphs G with n nodes from ℝn into ℝn−ω, where ω is the maximum clique size in G. We show that C. Berge's strong perfect graph conjecture is correct if and only if the projection (of either kind) of such polytopes is again almost
openaire +2 more sources
Sharp Diamond Needles for Single‐Photon Emission
We study the morphological evolution of single‐crystal diamond needles oxidized at 650–700 °C. Electron microscopy and photoluminescence reveal temperature‐ and time‐dependent sharpening, length reduction, and surface modifications affecting tip properties.
Mariam Quarshie +9 more
wiley +1 more source
Annihilating random walks and perfect matchings of planar graphs [PDF]
Massimiliano Mattera
openalex +1 more source
AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number equals the number of (maximal) cliques. We characterize the trivially perfect graphs as a proper subclass of the triangulated graphs (thus disproving a claim of Buneman [3]), and we relate them to some well-known classes of perfect graphs.
openaire +2 more sources
Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback
BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat +4 more
wiley +1 more source
Perfect domination in regular grid graphs
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\Lambda}$ of $\R^2$. In contrast, there is just one 1-perfect code in ${\Lambda}$ and one total perfect code in ${\Lambda}$ restricting to total perfect
Dejter, Italo J.
core +4 more sources
This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source

