The subject of this paper is the mining of generalized association rules using pruning techniques. Given a large transaction database and a hierarchical taxonomy tree of the items, we attempt to find the association rules between the items at different levels in the taxonomy tree under the assumption that original frequent itemsets and association rules have already been generated in advance. T...

We continue investigating the superintegrability property of matrix models, i.e. factorization model averages characters. This paper focuses on Gaussian Hermitian example, where role characters is played by Schur functions. find a new intriguing corollary superintegrability: an infinite set correlators bilinear in More exactly, these are products functions and polynomials $K_\Delta$ that form c...

Taking a Fiedler’s result [1] on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional ...

Due to advances in computer technology, many organizations have a large number of workstation-class machines connected by LAN. Such a network of workstations (NOW) can be used for parallel processing, including database query processing. This paper proposes a new load sharing algorithm for hash join processing on NOWs. This new algorithm combines a chunking method with hash join to manage dynam...

An n-connector is an acyclic directed graph having n inputs and n outputs and satisfying the following condition: given any one-to-one correspondence between inputs and distinct outputs, there exists a set of vertex-disjoint paths that join each input to the corresponding output. It is known that the minimum possible number of edges in an n-connector lies between lower and upper bounds that are...

In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network provides a number of channels distributed to the users by multicast trees which evolve dynamically as users join and leave the channels. We reduce this problem to a generalized Engset system with nonidentical users and g...

In many Discrete-Event Systems (DES) both state and event information are of importance to the systems designer. As a first step towards obtaining hierarchical models of systems, the behavior of Discrete-Event Systems with unobservable transitions and state output maps is considered. Observers for deterministic DES are generalized to nondeterministic DES and characterized using the join semilat...

Quad meshes can be interpreted as tensor-product spline control meshes as long as they form a regular grid, locally. We present a new option for complementing bi-3 splines by bi-4 splines near irregularities in the mesh layout, where less or more than four quadrilaterals join. These new generalized surface and IGA (isogeometric analysis) elements have as their degrees of freedom the vertices of...

In this work, we solve an open problem related to the exchange principle of fuzzy implications [Problem 3.1, Fuzzy Sets and Systems 261(2015) 112-123]. We show that two important generalizations of the exchange principle, namely, the generalized exchange principle(GEP) and the mutual exchangeability(ME) are sufficient conditions for the solution of the problem. We also show that, under some con...