Filtry
wszystkich: 578
-
Katalog
Wyniki wyszukiwania dla: KOLOR
-
Hat problem on the cycle C4
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
On the hat problem, its variations, and their applications
PublikacjaThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
A more colorful hat problem
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Joanna Raczek dr inż.
OsobyWykształcenie 1997 -- 2001 Studia inżynierskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2001 -- 2003 Studia magisterskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2000 -- 2004 Studia inżynierskie, Wydział Elektroniki, Informatyki i Telekomunikacji,...
-
Nodular melanoma - Male, 51 - Tissue image [4120730022884321]
Dane BadawczeThis is the histopathological image of SKIN 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.
-
Equitable coloring of hypergraphs
PublikacjaA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Tribological test for evaluation of Natural PEEK
Dane BadawczeTest of PEEK natural (beige color) samples with sliding speed up to 1,2 m/s and up to 8 MPa of nominal load
-
Metody zarządzania i monitoringu środowiska, L, E, sem.02, zimowy 22/23, (PG_00057320)
Kursy Online -
Modelowanie i optymalizacja w transporcie, L, TiL, sem. 01, lato 2021/22, (PG_0007088)
Kursy Online -
Konwencjonalne i niekonwencjonalne źródła energii, L/C, E, sem.02, zimowy 22/23, (PG_00057321)
Kursy Online -
On the complexity of distributed greedy coloring
PublikacjaW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Odnawialne źródła enegi cy energetyka jądrowa- pinia społeczna
PublikacjaW artykule zaprezentowano obecny stan i możliwości energii produkowanej z odnawianlych źródel energii (OŹE). W pracy przedstawiono uzasadnienie ekonomiczne oraz uwarunkowania środowiskowe dla wykorzystania konkretnych źródeł energii odnawialnej. Opinia wykreowana na podstawie przesłanek ekonomicznych i technicznych przeciwstawiona zostala opinii społecznej uzyskanej na podstawie ankiety. W artykule poruzsony został także temat...
-
Elektrownie jądrowe- historia i przegląd typów reaktorów
PublikacjaElektrownie jądrowe stanowią jedno ze źrodeł produkcji energii. Produkują one duże ilości energii z małej ilości surowca. Reaktry jądrowe są stale rowijane technologicznie, po to aby byly one jeszcze bezpieczniejsze, a także aby pracowały z coraz to wyższymi sprawnościami
-
Modelowanie niepewności pomiarowych obiegu turbo parowego.
PublikacjaArtykuł opisuje próbę stworzenia modelu neuronowego wymiennika regeneracyjnego siłowni kondensacyjnej pracującego w zmiennych warunkach ruchu. Wzorzec poprawnej pracy elementów siłowni turboparowej jest pożądany w dziedzinie diagnostyki, ponieważ poprawnie pracujący model neuronowy jest w stanie zastąpić czasochłonne obliczenia bilansowe.
-
O diagnozowaniu sprawnościowym cieplnych siłowni turbinowych przy wykorzystaniu algorytmów genetycznych
PublikacjaArtykuł ma na celu przybliżenie informacji o metodzie zastosowania algorytmów genetycznych do procesu diagnostyki cieplno-przepływowej bloków z turbinami parowymi. Wykorzystano właściwości polegające na poszukiwaniu ekstremum.
-
Modelowanie niepewności pomiarowych obiegu turboparowego
PublikacjaArtykuł opisuje próbę stworzenia modelu neuronowego wymiennika regeneracyjnego siłowni kondensacyjnej pracującego w zmiennych warunkach ruchu. Wzorzec poprawnej pracy elementów siłowni turboparowej jest pożądany w dziedzinie diagnostyki, ponieważ poprawnie pracujący model neuronowy jest w stanie zastąpić czasochłonne obliczenia bilansowe.
-
O diagnozowaniu sprawnościowym cieplnych siłowni turbinowych z wykorzystaniem algorytmów genetycznych.
PublikacjaArtykuł ma na celu przybliżenie informacji o metodzie zastosowania algorytmów genetycznych do procesu diagnostyki cieplno-przepływowej bloków z turbinami parowymi
-
Porównanie wybranych typów elektrowni jądrowych z reaktorem HTGR
PublikacjaWśród interesujących rozwiązań elektrowni jądrowych USA, Rosja i Chiny proponują zastosowanie tzw. pływających morskich elektrowni nuklearnych. Wchodzi w rachubę wyposażenie ich w reaktor wysokotemperaturowy typu HTGR, chłodzony gazem. Przeprowadzono rozważania i obliczenia sprawności dla bloków 560 MW parowej elektrowni jądrowej i elektrowni z turbiną gazową. Wyższa sprawność turbin parowych nie dyskredytuje możliwości zastosowania...
-
On the hardness of computing span of subcubic graphs
PublikacjaIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Dane BadawczeFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
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:...
-
Tribological test for evaluation of CF30 Black PEEK
Dane BadawczeSample numner BL03 and BL04 made of PEEK CF30 (black color) tribologicaly tested with sliding speed up to 1,8 m/s and up to 14 MPa of nominal load under water lubrication.
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Insights into the Thermo-Mechanical Treatment of Brewers’ Spent Grain as a Potential Filler for Polymer Composites
PublikacjaThis paper investigated the impact of twin-screw extrusion parameters on the properties of brewers’ spent grain. The chemical structure, antioxidant activity, particle size, and color properties, as well as the emission of volatile organic compounds during extrusion, were investigated. The main compounds detected in the air during modifications were terpenes and terpenoids, such as α-pinene, camphene, 3-carene, limonene, or terpinene....
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
Wavelet filtering of signals without using model functions
PublikacjaThe effective wavelet filtering of real signals is impossible without determining their shape. The shape of a real signal is related to its wavelet spectrum. For shape analysis, a continuous color wavelet spectrogram of signal level is often used. The disadvantage of continuous wavelet spectrogram is the complexity of analyzing a blurry color image. A real signal with additive noise strongly distorts the spectrogram based on continuous...
-
Simple colorimetric copper(II) sensor – spectral characterization and possible applications
PublikacjaNew o-hydroxyazocompound L bearing pyrrole residue was obtained in the simple synthetic protocol. The structure of L was confirmed and analyzed by X-ray diffraction. It was found that new chemosensor can be successfully used as copper(II) selective spectrophotometric regent in solution and can be also applied for the preparation of sensing materials generating selective color signal upon interaction with copper(II). Selective colorimetric...
-
Influence of lightweight structures used in swimming pools and water parks objects on their functionality, building form and spatial-visual effects indoors.
PublikacjaSpeaking about architecture of swimming facilities and water parks we have in mind their form, function , design and detail, texture and color. A particularly important element of the architecture of these buildings was and still is the structure.
-
The experimental identification of the dynamic coefficients of two hydrodynamic journal bearings operating at constant rotational speed and under nonlinear conditions.
PublikacjaHydrodynamic bearings are commonly used in ship propulsion systems. Typically, they are calculated using numerical or experimental methods. This paper presents an experimental study through which it has been possible to estimate 24 dynamic coefficients of two hydrodynamic slide bearings operating under nonlinear conditions. During the investigation, bearing mass coefficients are identified by means of a newly developed algorithm....
-
Performance evaluation of the parallel object tracking algorithm employing the particle filter
PublikacjaAn algorithm based on particle filters is employed to track moving objects in video streams from fixed and non-fixed cameras. Particle weighting is based on color histograms computed in the iHLS color space. Particle computations are parallelized with CUDA framework. The algorithm was tested on various GPU devices: a desktop GPU card, a mobile chipset and two embedded GPU platforms. The processing speed depending on the number...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Dane BadawczeFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Instalacja artystyczna "W sztuce lubię: romantyzm, poezję i figle"
PublikacjaInstalacja artystyczna "W sztuce lubię: romantyzm, poezję i figle" instalacja z 70 koszul męskich różnego koloru, wraz z wideo wyświetlanym na suficie. Wystawa w Instytucie Cybernetyki Sztuki.
-
Relationship between album cover design and music genres.
PublikacjaThe aim of the study is to find out whether there exists a relationship between typographic, compositional and coloristic elements of the music album cover design and music contained in the album. The research study involves basic statistical analysis of the manually extracted data coming from the worldwide album covers. The samples represent 34 different music genres, coming from nine countries from around the world. There are...
-
Calibration images under different lighting conditions vol. 1
Dane BadawczeDataset description: Calibration images under different lighting conditions vol. 1
-
Topology recognition and leader election in colored networks
PublikacjaTopology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...
-
Koło języka niemieckiego.
Kursy Online -
Koło Naukowe Vertex
Kursy OnlineForum spotkań członków Koła Naukowego "VERTEX"
-
koło naukowe - Maxwell
Kursy OnlineKoło naukowe Maxwell
-
Studenckie Koło Prototypowania
Kursy Online -
Koło Naukowe KOMBO
Kursy OnlineKurs dedykowany dla realizacji bieżących działań Koła Naukowego Mechaniki Konstrukcji KOMBO