Results 101 to 110 of about 382 (214)
Machine learning interatomic potentials bridge quantum accuracy and computational efficiency for materials discovery. Architectures from Gaussian process regression to equivariant graph neural networks, training strategies including active learning and foundation models, and applications in solid‐state electrolytes, batteries, electrocatalysts ...
In Kee Park +19 more
wiley +1 more source
Iterative Synthesis of Pyrene–Coronene Molecular Graphene Nanoribbons
An iterative approach delivers a new family of undoped, cove‐edged graphene nanoribbons with lengths up to 9.1 nm that exhibit both molar absorptivity and fluorescence brightness values on the order of 105 M−1 cm−1 and an intrinsic charge‐carrier mobility of 475 ± 32 cm2 V−1 s−1.
Miguel A. Medel +6 more
wiley +2 more sources
Several simulation techniques are used to explore static and dynamic behavior in polyanion sodium cathode materials. The study reveals that universal machine learning interatomic potentials (MLIPs) struggle with system‐specific chemistry, emphasizing the need for tailored datasets.
Martin Hoffmann Petersen +5 more
wiley +1 more source
Energy Conditions for Hamiltonicity of Graphs
Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G)≤μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n|μi(G)|. Denote by GBPT a bipartite graph.
Guidong Yu +3 more
doaj +1 more source
This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley +1 more source
On pre-Hamiltonian Cycles in Hamiltonian Digraphs
Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
openaire +2 more sources
Evolution of Physical Intelligence Across Scales
By following the evolution of physical intelligence across scales, this article shows how intelligence arises from materials, structures, physical interactions, and collectives. It establishes physical intelligence as the evolutionary foundation upon which embodied intelligence is built.
Ke Liu +7 more
wiley +1 more source
On edge-graceful labeling and deficiency for regular graphs
An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +1 more source
The authors evaluated six machine‐learned interatomic potentials for simulating threshold displacement energies and tritium diffusion in LiAlO2 essential for tritium production. Trained on the same density functional theory data and benchmarked against traditional models for accuracy, stability, displacement energies, and cost, Moment Tensor Potential ...
Ankit Roy +8 more
wiley +1 more source
Factorization machine with iterative quantum reverse annealing (FMIRA) leverages quantum reverse annealing to perform batch black‐box optimization. Factorization machine with quantum annealing (FMQA) is a widely used python package for solving black‐box optimization problems using D‐Wave quantum annealers.
Andrejs Tučs, Ryo Tamura, Koji Tsuda
wiley +1 more source

