We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

in this paper, we aresupposed to introduce the definitions of n-fold commutative, andimplicative hyper k-ideals. these definitions are thegeneralizations of the definitions of commutative, andimplicative hyper k-ideals, respectively, which have been definedin [12]. then we obtain some related results. in particular wedetermine the relationships between n-fold implicative hyperk-ideal and n-fold...

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 ...

hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

In this paper, an algorithm for hyper symmetric environment Simultaneous Localization And Mapping(SLAM) is developed based on the generalized Voronoi graph. The hyper symmetric environment is a challenging environment for the SLAM and the most difficult problem on this is a data association. To redeem this problem, we propose three techniques. The first one is a breadth first node navigation al...

When trying to understand the structure of a social network, the number of mutual dyads is often used to describe tendency toward mutuality (TTM). Only few works, however, deal with measures of TTM and only the work of Rao and Bandyopadhyay [Rao, A.R., Bandyopadhyay, S., 1987. Sankhya 49 Ser. A, pp. 141–188] compares between the different measures. This paper presents the different measures for...

A mineração temporal de textos (temporal text mining TTM) é uma técnica cujo objetivo é descobrir a estrutura latente e padrões temporais em coleções de texto. Estas características são importantes em coleções em que os tópicos de interesse mudam frequentemente com o passar do tempo. Além disso, a mineração temporal de textos é útil em ferramentas de sumarização e descoberta de tendências. Nest...

Space filling curves provide several advantages for indexing spatial data. We look at the Z-curve ordering and discuss three algorithms for navigating and querying k-dimensional Z-curves. In k-dimensional space, a single hyper-’Z’-shape in a recursive Z-curve forms a hypercube with 2k quadrants. The first algorithm concerns efficient checking whether a given quadrant of a local hyper-’Z’ inters...

Students entering into their first year of university studies are subject to a jarring difference between the learning experiences of high school and university. High schools typically take a very structured approach to teaching whereas university expects students to take ownership of their learning. This dramatic shift often means students are not adequately prepared to form positive study hab...