Results 91 to 100 of about 27,884 (262)
Parallel 3D Bioprinting on SLIPS‐Microarrays
Advanced Functional Materials, EarlyView.This work introduces the first truly parallel 3D bioprinting method, enabling both the simultaneous fabrication of hundreds of cell laden hydrogel 3D structures and their HTS in individual liquid compartments. By integrating Digital Light Processing (DLP) stereolithography with functional micropatterns, the platform decouples printing time from array ...
Julius von Padberg +3 more
wiley +1 more source
4-{2-[4-(Dimethylamino)phenyl]ethylidene}benzonitrile
Acta Crystallographica Section E, 2009 In the crystal of the title compound, C17H16N2, molecules are linked by C—H...N hydrogen bonds, forming rings of graph-set motifs R21(6) and R22(10). The title molecule is close to planar, with a dihedral angle between the aromatic rings of 0.6&
Rodolfo Moreno-Fuquen +3 more
doaj +1 more source
1-Planarity of Graphs with a Rotation System
Journal of Graph Algorithms and Applications, 2015 Summary: A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar graph. On the other hand, there is a linear time 1-planarity testing algorithm for maximal
Auer, Christopher +3 more
openaire +2 more sources
Meniscus Pixel Printing for Contact‐Lens Vision Sensing and Robotic Control
Advanced Functional Materials, EarlyView.A visual‐sensing contact lens is enabled by meniscus pixel printing (MPP), which rapidly patterns a 200 µm perovskite photodetector pixel in 1 s without masks, vacuum processing, or bulky equipment. A deep‐learning‐based super‐resolution reconstructs sparse on‐lens signals into 80 × 80 high‐resolution visual information, while AI‐driven eye‐tracking ...
Byung‐Hoon Gong +7 more
wiley +1 more source
Acta Crystallographica Section E, 2010 The aromatic ring of the title compound, C6H3ClN2O5, is almost planar (r.m.s. deviation = 0.007 Å); one nitro substituent is nearly coplanar with the ring [dihedral angle = 3(1)°], whereas the other is twisted [dihedral angle =
Seik Weng Ng
doaj +1 more source
Dispensing Volumetric Additive Manufacturing
Advanced Functional Materials, EarlyView.Dispensing volumetric additive manufacturing (DVAM) prints 3D structures inside a photocurable resin droplet suspended from the tip of a glass pipette, enabling sequential printing without resin vats or manual part removal. Real‐time droplet profiling and ray‐tracing‐based correction compensate for optical distortion at the curved resin‐air interface ...
Hongryung Jeon +5 more
wiley +1 more source
Three classes of 1-planar graphs
, 2014 A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\mathcal C_0, \mathcal C_1$ and $\mathcal C_2$ with respect to the types of crossings and present the decomposition of 1-planar join products.
Czap, J��lius, ��ugerek, Peter
openaire +3 more sources
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Engineering Strategies for Stable and Long‐Life Alkaline Zinc‐Based Flow Batteries
Advanced Functional Materials, EarlyView.Alkaline zinc‐based flow batteries face persistent challenges from unstable zinc deposition, including dendrite growth, passivation, corrosion, and hydrogen evolution, which severely limit cycling stability. Current research addresses these issues through coordinated electrode structuring, electrolyte regulation, and membrane design to control zinc ...
Yuran Bai +6 more
wiley +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj