Search
Filters
total: 590
filtered: 315
Search results for: color
-
Methods and means of measuring control and diagnostics of biological tissues in vivo based on measurements of color coordinates and multispectral image
Publication -
Measuring moisture damage of asphalt mixtures: The development of a new modified boiling test based on color image processing
Publication -
Luminescent GeO2–Pb–Bi2O3 glasses co-doped with Tb3+1 and Eu3+: Excitation energy transfer and color chromaticity
Publication -
Comparison of sono-direct and sono-alternate current electro-coagulation processes for removal of color and turbidity from domestic wastewater
Publication -
Prediction of skin color, tanning and freckling from DNA in Polish population: linear regression, random forest and neural network approaches
Publication -
Optimization and evaluation of the process variable’s effect on color and turbidity removal from coffee processing wastewater: Using a photoelectrochemical oxidation process
Publication -
Structural and luminescent study of TeO2-BaO-Bi2O3-Ag glass system doped with Eu3+ and Dy3+ for possible color-tunable phosphor application
PublicationTellurite glass systems of 73TeO2-4BaO-3Bi2O3-1Ag:xEu2O3-(2-x)Dy2O3 (where x = 0.5, 1, 1.5, 2 in molar ratio) composition have been successfully synthesized. In order to acquire Ag nanoparticles, materials have been heat treated at 350 °C in the air atmosphere. Structural properties of obtained samples were evaluated with various techniques. X-Ray Diffraction (XRD) measurements indicated that obtained materials are amorphous in...
-
Influence of the Grain Size Distribution of the Limestone Additives on the Color Properties and Phase Composition of Sintered Ceramic Materials Based on Cream-Firing Clays
Publication -
ColorNephroNet: Kidney tumor malignancy prediction using medical image colorization
PublicationRenal tumor malignancy classification is one of the crucial tasks in urology, being a primary factor included in the decision of whether to perform kidney removal surgery (nephrectomy) or not. Currently, tumor malignancy prediction is determined by the radiological diagnosis based on computed tomography (CT) images. However, it is estimated that up to 16% of nephrectomies could have been avoided because the tumor that had been...
-
Interval vertex-coloring of a graph with forbidden colors
Publication -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publication -
Interval edge coloring of a graph with forbidden colors
Publication -
A more colorful hat problem
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 winning. We consider a generalized hat...
-
Sum of Effective Temperatures in Colorado Beetle Control
Publication -
Circular colorings of graphs.
PublicationRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
Greedy T-colorings of graphs
PublicationTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
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...
-
Consecutive colorings of the edges of general graphs
Publication -
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
Colorings of the Strong Product of Circulant Graphs
PublicationGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
The Evaluation of Use of Colors in Graphical User-Interfaces in Healthcare
PublicationIn this paper, color difference/contrast measures are investigated in reference to results of experiments with the participation of average, color-normal observers and with individuals with deuteranopia. Additionally, a new method for the automatic analysis of color contrast is proposed, which supports designers of graphical user- interfaces in healthcare. The method was verified using the GUI phantom of a vital signs monitor (the...
-
Menopause: a trigger for simultaneous development of ulcerative colitis in sigmoid neovagina and residual colorectum?
Publication -
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Catalase immunoexpression in colorectal lesions
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
Novel Diazocrowns with Pyrrole Residue as Lead(II) Colorimetric Probes
PublicationNovel 18- and 23-membered diazomacrocycles were obtained with satisfactory yields by diazocoupling of aromatic diamines with pyrrole in reactions carried under high dilution conditions. X-ray structure of macrocycle bearing five carbon atoms linkage was determined and described. Compounds were characterized as chromogenic heavy metal ions receptors. Selective color and spectral response for lead(II) was found in acetonitrile and...
-
Smartphone-based digital image colorimetry for the determination of total capsaicinoid content in chili pepper extracts
PublicationA simple smartphone-based digital image colorimetry was proposed for the determination of total capsaicinoid content and the assessment of chili pepper pungency. The biobased solvent D-limonene was used for the first time to isolate analytes. Capsaicinoids were efficiently separated from chili pepper by solid-liquid extraction with D-limonene followed by partitioning of the analytes into the ammonium hydroxide solution to eliminate...
-
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...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
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...
-
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...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Extraction pathways and purification strategies towards carminic acid as natural-based food colorant: A comprehensive review
PublicationAs a current trend of fabricating healthier products, food manufacturing companies seek for natural-based food colorant aiming to replace the synthetic ones, which apart from meeting sensorial and organoleptic aspects, they can also act as health promoters offering additional added value. Carminic acid is a natural based food colorant typically found in several insect taxa. However, there are current approaches which pursue the...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
Colored Tattoo Ink Screening Method with Optical Tissue Phantoms and Raman Spectroscopy
PublicationDue to the increasing popularity of tattoos among the general population, to ensure their safety and quality, there is a need to develop reliable and rapid methods for the analysis of the composition of tattoo inks, both in the ink itself and in already existing tattoos. This paper presents the possibility of using Raman spectroscopy to examine tattoo inks in biological materials. We have developed optical tissue phantoms mimicking...
-
Classical coloring of graphs.
PublicationRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublicationRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Harmonions Coloring of Graphs.
PublicationProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublicationNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
<title>Colorimetric sensor based on two optical fiber couplers</title>
Publication -
Persistent oxidative stress in colorectal carcinoma patients
Publication -
Patients’ Awareness Of The Prevention And Treatment Of Colorectal Cancer*
Publication -
Pursuing the Deep-Learning-Based Classification of Exposed and Imagined Colors from EEG
PublicationEEG-based brain-computer interfaces are systems aiming to integrate disabled people into their environments. Nevertheless, their control could not be intuitive or depend on an active external stimulator to generate the responses for interacting with it. Targeting the second issue, a novel paradigm is explored in this paper, which depends on a passive stimulus by measuring the EEG responses of a subject to the primary colors (red,...
-
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...
-
Colorimetric study of the post-processing effect due to pulsed laser cleaning of paper.
PublicationW artykule przedstawiono wyniki badań procesu oczyszczania papieru implulsami laserowymi o różnej długości fali. Oceny dokonywano na podstawie pomierzonych wartości parametrów kolorymetrycznych. Badania obejmowały próbki papieru o różnym wieku.
-
A Colorimetric Microplate Assay for DNA-Binding Activity of His-Tagged MutS Protein
PublicationA simple microplate method was designed for rapid testing DNA-binding activity of proteins. The principle of the assay involves binding of tested DNA by his-tagged protein immobilized on a nickel-coated ELISA plate, following colorimetric detection of biotinylated DNA with avidin conjugated to horseradish peroxidase. The method was used to compare DNA mismatch binding activities of MutS proteins from three bacterial species. The...
-
Koala graph coloring library: an open graph coloring library for real-world applications
PublicationPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....