Results 111 to 120 of about 1,615,193 (298)

Electrostatic Superlattices Beyond 1:1 Stoichiometry

open access: yesAdvanced Functional Materials, EarlyView.
Polymer‐mediated charge regulation drives two hierarchical routes to higher‐stoichiometry nanoparticle superlattices. Tuning the polymer's molecular weight promotes progressive interstitial filling, transforming ZnS into the fully occupied CaF2${\rm CaF}_2$ lattice. Exchanging polymer assignment between large and small nanoparticles instead breaks CsCl
Binay P. Nayak   +7 more
wiley   +1 more source

An Integrated Oxygen‐Supplying Device and Predictive Multiphysics Model for Extended Ambient Transport of Insulin‐Producing Cells

open access: yesAdvanced Functional Materials, EarlyView.
Cell therapies typically rely on cold‐chain logistics and cryopreservation, limiting access and compromising cell quality. Here, a dual‐chamber device separates an oxygen‐supplying chamber from a hyaluronic acid cargo chamber, sustaining oxygen delivery for over 70 h and enabling ambient‐temperature shipment.
Daniel A. Domingo‐Lopez   +9 more
wiley   +1 more source

Parameterized complexity of conflict-free graph coloring [PDF]

open access: yes, 2019
Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring c: V(G) → { 1, 2, …, q} such that for each vertex v∈ V(G) there is a vertex in N(v) that is uniquely colored from the rest of the vertices in N(v). When
Friggstad, Zachary   +11 more
core   +2 more sources

Hybrid Ferroelectric Tunnel Junctions with Intrinsic Nonlinearity and Self‐Rectification via Interfacial Reconstruction

open access: yesAdvanced Functional Materials, EarlyView.
Rapid thermal annealing reconstructs the BCFO/Nb:STO interface into an atomically thin reconstructed interfacial layer, which reshapes the tunneling barrier and converts a high‐TER ferroelectric tunnel junction into an intrinsically nonlinear, self‐rectifying device.
Hojin Lee   +21 more
wiley   +1 more source

Crossing Numbers and Parameterized Complexity [PDF]

open access: yes, 2008
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the odd crossing number of G that uses at most 9k crossings, where k is the odd crossing number of G.
Michael J. Pelsmajer   +2 more
openaire   +2 more sources

Magnetically Driven Biofabrication for Tissue Engineering: From Nanoparticle Design to Mag‐ATMP Translation

open access: yesAdvanced Healthcare Materials, EarlyView.
Magnetically responsive nanoparticles enable remote control over biomaterials, cells, and engineered tissues. This review summarizes material design, biological safety, fabrication and actuation strategies, computational validation, and translational pathways that support the development of magnetic tissue‐engineering platforms and future magnetically ...
Konstantinos Ioannidis   +8 more
wiley   +1 more source

Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue

open access: yesAlgorithms, 2016
We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj   +1 more source

Parameterized Complexity of Sparse Linear Complementarity Problems [PDF]

open access: yes, 2015
In this paper, we study the parameterized complexity of the linear complementarity problem (LCP), which is one of the most fundamental mathematical optimization problems.
Makino, Kazuhisa   +2 more
core   +1 more source

Sub‐Nanometer Curvature Unlocks Quantum Orbital Flexoelectricity in Graphene

open access: yesAdvanced Materials, EarlyView.
In self‐assembled, reproducible, large‐area, quasi‐pristine graphene nanowrinkles, extreme curvature forces out‐of‐plane π‐electrons toward hybridization, driving a transition from classical to quantum orbital flexoelectricity. As curvature approaches the fundamental physical limit set by the C─C bond length, the resulting polarization increases by ...
Sathvik Ajay Iyengar   +8 more
wiley   +1 more source

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

open access: yesJournal of Graph Algorithms and Applications
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
Cornelius Brand   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy