Results 91 to 100 of about 125,344 (284)

New quantum toroidal algebras from 5D N $$ \mathcal{N} $$ = 1 instantons on orbifolds

open access: yesJournal of High Energy Physics, 2020
Quantum toroidal algebras are obtained from quantum affine algebras by a further affinization, and, like the latter, can be used to construct integrable systems.
Jean-Emile Bourgine, Saebyeok Jeong
doaj   +1 more source

A linear algorithm for the grundy number of a tree

open access: yes, 2014
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj .
Bouhlel, Mohamed Salim, Mansouri, Ali
core   +1 more source

Approximation algorithms for the partition vertex cover problem

open access: yesTheoretical Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bera, Suman K.   +3 more
openaire   +2 more sources

Respiratory Organ‐on‐a‐Chip for Disease Modeling: From Architecture to Functional Integration

open access: yesAdvanced Healthcare Materials, EarlyView.
Respiratory organ‐on‐a‐chip (ROC) models capture key mechanical and cellular cues of the human respiratory system, enabling quantitative dissection of disease mechanisms. This review links ROC architectures to disease modeling, functional integration, and commercialization, and proposes a decision framework that aligns model complexity with mechanistic
Jinzhuo Hu   +4 more
wiley   +1 more source

Graph realizations constrained by skeleton graphs [PDF]

open access: yes, 2017
In 2008 Amanatidis, Green and Mihail introduced the Joint Degree Matrix (JDM) model to capture the fundamental difference in assortativity of networks in nature studied by the physical and life sciences and social networks studied in the social sciences.
Erdős, Péter L.   +3 more
core   +2 more sources

Nonuniform Graph Partitioning with Unrelated Weights

open access: yes, 2014
We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014).
Makarychev, Konstantin, Makarychev, Yury
core   +1 more source

A Data Driven Review of In Vitro Electrical and Mechanical Stimulation for Post‐Acute Phase Wound Healing

open access: yesAdvanced Healthcare Materials, EarlyView.
This review examines how in vitro electrical and mechanical stimulation modulates wound healing in fibroblasts and keratinocytes. Analyzing over 560 experimental data points, we relate stimulation parameters to proliferation and migration outcomes, evaluate platform designs, and highlight the need for multi‐parameter optimization to advance targeted ...
Matthew K. Burgess   +3 more
wiley   +1 more source

Kelvin Probe Force Microscopy in Bionanotechnology: Current Advances and Future Perspectives

open access: yesAdvanced Materials, EarlyView.
Kelvin probe force microscopy (KPFM) enables the nanoscale mapping of electrostatic surface potentials. While widely applied in materials science, its use in biological systems remains emerging. This review presents recent advances in KPFM applied to biological samples and provides a critical perspective on current limitations and future directions for
Ehsan Rahimi   +4 more
wiley   +1 more source

2D Co‐Mo‐Hydroxide‐Based Multifunctional Material for the Development of H2‐Based Clean Energy Technologies

open access: yesAdvanced Materials, EarlyView.
2D α‐Co(OH)2 interleaved with Mo species displays an appealing dual functionality for the production and use of green hydrogen.Mo incorporation greatly benefits the electrochemical behaviour in Oxygen Evolution Reaction for H2 production, while the magnetocaloric response at liquid H2 temperature paves the way for alternative cryogenic refrigerants ...
Daniel Muñoz‐Gil   +14 more
wiley   +1 more source

On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph

open access: yesمجلة بغداد للعلوم
A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph,  a set that is dominant, is a subset of vertex set  such that any vertex outside of  is close to at least one vertex inside of .
Jalal Hatem Hussein Bayati   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy