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ę "generalized" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 484
Tytuł:
A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
Autorzy:
Sun, Yuefang
Powiązania:
https://bibliotekanauki.pl/articles/31341589.pdf
Data publikacji:
2017-11-27
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
generalized connectivity
generalized edge-connectivity
strong product
Opis:
The generalized $k$-connectivity $ \kappa_k (G) $ of a graph $G$, mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized $k$-edge-connectivity which is defined as $ \lambda_k (G) = \text{min} \{ \lambda_G (S) | S \subseteq V (G) $ and $ |S| = k \} $, where $ \lambda_G (S) $ denote the maximum number $ \mathcal{l} $ of pairwise edge-disjoint trees $ T_1 $, $ T_2 $, . . ., $ T_\mathcal{l} $ in $G$ such that $S \subseteq V (T_i)$ for $ 1 \le i \le \mathcal{l} $. In this paper we get a sharp lower bound for the generalized 3-edge-connectivity of the strong product of any two connected graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 975-988
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a visualization of the convergence of the boundary of generalized Mandelbrot set to (n-1)-sphere
Autorzy:
Katunin, A.
Fedio, K.
Powiązania:
https://bibliotekanauki.pl/articles/122318.pdf
Data publikacji:
2015
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
generalized Mandelbrot set
fractals
convergence
generalized sphere
Opis:
In this article we analyze the generalized Mandelbrot set in higher-order hypercomplex number spaces following both the Cayley-Dickson construction algebraic spaces and the spaces defined by Clifford algebras. The particular case of the generalized 3D quasi-Mandelbrot set was also considered. In particular, we investigated the increase of power of the iterated variable and proved that when this power tends to infinity, the Mandelbrot set is convergent to the unit circle. The same is true for the generalized Mandelbrot sets in higher-dimensional hypercomplex number spaces, i.e. when the power of iterated variable tends to infinity, the generalized Mandelbrot set is convergent to the unit (n-1)- sphere. The results of our investigation were visualized for the generalized Mandelbrot set in a complex number space and the generalized quasi-Mandelbrot set in a 3D Euclidean space.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 1; 63-69
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Idempotent Elements of Weak Projection Generalized Hypersubstitutions
Autorzy:
Lekkoksung, Nareupanat
Jampachon, Prakit
Powiązania:
https://bibliotekanauki.pl/articles/52486380.pdf
Data publikacji:
2018-06-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
idempotent
regular
generalized hypersubstitution
weak projection generalized hypersubstitution
Opis:
A generalized hypersubstitution of type τ = (ni)i∈I is a mapping σ which maps every operation symbol fi to the term σ(fi) and may not preserve arity. It is the main tool to study strong hyperidentities that are used to classify varieties into collections called strong hypervarieties. Each generalized hypersubstitution can be extended to a mapping σ̂ on the set of all terms of type τ. A binary operation on HypG(τ), the set of all generalized hypersubstitutions of type τ, can be defined by using this extension. The set HypG(τ) together with such a binary operation forms a monoid, where a hypersubstitution σid, which maps fi to fi(x1, . . ., xni) for every i ∈ I, is the neutral element of this monoid. A weak projection generalized hypersubstitution of type τ is a generalized hypersubstitution of type τ which maps at least one of the operation symbols to a variable. In semigroup theory, the various types of its elements are widely considered. In this paper, we present the characterizations of idempotent weak projection generalized hypersubstitutions of type (m, n) and give some sufficient conditions for a weak projection generalized hypersubstitution of type (m, n) to be regular, where m, n ≥ 1.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2018, 38, 1; 99-114
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized F tests and selective generalized F tests for orthogonal and associated mixed models
Autorzy:
Nunes, Célia
Pinto, Iola
Mexia, João
Powiązania:
https://bibliotekanauki.pl/articles/729658.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
selective generalized F tests
generalized polar coordinates
associated models
Opis:
The statistics of generalized F tests are quotients of linear combinations of independent chi-squares. Given a parameter, θ, for which we have a quadratic unbiased estimator, θ̃, the test statistic, for the hypothesis of nullity of that parameter, is the quotient of the positive part by the negative part of such estimator. Using generalized polar coordinates it is possible to obtain selective generalized F tests which are especially powerful for selected families of alternatives. We build both classes of tests for the orthogonal and associated mixed models. The associated models are obtained adding terms to the orthogonal models.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2008, 28, 2; 229-246
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Properties of the generalized nonlinear least squares method applied for fitting distribution to data
Autorzy:
Benšić, Mirta
Powiązania:
https://bibliotekanauki.pl/articles/729766.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
generalized least squares
distribution fitting
generalized method of moments
Opis:
We introduce and analyze a class of estimators for distribution parameters based on the relationship between the distribution function and the empirical distribution function. This class includes the nonlinear least squares estimator and the weighted nonlinear least squares estimator which has been used in parameter estimation for lifetime data (see e.g. [6, 8]) as well as the generalized nonlinear least squares estimator proposed in [3]. Sufficient conditions for consistency and asymptotic normality are given. Capability and limitations are illustrated by simulations.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2015, 35, 1-2; 75-94
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Variance components estimation in generalized orthogonal models
Autorzy:
Fernandes, Célia
Ramos, Paulo
Ferreira, Sandra
Mexia, João
Powiązania:
https://bibliotekanauki.pl/articles/729930.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
generalized orthogonal models
variance components
generalized cross nesting designs
Opis:
The model $y = ∑_{j=1}^w X_j β̲_j + e̲$ is generalized orthogonal if the orthogonal projection matrices on the range spaces of matrices $X_j$, j = 1, ..., w, commute. Unbiased estimators are obtained for the variance components of such models with cross-nesting.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2007, 27, 1-2; 99-115
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stronger bounds for generalized degrees and Menger path systems
Autorzy:
Faudree, R.
Tuza, Zs.
Powiązania:
https://bibliotekanauki.pl/articles/972047.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
generalized degree
Menger
Opis:
For positive integers d and m, let $P_{d,m}(G)$ denote the property that between each pair of vertices of the graph G, there are m internally vertex disjoint paths of length at most d. For a positive integer t a graph G satisfies the minimum generalized degree condition δₜ(G) ≥ s if the cardinality of the union of the neighborhoods of each set of t vertices of G is at least s. Generalized degree conditions that ensure that $P_{d,m}(G)$ is satisfied have been investigated. In particular, it has been shown, for fixed positive integers t ≥ 5, d ≥ 5t², and m, that if an m-connected graph G of order n satisfies the generalized degree condition δₜ(G) > (t/(t+1))(5n/(d+2))+(m-1)d+3t², then for n sufficiently large G has property $P_{d,m}(G)$. In this note, this result will be improved by obtaining corresponding results on property $P_{d,m}(G)$ using a generalized degree condition δₜ(G), except that the restriction d ≥ 5t² will be replaced by the weaker restriction d ≥ max{5t+28,t+77}. Also, it will be shown, just as in the original result, that if the order of magnitude of δₜ(G) is decreased, then $P_{d,m}(G)$ will not, in general, hold; so the result is sharp in terms of the order of magnitude of δₜ(G).
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 2; 167-177
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized Ostrowski type inequalities for functions whose local fractional derivatives are generalized s-convex in the second sense
Autorzy:
Budak, H.
Sarikaya, M. Z.
Set, E.
Powiązania:
https://bibliotekanauki.pl/articles/122303.pdf
Data publikacji:
2016
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
generalized Hermite-Hadamard inequality
generalized Hölder inequality
generalized convex functions
nierówność Höldera
wypukłość funkcji
nierówność Hermite-Hadamarda
Opis:
In this paper, we establish some generalized Ostrowski type inequalities for functions whose local fractional derivatives are generalized s-convex in the second sense.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 4; 11-21
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quasidifferentiable Calculus and Minimal Pairs of Compact Convex Sets
Autorzy:
Pallaschke, Diethard
Urbański, Ryszard
Powiązania:
https://bibliotekanauki.pl/articles/1373556.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
nonsmooth optimization
generalized convexity
Opis:
The quasidifferential calculus developed by V.F. Demyanov and A.M. Rubinov provides a complete analogon to the classical calculus of differentiation for a wide class of nonsmooth functions. Although this looks at the first glance as a generalized subgradient calculus for pairs of subdifferentials it turns out that, after a more detailed analysis, the quasidifferential calculus is a kind of Fréchet-differentiation whose gradients are elements of a suitable Minkowski–Rådström–Hörmander space. One aim of the paper is to point out this fact. The main results in this direction are Theorem 1 and Theorem 5. Since the elements of the Minkowski–Rådström–Hörmander space are not uniquely determined, we focus our attention in the second part of the paper to smallest possible representations of quasidifferentials, i.e. to minimal representations. Here the main results are two necessary minimality criteria, which are stated in Theorem 9 and Theorem 11.
Źródło:
Schedae Informaticae; 2012, 21; 107-125
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized weighted Besov spaces on the Gegenbauer hypergroup
Autorzy:
Ibrahimov, Elman J.
Powiązania:
https://bibliotekanauki.pl/articles/963587.pdf
Data publikacji:
2014
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
gegenbauer hypergroup
generalized gegenbauer shifts operators
besov spaces
generalized convolution
gegenbauer transformations
Opis:
In this paper we study generalized weighted Besov type spaces on the Gegenbauer hypergroup. We give different characterizations of these spaces in terms of generalized convolution with a kind of smooth functions and by means of generalized translation operators. Also a discrete norm is given to obtain more general properties on these spaces. Obtained results are analogies of the results for generalized Bessel shifts obtained in the work [5].
Źródło:
Commentationes Mathematicae; 2014, 54, 1
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Minimum Size of a Graph with Given Tree Connectivity
Autorzy:
Sun, Yuefang
Sheng, Bin
Jin, Zemin
Powiązania:
https://bibliotekanauki.pl/articles/32083875.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
generalized connectivity
tree connectivity
eneralized k-connectivity
generalized k-edge-connectivity
packing
Opis:
For a graph $G = (V, E)$ and a set $S ⊆ V$ of at least two vertices, an $S$-tree is a such subgraph $T$ of $G$ that is a tree with $S ⊆ V(T)$. Two $S$-trees $T_1$ and $T_2$ are said to be internally disjoint if $E(T_1) ∩ E(T_2) = ∅$ and $V(T_1) ∩ V(T_2) = S$, and edge-disjoint if $E(T_1) ∩ E(T_2) = ∅$. The generalized local connectivity $κ_G(S)$ (generalized local edge-connectivity $λ_G(S)$, respectively) is the maximum number of internally disjoint (edge-disjoint, respectively) $S$-trees in $G$. For an integer $k$ with $2 ≤ k ≤ n$, the generalized $k$-connectivity (generalized $k$-edge-connectivity, respectively) is defined as $κ_k(G) = min{κ_G(S) | S ⊆ V(G), |S| = k} (λ_k(G) = min{λ_G(S) | S ⊆ V(G), |S| = k}$, respectively). Let $f(n, k, t)$ ($g(n, k, t)$, respectively) be the minimum size of a connected graph $G$ with order $n$ and $κ_k(G) = t$ ($λ_k(G) = t$, respectively), where $3 ≤ k ≤ n$ and \(1≤t≤n-⌈\frac{k}{2}⌉\). For general $k$ and $t$, Li and Mao obtained a lower bound for $g(n, k, t)$ which is tight for the case $k = 3$. We show that the bound also holds for $f(n, k, t)$ and is tight for the case $k = 3$. When t is general, we obtain upper bounds of both $f(n, k, t)$ and $g(n, k, t)$ for $k ∈ {3, 4, 5}$, and all of these bounds can be attained. When $k$ is general, we get an upper bound of $g(n, k, t)$ for $t ∈ {1, 2, 3, 4}$ and an upper bound of $f(n, k, t)$ for $t ∈ {1, 2, 3}$. Moreover, both bounds can be attained.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 409-425
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Bayes estimators of the parameters of inflated modified power series distributions
Autorzy:
Murat, Małgorzata
Szynal, Dominik
Powiązania:
https://bibliotekanauki.pl/articles/729948.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
posterior distributions
posterior moments
Bayes estimator
inflated distribution
generalized Pareto distribution
generalized Poisson distribution
generalized negative binomial distribution
lost games distribution
Opis:
In this paper, we study the class of inflated modified power series distributions (IMPSD) where inflation occurs at any of support points. This class includes among others the generalized Poisson,the generalized negative binomial and the lost games distributions. We derive the Bayes estimators of parameters for these distributions when a parameter of inflation is known. First, we take as the prior distribution the uniform, Beta and Gamma distribution. In the second part of this paper, the prior distribution is the generalized Pareto distribution.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2000, 20, 2; 189-209
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Slicing of generalized surfaces with curvature measures and diameters estimate
Autorzy:
Delladio, Silvano
Powiązania:
https://bibliotekanauki.pl/articles/1310942.pdf
Data publikacji:
1996
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
generalized Gauss graphs
rectifiable currents
generalized curvatures
Meusnier theorem
Fenchel inequality
diameter estimate
Opis:
We prove generalizations of Meusnier's theorem and Fenchel's inequality for a class of generalized surfaces with curvature measures. Moreover, we apply them to obtain a diameter estimate.
Źródło:
Annales Polonici Mathematici; 1996, 64, 3; 267-283
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity
Autorzy:
Sun, Yuefang
Powiązania:
https://bibliotekanauki.pl/articles/31341709.pdf
Data publikacji:
2017-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
k -connectivity
generalized connectivity
connectivity
Opis:
The concept of k-connectivity κk(G), introduced by Chartrand in 1984, is a generalization of the cut-version of the classical connectivity. For an integer k ≥ 2, the k-connectivity of a connected graph G with order n ≥ k is the smallest number of vertices whose removal from G produces a graph with at least k components or a graph with fewer than k vertices. In this paper, we get a sharp upper bound for the size of G with κk(G) = t, where 1 ≤ t ≤ n − k and k ≥ 3; moreover, the unique extremal graph is given. Based on this result, we get the exact values for the maximum size, denoted by g(n, k, t), of a connected graph G with order n and κk(G) = t. We also compute the exact values and bounds for another parameter f(n, k, t) which is defined as the minimum size of a connected graph G with order n and κk(G) = t, where 1 ≤ t ≤ n − k and k ≥ 3.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 623-632
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Colouring game and generalized colouring game on graphs with cut-vertices
Autorzy:
Sidorowicz, Elżbieta
Powiązania:
https://bibliotekanauki.pl/articles/744059.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
colouring game
generalized colouring game
Opis:
For k ≥ 2 we define a class of graphs ₖ = {G: every block of G has at most k vertices}. The class ₖ contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs. We consider the colouring game and the generalized colouring game on graphs from ₖ.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 3; 499-533
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 484

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