displaying 1000 best results Help
Search results for: UPPER DOMINATION NUMBER
-
OTHER AND ILL-DEFINED SITES WITHIN RESPIRATORY SYSTEM AMD INTRATHORACIC ORGANS, Upper respiratory tract, NOS - Male, 70 - Tissue image [6280730027939311]
Open Research DataThis is the histopathological image of OTHER AND ILL-DEFINED SITES WITHIN RESPIRATORY SYSTEM AMD INTRATHORACIC ORGANS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
OTHER AND ILL-DEFINED SITES WITHIN RESPIRATORY SYSTEM AMD INTRATHORACIC ORGANS, Upper respiratory tract, NOS - Male, 70 - Tissue image [6280730027937241]
Open Research DataThis is the histopathological image of OTHER AND ILL-DEFINED SITES WITHIN RESPIRATORY SYSTEM AMD INTRATHORACIC ORGANS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Average number of hours worked per week by women aged 15 and older (Poland, Lithuania, Latvia, Estonia)
Open Research DataThe following dataset presents the average weekly number of hours worked by women in selected countries (Poland, Lithuania, Latvia, Estonia) in the years 1999 - 2016. The summary includes average weekly time worked in the main job, for women aged 15+. The estimates correspond to the declared amount. This includes part-time and full-time employment,...
-
The complete list of two-dimensional rotation-symmetric number-conserving septenary cellular automata
Open Research DataThis dataset contains a complete list of all 30144 two-dimensional rotation-symmetric number-con-serving cellular automata with the state set {0,1,2,3,4,5,6} based on adjacent cells only, i.e. with the von Neumann neighborhood. The detailed definitions and the method of enumerating are given in the paper:
-
Concurrent DNA Copy-Number Alterations and Mutations in Genes Related to Maintenance of Genome Stability in Uninvolved Mammary Glandular Tissue from Breast Cancer Patients
Publication -
<p>Potential effects of microbial air quality on the number of new cases of diabetes type 1 in children in two regions of Poland: a pilot study</p>
Publication -
Type A Behavior Pattern, Impulsiveness, Risk Propensity, and Empathy as Predictors of Dyspnea and Number of Infections in Men with Chronic Obstructive Pulmonary Disease: A Cross-Sectional Study
Publication -
The PF6−n(R)n−anions (R = CH3, C2H5;n= 0–6): the dependence of the electronic stability on the number of non-electronegative alkyl ligands
Publication -
Amplification of a single-locus variable-number direct-repeats with restriction fragment length polymorphism (DR-PCR/RFLP) for genetic typing of Acinetobacter baumannii strains
PublicationW celu poszukiwania nowych metod typowania genetycznego szczepów Acinetobacter baumannii przydatnych w szpitalnych badaniach epidemiologicznych przeprowadzono analizę dostępnych w banku genów sekwencji szczepów referencyjnych na obecność nowych motywów repetytywnych. Do badania polimorfizmu sekwencji repetytywnych w szczepach Acinetobacter sp. wykorzystano proste powtórzenia typu "direct repeat" (DR) zlokalizowane w jednym miejscu...
-
An analysis of the prevalence of thyroid autoantibodies: thyroid peroxidase antibodies (ATA) and thyroglobulin antibodies (ATG) in children with newly diagnosed diabetes mellitus type 1 during 2000–2004 in the Upper Silesia region, Poland
Publication -
Nuts 61 (voj. kujawsko-pomorskie). Number of accidents, injuries, seriously Injured and fatalities
Open Research DataThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. kujawsko-pomorskie (Poland, nuts 61)
-
Nuts 92 (mazowiecki regionalny region). Number of accidents, injuries, seriously Injured and fatalities
Open Research DataThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in mazowiecki regionalny region (Poland, nuts 92)
-
Nuts 62 (voj. warminsko-mazurskie). Number of accidents, injuries, seriously Injured and fatalities
Open Research DataThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. warminsko-mazurskie (Poland, nuts 62)
-
Nuts 91 (woj. warszawski - stoleczny). Number of accidents, injuries, seriously Injured and fatalities
Open Research DataThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in warszawski - stoleczny region (Poland, nuts 91)
-
Number of seasonal work permits issued in 2018
Open Research DataIn 2018, a total of 121,436 seasonal work permits were issued, the vast majority of which were granted to Ukrainian citizens. The following dataset shows the countries from which citizens have been issued the most permits.
-
Number of tax returns filed by taxpayers obtaining income taxed with a lump sum on income recorded according to sources of income 2011-2015
Open Research DataTaxpayers engaged in non-agricultural business activities benefiting from taxation in the form of a lump sum on recorded income, are required to have and store proofs of purchase of goods, keep a list of fixed assets and intangible assets, records of equipment and, separately for each tax year, a record of revenues. The obligation to keep records of...
-
Discount for children deducted from tax in selected EU countries, available according to number of children criterion (in EUR) in 2017
Open Research DataWhen analyzing the collected data, it should be indicated that the amount of tax preferences addressed to families with children varies widely and ranges from several hundred euro to even several tens of thousands of euro relief annually. The highest family allowances, calculated in absolute terms, are in Germany, and the lowest in Poland. All countries,...
-
Infinite chromatic games
PublicationIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Jakub Miler dr inż.
PeopleAcademic career: 2000: Master of Science - Gdansk University of Technology, Faculty of Electronics, Telecommunications and Informatics, thesis "Computer system for supporting risk management in a software engineering project", supervisor prof. Janusz Górski 2005: PhD - Gdansk University of Technology, Faculty of Electronics, Telecommunications and Informatics, thesis "A Method of Software Project Risk Identification and Analysis",...
-
Application of 2D RST method for spatial distribution of annual precipitation determination in the Upper Vistula Basin | Zastosowanie metody 2D RST do opracowania rozkładu przestrzennego rocznych sum opadów atmosferycznych w Dorzeczu Górnej Wisły
Publication -
Jerzy Kowalski dr hab. inż.
People -
Emphysema affects the number and appearance of solitary pulmonary nodules identified in chest low-dose computed tomography: a study on high risk lung cancer screenees recruited in Silesian District
Publication -
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Agnieszka Sikora, WCH, I st, 3 sem, 22/23 z
e-Learning CoursesPlease, buy Language Leader Upper-Intermediate from 2015, the 1st edition.
-
Number of active credit cards issued to individual customers (2017)
Open Research DataPolish banks serviced 6.04 million credit cards in 2017. This is a decrease by 121,000 year on year (comparing 2017 and 2016). The largest issuer of credit cards in the country is Bank PKO BP. In the third quarter of 2017, this institution had 847,000 credit cards. Bank Zachodni WBK is second (803,000) and CITI Handlowy is third (697,000).
-
On proper (1,2)‐dominating sets in graphs
PublicationIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Number of tax returns filed by taxpayers who obtain income taxed with a lump sum on income recorded according to sources of income (2011-2015)
Open Research DataTaxpayers engaged in non-agricultural business activities benefiting from taxation in the form of a lump sum on recorded income, are required to have and store proofs of purchase of goods, keep a list of fixed assets and intangible assets, records of equipment and, separately for each tax year, a record of revenues. The obligation to keep records of...
-
An Application Supporting Gastroesophageal Multichannel Intraluminal Impedance-pH Analysis
PublicationDue to a significant rise in the number of patients diagnosed with diseases of the upper gastrointestinal tract and the high cost of treatment, there is a need to further research on one of the most popular diagnostic tests used in this case – esophageal Multichannel Intraluminal Impedance and pH measurement. This may lead to finding new diagnostically relevant information, used to quicken and improve the diagnostic procedure....
-
Some variations of perfect graphs
PublicationWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 4 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 4 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 6 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 6 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 5 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 5 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 8 and homology groups with the sum of ranks less or equal to 10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 8 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 7 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 7 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Number of individual clients banks accounts - accounts in Polish zloty (2017)
Open Research DataBanks maintained a total of 31.7 million accounts (the so-called ROR - checking and savings account). Most of them are PKO BP, which currently maintains 7.1 million accounts. Bank Pekao is second (3.87 million personal accounts), and third is mBank (3.30 million)
-
Number of BPO/SSC centers in selected business service centers in Poland
Open Research DataMost BPO/SSC centers are located in Warsaw (238). The next positions are taken by Kraków (217 units), Wrocław (169), Tricity (146), Katowice (102) and Poznań (102).
-
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Magdalena Szuflita-Żurawska
PeopleHead of the Scientific and Technical Information Services at the Gdansk University of Technology Library and the Leader of the Open Science Competence Center. She is also a Plenipotentiary of the Rector of the Gdańsk University of Technology for open science. She is a PhD Candidate. Her main areas of research and interests include research productivity, motivation, management of HEs, Open Access, Open Research Data, information...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Common Independence in Graphs
PublicationAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Kacper Wereszko mgr inż.
PeopleKacper Wereszko received the M.Sc. in 2016 (field of study: computer science, specialization: Internet technologies and algorithms). Since 2017 he is a Ph.D. student in the field of computer science. He works as assistant in Department of Algorithms and System Modelling. His research interests focus on security properties of graphs, domination problems in graphs and their practical applications.
-
Speed, alcohol and safety belts as important factors influencing the number voivodship = Prędkość, alkohol i pasy bezpieczeństwa jako istotne czynniki wpływające na liczbę ofiar śmiertelnych wypadków drogowych na obszarze województw
PublicationNiniejszy referat prezentuje wyniki wstępne szerszego programu prac badawczych dotyczących bezpieczeństwa ruchu drogowego na obszarach województw.
-
Maria Damps dr n.med.
PeopleA specialist in anesthesiology and intensive care, Dr. Maria Damps works every day at the Upper Silesian Children's Health Center in Katowice and as a scientific and research assistant at the Faculty of Medical Sciences at the Medical University of Silesian, Poland. Dr. Damps is a graduate of postgraduate studies in medical law and bioethics at the Jagiellonian University in Kraków. Dr. Damps is also the chairwoman of the Ethics...
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublicationThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublicationThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...