Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "sets" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 372
Tytuł:
On some properties of the class of stationary sets
Autorzy:
Lefevre, Pascal
Powiązania:
https://bibliotekanauki.pl/articles/966024.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Rajchman sets
sets of continuity
stationary sets
UC sets
random Fourier series
Sidon sets
Riesz products
Opis:
Some new properties of the stationary sets (defined by G. Pisier in [12]) are studied. Some arithmetical conditions are given, leading to the non-stationarity of the prime numbers. It is shown that any stationary set is a set of continuity. Some examples of "large" stationary sets are given, which are not sets of uniform convergence.
Źródło:
Colloquium Mathematicum; 1998, 76, 1; 1-18
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Additive properties and uniformly completely Ramsey sets
Autorzy:
Nowik, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/965985.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
QN sets
uniformly completely Ramsey sets
Ramsey null sets
Opis:
We prove some properties of uniformly completely Ramsey null sets (for example, every hereditarily Menger set is uniformly completely Ramsey null).
Źródło:
Colloquium Mathematicum; 1999, 82, 2; 191-199
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analytic cell decomposition of sets definable in the structure $ℝ_{exp}$
Autorzy:
Loi, Ta
Powiązania:
https://bibliotekanauki.pl/articles/1311687.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
-sets
Opis:
We prove that every set definable in the structure $ℝ_{exp}$ can be decomposed into finitely many connected analytic manifolds each of which is also definable in this structure.
Źródło:
Annales Polonici Mathematici; 1994, 59, 3; 255-266
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Measures and lacunary sets
Autorzy:
Lefèvre, Pascal
Powiązania:
https://bibliotekanauki.pl/articles/1216990.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
stationary sets
p-Sidon sets
sets of continuity
Λ(1) sets
Riesz sets
random Fourier series
(p,q)-summing operators
Opis:
We establish new connections between some classes of lacunary sets. The main tool is the use of (p,q)-summing or weakly compact operators (for Riesz sets). This point of view provides new properties of stationary sets and allows us to generalize to more general abelian groups than the torus some properties of p-Sidon sets. We also construct some new classes of Riesz sets.
Źródło:
Studia Mathematica; 1999, 133, 2; 145-161
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Convex universal fixers
Autorzy:
Lemańska, Magdalena
Zuazua, Rita
Powiązania:
https://bibliotekanauki.pl/articles/743272.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
convex sets
dominating sets
universal fixers
Opis:
In [1] Burger and Mynhardt introduced the idea of universal fixers. Let G = (V, E) be a graph with n vertices and G' a copy of G. For a bijective function π: V(G) → V(G'), define the prism πG of G as follows: V(πG) = V(G) ∪ V(G') and $E(πG) = E(G) ∪ E(G') ∪ M_{π}$, where $M_{π} = {u π(u) | u ∈ V(G)}$. Let γ(G) be the domination number of G. If γ(πG) = γ(G) for any bijective function π, then G is called a universal fixer. In [9] it is conjectured that the only universal fixers are the edgeless graphs K̅ₙ. In this work we generalize the concept of universal fixers to the convex universal fixers. In the second section we give a characterization for convex universal fixers (Theorem 6) and finally, we give an in infinite family of convex universal fixers for an arbitrary natural number n ≥ 10.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 807-812
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Knowledge, Vagueness and Logic
Autorzy:
Wybraniec-Skardowska, U.
Powiązania:
https://bibliotekanauki.pl/articles/908372.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
logika formalna
vague knowledge
fuzzy sets
rough sets
vague sets
formal logic
Opis:
The aim of the paper is to outline an idea of solving the problem of the vagueness of concepts. The starting point is a definition of the concept of vague knowledge. One of the primary goals is a formal justification of the classical viewpoint on the controversy about the truth and object reference of expressions including vague terms. It is proved that grasping the vagueness in the language aspect is possible through the extension of classical logic to the logic of sentences which may contain vague terms. The theoretical framework of the conception refers to the theory of Pawlak's rough sets and is connected with Zadeh's fuzzy set theory as well as bag (or multiset) theory. In the considerations formal logic means and the concept system of set theory have been used. The paper can be regarded as an outline of the logical theory of vague concepts.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 719-737
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sidon sets and Riesz sets for some measure algebras on the disk
Autorzy:
Gebuhrer, Olivier
Schwartz, Alan
Powiązania:
https://bibliotekanauki.pl/articles/966664.pdf
Data publikacji:
1997
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
disk polynomials
bivariate polynomials
Riesz sets
hypergroups
Sidon sets
Opis:
Sidon sets for the disk polynomial measure algebra (the continuous disk polynomial hypergroup) are described completely in terms of classical Sidon sets for the circle; an analogue of the F. and M. Riesz theorem is also proved.
Źródło:
Colloquium Mathematicum; 1997, 72, 2; 269-279
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rough membership functions: a tool for reasoning with uncertainty
Autorzy:
Pawlak, Z.
Skowron, A.
Powiązania:
https://bibliotekanauki.pl/articles/1361085.pdf
Data publikacji:
1993
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
evidence theory
rough sets
reasoning with incomplete information
fuzzy sets
Opis:
A variety of numerical approaches for reasoning with uncertainty have been investigated in the literature. We propose rough membership functions, rm-functions for short, as a basis for such reasoning. These functions have values in the interval [0,1] and are computable on the basis of the observable information about the objects rather than on the objects themselves. We investigate properties of the rm-functions. In particular, we show that our approach is intensional with respect to the class of all information systems [P91]. As a consequence we point out some differences between the rm-functions and the fuzzy membership functions [Z65], e.g. the rm-function values for X ∪ Y (X ∩ Y) cannot be computed in general by applying the operation max(min) to the rm-function values for X and Y.
Źródło:
Banach Center Publications; 1993, 28, 1; 135-150
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy modal operators and their applications
Autorzy:
Radzikowska, A. M.
Powiązania:
https://bibliotekanauki.pl/articles/384429.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
modal operator
fuzzy sets
approximation operators
intuitionistic fuzzy sets
linguistic hedge
Opis:
In this paper we present some fuzzy modal operators and show their two possible applications. These operators are fuzzy generalizations of modal operators well-known in modal logics. We present an application of some compositions of these operators in approximations of fuzzy sets. In particular, it is shown how skills of candidates can be matched for selecting research projects. The underlying idea is based on the observation that fuzzy sets approximations can be viewed as intuitionistic fuzzy sets introduced by Atanassov. Distances between intuitionistic fuzzy sets, proposed by Szmidt and Kacprzyk, support the reasoning process. Also, we point out how modal operators are useful for representing linguistic hedges, that is terms like “very”, “definitely”, “rather”, or “more or less”.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 1; 10-20
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recent soft computing methods in software reliability engineering
Autorzy:
Albeanu, G.
Duda, G.
Powiązania:
https://bibliotekanauki.pl/articles/2069529.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
fuzzy sets
intuitionistic fuzzy sets
intuitionistic fuzzy numbers
subjective data analysis
Opis:
This paper presents recent approaches in soft computing to manage imprecision and uncertainty which appear in software reliability engineering. Firstly, recent approaches like imprecise probabilities, generalized intervals, fuzzy sets and intuitionistic-fuzzy sets are shortly described, and the usage of intuitionistic fuzzy numbers for system reliability computation is shown. Intuitionistic-fuzzy approaches for software reliability growth models are proposed and experimental results are given.
Źródło:
Journal of Polish Safety and Reliability Association; 2011, 2, 1; 1--10
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the complemented subspaces of the Schreier spaces
Autorzy:
Gasparis, I.
Leung, D.
Powiązania:
https://bibliotekanauki.pl/articles/1206028.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Schreier sets
complemented subspace
Opis:
It is shown that for every 1 ≤ ξ < ω, two subspaces of the Schreier space $X^ξ$ generated by subsequences $(e_{l_n}^{ξ})$ and $(e_{m_n}^{ξ})$, respectively, of the natural Schauder basis $(e_{n}^{ξ})$ of $X^ξ$ are isomorphic if and only if $(e_{l_n}^{ξ})$ and $(e_{m_n}^{ξ})$ are equivalent. Further, $X^ξ$ admits a continuum of mutually incomparable complemented subspaces spanned by subsequences of $(e_{n}^{ξ})$. It is also shown that there exists a complemented subspace spanned by a block basis of $(e_{n}^{ξ})$, which is not isomorphic to a subspace generated by a subsequence of $(e_n^ζ)$, for every $0 ≤ ζ ≤ ξ$. Finally, an example is given of an uncomplemented subspace of $X^ξ$ which is spanned by a block basis of $(e_{n}^{ξ})$.
Źródło:
Studia Mathematica; 2000, 141, 3; 273-300
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
γ-graphs of graphs
Autorzy:
Fricke, Gerd
Hedetniemi, Sandra
Hedetniemi, Stephen
Hutson, Kevin
Powiązania:
https://bibliotekanauki.pl/articles/743973.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
dominating sets
gamma graphs
Opis:
A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set S in G; we say that such a set S is a γ-set. In this paper we consider the family of all γ-sets in a graph G and we define the γ-graph G(γ) = (V(γ), E(γ)) of G to be the graph whose vertices V(γ) correspond 1-to-1 with the γ-sets of G, and two γ-sets, say D₁ and D₂, are adjacent in E(γ) if there exists a vertex v ∈ D₁ and a vertex w ∈ D₂ such that v is adjacent to w and D₁ = D₂ - {w} ∪ {v}, or equivalently, D₂ = D₁ - {v} ∪ {w}. In this paper we initiate the study of γ-graphs of graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 3; 517-531
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Effectiveness of Real Estate Market Versus Efficiency of Its Participants
Autorzy:
Renigier-Biłozor, Małgorzata
Wiśniewski, Radosław
Powiązania:
https://bibliotekanauki.pl/articles/623843.pdf
Data publikacji:
2012-07-26
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
subject efficiency
rough sets
Opis:
This paper attempts to prove the following hypothesis: the effectiveness of a real estate market may be identified by analysing the effectiveness of its participants. The authors also discuss methods based on the rough set theory which can influence the efficiency and efficacy of market participants, and consequently, the effectiveness of the real estate market and its participants.
Źródło:
European Spatial Research and Policy; 2012, 19, 1
1231-1952
1896-1525
Pojawia się w:
European Spatial Research and Policy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A remark on the intersections of subanalytic leaves
Autorzy:
Denkowski, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/255335.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
transversality conditions
subanalytic sets
Opis:
We discuss a new sufficient condition - weaker than the usual transversality condition - for the intersection of two subanalytic leaves to be smooth. It involves the tangent cone of the intersection and, as typically non-transversal, it is of interest in analytic geometry or dynamical systems. We also prove an identity principle for real analytic manifolds and subanalytic functions.
Źródło:
Opuscula Mathematica; 2016, 36, 4; 471-479
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On degree sets and the minimum orders in bipartite graphs
Autorzy:
Manoussakis, Y.
Patil, H.P.
Powiązania:
https://bibliotekanauki.pl/articles/30148239.pdf
Data publikacji:
2014-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
degree sets
unicyclic graphs
Opis:
For any simple graph G, let D(G) denote the degree set ${deg_G(v) : v ∈ V (G)}$. Let S be a finite, nonempty set of positive integers. In this paper, we first determine the families of graphs G which are unicyclic, bipartite satisfying D(G) = S, and further obtain the graphs of minimum orders in such families. More general, for a given pair (S, T) of finite, nonempty sets of positive integers of the same cardinality, it is shown that there exists a bipartite graph B(X, Y) such that D(X) = S, D(Y ) = T and the minimum orders of different types are obtained for such graphs
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 2; 383-390
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 372

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies