Filtry
wszystkich: 2990
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: EQUITABLE CHROMATIC NUMBER
-
Nuts 91 (woj. warszawski - stoleczny). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe 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
Dane BadawczeIn 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.
-
Discount for children deducted from tax in selected EU countries, available according to number of children criterion (in EUR) in 2017
Dane BadawczeWhen 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,...
-
Jakub Miler dr inż.
OsobyKariera akademicka: 2000: mgr inż. Wydział ETI, Politechnika Gdańska, praca pt. "Computer system for supporting risk management in a software engineering project", promotor prof. Janusz Górski 2005: dr inż. Wydział ETI, Politechnika Gdańska, rozprawa pt. "A Method of Software Project Risk Identification and Analysis", obroniona z wyróżnieniem, dziedzina nauki techniczne, dyscyplina informatyka, promotor prof. Janusz Górski Zainteresowania...
-
Jerzy Kowalski dr hab. inż.
Osoby -
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
Publikacja -
Optimal backbone coloring of split graphs with matching backbones
PublikacjaFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Number of active credit cards issued to individual customers (2017)
Dane BadawczePolish 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).
-
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)
Dane BadawczeTaxpayers 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...
-
Selecting wells for an optimal design of groundwater monitoring network based on monitoring priority map: A Kish Island case study
PublikacjaThis paper presents a novel approach, i.e. a combination of gamma test and monitoring priority map, for optimal design of groundwater monitoring network (GMN) by considering the cumulative effects of industries, human activities, and natural factors on the groundwater quality. The proposed method was successfully applied to design an optimal network for groundwater salinity monitoring on Kish Island, Persian Gulf. The priority...
-
Kamila Kokot-Kanikuła mgr
OsobyKamila Kokot-Kanikuła pracuje w Bibliotece Politechniki Gdańskiej w Sekcji Budowy Zbiorów Cyfrowych i Multimedialnych na stanowisku starszego bibliotekarza. Jest absolwentką Instytutu Historycznego oraz Informacji Naukowej i Bibliotekoznawstwa na Uniwersytecie Wrocławskim. Główne kierunki zainteresowań to starodruki, biblioteki cyfrowe, repozytoria instytucjonalne, Otwarte Zasoby Edukacyjne, Open Access i Open Data. W bibliotece...
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Restricted open shop scheduling
PublikacjaIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
Gender and Digital Divide - Information and Communication Technologiesand their Impact on Equality
PublikacjaIn the entire Europe more women than men graduate from tertiaryeducation institutes. However, they are underrepresented in scientific and engineering disciplines. Women researchers still constitute a minority in the Government and Higher Education Sectors. A number of industry reports highlight a low number of women in IT occupations49. This has led to a variety of public policy measures, such as subsidies on community provision,...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
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
Dane BadawczeAn 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
Dane BadawczeAn 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
Dane BadawczeAn 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
Dane BadawczeAn 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
Dane BadawczeAn 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)
Dane BadawczeBanks 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
Dane BadawczeMost 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).
-
Magdalena Szuflita-Żurawska
OsobyMagdalena Szuflita-Żurawska jest kierownikiem Sekcji Informacji Naukowo-Technicznej na Politechnice Gdańskiej oraz Liderem Centrum Kompetencji Otwartej Nauki przy Bibliotece Politechniki Gdańskiej. Jej główne zainteresowania badawcze koncentrują się w obszarze komunikacji naukowej oraz otwartych danych badawczych, a także motywacji i produktywności naukowej. Jest odpowiedzialna między innymi za prowadzenie szkoleń dla pracowników...
-
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
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
PublikacjaNiniejszy referat prezentuje wyniki wstępne szerszego programu prac badawczych dotyczących bezpieczeństwa ruchu drogowego na obszarach województw.
-
Magdalena Maria Popowska dr
OsobyAbsolwentka Uniwersytetu im Adama Mickiewicza w Poznaniu oraz Ecole Supérieure de Commerce w Rouen. Pracownik badawczo dydaktyczny, autorka i recenzentka wielu artykułów publikowanych w czasopismach krajowych i międzynarodowych. Przez wiele lat odpowiedzialna za procesy internacjonalizacji, w latach 2008-2016 jako prodziekan ds. międzynarodowych i publicznych, a 2016-2020 jako pełnomocnik dziekana ds. współpracy międzynarodowej....
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublikacjaThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
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.
PublikacjaThe 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...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublikacjaIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Number of statements issued regarding the intention to entrust the performance of work in 2008-2018, broken down by country of origin of migrants
Dane BadawczeThe declaration of the intention to entrust work (applicable in the years 2007-2017) and the declaration of entrustment of work (applicable since 2018) are instruments for legalizing the work of foreigners in Poland, which by the ease of meeting the procedural requirements are by far the most popular among economic migrants and their employers.
-
Tax discount for children deducted from income in selected EU countries, available according to the criterion of the number of children (in EUR) in 2017
Dane BadawczeDespite the far-reaching harmonization of collection mechanisms and the amount of VAT and excise duty rates in the European Union, individual countries, as a rule, conduct individual income tax policies, including a system of reliefs and exemptions. It is worth noting that, as shown below, each European Union country uses at least one method of supporting...
-
Krzysztof Gierłowski dr inż.
OsobyKrzysztof Gierłowski uzyskał tytuł doktora inżyniera telekomunikacji na Wydziale Elektroniki, Telekomunikacji i Informatyki w 2018 roku. Jest autorem lub współautorem ponad 80 publikacji naukowych oraz recenzentem wielu czasopism i konferencji. Brał udział w szeregu projektów badawczych dotyczących tematyki IT, wliczając w to: finansowany ze źródeł UE projekt Inżynieria Internetu Przyszłości, projekt infrastrukturalny PL-LAB2020,...
-
Wojciech Litwin dr hab. inż.
Osoby1992÷1996 – Studia na Wydziale Mechanicznym Politechniki Gdańskiej1996 – Zatrudniony na Wydziale Oceanotechniki i Okrętownictwa PG2004 – Obrona pracy doktorskiej2014 – obrona rozprawy habilitacyjnej2012 – obejmuje funkcję prodziekan ds. Nauki na Wydziale Oceanotechniki i OkrętownictwaUczestniczył w wielu projektach badawczych oraz pracach zleconych przez przemysł związanych z łożyskowaniem ślizgowym wałów głównych oraz niekonwencjonalnymi...
-
Green, simple analytical method for total biogenic amines content determination in wine using spectrophotometry
PublikacjaA simple, green and equitable procedure for total biogenic amines (BAs) content determination was developed. The scientific novelty lies in the use of commercially available S 0378 dye, the reaction of which with BAs results in a colour change of the solution. Sample preparation and analysis were simplified to make the method suitable for routine analyses even in resource-scarce settings. The optimization of the method was carried...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
PG_00042018_ PHYSICS I - ET- 2021/22
Kursy OnlinePhysics I lecture for students from both faculties, course number PG_00042018 Lecture runs on 2021/22 academic year
-
PG_00042018_ PHYSICS I - ET- 2022/23
Kursy OnlinePhysics I lecture for students from both faculties, course number PG_00042018 Lecture runs on 2022/23 academic year
-
PG_00042018_ PHYSICS I - ET- 2023/24
Kursy OnlinePhysics I lecture for students from both faculties, course number PG_00042018 Lecture runs on 2023/24 academic year
-
Development of novel smartphone-based methods of wine quality assessment
PublikacjaThe doctoral dissertation concerns the development of novel smartphone-based analytical methods of wine quality evaluation, which would be in line with the stipulations of green and equitable analytical chemistry. This solution is based on the analysis of biogenic amines and selected bioactive compounds. The dissertation is based on four articles containing the results of research which led to the development of smartphone-based...
-
Pomiary grubości cienkich warstw metodą modulacji chromatycznej.
PublikacjaTematem artykułu jest pomiar grubości struktur cienkowarstwowych szerokostosowanych w optoelektronice, transparentnych warstw dielektrycznych. Grubość jest najistotniejszym parametrem warstwy i determinuje jej właściwościoptyczne. Metoda pomiaru grubości cienkich warstw powinna być bezkontaktowa, nieniszcząca, niekosztowna oraz odporna na zakłócenia
-
Detection and segmentation of moving vehicles and trains using Gaussian mixtures, shadow detection and morphological processing
PublikacjaSolution presented in this paper combines background modelling, shadow detection and morphological and temporal processing into one system responsible for detection and segmentation of moving objects recorded with a static camera. Vehicles and trains are detected based on their pixellevel difference from the continually updated background model utilizing a Gaussian mixture calculated separately for every pixel. The shadow detection...
-
Is DAO Governance Fostering Democracy? Reviewing Decision-Making in Decentraland
PublikacjaThis study analyzes voting dynamics and proposal outcomes within Decentraland, a prominent Decentralized Autonomous Organization (DAO), by examining its voting behaviors and decision outcomes. We offer insights into how a DAO is employed to facilitate decision-making and discern the nature of the issues about which decisions are made. DAOs promise horizontal and democratic decision-making. However, our research reveals...
-
PG_00040165_ PHYSICS II - DaPE- 2023/24
Kursy OnlinePhysics II lecture for students of DAPE, course number PG_00040165 Lecture runs in academic year 2023/24
-
PG_00055087_ PHYSICS II - DaPE- 2022/23
Kursy OnlinePhysics II lecture for students of DAPE, course number PG_00055087 Lecture runs in academic year 2022/23
-
PG_00042031_ PHYSICS 2 - ET- 2022/23
Kursy OnlinePhysics 2 lab for students of ET, course number PG_00042031 lab runs on academic year 2022/23
-
PG_00042018_ PHYSICS I - DaPE- 2022/23
Kursy OnlinePhysics I lecture for students of DAPE, course number PG_00055087 Lecture runs on academic year 2022/23