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ę "connection" wg kryterium: Wszystkie pola


Tytuł:
Affine analogues of the Sasaki-Shchepetilov connection
Autorzy:
Robaszewska, Maria
Powiązania:
https://bibliotekanauki.pl/articles/744685.pdf
Data publikacji:
2016-12-01
Wydawca:
Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie
Tematy:
connection on a vector bundle
associated vector bundle
connection form
locally symmetric connection
Opis:
For two-dimensional manifold M with locally symmetric connection ∇ and with ∇-parallel volume element vol one can construct a flat connection on the vector bundle TM ⊕ E, where E is a trivial bundle. The metrizable case, when M is a Riemannian manifold of constant curvature, together with its higher dimension generalizations, was studied by A.V. Shchepetilov [J. Phys. A: 36 (2003), 3893-3898]. This paper deals with the case of non-metrizable locally symmetric connection. Two flat connections on TM ⊕ (ℝ × M) and two on TM ⊕ (ℝ2 × M) are constructed. It is shown that two of those connections – one from each pair – may be identified with the standard flat connection in ℝN, after suitable local affine embedding of (M,∇) into ℝN.
Źródło:
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica; 2016, 15
2300-133X
Pojawia się w:
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Сфера поширення напівпредикативного синтаксичного зв’язку
Autorzy:
Kobczenko, Natalia
Powiązania:
https://bibliotekanauki.pl/articles/1789783.pdf
Data publikacji:
2018-04-18
Wydawca:
Uniwersytet Warszawski. Wydawnictwa Uniwersytetu Warszawskiego
Tematy:
semi-predicative syntactic connection
dual-syntactic connection
determinative subordinate syntactic connection
syncretic type of syntactic connection
unattached phrase
depictive predicate (predicative attribute/ duplexes)
Opis:
The paper deals with the analysis of syntactic connection between unattached phrases (with characterizing semantics, but without detailing semantics) and the structure of the basic sentence. The author proves that various structural-semantic types of unattached phrases have diff erent grammatical ways of connection with the basic sentence. The semipredicative syntactic connection occurs between an unattached component of properlyattribute semantics and any substantive of the basic sentence. Unattached adverbial modifiers and also unattached attributes of attribute-adverbial semantics and unattached appositions of characterizing-adverbial semantics join the predicative centre of the basic sentence with the determinative subordinate syntactic connection. And the syntactic connection in sentences with an unattached adjective component of dual-predicate (predicative attribute, duplexes) is a transitional between unitary and dual types.
Źródło:
Studia Ucrainica Varsoviensia; 2018, 6; 83-97
2299-7237
Pojawia się w:
Studia Ucrainica Varsoviensia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Models of n-th order linear time – varying systems
Autorzy:
Piwowar, A.
Walczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/141111.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
LTV
parametric section
LTV connection
parallel connection
cascade connection
Opis:
Effective algorithms of constructing models of generalized parametric sections of the n-th order consisting of cascade and parallel elementary LTV section connections are presented in this paper. Moreover, the methods of impulse responses determination have been shown.
Źródło:
Archives of Electrical Engineering; 2015, 64, 2; 315-331
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On canonical constructions on connections
Autorzy:
Kurek, Jan
Mikulski, Włodzimierz
Powiązania:
https://bibliotekanauki.pl/articles/746988.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
General connection
projectable general connection
general vertical connection
2-fibred manifold
natural operator
Opis:
We study  how a projectable general connection \(\Gamma\) in a 2-fibred manifold \(Y^2\to Y^1\to Y^0\)  and a general vertical connection \(\Theta\) in \(Y^2\to Y^1\to Y^0\) induce a general connection \(A(\Gamma,\Theta)\) in \(Y^2\to Y^1\).
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2016, 70, 1
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cartan connection of transversally Finsler foliation
Autorzy:
Miernowski, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/747272.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
Finsler metric
normal bundle
Cartan connection
Opis:
The purpose of this paper is to define transversal Cartan connectionof Finsler foliation and to prove its existence and uniqueness.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2012, 66, 1
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the rainbow connection of Cartesian products and their subgraphs
Autorzy:
Klavžar, Sandi
Mekiš, Gašper
Powiązania:
https://bibliotekanauki.pl/articles/743307.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
rainbow connection
strong rainbow connection
Cartesian product of graphs
isometric subgraph
hypercube
Opis:
Rainbow connection number of Cartesian products and their subgraphs are considered. Previously known bounds are compared and non-existence of such bounds for subgraphs of products are discussed. It is shown that the rainbow connection number of an isometric subgraph of a hypercube is bounded above by the rainbow connection number of the hypercube. Isometric subgraphs of hypercubes with the rainbow connection number as small as possible compared to the rainbow connection of the hypercube are constructed. The concept of c-strong rainbow connected coloring is introduced. In particular, it is proved that the so-called Θ-coloring of an isometric subgraph of a hypercube is its unique optimal c-strong rainbow connected coloring.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 783-793
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graphs with rainbow connection number two
Autorzy:
Kemnitz, Arnfried
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/743883.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge colouring
rainbow colouring
rainbow connection
Opis:
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. In this paper we prove that rc(G) = 2 for every connected graph G of order n and size m, where $\binom{n-1}{2} + 1 ≤ m ≤ \binom{n}{2} - 1$. We also characterize graphs with rainbow connection number two and large clique number.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 2; 313-320
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Connection matrix theory for discrete dynamical systems
Autorzy:
Bartłomiejczyk, Piotr
Dzedzej, Zdzisław
Powiązania:
https://bibliotekanauki.pl/articles/1341654.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Conley index
Morse decomposition
connection matrix
Opis:
In [C] and [F1] the connection matrix theory for Morse decomposition is developed in the case of continuous dynamical systems. Our purpose is to study the case of discrete time dynamical systems. The connection matrices are matrices between the homology indices of the sets in the Morse decomposition. They provide information about the structure of the Morse decomposition; in particular, they give an algebraic condition for the existence of connecting orbit set between different Morse sets.
Źródło:
Banach Center Publications; 1999, 47, 1; 67-78
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Connection matrix pairs
Autorzy:
Richeson, David
Powiązania:
https://bibliotekanauki.pl/articles/1341687.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Conley index
multi-valued maps
connection matrix pairs
Morse decomposition
index filtrations
Opis:
We discuss the ideas of Morse decompositions and index filtrations for isolated invariant sets for both single-valued and multi-valued maps. We introduce the definition of connection matrix pairs and present the theorem of their existence. Connection matrix pair theory for multi-valued maps is used to show that connection matrix pairs obey the continuation property. We conclude by addressing applications to numerical analysis. This paper is primarily an overview of the papers [R1] and [R2].
Źródło:
Banach Center Publications; 1999, 47, 1; 219-232
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
MEA’s Network Connection Regulation
Autorzy:
Thasananutariya, T.
Powiązania:
https://bibliotekanauki.pl/articles/262811.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
Źródło:
Electrical Power Quality and Utilisation. Journal; 2009, 15, 2; 41
1896-4672
Pojawia się w:
Electrical Power Quality and Utilisation. Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fatigue testing of a bolted connection for buried flexible steel culverts
Autorzy:
Leander, J.
Wadi, A.
Pettersson, L.
Powiązania:
https://bibliotekanauki.pl/articles/383652.pdf
Data publikacji:
2017
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
fatigue
testing
bolted connection
culvert
Opis:
A fatigue assessment of steel structures based on the safe life approach requires a detail category representing the fatigue strength. For flexible culverts there are no matching details in the governing regulations. In this paper the testing and evaluation of the fatigue strength of a standardized bolted connection for steel culverts are presented. A test rig was designed to mimic the in-service conditions with a combination of bending moment and axial force. A total of ten specimens was tested to failure. The failure was governed cracks initiating at the indentations from the bolt heads and propagated towards the nearest edge. From the test results, an S-N curve has been derived suggesting a characteristic fatigue strength of 124 MPa at 2 million cycles and a slope of 5 in log-log scale.
Źródło:
Archiwum Instytutu Inżynierii Lądowej; 2017, 23; 153-162
1897-4007
Pojawia się w:
Archiwum Instytutu Inżynierii Lądowej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On naturality of some construction of connections
Autorzy:
Kurek, Jan
Mikulski, Włodzimierz
Powiązania:
https://bibliotekanauki.pl/articles/1395922.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
General connection
classical linear connection
fibred manifold
bundle functor
natural operator
Opis:
Let \(F\) be a bundle functor on the category of all fibred manifolds and fibred maps. Let \(\Gamma\) be a general connection in a fibred manifold \(\mathrm{pr}:Y\to M\) and \(\nabla\) be a classical linear connection on \(M\). We prove that the  well-known general connection \(\mathcal{F}(\Gamma,\nabla)\) in \(FY\to M\) is canonical with respect to fibred maps and with respect to natural transformations of bundle functors.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2020, 74, 1
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Logical Connection Argument from the Perspective of Exploratory Behaviors
Autorzy:
Michalska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/451459.pdf
Data publikacji:
2019-04-30
Wydawca:
Uniwersytet Warszawski. Wydział Filozofii
Tematy:
Logical Connection Argument
meaning
content
means of expression
goal-directed action
performativity
Opis:
In the most general terms, the Logical Connection Argument (LCA) states that theory and practice are two inseparable aspects of the same thing. Every action (or practice), linguistic or otherwise, is an indivisible unity of content and the means by which it is expressed. Alternatively, we may talk of the inseparability of content and form, meaning and act of expression, goal and method or means of its realization, and so forth. The argument was meant to prove that intentions cannot be treated as causes in social scientific explanation, but it did it at the cost of making any meta-analysis, and hence, critique, highly problematic. My position is that the LCA is indeed logical, and hence irrefutable. Nonetheless, we can distinguish between “raw” and “refined” versions of the argument. The refined version maintains that while ultimately and ideally, the content and means of expression presuppose one another in the sense that a content is inconceivable without a form, and vice versa, in reality there is never a perfect match between aims and methods. In typical circumstances, we do not have a precise sense of what we are doing; the meaning of our actions is gradually discovered in the course of exploratory behaviors, of which (immanent) critique is an indispensable part. In this contribution, I venture to examine the problem from a neuropsychological perspective with the view to showing in exactly what sense and to what extent explorative behaviors and associated motivations preside over other activities. I argue that content is always underdetermined with respect to its form (and vice versa), and hence the alleged internal connection between them is not a given, but rather amounts to a regulative principle which motivates mutual adjustments.
Źródło:
Eidos. A Journal for Philosophy of Culture; 2019, 3, 1(7); 78-91
2544-302X
Pojawia się w:
Eidos. A Journal for Philosophy of Culture
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Anycasting in connection-oriented computer networks: Models, algorithms and results
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/907768.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć połączeniowa
optymalizacja
MPLS
odporność
anycasting
connection-oriented networks
optimization
survivability
Opis:
Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is growing concurrently with the popularity of electronic music, movies, and other content required by Internet users. In this work we focus on the optimization of anycast flows in connection-oriented networks. We formulate a model of anycast connections and next propose a heuristic algorithm based on the Lagrangean relaxation aimed to optimize jointly routes for anycast and unicast connections. Results of numerical experiments are presented and evaluated. Finally, we analyze briefly problems related to anycasting in dynamic routing and multi-layer networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 207-220
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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