Informacja

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

Wyszukujesz frazę "METRIC" wg kryterium: Temat


Tytuł:
Injective hyperbolicity of domains
Autorzy:
Overholt, Marius
Powiązania:
https://bibliotekanauki.pl/articles/1311489.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
invariant metric
Kobayashi-Royden metric
Hahn metric
S-metric
Opis:
The pseudometric of Hahn is identical to the Kobayashi-Royden pseudometric on domains of dimension greater than two. Thus injective hyperbolicity coincides with ordinary hyperbolicity in this case.
Źródło:
Annales Polonici Mathematici; 1995, 62, 1; 79-82
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Completeness of the Bergman metric on non-smooth pseudoconvex domains
Autorzy:
Chen, Bo
Powiązania:
https://bibliotekanauki.pl/articles/1294051.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Bergman metric
Opis:
We prove that the Bergman metric on domains satisfying condition S is complete. This implies that any bounded pseudoconvex domain with Lipschitz boundary is complete with respect to the Bergman metric. We also show that bounded hyperconvex domains in the plane and convex domains in $ℂ^n$ are Bergman comlete.
Źródło:
Annales Polonici Mathematici; 1999, 71, 3; 241-251
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Autorzy:
Kuziak, Dorota
Yero, Ismael G.
Rodríguez-Velázquez, Juan A.
Powiązania:
https://bibliotekanauki.pl/articles/31340465.pdf
Data publikacji:
2016-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
strong metric dimension
strong metric basis
strong metric generator
lexicographic product graphs
Opis:
Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its factor graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 1051-1064
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Isometric embedding into spaces of continuous functions
Autorzy:
Villa, Rafael
Powiązania:
https://bibliotekanauki.pl/articles/1218403.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
metric space
Banach space
metric linear dimension
Opis:
We prove that some Banach spaces X have the property that every Banach space that can be isometrically embedded in X can be isometrically and linearly embedded in X. We do not know if this is a general property of Banach spaces. As a consequence we characterize for which ordinal numbers α, β there exists an isometric embedding between $C_0(α+1)$ and $C_0(β+1)$.
Źródło:
Studia Mathematica; 1998, 129, 3; 197-205
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cone 2-metric space nad Fixed point theorem of contractive mappings
Autorzy:
Singh, B.
Jain, Shishir
Bhagat, Prakash
Powiązania:
https://bibliotekanauki.pl/articles/746380.pdf
Data publikacji:
2012
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Cone 2-metric space
Fixed point
Cone metric space
2-metric space
Ordered Banach space
Opis:
In this paper we introduce cone 2-metric space and prove some fixed point theorems of a contractive mapping on a cone 2-metric space.
Źródło:
Commentationes Mathematicae; 2012, 52, 2
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computing the Metric Dimension of a Graph from Primary Subgraphs
Autorzy:
Kuziak, Dorota
Rodríguez-Velázquez, Juan A.
Yero, Ismael G.
Powiązania:
https://bibliotekanauki.pl/articles/31342126.pdf
Data publikacji:
2017-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
metric dimension
metric basis
primary subgraphs
rooted product graphs
corona product graphs
Opis:
Let G be a connected graph. Given an ordered set W = {w1, . . ., wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . ., d(u, wk)), where d(u, wi) denotes the distance between u and wi. The set W is a metric generator for G if every two different vertices of G have distinct representations. A minimum cardinality metric generator is called a metric basis of G and its cardinality is called the metric dimension of G. It is well known that the problem of finding the metric dimension of a graph is NP-hard. In this paper we obtain closed formulae for the metric dimension of graphs with cut vertices. The main results are applied to specific constructions including rooted product graphs, corona product graphs, block graphs and chains of graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 273-293
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Design of an Objective Metric and Construction of a Prototype System for Monitoring Perceived Quality (QoE) of Video Sequences
Autorzy:
Janowski, L.
Leszczuk, M.
Papir, Z.
Romaniak, P.
Powiązania:
https://bibliotekanauki.pl/articles/307891.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
mean opinion score
no reference metric
objective metric
quality of experience
video artefacts
Opis:
The paper presents different no reference (NR) objective metrics addressing the most important artefacts for raw (source) video sequences (noise, blur, exposure) and those introduced by compression (blocking, flickering) which can be used for assessing quality of experience. The validity of all metrics was verified under subjective tests.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 3; 87-94
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
All metric bases and fault-tolerant metric dimension for square of grid
Autorzy:
Saha, Laxman
Basak, Mithun
Tiwary, Kalishankar
Powiązania:
https://bibliotekanauki.pl/articles/2048644.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
code
resolving set
metric dimension
fault-tolerant resolving set
fault-tolerant metric dimension
Opis:
For a simple connected graph G = (V,E) and an ordered subset W = {w1, w2, . . . , wk} of V , the code of a vertex v ∈ V , denoted by code(v), with respect to W is a k-tuple (d(v, w1), . . . , d(v, wk)), where d(v, wt) represents the distance between v and wt. The set W is called a resolving set of G if code(u) ≠ code(v) for every pair of distinct vertices u and v. A metric basis of G is a resolving set with the minimum cardinality. The metric dimension of G is the cardinality of a metric basis and is denoted by β(G). A set F ⊂ V is called fault-tolerant resolving set of G if F \ {v} is a resolving set of G for every v ∈ F. The fault-tolerant metric dimension of G is the cardinality of a minimal fault-tolerant resolving set. In this article, a complete characterization of metric bases for G2 mn has been given. In addition, we prove that the fault-tolerant metric dimension of G2 mn is 4 if m + n is even. We also show that the fault-tolerant metric dimension of G2 mn is at least 5 and at most 6 when m + n is odd.
Źródło:
Opuscula Mathematica; 2022, 42, 1; 93-111
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Anima, Spiritus, Mens in Sepulchral Inscriptions from the Carmina Latina Epigraphica. Philological Approximations
Autorzy:
Gacia, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/2158382.pdf
Data publikacji:
2022-09-26
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II
Tematy:
carmina epigraphica
metric sepulchral inscriptions,
anima
spiritus
mens
corpus
caro
metric sepulchral inscriptions
Opis:
The subject of this study is the meaning of the words anima, spiritus and mens in the metrical sepulchral inscriptions in the Carmina Latina Epigraphica collection published at the end of the 19th century by Franz Buecheler. This collection comprises almost 1,900 texts, of which around 1,400 are funerary and, particularly, sepulchral inscriptions. This article consists of three sections. The first contains general comments on Roman sepulchral inscriptions. The second, and most important part uses a conventional philological method to analyze the words in the source texts that denote the immaterial aspect of the human being that continues after death. The analysis of the texts reveals that the word anima occurs about 80 times, spiritus – 20, and mens only three times. These three words stand for what is usually expressed by the word “soul,” that is, the spiritual, immaterial aspect of the human being. Conclusions are presented gradually as the analytical compilation proceeds. Firstly, there is no semantic difference between anima and spiritus; although the word animus which is close to the three words discussed in this paper does not occur in this sense in the inscriptions. Secondly, both pagan and Christian inscriptions emphasize the dichotomy between anima or spiritus and corpus or caro (alternatively membra); some Christian inscriptions, pointing to this dichotomy, express belief in the resurrection. Thirdly, despite the difference in beliefs, Roman worshipers and Christians used very similar patterns of statements about the posthumous fate of the soul, for example, astra tenent animam, astra fovent animam, anima migravit ad astra or spiritus astra tenet, spiritus petit ad astra, mens caeli perget ad astra, which means that the Christian funerary language did not develop its distinct terminology for several centuries. The third section is a very brief summary of the study carried out.
Źródło:
Verbum Vitae; 2022, 40, 3; 675-690
1644-8561
2451-280X
Pojawia się w:
Verbum Vitae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
O ilości nierównoważnych metryk
On non-equivalent metrics on a uncountable set
Autorzy:
Zieliński, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/1791034.pdf
Data publikacji:
2018-06-01
Wydawca:
Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie
Tematy:
nonequivalent metrics
metrizability
metric spaces
Opis:
It is well known that there exist many metrics on a non-emptyset. In the case of $(X, \varrho)$ − a finite metric set, it can be easily shown that all the metrics on X are equivalent. This paper examines the number of non-equivalent metrics on uncountably infinite sets.
Źródło:
Annales Universitatis Paedagogicae Cracoviensis. Studia ad Didacticam Mathematicae Pertinentia; 2017, 9; 139-152
2080-9751
2450-341X
Pojawia się w:
Annales Universitatis Paedagogicae Cracoviensis. Studia ad Didacticam Mathematicae Pertinentia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tree-based control space structures for discrete metric sources in 3D meshing
Autorzy:
Głut, Barbara
Jurczyk, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/305686.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
control space
kd-trees
octree
anisotropic metric
mesh generation and adaptation
discrete metric sources
Opis:
This article compares the different variations of the octree and kd-tree structures used to create a control space based on a set of discrete metric point-sources. The control space thus created supervises the generation of the mesh providing efficient access to the required information on the desired shape and size of the mesh elements at each point of the discretized domain. Structures are compared in terms of computational and memory complexity as well as regarding the accuracy of the approximation of the set of discrete metric sources in the created control space structure.
Źródło:
Computer Science; 2019, 20 (4); 493-509
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On regularity estimates for mappings between embedded manifolds
Autorzy:
Ioffe, A.
Powiązania:
https://bibliotekanauki.pl/articles/970258.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
metric regularity
slope
locally coherent space
Opis:
We describe a class of metric spaces such that for set-valued mappings into such spaces it is possible to give a precise expression of regularity moduli in terms of slopes of DeGiorgi-Marino-Tosques. We also show that smooth manifolds in Banach spaces endowed with the induced metric belong to this class.
Źródło:
Control and Cybernetics; 2007, 36, 3; 659-668
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Statystyka w archeologii, czyli dlaczego nie trzeba bać się liczb
Statistics in archaeology. So why shouldn’t you be afraid of numbers?
Autorzy:
Rajpold, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/2053542.pdf
Data publikacji:
2022-06-03
Wydawca:
Uniwersytet Rzeszowski. Instytut Archeologii Uniwersytetu Rzeszowskiego. Muzeum Okręgowe w Rzeszowie
Tematy:
statistical analysis
archaeology
mathematics
metric data
Opis:
The great motorway research and construction investments have brought and are still bringing a huge set of new data. In 2019 alone, one million new archaeological artefacts were sourced. Therefore, there is a problem of systematic and comprehensive development of the obtained sources, in which statistics may be helpful. The article introduces selected statistical methods and shows examples of their use. It focuses on their usefulness in archaeological research, and thus it may become a boost for their wider use in the development of archaeological sources.
Źródło:
Materiały i Sprawozdania Rzeszowskiego Ośrodka Archeologicznego; 2021, 42; 113-139
0137-5725
Pojawia się w:
Materiały i Sprawozdania Rzeszowskiego Ośrodka Archeologicznego
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The metric dimension of circulant graphs and their Cartesian products
Autorzy:
Chau, K.
Gosselin, S.
Powiązania:
https://bibliotekanauki.pl/articles/255804.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
metric dimension
circulant graph
Cartesian product
Opis:
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between vertices x,y ∈V(G). A subset W ⊆V(G) is called a resolving set for G if for every pair ol distinct vertices x, y ∈ (G), there is w ∈W such that d(x,w) ≠d(y,w). The minimum cardinality of a resolving set for G is called the metric dimension of G, denoted by β (G). The circulant graph Cn(l, 2,... , t) has vertex set {v0, v1 …, vn-1} and edges [formula] where 0 ≤ i ≤ n — 1 and 1 ≤j ≤ t and the indices are taken modulo [formula]. In this paper we determine the exact metric dimension olthe circulant graphs Cn(l, 2,... , t). extending previous results due to Borchert and Gosselin (2013), Grigorious et al. (2014), and Vetrik (2016). In particular, we show that [formula] for large enough n, which implies that the metric dimension ol these circulants is completely determined by the congruence class ol n modulo 2t. We determine the exact value of β Cn (l, 2,.. . , i)) for n ≡ 2 mod 2t and n =≡ (t + 1) mod 2t and we give better bounds on the metric dimension ol these circulants for n ≡ 0 mod 2t and n ≡ 1 mod 2t. In addition, we bound the metric dimension ol Cartesian products ol circulant graphs.
Źródło:
Opuscula Mathematica; 2017, 37, 4; 509-534
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł

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