Results 71 to 80 of about 2,463 (224)
Complexity of Products of Some Complete and Complete Bipartite Graphs
The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete ...
S. N. Daoud
doaj +1 more source
AI‐BioMech is a deep learning framework that predicts the mechanical behavior of biological cellular materials directly from 2D images. By replacing traditional finite element analysis with semantic segmentation, it identifies stress and strain distributions with 99% accuracy, offering a high‐speed, scalable alternative for analyzing complex, aperiodic
Haleema Sadia +2 more
wiley +1 more source
On the δ-chromatic numbers of the Cartesian products of graphs
In this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source
This article reviews the current state of bioinspired soft robotics. The article discusses soft actuators, soft sensors, materials selection, and control methods used in bioinspired soft robotics. It also highlights the challenges and future prospects of this field.
Abhirup Sarker +2 more
wiley +1 more source
Quadrotor unmanned aerial vehicle control is critical to maintain flight safety and efficiency, especially when facing external disturbances and model uncertainties. This article presents a robust reinforcement learning control scheme to deal with these challenges.
Yu Cai +3 more
wiley +1 more source
Constructing Node-Disjoint Routes in K-Ary N-Cubes
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths in ...
Khaled Day, Abdel Elah Al-Ayyoub
doaj +1 more source
Accelerating Materials Discovery: A Review of Machine Learning in X‐Ray Absorption Spectroscopy
This review systematically details how machine learning transforms X‐ray absorption spectroscopy (XAS) analysis. It covers advanced deep learning architectures for structure‐spectra mapping and inverse tasks, while discussing key challenges like the simulation‐to‐reality gap.
Melaku Lake Tegegne +5 more
wiley +1 more source
Retract rigid cartesian products of graphs
A graph H is defined to be a retract of the graph G if there are edge- preserving maps \(f: V(H)\to V(G)\) and \(g: V(G)\to V(H)\) such that \(g(f(v))=v,\) for each \(v\in V(G)\) \((''v\in V(G)''\) appears in the paper, but \(''v\in V(H)''\) is correct). Thus H can be regarded as a subgraph of G.
Richard J. Nowakowski, Ivan Rival
openaire +2 more sources
This review traces three decades of technological evolution in robot‐assisted fracture reduction systems, from early robotic concepts to clinically oriented platforms. Key advances in robotic architecture, navigation, path planning, interaction control, and surgical integration are summarized, while current translational challenges and future ...
Shaolong Kuang +5 more
wiley +1 more source
Craniofacial growth, modeling, and estimation of milestones
Abstract Understanding craniofacial growth is foundational for research into intra‐ and interspecies variation, evolution, and clinical care. The Craniofacial Growth Consortium Study (CGCS), combines cephalographs from historical growth studies to create a dense longitudinal record of growth from 6 to 22 years of age.
Richard J. Sherwood +6 more
wiley +1 more source

