-lattices
In this paper, we generalize the notion of supremum and infimum in a poset.
Congruences in ordered sets and LU compatible equivalences
A concept of equivalence preserving upper and lower bounds in a poset is introduced. If is a lattice, this concept coincides with the notion of lattice congruence.
Data type polygon
Congruences in ordered sets
A concept of congruence preserving upper and lower bounds in a poset is introduced. If is a lattice, this concept coincides with the notion of lattice congruence.
Kouzlo Fibonacciho kódování
Knowledge sharing in organizational structures
The organizational structure is usually defined using the best experience and there is a minimum of formal approach involved. This paper shows the possibilities of the theory of concept analysis that can help to understand organizational structure based on solid mathematical foundations. This theory is extended by the concept of knowledge sharing and diversity that enables to evaluate the organizational structure. The alternative approach based on the hierarchical methods of cluster analysis is...
Multidimensional term indexing for efficient processing of complex queries
The area of Information Retrieval deals with problems of storage and retrieval within a huge collection of text documents. In IR models, the semantics of a document is usually characterized using a set of terms. A common need to various IR models is an efficient term retrieval provided via a term index. Existing approaches of term indexing, e. g. the inverted list, support efficiently only simple queries asking for a term occurrence. In practice, we would like to exploit some more sophisticated...
Local dependency in networks
Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network's nodes from the structure...
Page 1