Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements have been proposed which include mining a closed set of sequential patterns. Sequential patterns supported by the same sequences in the database can be considered as belonging to an equivalence class. Each equivalence...

this paper provides a review on major ergodic features of semi-independent hyper mv {algebra dynamical systems. theorems are presentedto make contribution to calculate the entropy. particularly, it is proved that thetotal entropy of those semi-independent hyper mv {algebra dynamical systemsthat have a generator can be calculated with respect to their generator ratherthan considering all the par...

This paper presents an approach to calculate the equivalent stray capacitance (SC) of n-turn of the helical flux compression generator (HFCG) coil with multi layer conductor wire filaments (MLCWF) in the form of rectangular cross-section. This approach is based on vespiary regular hexagonal (VRH) model. In this method, wire filaments of the generator coil are separated into many very small simi...

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

This paper describes a minimal implementation of a cryptographically secure electronic voting system, built with a low-cost Xilinx FPGA board. This system, called VoteBox Nano, follows the same basic design principles as VoteBox, a full-featured electronic voting system. As with VoteBox, the votes are encrypted using Elgamal homomorphic encryption and the accuracy of the system can be challenge...

Two new efficient algorithms for computing greatest common divisors (gcds) of parametric multivariate polynomials over k[U][X] are presented. The key idea the first algorithm is that gcd two non-parametric can be obtained by dividing their product generator intersection principal ideals generated polynomials. second based on another simple insight extracted using ideal quotient a polynomial wit...

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...