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: Temat


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ł:
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ł:
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ł:
Proper Rainbow Connection Number of Graphs
Autorzy:
Doan, Trung Duy
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/32222687.pdf
Data publikacji:
2021-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge-colouring
rainbow connection number
proper rainbow connection number
Opis:
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path. The minimum k for which there exists such an edge-colouring is the rainbow connection number rc(G) of G. Recently, Bau et al. [Rainbow connectivity in some Cayley graphs, Australas. J. Combin. 71 (2018) 381–393] introduced this concept with the additional requirement that the edge-colouring must be proper. The proper rainbow connection number of G, denoted by prc(G), is the minimum number of colours needed in order to make it properly rainbow connected. Obviously, prc(G) ≥ max{rc(G), χ′(G)}. In this paper we first prove an improved upper bound prc(G) ≤ n for every connected graph G of order n ≥ 3. Next we show that the difference prc(G) – max{rc(G), χ′(G)} can be arbitrarily large. Finally, we present several sufficient conditions for graph classes satisfying prc(G) = χ′(G).
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 3; 809-826
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
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ł:
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ł:
On the existence of connections with a prescribed skew-symmetric Ricci tensor
Autorzy:
Kurek, Jan
Mikulski, Włodzimierz
Powiązania:
https://bibliotekanauki.pl/articles/747079.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
Linear connection
Ricci tensor
Opis:
We study the so-called inverse problem. Namely, given a prescribed skew-symmetric Ricci tensor we find (locally) a respective linear connection.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2018, 72, 2
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
International standardization in the design of “Shore To Ship” - power supply systems of ships in port
Autorzy:
Tarnapowicz, D.
German-Galkin, S.
Powiązania:
https://bibliotekanauki.pl/articles/410120.pdf
Data publikacji:
2018
Wydawca:
STE GROUP
Tematy:
Shore to Ship system
High Voltage Shore Connection
Low Voltage Shore Connection
Opis:
The decisive source of air pollution emissions in ports is the berthed ships. This is primarily caused by the work of ship’s autonomous generator sets. One way of reducing the air pollution emissions in ports is the supply of ships from electricity inland system. The main problem connected with the power connection of ships to the inland network is caused by different values of levels and frequencies of voltages in these networks (in various countries) in relation to different values of levels and frequencies of voltages present in the ship’s network. It is also important that the source power can range from a few hundred kW up to several MW. In order to realize a universal „Shore to Ship” system that allows the connection of ships to the electricity inland network, the international standardization is necessary. This article presents the current recommendations, standards and regulations for the design of „Shore to Ship” systems.
Źródło:
Management Systems in Production Engineering; 2018, 1 (26); 9-13
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The constructions of general connections on the fibred product of q copies of the first jet prolongation
Autorzy:
Plaszczyk, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/747059.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
General connection
classical linear connection
first jet prolongation
bundle functor
natural operator
Opis:
We describe all natural operators \(A\) transforming general connections \(\Gamma\) on fibred manifolds \(Y \rightarrow M\) and torsion-free classical linear connections \(\Lambda\) on \(M\) into general connections \(A(\Gamma,\Lambda)\) on the fibred product \(J^{<q>}Y \rightarrow M\) of \(q\) copies of the first jet prolongation \(J^{1}Y \rightarrow M\).
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2018, 72, 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ł:
Call and connections times in ASON/GMPLS architecture
Autorzy:
Kaczmarek, S.
Młynarczuk, M.
Zieńko, P.
Powiązania:
https://bibliotekanauki.pl/articles/309299.pdf
Data publikacji:
2013
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
ASON
call control
call time
connection control
connection time
GMPLS
simulation model
Opis:
It is assumed that demands of information society could be satisfied by architecture ASON/GMPLS comprehended as Automatically Switched Optical Network (ASON) with Generalized Multi-Protocol Label Switching (GMPLS) protocols. Introduction this solution must be preceded by performance evaluation to guarantee society expectations. Call and connections times are in ASON/GMPLS architecture important for real-time applications. Practical realization is expensive and simulations models are necessary to examine standardized propositions. This paper is devoted to the simulation results of ASON/GMPLS architecture control plane functions in OMNeT++ discrete event simulator. The authors make an effort to explore call/connection set-up times, connection release times in a single domain of ASON/GMPLS architecture.
Źródło:
Journal of Telecommunications and Information Technology; 2013, 3; 80-88
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Vertex-Rainbow Connection Number of Some Graph Operations
Autorzy:
Li, Hengzhe
Ma, Yingbin
Li, Xueliang
Powiązania:
https://bibliotekanauki.pl/articles/32083892.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
rainbow connection number
vertex-rainbow connection number
Cartesian product
lexicographic product
line graph
Opis:
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same. An edge-colored (respectively vertex-colored) graph G is rainbow connected (respectively vertex-rainbow connected) if every two distinct vertices are connected by a rainbow (respectively vertex-rainbow) path. The rainbow connection number rc(G) (respectively vertex-rainbow connection number rvc(G)) of G is the smallest number of colors that are needed in order to make G rainbow connected (respectively vertex-rainbow connected). In this paper, we show that for a connected graph G and any edge e = xy ∈ E(G), rvc(G) ≤ rvc(G − e) ≤ rvc(G) + dG−e(x, y) − 1 if G − e is connected. For any two connected, non-trivial graphs G and H, rad(G□H)−1 ≤ rvc(G□H) ≤ 2rad(G□H), where G□H is the Cartesian product of G and H. For any two non-trivial graphs G and H such that G is connected, rvc(G ◦ H) = 1 if diam(G ◦ H) ≤ 2, rad(G) − 1 ≤ rvc(G ◦ H) ≤ 2rad(G) if diam(G) > 2, where G ◦ H is the lexicographic product of G and H. For the line graph L(G) of a graph G we show that rvc(L(G)) ≤ rc(G), which is the first known nontrivial inequality between the rainbow connection number and vertex-rainbow connection number. Moreover, the bounds reported are tight or tight up to additive constants.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 513-530
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Panax quinquefolium hairy root extracts and their effect in connections with antibiotics against pathogenic bacteria – preliminary study
Autorzy:
Kochan, Ewa
Powiązania:
https://bibliotekanauki.pl/articles/763893.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
ginseng, ginsenosides, connection with antibiotic
Opis:
 The aim of the present study was to determine the level of ginsenosides in extracts from hairy root A, B, G clones of Panax quinquefolium and their action with antibiotics against clinical bacterial isolates. The content of ginsenosides (the key biologically active compounds) were determined in tested extracts using HPLC. The activity of extracts with antibiotics was established by micro-dilution broth method. Total triterpene saponin content was 14.68, 14.32 and 10.07 mgg-1 d.w. for root culture clones B, A and G, respectively. Our research indicates that the addition of extracts mainly from B and G clone hairy root cultures to antibiotics allow to reduce the ampicillin and tetracycline effective concentration respectively against Enterococcus faecalis and both Escherichia coli and Acintobacter baumannii.
Źródło:
Annales Universitatis Mariae Curie-Sklodowska, sectio C – Biologia; 2018, 73, 1
2083-3563
0066-2232
Pojawia się w:
Annales Universitatis Mariae Curie-Sklodowska, sectio C – Biologia
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ł:
The natural operators of general affine connections into general affine connections
Autorzy:
Kurek, Jan
Mikulski, Włodzimierz M.
Powiązania:
https://bibliotekanauki.pl/articles/747278.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
General affine connection
natural operator
Opis:
We reduce the problem of describing all \(\mathcal{M} f_m\)-natural operators  transforming general affine connections on \(m\)-manifolds into general affine ones to the known description of all \(GL(\mathbf{R}^m)\)-invariant maps \(\mathbf{R}^{m*}\otimes \mathbf{R}^m\to \otimes^k\mathbf{R}^{m*}\otimes\otimes ^k\mathbf{R}^m\) for \(k=1,3\).
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2017, 71, 1
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – 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