Institution
Matej Bel University
Education•Banská Bystrica, Slovakia•
About: Matej Bel University is a education organization based out in Banská Bystrica, Slovakia. It is known for research contribution in the topics: Tourism & Fuzzy set. The organization has 721 authors who have published 1497 publications receiving 11573 citations. The organization is also known as: Matej Bel & Univerzita Mateja Bela.
Topics: Tourism, Fuzzy set, Population, Context (language use), Higher education
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The recurrence rate and determinism are expressed in terms of the correlation sum, and strong laws of large numbers are given for them.
Abstract: The recurrence rate and determinism are two of the basic complexity measures studied in the recurrence quantification analysis. In this paper, the recurrence rate and determinism are expressed in terms of the correlation sums, and strong laws of large numbers are given for them.
13 citations
••
TL;DR: The concepts of logical entropy and logical mutual information of experiments in the intuitionistic fuzzy case are introduced, and an analogy of the Kolmogorov-Sinai theorem on generators for IF-dynamical systems is proved.
Abstract: In this contribution, we introduce the concepts of logical entropy and logical mutual information of experiments in the intuitionistic fuzzy case, and study the basic properties of the suggested measures. Subsequently, by means of the suggested notion of logical entropy of an IF-partition, we define the logical entropy of an IF-dynamical system. It is shown that the logical entropy of IF-dynamical systems is invariant under isomorphism. Finally, an analogy of the Kolmogorov–Sinai theorem on generators for IF-dynamical systems is proved.
13 citations
••
27 Feb 2003TL;DR: The matroid parse trees of as mentioned in this paper are matroids of bounded branch-width representable over a finite field, and they can be recognized by a finite tree automaton.
Abstract: We introduce "matroid parse trees" which, using only a limited amount of information, can build up all matroids of bounded branch-width representable over a finite field. We prove that if M is a family of matroids described by a sentence in the second-order monadic logic of matroids, then the parse trees of bounded-width representable members of M can be recognized by a finite tree automaton. Since the cycle matroids of graphs are representable over any finite field, our result directly extends the well-known "MS2-theorem" for graphs of bounded tree-width by Courcelle and others. This work has algorithmic applications in matroid or coding theories.
13 citations
••
TL;DR: In this article, the importance of the family in our current society with an emphasis on the particularities of the father's and mother's role in child rearing is discussed, and the authors attempt to point out the importance and importance of family in modern society.
Abstract: Abstract We live in the era, when a lack of understanding the elementary family's functions and ineffectiveness in creating lasting and open relations within the family backgrounds are a frequent phenomenon. The breakdown of the family is often caused by immaturity and inadequate conditions for the parental and marital role. Personal tragedies, as well as the consequences in the upbringing, are serious effects of divorce and family breakdown. In this article we are attempting to point out an importance of the family in our current society with an emphasis on the particularities of the father’s and mother’s role in child rearing.
13 citations
••
TL;DR: Enough conditions are studied to ensure standard, weak and directional monotonicity for specific types of weighting functions for specific kinds of mixture functions.
13 citations
Authors
Showing all 749 results
Name | H-index | Papers | Citations |
---|---|---|---|
Gareth Jones | 91 | 655 | 30290 |
Michal Meres | 71 | 260 | 14850 |
Alexander Rosa | 30 | 127 | 2741 |
Robert Zaleśny | 25 | 95 | 1658 |
Ľubomír Švorc | 25 | 92 | 1636 |
Evgeni E. Kolomeitsev | 24 | 96 | 2727 |
Heribert Reis | 23 | 56 | 1130 |
Ivan Černušák | 20 | 96 | 1362 |
Beloslav Riečan | 19 | 89 | 1123 |
Boris Tomasik | 16 | 138 | 792 |
Peter Pristaš | 16 | 138 | 1110 |
Juraj Nemec | 15 | 179 | 1125 |
Polina Lemenkova | 15 | 105 | 743 |
Uglješa Stankov | 15 | 68 | 717 |
Roman Nedela | 15 | 31 | 765 |