Results 41 to 50 of about 16,549 (235)

On metric dimensions of hypercubes

Ars Mathematica Contemporanea, 2022
The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by using a vector of distances to this set. In this note we show two unexpected results on hypercube graphs. First, we
Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero   +3 more
openaire   +5 more sources

Toward Knowledge‐Guided AI for Inverse Design in Manufacturing: A Perspective on Domain, Physics, and Human–AI Synergy

Advanced Intelligent Discovery, EarlyView.
This perspective highlights how knowledge‐guided artificial intelligence can address key challenges in manufacturing inverse design, including high‐dimensional search spaces, limited data, and process constraints. It focused on three complementary pillars—expert‐guided problem definition, physics‐informed machine learning, and large language model ...
Hugon Lee, Hyeonbin Moon, Junhyeong Lee, Seunghwa Ryu   +3 more
wiley   +1 more source

Advances in Thermal Modeling and Simulation of Lithium‐Ion Batteries with Machine Learning Approaches

Advanced Intelligent Discovery, EarlyView.
Heat generation in lithium‐ion batteries affects performance, aging, and safety, requiring accurate thermal modeling. Traditional methods face efficiency and adaptability challenges. This article reviews machine learning‐based and hybrid modeling approaches, integrating data and physics to improve parameter estimation and temperature prediction ...
Qi Lin, Kang Fu, Junjie Ding, Kai Sun, Peng Tan   +4 more
wiley   +1 more source

Taguchi–Bayesian Sampling: A Roadmap for Polymer Database Construction Toward Small Representative Machine Learning

Advanced Intelligent Discovery, EarlyView.
This article establishes a Taguchi–Bayesian sampling strategy to reconstruct polymer processing–property landscape at minimal sampling cost, generically building the roadmap for materials database construction from sampling their vast design space. This sampling strategy is featured by an alternating lesson between uniformity and representativeness ...
Han Liu, Liantang Li
wiley   +1 more source

Sampling Strategy: An Overlooked Factor Affecting Artificial Intelligence Prediction Accuracy of Peptides’ Physicochemical Properties

Advanced Intelligent Discovery, EarlyView.
This study reveals that sampling strategy (i.e., sampling size and approach) is a foundational prerequisite for building accurate and generalizable AI models in peptide discovery. Reaching a threshold of 7.5% of the total tetrapeptide sequence space was essential to ensure reliable predictions.
Meiru Yan, Ankeer Abuduhebaier, Haojin Zhou, Jiaqi Wang   +3 more
wiley   +1 more source

Antipodal Edge-Colorings of Hypercubes

Discussiones Mathematicae Graph Theory, 2019
Two vertices of the k-dimensional hypercube Qkare antipodal if they differ in every coordinate. Edges uv and xy are antipodal if u is antipodal to x and v is antipodal to y.
West Douglas B., Wise Jennifer I.
doaj   +1 more source

The Capture Time of the Hypercube [PDF]

The Electronic Journal of Combinatorics, 2013
In the game of Cops and Robbers, the capture time of a graph is the minimum number of moves needed by the cops to capture the robber, assuming optimal play. We prove that the capture time of the $n$-dimensional hypercube is $\Theta (n\ln n)$. Our methods include a novel randomized strategy for the players, which involves the analysis of the coupon ...
Anthony Bonato, Przemyslaw Gordinowicz, Bill Kinnersley, Pawel Pralat   +3 more
openaire   +3 more sources

RAMS: Residual‐Based Adversarial‐Gradient Moving Sample Method for Scientific Machine Learning in Solving Partial Differential Equations

Advanced Intelligent Discovery, EarlyView.
We propose a residual‐based adversarial‐gradient moving sample (RAMS) method for scientific machine learning that treats samples as trainable variables and updates them to maximize the physics residual, thereby effectively concentrating samples in inadequately learned regions.
Weihang Ouyang, Min Zhu, Wei Xiong, Si‐Wei Liu, Lu Lu   +4 more
wiley   +1 more source

A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint [PDF]

International Journal of Networked and Distributed Computing (IJNDC), 2015
As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology.
Antoine Bossard, Keiichi Kaneko
doaj   +1 more source

Multipacking in Hypercubes [PDF]

CoRR
For an undirected graph $G$, a dominating broadcast on $G$ is a function $f : V(G) \rightarrow \mathbb{N}$ such that for any vertex $u \in V(G)$, there exists a vertex $v \in V(G)$ with $f(v) \geqslant 1$ and $d(u,v) \leqslant f(v)$. The cost of $f$ is $\sum_{v \in V} f(v)$.
Deepak Rajendraprasad, Varun Sani, Birenjith Sasidharan, Jishnu Sen   +3 more
openaire   +2 more sources