Search results for: COLOR CHANGES
-
Effect of long-term cold storage on physicochemical attributes and bioactive components of kiwi fruit cultivars
PublicationVarious kiwi fruit cultivars, bred in Korea, were kept in cold storage for 8–24 weeks for possible increase of their quality. Firmness significantly decreased at initial time in all cultivars.The rate of softeningwas the slowest in “Hayward”, followed by “Hort16A”, “Haenam”, “Daheung”, “Bidan”, “Hwamei”, and “SKK 12”. Sensory value increased with decreasing of firmness. Soluble solids content increased with storage time while acidity gradually...
-
Elective design I: Waterfront Areas in a Changing Climate – Solutions for Gdańsk
e-Learning CoursesElective design I:Waterfront Areas in a Changing Climate – Solutions for Gdańsk for MSc in Arch. Seminars & assignments: 30 hTeacher: Lucyna Nyka, Jakub Szczepański, Justyna Borucka + assist. teacher from Gdańsk Tech Waterfront Areas in a Changing Climate – Solutions for Gdańsk – This course explores challenges, conflicts and concepts in waterfront areas, their connection to architectural and urban design in the time of...
-
Equitable coloring of hypergraphs
PublicationA 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
Open Research DataTest of PEEK natural (beige color) samples with sliding speed up to 1,2 m/s and up to 8 MPa of nominal load
-
Konsultacje/Consulting - IZS/ICS (ACR)
e-Learning CoursesPliki dydaktyczne - Identyfikacja Zmian w Sygnałach (Didactic files - Identification of Changes in Signals)
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven 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...
-
On the hardness of computing span of subcubic graphs
PublicationIn 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)
Open Research DataFor 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)
Open Research DataFor 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)
Open Research DataFor 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
PublicationIn 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
Open Research DataSample 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)
Open Research DataFor 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)
Open Research DataFor 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)...
-
Hat problem on a graph
PublicationThe 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
PublicationThe 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...
-
Bees Detection on Images: Study of Different Color Models for Neural Networks
PublicationThis paper presents an approach to bee detection in video streams using a neural network classifier. We describe the motivation for our research and the methodology of data acquisition. The main contribution to this work is a comparison of different color models used as an input format for a feedforward convolutional architecture applied to bee detection. The detection process has is based on a neural binary classifier that classifies...
-
Simple colorimetric copper(II) sensor – spectral characterization and possible applications
PublicationNew 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.
PublicationSpeaking 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.
-
Performance evaluation of the parallel object tracking algorithm employing the particle filter
PublicationAn 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
PublicationFor 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).
Open Research DataFor 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)...
-
Minimum order of graphs with given coloring parameters
PublicationA 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)
Open Research DataFor 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...
-
Towards bees detection on images: study of different color models for neural networks
PublicationThis paper presents an approach to bee detection in videostreams using a neural network classifier. We describe the motivationfor our research and the methodology of data acquisition. The maincontribution to this work is a comparison of different color models usedas an input format for a feedforward convolutional architecture appliedto bee detection. The detection process has is based on a neural...
-
Predicting emotion from color present in images and video excerpts by machine learning
PublicationThis work aims at predicting emotion based on the colors present in images and video excerpts using a machine-learning approach. The purpose of this paper is threefold: (a) to develop a machine-learning algorithm that classifies emotions based on the color present in an image, (b) to select the best-performing algorithm from the first phase and apply it to film excerpt emotion analysis based on colors, (c) to design an online survey...
-
Relationship between album cover design and music genres.
PublicationThe 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
Open Research DataDataset description: Calibration images under different lighting conditions vol. 1
-
Topology recognition and leader election in colored networks
PublicationTopology 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...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-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(K3-e,Km-e) is the smallest...
-
Hat problem on odd cycles
PublicationThe 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 a win. In this version every player can...
-
A construction for the hat problem on a directed graph
PublicationA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
Dynamic coloring of graphs
PublicationDynamics 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...
-
Sustainable upcycling of brewers’ spent grain by thermo-mechanical treatment in twin-screw extruder
PublicationThermo-mechanical treatment of brewers’ spent grain (a by-product of beer manufacturing) was successfully performed via the extrusion process. The impact of temperature (from 30 to 180 °C), throughput (from 1 to 5 kg/h) and screw speed (from 75 to 375 rpm) on particle size, color, chemical structure, antioxidant activity and thermal stability of resulting material, as well as correlations between particular properties, were investigated....
-
ANALIZA KOLORÓW SCEN FILMOWYCH W KONTEKŚCIE COLOR GRADINGU
PublicationW artykule przedstawiono zagadnienia związane z kolorowaniem sceny filmowej. W pracy przedyskutowano główne aspekty obróbki koloru obrazu filmowego oraz omówiono definicje pojęć związanych z kolorowaniem sceny, tj.: color correction oraz color gradingu. Opisano teorie psychologii koloru oraz ich praktyczne wykorzystanie w filmie i odniesiono je do podstawowych gatunków filmowych i modeli emocji. Następnie przedyskutowano założenia...
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Wide-field magnetometry using nitrogen-vacancy color centers with randomly oriented micro-diamonds
PublicationMagnetometry with nitrogen-vacancy (NV) color centers in diamond has gained significant interest among researchers in recent years. Absolute knowledge of the three-dimensional orientation of the magnetic field is necessary for many applications. Conventional magnetometry measurements are usually performed with NV ensembles in a bulk diamond with a thin NV layer or a scanning probe in the form of a diamond tip, which requires a...
-
LDRAW based renders of LEGO bricks moving on a conveyor belt
Open Research DataThe set contains renders of 5237 LEGO bricks moving on a white conveyor belt. The images were prepared for training neural network for recognition of LEGO bricks. For each brick starting position, alignment and color was selected (simulating the brick falling down on the conveyour belt) and than 10 images was created while the brick was moved across...
-
Facial features extraction for color, frontal images
PublicationThe problem of facial characteristic features extraction is discussed. Several methods of features extraction for color en--face photographs are discussed. The methods are based mainly on the colors features related to the specific regions of the human face. The usefulness of presented methods was tested on a database of en--face photographs consisting of 100 photographs.
-
Overall color parameter as a parameter determining the level of oxidation of olive oil
PublicationEdible fats are an important part of a human daily diet. They have a significant effect on the proper functioning of the human body. During frying, the oil is chemically modified and the fats consumed should have the highest oxidation stability. The subject of the study were samples of olive oil bought at local markets in Gdansk. Samples were heated at 20 °C, 60 °C, 100 °C, 140 °C and 180 °C. The aim of the study was to determine...
-
Pyrrole bearing diazocrowns: Selective chromoionophores for lead(II) optical sensing
PublicationDiazocrowns of 18-, 21- and 23-membered rings with pyrrole residue as a part of macrocycle were for the first time used as chromoionophores in lead(II) selective optodes. Sensing properties of optodes depend on the type of macrocycle, namely its size and the type of linker: oligoether or hydrocarbon chain. The best results were obtained for optode bearing 18-membered crown with oligoether linker showing linear response range of...
-
Structural and luminescence properties of B2O3-Bi2O3-AlF3 glass doped with Eu3+, Tb3+ and Tm3+ ions
PublicationThe B2O3-Bi2O3-AlF3 glass system doped with Eu3+, Tb3+, Tm3+ and triply doped with Eu3+/Tm3+/Tb3+ ions in different molar ratios were successfully synthesized. Glass transition and crystallization temperatures were examined by Differential Scanning Calorimetry (DSC) measurements. X-ray Diffraction (XRD) confirmed the amorphous character of the samples. Fourier Transform Infrared Spectroscopy (FTIR) revealed that the glass matrix...
-
Visual Features for Improving Endoscopic Bleeding Detection Using Convolutional Neural Networks
PublicationThe presented paper investigates the problem of endoscopic bleeding detection in endoscopic videos in the form of a binary image classification task. A set of definitions of high-level visual features of endoscopic bleeding is introduced, which incorporates domain knowledge from the field. The high-level features are coupled with respective feature descriptors, enabling automatic capture of the features using image processing methods....
-
LDRAW based renders of LEGO bricks moving on a conveyor belt with extracted models
Open Research DataThe set contains renders of LEGO bricks moving on a white conveyor belt. The images were prepared for training neural network for recognition of LEGO bricks. For each brick starting position, alignment and color was selected (simulating the brick falling down on the conveyour belt) and than 10 images was created while the brick was moved across the...
-
A Method of MOS Evaluation for Video Based Services
PublicationThis paper deals with a method for QoE evaluation for the services transmitting large amount of data perceived by the end user in relatively short time periods, e.g. streaming video in mobile operator...
-
Macrocyclic derivatives of imidazole as chromoionophores for bismuth(III)/lead(II) pair
Publication18-membered diazomacrocycles with imidazole or 4-methylimidazole residue as a part of macrocycle were used as chromoionophores in bismuth(III) and lead(II) dual selective optodes for the first time. Cellulose triacetate membranes doped with macrocyclic chromoionophores are bismuth(III) and lead(II) selective with color change from orange/red to different shades of blue and violet, respectively. Results obtained for model and real...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
A Rapid and Simple Method for Screening Microorganisms with a Potential for Catechol Biodegradation
PublicationCatechol is a highly toxic compound that is also a key intermediate in biodegradation pathways of various aromatic compounds. In this paper, a new screening method for isolation of microorganisms with the potential for catechol biodegradation is reported. The method described is based on the ability of catechol to form a color complex with Fe3+ ions. For this purpose, basal medium that is widely used for classification of microorganisms...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
On some open questions for Ramsey and Folkman numbers
PublicationWe discuss some of our favorite open questions about Ramsey numbers and a related problem on edge Folkman numbers. For the classical two-color Ramsey numbers, we first focus on constructive bounds for the difference between consecutive Ramsey numbers. We present the history of progress on the Ramsey number R(5,5) and discuss the conjecture that it is equal to 43.