Results 101 to 110 of about 29,342 (268)
Conformational Switching of Proteins on Material Surfaces Enabled by Peptide‐Oriented Adsorption
Advanced Functional Materials, EarlyView.Responsive biointerfaces could be achieved using conformationally responsive proteins; however, their interconversion can be lost upon surface adsorption. Herein, we demonstrate that the incorporation a Au binding peptide into calmodulin allows for binding control on Au wherein the protein retains conformational switching. This capability was confirmed
Sakthirupini Ramamurthy +7 more
wiley +1 more source
Vector Bond Graph Method of Kineto-static Analysis for Planar Multi-body System with Gear Pair
Jixie chuandong, 2015 In order to increase the reliability and efficiency of the kineto-static analysis of complex planar multi-body system,the corresponding vector bond graph method is proposed.According to the kinematic constraint condition,the vector bond graph model of a ...
Wang Zhongshuang +3 more
doaj
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Journal of Graph Algorithms and Applications, 2016 Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only ...
Michael Bekos +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Multifunctional solid polymer electrolyte (SPE) films integrating intrinsic self‐healing, mechanical stretchability, and dual photo‐ and pH‐responsive ionic conductivity are developed. Constructed from thermoplastic polyurethane (TPU) and hydrogen‐bonded poly(thiourea triethylene glycol) (PTUEG3), these films form a dynamic supramolecular network ...
Mei‐Li Li +12 more
wiley +1 more source
On the planarity of jump graphs
Discrete Mathematics, 2000 Let \(G\) be a graph of size \(m\geq 1\) and let \(F\) and \(H\) be edge-induced subgraphs of \(G\) of size \(k\) with \(1\leq k\leq m\). In the literature is then defined the \(k\)-jump distance from \(F\) to \(H\). For a graph \(G\) of size \(m\geq 1\) and an integer \(k\) with \(1\leq k\leq m\), the \(k\)-jump graph \(J_k(G)\) is defined as a graph ...
Héctor Hevia +2 more
openaire +1 more source
One‐Step Curcumin‐Mediated Multiphoton Lithography for Bioactive 3D Scaffolds
Advanced Functional Materials, EarlyView.Curcumin‐mediated multiphoton lithography enables one‐step fabrication of highly architected complex gelatin methacryloyl scaffolds by exploiting curcumin as a multifunctional bioactive photoinitiator. The resulting 3D structures support mesenchymal stem cell adhesion, proliferation, and migration, while exhibiting dual antibacterial activity through ...
Myrto Charitaki +7 more
wiley +1 more source
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
CoRR, 2018 We show that for any $k \geq 0$, there exists a planar graph which is $B_{k+1}$-CPG but not $B_k$-CPG. As a consequence, we obtain that $B_k$-CPG is a strict subclass of $B_{k+1}$-CPG.
Nicolas Champseix +2 more
openaire +2 more sources
3D Hydrodynamic Flow Lithography
Advanced Functional Materials, EarlyView.ABSTRACT Continuous‐ and stop‐flow lithography are widely used to fabricate multi‐dimensional microstructures whose cross‐sectional morphology is dictated by the flow profile of multiple co‐flowing streams. Here, we introduce three‐dimensional hydrodynamic flow lithography (3D HFL), a platform for programmable generation of multi‐layered flow profiles ...
Yiying Zou +5 more
wiley +1 more source
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
doaj +1 more source