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

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-15 z 331
Tytuł:
Independent transversal domination in graphs
Autorzy:
Hamid, Ismail
Powiązania:
https://bibliotekanauki.pl/articles/743635.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
dominating set
independent set
independent transversal dominating set
Opis:
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by $γ_{it}(G)$. In this paper we begin an investigation of this parameter.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 1; 5-17
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the special context of independent sets
Autorzy:
Slezák, Vladimír
Powiązania:
https://bibliotekanauki.pl/articles/728756.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
context
complete lattice
join-independent and meet-independent sets
Opis:
In this paper the context of independent sets $J^{p}_{L}$ is assigned to the complete lattice (P(M),⊆) of all subsets of a non-empty set M. Some properties of this context, especially the irreducibility and the span, are investigated.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2001, 21, 1; 115-122
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Maximal k-independent sets in graphs
Autorzy:
Blidia, Mostafa
Chellali, Mustapha
Favaron, Odile
Meddah, Nacéra
Powiązania:
https://bibliotekanauki.pl/articles/743533.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
k-independent
cactus
Opis:
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree less than k. The minimum and maximum cardinalities of a maximal k-independent set are respectively denoted iₖ(G) and βₖ(G). We give some relations between βₖ(G) and $β_j(G)$ and between iₖ(G) and $i_j(G)$ for j ≠ k. We study two families of extremal graphs for the inequality i₂(G) ≤ i(G) + β(G). Finally we give an upper bound on i₂(G) and a lower bound when G is a cactus.
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 1; 151-163
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lattice-inadmissible incidence structures
Autorzy:
Machala, Frantisek
Slezák, Vladimír
Powiązania:
https://bibliotekanauki.pl/articles/729105.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
complete lattices
join-independent and meet-independent sets
incidence structures
Opis:
Join-independent and meet-independent sets in complete lattices were defined in [6]. According to [6], to each complete lattice (L,≤) and a cardinal number p one can assign (in a unique way) an incidence structure $J^{p}_{L}$ of independent sets of (L,≤). In this paper some lattice-inadmissible incidence structures are founded, i.e. such incidence structures that are not isomorphic to any incidence structure $J^{p}_{L}$.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2004, 24, 2; 199-209
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The hardness of the independence and matching clutter of a graph
Autorzy:
Hambardzumyan, S.
Mkrtchyan, V. V.
Musoyan, V. L.
Sargsyan, H.
Powiązania:
https://bibliotekanauki.pl/articles/952814.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
clutter
hardness
independent set
maximal independent set
matching
maximal matching
Opis:
A clutter (or antichain or Sperner family) L is a pair (V, E), where V is a finite set and E is a family of subsets of V none of which is a subset of another. Usually, the elements of V are called vertices of L, and the elements of E are called edges of L. A subset se of an edge e of a clutter is called recognizing for e, if se is not a subset of another edge. The hardness of an edge e of a clutter is the ratio of the size of e's smallest recognizing subset to the size of e. The hardness of a clutter is the maximum hardness of its edges. We study the hardness of clutters arising from independent sets and matchings of graphs.
Źródło:
Opuscula Mathematica; 2016, 36, 3; 375-397
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
Autorzy:
Paj, Tjaša
Špacapan, Simon
Powiązania:
https://bibliotekanauki.pl/articles/31339257.pdf
Data publikacji:
2015-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
direct product
independent set
Opis:
The direct product of graphs G = (V (G), E(G)) and H = (V (H), E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We prove that every maximum independent set in Pn×G, respectively Cm×G, is of the form (A×C)∪(B×D), where C and D are nonadjacent in G, and A∪B is the bipartition of Pn respectively Cm. We also give a characterization of maximum independent subsets of Pn × G for every even n and discuss the structure of maximum independent sets in T × G where T is a tree.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 4; 675-688
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Poczucie własnej skuteczności jako czynnik różnicujący samodzielne uczenie się studentów
The Feeling of self-Efficacy as a Factor Differentiating Students’ Independent Learning
Autorzy:
Rodek, Violetta
Powiązania:
https://bibliotekanauki.pl/articles/1075372.pdf
Data publikacji:
2020-12-29
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
self-efficacy
independent learning
Opis:
The article presents empirical and diagnostic research aiming to recognise how a generalised feeling of self-efficacy differentiates students’ independent learning. In the research, Generalized Self – Efficacy Scale (GSES) was applied (according to R. Schwarzer, M. Jeruzalem, in the Polish adaptation by Z. Juczyński) as well as a free-form interview, partially categorised. The study group was composed of 215 intentionally selected pedagogy students, following full-time and part-time courses. The variable adopted in the research differentiates the view of students’ independent learning, mainly in terms of the degree of involvement in their own learning. A high level of self-efficacy seems to be related to regularity, persistence in learning, consistency, the ability to focus on longer periods of learning, as well as the ability to plan and organize one’s own learning process. A generalized sense of self-efficacy, however, is not critical to how we understand the concept of learning, assigning value to it, and the used learning techniques.
Źródło:
Studia Edukacyjne; 2020, 58; 107-122
1233-6688
Pojawia się w:
Studia Edukacyjne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithmic Aspects of the Independent 2-Rainbow Domination Number and Independent Roman {2}-Domination Number
Autorzy:
Poureidi, Abolfazl
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/32312036.pdf
Data publikacji:
2022-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
independent 2-rainbow dominating function
independent Roman {2}-dominating function
algorithm
3-SAT
Opis:
A 2-rainbow dominating function (2RDF) of a graph $G$ is a function $g$ from the vertex set $V (G)$ to the family of all subsets of $ \{1, 2\}$ such that for each vertex $v$ with $g(v) =\emptyset $ we have \( \bigcup_{u∈N(v)} g(u) = \{ 1, 2 \} \). The minimum of $ g(V (G)) = \Sigma_{v \in V (G)} |g(v)| $ over all such functions is called the 2-rainbow domination number. A 2RDF $g$ of a graph $G$ is independent if no two vertices assigned non empty sets are adjacent. The independent 2-rainbow domination number is the minimum weight of an independent 2RDF of $G$. A Roman {2}-dominating function (R2DF) $ f : V \rightarrow \{ 0, 1, 2 \} $ of a graph $G = (V, E)$ has the property that for every vertex $ v \in V$ with $f(v) = 0$ either there is $ u \in N(v)$ with $f(u) = 2$ or there are $x, y \in N(v)$ with $f(x) = f(y) = 1$. The weight of $f$ is the sum $f(V) = \Sigma_{v \in V} f(v) $. An R2DF $f$ is called independent if no two vertices assigned non-zero values are adjacent. The independent Roman {2}-domination number is the minimum weight of an independent R2DF on $G$. We first show that the decision problem for computing the independent 2-rainbow (respectively, independent Roman {2}-domination) number is NP-complete even when restricted to planar graphs. Then, we give a linear algorithm that computes the independent 2-rainbow domination number as well as the independent Roman {2}-domination number of a given tree, answering problems posed in [M. Chellali and N. Jafari Rad, Independent 2-rainbow domination in graphs, J. Combin. Math. Combin. Comput. 94 (2015) 133–148] and [A. Rahmouni and M. Chellali, Independent Roman {2}-domination in graphs, Discrete Appl. Math. 236 (2018) 408–414]. Then, we give a linear algorithm that computes the independent 2-rainbow domination number of a given unicyclic graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 709-726
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Corrigendum to: Independent Transversal Domination in Graphs [Discuss. Math. Graph Theory 32 (2012) 5–17]
Autorzy:
Guzman-Garcia, Emma
Sánchez-López, Rocío
Powiązania:
https://bibliotekanauki.pl/articles/32316018.pdf
Data publikacji:
2022-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
independent
transversal
covering
matching
Opis:
In [Independent transversal domination in graphs, Discuss. Math. Graph Theory 32 (2012) 5–17], Hamid claims that if G is a connected bipartite graph with bipartition {X, Y } such that |X| ≤ |Y| and |X| = γ(G), then γit(G) = γ(G) + 1 if and only if every vertex x in X is adjacent to at least two pendant vertices. In this corrigendum, we give a counterexample for the sufficient condition of this sentence and we provide a right characterization. On the other hand, we show an example that disproves a construction which is given in the same paper.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 2; 601-611
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The well-covered dimension of products of graphs
Autorzy:
Birnbaum, Isaac
Kuneli, Megan
McDonald, Robyn
Urabe, Katherine
Vega, Oscar
Powiązania:
https://bibliotekanauki.pl/articles/30148720.pdf
Data publikacji:
2014-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
well-covered dimension
maximal independent sets
Opis:
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of $K_n × G$ is found, provided that $G$ has a largest greedy independent decomposition of length $c < n$. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 4; 811-827
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The war in Ukraine and the risk of low impact of Western sanctions imposed on Russia
Autorzy:
Pera, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/30119453.pdf
Data publikacji:
2023
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
sanction
effectiveness
dependent and independent variables
Opis:
In 2022, the Russian Federation became the most sanctioned country on Earth due to its full-scale invasion of Ukraine. The aim of this article is to measure the effectiveness of the economic sanctions adopted against the Russian Federation. The research main hypothesis was the following: the impact of Western sanctions imposed on Russia caused by the war in Ukraine remains low.  The research methodology was based on literature research and a linear regression model with two variables: dependent and independent. The results of the study lead to the following conclusions: 1.Sanctions adopted on Russia since 2014 and since 2022 have a direct negative impact on Russian trade (imports and exports in value) with the EU countries and the US. 2.Sanctions adopted against Russia since 2014 and 2022 have a direct negative impact on its trade (imports and exports in value) with the trade partners that have a neutral position concerning the war.
Źródło:
Central European Review of Economics & Finance; 2023, 44, 3; 99-124
2082-8500
2083-4314
Pojawia się w:
Central European Review of Economics & Finance
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
‘Formation of skills for independent life’ a training program for students preparing them to work with children at risk
Autorzy:
Petkova, Iskra
Powiązania:
https://bibliotekanauki.pl/articles/1818300.pdf
Data publikacji:
2019-12-10
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
students
training
children
skills
independent living
Opis:
A training program, ‘Formation of skills for independent life while working with children at risk’ is presented in the paper. It is intended for students of Social Activities, a field of study. Objectives and tasks are defined in the articles, and the basic knowledge and skills that students receive during the process of training under this program are specified. The content of the program is presented in two parts. Part one covers methodological principles applied in formation of skills for independent life. Three main stages to be mastered by the students in the training process within the stage of forming skills for independent life in children from risk groups are elaborated. Part two of the program covers five sections for mastering individual and group techniques of a practical and applied nature; its content is included in Trainer’s Manual.
Źródło:
Student Niepełnosprawny. Szkice i rozprawy; 2019, 19, 12; 71-76
1689-6416
Pojawia się w:
Student Niepełnosprawny. Szkice i rozprawy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Predictive factors for preeclampsia in pregnant women: a unvariate and multivariate logistic regression analysis
Autorzy:
Direkvand-Moghadam, Ashraf
Khosravi, Afra
Sayehmiri, Kourosh
Powiązania:
https://bibliotekanauki.pl/articles/1039684.pdf
Data publikacji:
2012
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
preeclampsia
risk factors
independent predictive factors
Opis:
Introduction: Several risk factors have been used to predict preeclampsia. The role of some risk factors as predictors associated with preeclampsia among Iranian women was analyzed in the present study using logistic regression. Materials and Methods: 610 women attending the obstetric ward of Mustafa hospital in Ilam were enrolled in this study. Demographic variables such as age, Body Mass Index (BMI), medical and obstetrics variables such as education, number of pregnancy, abortion and parity from May to September 2010 were analyzed. We used the unvaried and multiple logistic regression analyses to predict preeclampsia. Results: The history of preeclampsia, hypertension, and infertility showed to be good independent predicator variables for preeclampsia using multivariate logistic regression analysis (OR was 5.46, 2.34 and 3.07 respectively). Area Under the Receiver Operation Character (AUROC) was estimated to be 0.67 (95% CI 0.59-0.67, p<0.01) indicating the efficacy of the model for the prediction. Conclusion: The history of preeclampsia, hypertension and infertility predict preeclampsia with an increased odds ratio. Using such variables in regression analysis can help to diagnose preeclampsia beforehand and hence allow timely intervention.
Źródło:
Acta Biochimica Polonica; 2012, 59, 4; 673-677
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bohr Cluster Points of Sidon Sets
Autorzy:
Ramsey, L.
Powiązania:
https://bibliotekanauki.pl/articles/967106.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Bohr compactification
Sidon
quasi-independent
dissociate
Opis:
It is a long standing open problem whether Sidon subsets of ℤ can be dense in the Bohr compactification of ℤ ([LR]). Yitzhak Katznelson came closest to resolving the issue with a random process in which almost all sets were Sidon and and almost all sets failed to be dense in the Bohr compactification [K]. This note, which does not resolve this open problem, supplies additional evidence that the problem is delicate: it is proved here that if one has a Sidon set which clusters at even one member of ℤ, one can construct from it another Sidon set which is dense in the Bohr compactification of ℤ. A weaker result holds for quasi-independent and dissociate subsets of ℤ.
Źródło:
Colloquium Mathematicum; 1995, 68, 2; 285-290
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 331

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