Results 71 to 80 of about 8,796 (225)
Neighborhood Broadcasting in Hypercubes
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil \log_2 N \rceil$ rounds in a network of $N$ nodes. In the neighborhood broadcasting problem, the node that is broadcasting needs to inform only its neighbors ...
Bermond, Jean-Claude +3 more
openaire +2 more sources
Explicit 3‐colorings for Exponential Graphs
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
Reliability evaluation of hierarchical hypercube network
Aiming at the problem that the reliability research on hierarchical hypercube networks was not yet systematic, which severely restricted its application and popularization, the hierarchical hypercube network was taken as studying object, on the basis of ...
Ximeng LIU +3 more
doaj +2 more sources
METAGRAPH THEORY AS A BASIS FOR MODELING RELEVANT MEDIA DISCOURSE
This article is devoted to modeling media discourse based on a combination of a complex graph model and a multidimensional model. Despite significant advances in the field of neural network text processing, the task of modeling text and media discourse ...
Yuriy E. Gapanyuk
doaj +1 more source
Sliced Latin Hypercube Designs for Computer Experiments With Unequal Batch Sizes
Latin hypercube designs are frequently used in estimating the mean output value of computer simulations given random environmental factors. Sliced Latin hypercube designs are designs that can be partitioned into a number of batches so that both the whole
Jin Xu +3 more
doaj +1 more source
Hunting rabbits on the hypercube
We explore the Hunters and Rabbits game on the hypercube. In the process, we find the solution for all classes of graphs with an isoperimetric nesting property and find the exact hunter number of $Q^n$ to be $1+\sum\limits_{i=0}^{n-2} \binom{i}{\lfloor i/2 \rfloor}$.
Jessalyn Bolkema, Corbin Groothuis
openaire +2 more sources
AlloyDesignClaw: Optimizing Castability and Mechanical Properties of Nickel‐Based Superalloys
A stepwise optimization method is proposed for castability and mechanical properties of nickel‐based superalloys, enabling interpretable dimensionality reduction and efficient multi‐objective optimization of the composition space. An alloy design multi‐agent framework was further developed, integrating large language models, CALPHAD calculation ...
Jiaxuan Ma +7 more
wiley +1 more source
On r-factors with components containing specified vertices in a torus
Let T be a graph obtained by taking the Cartesian product of n cycles of even lengths [Formula: see text]. It is known that for any subset of k vertices of T with [Formula: see text] there exists a 2-factor in T where each cycle contains exactly one of ...
A. V. Sonawane, Y. M. Borse
doaj +1 more source
On Recursively Directed Hypercubes [PDF]
In this paper we introduce the recursively directed hypercubes, and analyze some of their structural properties. We show that every recursively directed hypercube is acyclic, and has a unique pair of source and sink nodes. The main contribution of the paper is an analysis of distances between the nodes in such a graph.
openaire +2 more sources
ABSTRACT Digitalization and emerging technologies are increasing the demand for wireless sensing and the Internet of Things (IoT), which provide opportunities for autonomous sources of electricity in the form of energy harvesting systems. This paper focuses on the challenges in hybrid piezoelectric‐electromagnetic kinetic energy harvesting systems that
Petr Sosna, Damian Gaska, Zdeněk Hadaš
wiley +1 more source

