Fuzzy roughness of n-ary hypergroups based on a complete residuated lattice

This paper considers the relationships among L-fuzzy sets, rough sets and n-ary hypergroup theory. Based on a complete residuated lattice, the concept of (invertible) L-fuzzy n-ary subhypergroups of a commutative n-ary hypergroup is introduced and some related properties are presented. The notions of lower and upper L-fuzzy rough approximation operators with respect to an L-fuzzy n-ary subhypergroup are introduced and studied. Then, a new algebraic structure called (invertible) L-fuzzy rough n-ary subhypergroups is defined, and the (strong) homomorphism of lower and upper L-fuzzy rough approximation operators is studied.     

Interval-valued fuzzy n-ary subhypergroups of n-ary hypergroups

This paper provides a continuation of ideas presented by Davvaz and Corsini (J Intell Fuzzy Syst 18(4):377–382, 2007). Our aim in this paper is to introduce the concept of quasicoincidence of a fuzzy interval value with an interval-valued fuzzy set. This concept is a generalized concept of quasicoincidence of a fuzzy point within a fuzzy set. By using this new idea, we consider the interval-valued (∈, ∈ ∨q)-fuzzy n-ary subhypergroup of a n-ary hypergroup. This newly defined interval-valued (∈, ∈ ∨q)-fuzzy n-ary subhypergroup is a generalization of the usual fuzzy n-ary subhypergroup. Finally, we consider the concept of implication-based interval-valued fuzzy n-ary subhypergroup in an n-ary hypergroup; in particular, the implication operators in ￡ukasiewicz system of continuous-valued logic are discussed.     

The lower and upper approximations in a hypergroup

This paper presents a relationship between rough sets and hypergroup theory. We analyze the lower and upper approximations of a subset, with respect to an invertible subhypergroup and we consider some particular situations. Moreover, the notion of a rough subhypergroup is introduced. Finally, fuzzy rough subhypergroups are introduced and characterized.     

Approximations in <Emphasis Type="Italic">n</Emphasis>-ary algebraic systems

Algebraic systems have many applications in the theory of sequential machines, formal languages, computer arithmetics, design of fast adders and error-correcting codes. The theory of rough sets has emerged as another major mathematical approach for managing uncertainty that arises from inexact, noisy, or incomplete information. This paper is devoted to the discussion of the relationship between algebraic systems, rough sets and fuzzy rough set models. We shall restrict ourselves to algebraic systems with one n-ary operation and we investigate some properties of approximations of n-ary semigroups. We introduce the notion of rough system in an n-ary semigroup. Fuzzy sets, a generalization of classical sets, are considered as mathematical tools to model the vagueness present in rough systems.     

On probabilistic n-ary hypergroups

The T-fuzzy n-ary subhypergroups of an n-ary hypergroup are defined by using triangular norms and some related properties are hence obtained. In particular, we consider the probabilistic version of n-ary hypergroups by using random sets and show that the fuzzy n-ary hypergroups defined by triangular norms are consequences of some probabilistic n-ary hypergroups under certain conditions. Some results on n-ary hypergroups recently given by Davvaz and Corsini are extended.     

Fuzzy -ary polygroups related to fuzzy points

Recently, fuzzy n-ary sub-polygroups were introduced and studied by Davvaz, Corsini and Leoreanu-Fotea [B. Davvaz, P. Corsini, V. Leoreanu-Fotea, Fuzzy n-ary sub-polygroups, Comput. Math. Appl. 57 (2008) 141–152]. Now, in this paper, the concept of (,q)-fuzzy n-ary sub-polygroups, -fuzzy n-ary sub-polygroups and fuzzy n-ary sub-polygroup with thresholds of an n-ary polygroup are introduced and some characterizations are described. Also, we give the definition of implication-based fuzzy n-ary sub-polygroups in an n-ary polygroup, in particular, the implication operators in Łukasiewicz system of continuous-valued logic are discussed.     

Fuzzy n-ary hypergroups related to fuzzy points

In this paper, we introduce and study a new sort of fuzzy n-ary sub-hypergroups of an n-ary hypergroup, called $(\in,\in \vee q)In this paper, we introduce and study a new sort of fuzzy n-ary sub-hypergroups of an n-ary hypergroup, called ( ? , ? úq)(\in,\in \vee q)-fuzzy n-ary sub-hypergroup. By using this new idea, we consider the ( ? , ? úq)(\in,\in\vee q)-fuzzy n-ary sub-hypergroup of a n-ary hypergroup. This newly defined ( ? , ? úq)(\in,\in \vee q)-fuzzy n-ary sub-hypergroup is a generalization of the usual fuzzy n-ary sub-hypergroup. Finally, we consider the concept of implication-based fuzzy n-ary sub-hypergroup in an n-ary hypergroup and discuss the relations between them, in particular, the implication operators in £\poundsukasiewicz system of continuous-valued logic are discussed.     

Strongly Hamiltonian laceability of the even k-ary n-cube

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every two vertices which are in distinct partite sets. A bipartite graph G is strongly Hamiltonian laceable if it is Hamiltonian laceable and there exists a path of length N − 2 joining each pair of vertices in the same partite set, where N = |V(G)|. We prove that the k-ary n-cube is strongly Hamiltonian laceable for k is even and n  2.     

Multi-Radio Multi-Channel无线传感器网络中信道分配和路由策略

针对无线传感器网络中传输时延长、传输冲突大和吞吐量低等问题,提出了一种在Multi-Radio Multi-Channel无线传感器网络中信道分配和路由策略.该策略动态地建立k元n立方体拓扑结构,使用优化的静态信道分配算法提高节点的吞吐量,使用维序寻径的路由算法减少传输冲突.该方法适用于网络节点稠密、节点相互之间通信冲突大的情况,并且在单跳和多跳的网络环境下均适用.实验结果表明,基于k元n立方体这一拓扑结构的信道分配和路由策略与传统方法相比,有效地减少了端到端时延,降低了网络冲突,减少了节点能量消耗,延长了网络寿命,提高了网络吞吐量.     

A Performance Model of Adaptive Wormhole Routing in k-Ary n-Cubes in the Presence of Digit-Reversal Traffic

Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used by researchers, it is not always true in practice as there are many applications that exhibit traffic nonuniformity. There has hardly been any study that describes an analytical model of fully adaptive routing under nonuniform traffic conditions. This paper describes the first analytical model of fully adaptive routing in k-ary n-cubes in the presence of nonuniform traffic generated by the digit-reversal permutation, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.     

Parallel Lagrange interpolation on <Emphasis Type="Italic">k</Emphasis>-ary <Emphasis Type="Italic">n</Emphasis>-cubes with maximum channel utilization

This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters used in current state-of-the-art implementations.

多值Łukasiewicz逻辑公式的范式表示和计数问题

将符号化计算树逻辑中的Shannon展开式做了推广,在n值Łukasiewicz逻辑系统Łn中,研究了由逻辑公式导出的n值McNaughton函数的展开式,给出了m元n值McNaughton函数的准析取范式和准合取范式.在此基础上,给出了m元n值McNaughton函数的计数问题,并在n值Łukasiewicz逻辑系统Łn中,给出了m元逻辑公式的构造方法及其逻辑等价类的计数问题.     

Product structure of the fuzzy n-ary factor polygroup

Fuzzy n-ary hypergroups were introduced as suitable generalizations of fuzzy polygroups and a special case of fuzzy n-ary hyper groups. The aim of this paper is to introduce the notion of fuzzy n-ary factor polygroups of a polygroup. Based on the fuzzy n-ary factor group, we also study the product structures of the generating fuzzy factor n-ary groups. At the end of the paper, we prove the fundamental theorem of isomorphism of fuzzy n-ary groups.     

A new type of fuzzy n-ary hyperstructures

The aim of this paper is to consider and study a new kind of fuzzy n-ary hyperstructures, such as fuzzy n-ary hypergroups and fuzzy (m,n)-ary hyperrings.     

The diagnosability of the k-ary n-cubes using the pessimistic strategy

The pessimistic strategy, also called the t ₁/t ₁-diagnosis strategy, allows to contain all faulty vertices and at most one fault-free vertex. However, the degree of the diagnosability of a system increases quickly using the pessimistic strategy. In this paper, we consider the k-ary n-cube, which is an important hypercube variant, and show that the 3-ary n-cube and k-ary n-cube with k≥4 are (4n?3)/(4n?3)-diagnosable and (4n?2)/(4n?2)-diagnosable, respectively. Finally, we obtain the degree of the diagnosability of the tori using the pessimistic strategy.     

Path embeddings in faulty 3-ary n-cubes

The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. In this paper, we study the problem of embedding paths of various lengths into faulty 3-ary n-cubes and prove that a faulty 3-ary n-cube with f?2n-3 faulty vertices admits a path of every length from 2n-1 to 3ⁿ-f-1 connecting any two distinct healthy vertices. This result is optimal with respect to the number of vertex faults tolerated.     

Atanassov’s intuitionistic (S, T)-fuzzy n-ary sub-hypergroups and their properties

In this paper, we define a new kind of intuitionistic fuzzy n-ary sub-hypergroups of an n-ary hypergroup. This definition, which is based on Atanassov’s intuitionistic fuzzy sets, t-norms and t-conorms, includes earlier definitions of (n-ary) sub-hypergroups, (intuitionistic) fuzzy (n-ary) sub-hypergroups. Then some related properties are investigated. Also, intuitionistic fuzzy relations with respect to t-norms and t-conorms on n-ary hypergroups are discussed.     

The impact of virtual channel allocation on the performance of deterministic wormhole-routed k-ary n-cubes

Virtual channels yield significant improvement in the performance of wormhole-routed networks as they can greatly reduce message blocking over network resources. K-ary n-cubes with deterministic routing have been widely analysed using analytical modelling tools. Most existing models, however, have either entirely ignored the effects of virtual channel multiplexing or have not considered the impact of virtual channels allocation on message latency. This paper discusses two different organisations of virtual channels in k-ary n-cubes, resulting in two deterministic routing algorithms. It then proposes an analytical model to compute message latency for the two routing algorithms. The proposed model is used in a case study to demonstrate the sensitivity of network latency to the way virtual channels are allocated to messages.     

Superpositions of continuous functions defined on a Baire space

We consider uniformly continuous functions on a Baire space and introduce the notion of a continuity modulus of a function. We formulate a condition on the growth of the continuity modulus φ guaranteeing that superpositions of n-ary functions with continuity modulus φ do not exhaust all (n + 1)-ary functions with continuity modulus φ for any n. Moreover, negating this property leads to the inverse effect.     

On the linear span of the p -ary cascaded GMW sequences

In this paper, a recursion is derived to compute the linear span of the p-ary cascaded GMW sequences. It is the first time to determine the linear span of the p-ary cascaded GMW sequence without any restriction on the parameters completely. Whereas, the known result on the p-ary cascaded GMW sequence with the specific parameters in the literature could be viewed as a special case of the new result. Supported by the National Natural Science Foundation of China (Grant No. 60302015), the Foundation for the Author of National Excellent Doctoral Dissertation of China (Grant No. 200341), and Sichuan Youth Science Foundation (Grant No. 04ZQ026-048)