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


Tytuł:
Diagnosis of hereditary angioedema
Diagnostyka wrodzonego obrzęku naczynioruchowego
Autorzy:
Kőhalmi, Kinga Viktória
Cervenak, László
Farkas, Henriette
Powiązania:
https://bibliotekanauki.pl/articles/1034431.pdf
Data publikacji:
2018
Wydawca:
Oficyna Wydawnicza Mediton
Tematy:
complement testing
Opis:
Hereditary angioedema (HAE) is a rare disorder characterized by acute episodes of edema formation in the subcutis and/or the submucosa. The clinical picture of the disease resembles that of histamine-mediated angioedema, nevertheless bradykinin release is involved in the pathomechanism of HAE. The diagnosis of HAE can be established from the clinical manifestations, the family history, as well as the findings of complement and genetic tests. Currently, the six types of hereditary angioedema are distinguished: types I and II of hereditary angioedema with C1-inhibitor (C1-INH) deficiency (C1-INH-HAE) and the following types of hereditary angioedema with normal C1-INH levels: hereditary angioedema caused by a mutation in the Factor XII gene (FXII-HAE), the angiopoietin-1 gene (ANGPT1-HAE), and the plasminogen gene (PLG-HAE) – and hereditary angioedema of unknown origin (U-HAE). Current options for the laboratory diagnosis of angioedemas include means for identifying C1-INH-HAE, FXII-HAE, ANGPT1-HAE, PLG-HAE and acquired angioedema with C1-INH deficiency (C1-INH-AAE). No laboratory method is available currently for diagnosing the other types of angioedemas such as idiopathic histaminergic acquired angioedema (IH-AAE), idiopathic non-histaminergic acquired angioedema (InH-AAE), acquired angioedema related to angiotensin-converting enzyme inhibitor (ACEI-AAE), and U-HAE. These disease types can be identified only by indirect methods, i.e. by exploring medical and family history, observing the clinical manifestations and the therapeutic response, as well as by excluding the presence of C1-INH deficiency, FXII-HAE, ANGPT1-HAE, and PLG-HAE.
Źródło:
Alergia Astma Immunologia - przegląd kliniczny; 2018, 23, 4; 168-174
1427-3101
Pojawia się w:
Alergia Astma Immunologia - przegląd kliniczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Protein C-mannosylation: Facts and questions.
Autorzy:
Furmanek, Aleksandra
Hofsteenge, Jan
Powiązania:
https://bibliotekanauki.pl/articles/1044326.pdf
Data publikacji:
2000
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
RNase
complement
C-mannosylation
Opis:
Among the posttranslational modifications of proteins, glycosylation is probably the most abundant one. Two main types of protein glycosylation have been known for several years, namely N-glycosylation and O-glycosylation. Their biochemical properties, structure and biosynthesis, have been described extensively. Their biological functions are also known for a number of proteins, although in many cases the function remains speculative despite continuous efforts. A few years ago, a new type of protein glycosylation was found, which is different from the above-mentioned ones. It was called C-glycosylation, since the sugar is linked to the protein through a carbon-carbon bond. This article reviews the biochemistry of C-glycosylation, the biosynthetic pathway and structural requirements. Possible biological functions of this modification are also discussed.
Źródło:
Acta Biochimica Polonica; 2000, 47, 3; 781-789
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Expansivergänzungen und Verbklassen: Eine inter- und intralinguale Annäherung
Expansion complement and verb classes: An inter- and intralingual approach
Autorzy:
Meliss, Meike
Powiązania:
https://bibliotekanauki.pl/articles/1287741.pdf
Data publikacji:
2018-12-20
Wydawca:
Uniwersytet Gdański. Wydawnictwo Uniwersytetu Gdańskiego
Tematy:
Valenzgrammatik
Expansivergänzung
Dilativkomplement
Maßverben
: valency grammar
expansion complement
dilative complement
dimensional verbs.
Opis:
Ausgehend von der engelschen Ergänzungstypologie soll in dem Beitrag die Leistung der Expansivergänzung für valenztheoretisch fundierte Verbanalysen in Verbindung mit bestimmten Verbsubklassen genauer untersucht werden. Eine ausführliche Darstellung der Begriffsgeschichte und der Abgrenzungsproblematik zeigt die Notwendigkeit auf, die semantischen, morpho-syntaktischen und funktionalen Kriterien zur Begriffsbestimmung für inter- und intralinguale Studien integrativ zu erfassen.
Based on the supplementation typology following the approach of Engel, the contribution of the “expansive complement” for valency theory-based verb analyzes in connection with certain verb subclasses will be examined in more detail. A detailed description of the conceptual history and the delimitation problems points to the need of integration of the semantic, morpho-syntactically and functional criteria for inter- and intralingual studies.
Źródło:
Studia Germanica Gedanensia; 2018, 39; 35-53
1230-6045
Pojawia się w:
Studia Germanica Gedanensia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On graphs G for which both g and G̅ are claw-free
Autorzy:
Fujita, Shinya
Powiązania:
https://bibliotekanauki.pl/articles/744362.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
claw-free
complement
maximum degree
Opis:
Let G be a graph with |V(G)| ≥ 10. We prove that if both G and G̅ are claw-free, then min{Δ(G), Δ(G̅)} ≤ 2. As a generalization of this result in the case where |V(G)| is sufficiently large, we also prove that if both G and G̅ are $K_{1,t}$-free, then min{Δ(G),Δ(G̅)} ≤ r(t- 1,t)-1 where r(t-1,t) is the Ramsey number.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 267-272
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Trees as Star Complements in Regular Graphs
Autorzy:
Rowlinson, Peter
Powiązania:
https://bibliotekanauki.pl/articles/31562766.pdf
Data publikacji:
2020-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
eigenvalue
regular graph
star complement
tree
Opis:
Let G be a connected r-regular graph (r > 3) of order n with a tree of order t as a star complement for an eigenvalue µ ∉ {−1, 0}. It is shown that n ≤ 1/2 (r + 1)t − 2. Equality holds when G is the complement of the Clebsch graph (with µ = 1, r = 5, t = 6, n = 16).
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 2; 621-636
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on periodicity of the 2-distance operator
Autorzy:
Zelinka, Bohdan
Powiązania:
https://bibliotekanauki.pl/articles/743805.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
2-distance operator
complement of a graph
Opis:
The paper solves one problem by E. Prisner concerning the 2-distance operator T₂. This is an operator on the class $C_f$ of all finite undirected graphs. If G is a graph from $C_f$, then T₂(G) is the graph with the same vertex set as G in which two vertices are adjacent if and only if their distance in G is 2. E. Prisner asks whether the periodicity ≥ 3 is possible for T₂. In this paper an affirmative answer is given. A result concerning the periodicity 2 is added.
Źródło:
Discussiones Mathematicae Graph Theory; 2000, 20, 2; 267-269
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Restrained Domination in Self-Complementary Graphs
Autorzy:
Desormeaux, Wyatt J.
Haynes, Teresa W.
Henning, Michael A.
Powiązania:
https://bibliotekanauki.pl/articles/32083901.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
complement
restrained domination
self-complementary graph
Opis:
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S. The restrained domination number of a graph G is the minimum cardinality of a restrained dominating set of G. In this paper, we study restrained domination in self-complementary graphs. In particular, we characterize the self-complementary graphs having equal domination and restrained domination numbers.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 633-645
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterization of knot complements in the n-sphere
Autorzy:
Liem, Vo-Thanh
Venema, Gerard
Powiązania:
https://bibliotekanauki.pl/articles/1208358.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
knot
n-sphere
complement
homotopy groups of end
Opis:
Knot complements in the n-sphere are characterized. A connected open subset W of $S^n$ is homeomorphic with the complement of a locally flat (n-2)-sphere in $S^n$, n ≥ 4, if and only if the first homology group of W is infinite cyclic, W has one end, and the homotopy groups of the end of W are isomorphic to those of $S^1$ in dimensions less than n/2. This result generalizes earlier theorems of Daverman, Liem, and Liem and Venema.
Źródło:
Fundamenta Mathematicae; 1995, 147, 2; 189-196
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On 2-rainbow domination number of functigraph and its complement
Autorzy:
Shaminezhad, Athena
Vatandoost, Ebrahim
Powiązania:
https://bibliotekanauki.pl/articles/255140.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
2-rainbow domination number
functigraph
complement
cubic graph
Opis:
Let G be a graph and ƒ : V(G) → P({1, 2}) be a function where for every vertex v ∈ V(G), with ƒ (v) = ∅ we have [formula]. Then ƒ is a 2-rainbow dominating function or a 2RDF of G. The weight of ƒ is[formula]. The minimum weight of all 2-rainbow dominating functions is 2-rainbow domination number of G, denoted by [formula]. Let G 1 and G2 be two copies of a graph G with disjoint vertex sets V(G 1) and V(G2), and let σ be a function from V(G 1) to V(G2). We define the functigraph C(G,σ) to be the graph that has the vertex set V(C(G, ,σ)) = V(G 1) U V(G2), and the edge set [formula]. In this paper, 2-rainbow domination number of the functigraph of C(G, ,σ) and its complement are investigated. We obtain a general bound for [formula] and we show that this bound is sharp.
Źródło:
Opuscula Mathematica; 2020, 40, 5; 617-627
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The least eigenvalue of the graphs whose complements are connected and have pendent paths
Autorzy:
Wang, C.
Yu, G.
Sun, W.
Cao, J.
Powiązania:
https://bibliotekanauki.pl/articles/91753.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
graph
complement
pendent path
adjacency matrix
least eigenvalue
Opis:
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph. Let Gn be the set of the graphs of order n, whose complements are connected and have pendent paths. This paper investigates the least eigenvalue of the graphs and characterizes the unique graph which has the minimum least eigenvalue in Gn.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 303-308
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Least Eigenvalue of Graphs whose Complements Are Unicyclic
Autorzy:
Wang, Yi
Fan, Yi-Zheng
Li, Xiao-Xin
Zhang, Fei-Fei
Powiązania:
https://bibliotekanauki.pl/articles/31339491.pdf
Data publikacji:
2015-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
unicyclic graph
complement
adjacency matrix
least eigen- value
Opis:
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order $n$ and size $m$ in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size $ n/2 $). In this paper we discuss the minimizing graphs of a special class of graphs of order $n$ whose complements are connected and contains exactly one cycle (namely the class $ \mathcal{U}_n^c $ of graphs whose complements are unicyclic), and characterize the unique minimizing graph in $ \mathcal{U}_n^c $ when $ n \ge 20 $.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 249-260
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Korygenda w Chronologii polskiej
Autorzy:
Jelonek, Eugeniusz
Powiązania:
https://bibliotekanauki.pl/articles/1047783.pdf
Data publikacji:
1973
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II
Tematy:
kalendarz
Kodeks Gertrudy
Martyrologium Romanum
uzupełnienia
calendar
complement
Źródło:
Archiwa, Biblioteki i Muzea Kościelne; 1973, 26; 284-286
0518-3766
2545-3491
Pojawia się w:
Archiwa, Biblioteki i Muzea Kościelne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Similarity measures for Atanassov’s intuitionistic fuzzy sets : some dilemmas and challenges
Autorzy:
Szmidt, Eulalia
Kacprzyk, Janusz
Bujnowski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/2183493.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
similarity measures
Atanassov’s intuitionistic fuzzy sets
distances
complement
Opis:
We discuss some aspects of similarity measures in the context of Atanassov’s intuitionistic fuzzy sets (IFSs, for short). IFSs, proposed in 1983, are a relatively new tool for the modeling and simulation and, because of their construction, present us with new challenges as far the similarity measures are concerned. Specifically, we claim that the distances alone are not a proper measure of similarity for the IFSs. We stress the role of a lack of knowledge concerning elements (options, decisions, etc.) and point out the role of the opposing (complementing) elements. We also pay attention to the fact that it is not justified to talk about similarity when one has not enough knowledge about the compared objects/elements. Some novel measures of similarity are presented.
Źródło:
Control and Cybernetics; 2022, 51, 2; 249--266
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Notes on topological indices of graph and its complement
Autorzy:
Madaras, T.
Mockovciakova, M.
Powiązania:
https://bibliotekanauki.pl/articles/254698.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Wiener index
Zagreb index
Randic index
bipartite graph
bipartite complement
Opis:
In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.
Źródło:
Opuscula Mathematica; 2013, 33, 1; 107-115
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Domination Parameters of a Graph and its Complement
Autorzy:
Desormeaux, Wyatt J.
Haynes, Teresa W.
Henning, Michael A.
Powiązania:
https://bibliotekanauki.pl/articles/31342430.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
complement
total domination
connected domination
clique domination
restrained domination
Opis:
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 203-215
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
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