Results 151 to 160 of about 768,033 (273)
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
A Net-structure High-order Heterogeneous Data Co-clustering Algorithm Based on Graph Partitioning
:Existing high-order co-clustering algorithm just can be suitable for analyzing star-structure high-order heterogeneous data.In order to analyze net-structure high-order heterogeneous data,a high-order co-clustering algorithm based on graph partitioning ...
杨欣欣, 黄少滨
doaj
Near-Data Source Graph Partitioning
Recently, numerous graph partitioning approaches have been proposed to distribute a big graph to machines in a cluster for distributed computing. Due to heavy communication overhead, these graph partitioning approaches always suffered from long ingress ...
Haitian Zhang +5 more
core +1 more source
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
Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Genetic Algorithms for Graph Partitioning and Incremental Graph Partitioning
Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely important problem in parallel computing.
Sanjay Ranka +3 more
core
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ +19 more
wiley +1 more source
Graph partitioning - a survey [PDF]
Many problems appearing in scientific computing and other areas can be formulated as a graph partitioning problems. Examples include data distribution for parallel computers, decomposition of sparse matrices and VLSI-design.
Elsner, Ulrich
core
The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling +15 more
wiley +1 more source
Dual Graph Partitioning Highlights a Small Group of Pseudoknot-Containing RNA Submotifs. [PDF]
Jain S, Bayrak CS, Petingi L, Schlick T.
europepmc +1 more source

