Results 61 to 70 of about 3,558 (256)

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

open access: yesAdvanced Engineering Materials, EarlyView.
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

Distance magic Cartesian product of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz   +3 more
openaire   +3 more sources

Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]

open access: yes, 2011
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core   +1 more source

Computing role assignments of Cartesian product of graphs [PDF]

open access: yes, 2023
Network science is a growing field of study using Graph Theory as a modeling tool. In social networks, a role assignment is such that individuals play the same role, if they relate in the same way to other individuals playing counterpart roles.
Julliano Rosa Nascimento   +3 more
core   +1 more source

Experimental and Numerical Modal Analysis of Composite Sandwich Structures Using Surfboards as Model Systems

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents an experimental and numerical modal investigation of composite sandwich structures using surfboards as model systems. By comparing different core materials and reinforcement strategies, the study demonstrates how local stiffeners influence vibrational response and introduce characteristic modal features, highlighting modal ...
Brett Connellan   +4 more
wiley   +1 more source

Unbiased Structure Prediction of Sophisticated Cage Structures

open access: yesAngewandte Chemie, EarlyView.
We introduce the software and workflow for automated, unbiased exploration of all possible connectivities of a given set of building blocks and their stoichiometry to predict stable cage structures. ABSTRACT Cage structure prediction has made significant strides by generating structures based on what the community has seen before.
Andrew Tarzia, Giovanni M. Pavan
wiley   +2 more sources

Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling

open access: yesAdvanced Robotics Research, EarlyView.
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang   +5 more
wiley   +1 more source

Strong incidence domination in some operations of fuzzy incidence graphs and application in security allocation

open access: yesInternational Journal of Mathematics for Industry
This paper explores operations on fuzzy incidence graphs (FIGs), focusing on join, Cartesian product, tensor product, and composition. Emphasizing strong fuzzy incidence graphs (SFIGs), the study examines strong incidence domination (SID) and the strong ...
Kavya R. Nair, M. S. Sunitha
doaj   +1 more source

A Generative Neuro‐Symbolic AI for Protein Sequence Design

open access: yesAdvanced Science, EarlyView.
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne   +12 more
wiley   +1 more source

Some Results on Palette Index of Cartesian Product Graphs

open access: yesMathematical Problems of Computer Science, 2021
Given a proper edge coloring α of a graph G, we define the palette SG(ν, α) of a vertex ν ∈ V (G) as the set of all colors appearing on edges incident to ν. The palette index š(G) of G is the minimum number of distinct palettes occurring in a proper edge
Khachik S. Smbatyan
doaj   +1 more source

Home - About - Disclaimer - Privacy