Hyper-tubes of hyper-cubes
Authors
Abstract:
Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
similar resources
hyper-tubes of hyper-cubes
hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
full textINTUITIONISTIC FUZZY HYPER BCK-IDEALS OF HYPER BCK-ALGEBRAS
The intuitionistic fuzzification of (strong, weak, s-weak) hyperBCK-ideals is introduced, and related properties are investigated. Characterizationsof an intuitionistic fuzzy hyper BCK-ideal are established. Using acollection of hyper BCK-ideals with some conditions, an intuitionistic fuzzyhyper BCK-ideal is built.
full textWireless Network-Coded Multi-Way Relaying Using Latin Hyper-Cubes
Physical layer network-coding for the n-way wireless relaying scenario is dealt with, where each of the n user nodes X1, X2, ..., Xn wishes to communicate its messages to all the other (n−1) nodes with the help of the relay node R. The given scheme, based on the denoise-and-forward scheme proposed for two-way relaying by Popovski et al. in [1], employs two phases: Multiple Access (MA) phase and...
full textHyper-Rendering of Hyper-Textured Surfaces
Hypertexture is a powerful and exible procedural modeling tool that is currently limited only by an ine cient rendering mechanism. We analyze the terms of hypertexture functions to obtain an importance measure, capitalize on spatial and image coherence when possible. These enhancements make a guaranteed algorithm for ray-tracing implicit surfaces signi cantly more e cient for rendering hypertex...
full textHyper
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time O(n), where n is the number of graph ...
full textLattice of weak hyper K-ideals of a hyper K-algebra
In this note, we study the lattice structure on the class of all weak hyper K-ideals of a hyper K-algebra. We first introduce the notion of (left,right) scalar in a hyper K-algebra which help us to characterize the weak hyper K-ideals generated by a subset. In the sequel, using the notion of a closure operator, we study the lattice of all weak hyper K-ideals of ahyper K-algebra, and we prove a ...
full textMy Resources
Journal title
volume 6 issue 2
pages 163- 168
publication date 2015-10-01
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023