scispace - formally typeset
Search or ask a question
Institution

Matej Bel University

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


Papers
More filters
Journal ArticleDOI
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

Journal ArticleDOI
21 Aug 2017-Entropy
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

Book ChapterDOI
27 Feb 2003
TL;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

Journal ArticleDOI
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

Journal ArticleDOI
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

NameH-indexPapersCitations
Gareth Jones9165530290
Michal Meres7126014850
Alexander Rosa301272741
Robert Zaleśny25951658
Ľubomír Švorc25921636
Evgeni E. Kolomeitsev24962727
Heribert Reis23561130
Ivan Černušák20961362
Beloslav Riečan19891123
Boris Tomasik16138792
Peter Pristaš161381110
Juraj Nemec151791125
Polina Lemenkova15105743
Uglješa Stankov1568717
Roman Nedela1531765
Network Information
Related Institutions (5)
Comenius University in Bratislava
20.5K papers, 439.1K citations

81% related

Masaryk University
24.6K papers, 470.3K citations

81% related

University of Wrocław
25.1K papers, 358.7K citations

78% related

Slovak Academy of Sciences
30.6K papers, 621.8K citations

78% related

University of Maribor
13K papers, 258.3K citations

78% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202318
202233
2021125
2020138
2019137
2018147