Results 31 to 40 of about 115,144,832 (243)
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Architecture‐Driven Sensor Stability in Weft‐Knitted Engineering Textiles
Textile‐integrated sensor architectures are systematically compared to evaluate their electromechanical behavior under combined mechanical and environmental loading. Pocket‐based integration exhibits stable and reproducible signals, whereas tunnel‐based routing shows higher sensitivity accompanied by increased variability.
Adnan Maroof Khan +5 more
wiley +1 more source
Undecidability of polynomial inequalities in weighted graph homomorphism densities
Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights.
Grigoriy Blekherman +2 more
doaj +1 more source
Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +1 more source
Turan problems in extremal graph theory and flexibility
In this work we will study two distinct areas of graph theory: generalized Turan problems and graph flexibility. In the first chapter, we will provide some basic definitions and motivation. Chapters 2 and 3 contain two submitted papers showing that two graphs, the cycle on five vertices and the path on four vertices, are maximized by the Turan graph ...
openaire +4 more sources
Rational exponents in extremal graph theory [PDF]
Given a family of graphs H, the extremal number ex(n,H) is the largest m for which there exists a graph with n vertices and m edges containing no graph from the family H as a subgraph.
David Conlon +6 more
core +1 more source
This review highlights the role of self‐assembled monolayers (SAMs) in perovskite solar cells, covering molecular engineering, multifunctional interface regulation, machine learning (ML) accelerated discovery, advanced device architectures, and pathways toward scalable fabrication and commercialization for high‐efficiency and stable single‐junction and
Asmat Ullah, Ying Luo, Stefaan De Wolf
wiley +1 more source
An extremal problem for sets with applications to graph theory
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On some extremal problems in graph theory
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to one in analysis. We study both weighted and unweighted graphs which are extremal for these invariants.
Jakobson, Dmitry, Rivin, Igor
openaire +2 more sources
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source

