Results 81 to 90 of about 35,638 (292)
Integrative Approaches for DNA Sequence‐Controlled Functional Materials
Advanced Functional Materials, EarlyView.DNA is emerging as a programmable building block for functional materials with applications in biomimicry, biochemical, and mechanical information processing. The integration of simulations, experiments, and machine learning is explored as a means to bridge DNA sequences with macroscopic material properties, highlighting current advances and providing ...
Aaron Gadzekpo +4 more
wiley +1 more source
Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
AIMS MathematicsLet $ G = (V, E) $ be a simple, connected graph with vertex set $ V(G) $ and $ E(G) $ edge set of $ G $. For two vertices $ a $ and $ b $ in a graph $ G $, the distance $ d(a, b) $ from $ a $ to $ b $ is the length of shortest path $ a-b $ path in $ G $.
Ali N. A. Koam +3 more
doaj +1 more source
Medical Intelligent System and Orthopedic Clinical Nursing Based on Graph Partition Sampling Algorithm. [PDF]
Comput Intell Neurosci, 2022 Heng X, Chen Y, Liu L.
europepmc +1 more source
Advanced Functional Materials, EarlyView.This review highlights how machine learning (ML) algorithms are employed to enhance sensor performance, focusing on gas and physical sensors such as haptic and strain devices. By addressing current bottlenecks and enabling simultaneous improvement of multiple metrics, these approaches pave the way toward next‐generation, real‐world sensor applications.
Kichul Lee +17 more
wiley +1 more source
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices, 2019 Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen.
Adm Mohammad +5 more
doaj +1 more source
Counting connected partitions of graphs
Journal of Graph TheoryAbstractMotivated by the theorem of Győri and Lovász, we consider the following problem. For a connected graph on vertices and edges determine the number of unordered solutions of positive integers such that every is realized by a connected subgraph of with edges. We also consider the vertex‐partition analogue. We prove various lower bounds on
Yair Caro +3 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.A single cell type Electro‐chromo‐emissive (ECECL) device integrating synchronized electrochromic (EC) and electrochemiluminescent (ECL) functions is developed using a mixed ionic‐electronic conductor (MIEC). A MIEC layer reduces ionic/electronic resistance, enabling ultrafast switching and enhanced optical contrast.
Hwandong Jang +5 more
wiley +1 more source
New results on upper domatic number of graphs
Communications in Combinatorics and Optimization, 2020 For a graph G = (V, E), a partition π = {V1, V2, . . . , Vk} of the vertex set V is an upper domatic partition if Vi dominates Vj or Vj dominates Vi or both for every Vi, Vj ∈ π, whenever i 6= j.
Libin Chacko Samuel, Mayamma Joseph
doaj +1 more source
On partitioning the edges of 1-plane graphs [PDF]
, 2016 William Lenhart +2 more
openalex +1 more source
Interconnected Porous Hydrogels with Tunable Anisotropy Through Aqueous Emulsion Bioprinting
Advanced Functional Materials, EarlyView.A 3D bioprintable microporous bioink is developed using an aqueous two‐phase system (ATPS) composed of extracellular matrix (ECM) mimetic biopolymers. The ATPS bioink enables the fabrication of interconnected porous architectures with up to 70% porosity, supporting long‐term cell viability and 3D cell alignment, enabling a simultaneous generation of ...
Hugo Edgar‐Vilar +4 more
wiley +1 more source