In this work, we propose a visual, custom-designed, event-driven interconnect simulation framework to evaluate the performance of off-chip multi-processor/memory communications architectures for line cards. The simulator uses the state-of-the-art software design techniques to provide the user with a flexible, robust and comprehensive tool that can evaluate k-ary n-cube based network topologies ...

In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

Computing with sets of tuples (n-ary relations) is often required in programming. This paper presents a new data structure dedicated to the manipulation of large sets of tuples, dubbed sharing tree. The main idea is to share in memory some sub-tuples of the set. We give algorithms for common set operations, that have theoretical complexities proportional to the sizes of the sharing trees given ...

This paper concerns a relationship between soft sets and n-ary polygroups. We consider the notion of an n-ary polygroup as a generalization of a polygroup and apply the notion of soft sets to n-ary polygroups. Some related notions are defined and several basic properties are discussed by using the soft set theory. Furthermore, we propose the homomorphism of n-ary polygroups and investigate the ...

In this paper, we define the strongly compatible relation ε on the (m,n)ary hypermodule M, so that the quotient (M/ε∗, h/ε∗) is an (m,n)-ary module over the fundamental (m,n)-ary ring (R/Γ∗, f/Γ∗, g/Γ∗). Also, we determine a family P (M) of subsets of an (m,n)-ary hypermodule M and we give a sufficient condition such that the geometric space (M,P (M)) is strongly transitive. Mathematics Subject...