Search
Search results for: color
-
Urinary Measurement of Epigenetic DNA Modifications: A Non-Invasive Assessment of the Whole-Body Epigenetic Status in Healthy Subjects and Colorectal Cancer Patients
Publication -
Association between use of enhanced recovery after surgery protocols and postoperative complications in colorectal surgery in Europe: The EuroPOWER international observational study
Publication -
Red Kale (Brassica oleracea L. ssp. acephala L. var. sabellica) Induces Apoptosis in Human Colorectal Cancer Cells In Vitro
PublicationThis article presents the results of studies investigating the effect of red kale (Brassica oleracea L. ssp. acephala L. var. sabellica) extract on cancer cells (HT-29). The cytotoxicity of the red kale extract was assessed using MTT and LDH assays, while qRT-PCR was employed to analyze the expression of genes associated with the p53 signaling pathway to elucidate the effect of the extract on cancer cells. Furthermore, HPLC-ESI-QTOF-MS/MS...
-
Antiproliferative, Antiangiogenic, and Antimetastatic Therapy Response by Mangiferin in a Syngeneic Immunocompetent Colorectal Cancer Mouse Model Involves Changes in Mitochondrial Energy Metabolism
PublicationIn spite of the current advances and achievements in cancer treatments, colorectal cancer (CRC) persists as one of the most prevalent and deadly tumor types in both men and women worldwide. Drug resistance, adverse side effects and high rate of angiogenesis, metastasis and tumor relapse remain one of the greatest challenges in long-term management of CRC and urges need for new leads of anticancer drugs. We demonstrate that CRC...
-
c-Myc Protein Level Affected by Unsymmetrical Bisacridines Influences Apoptosis and Senescence Induced in HCT116 Colorectal and H460 Lung Cancer Cells
PublicationUnsymmetrical bisacridines (UAs) are highly active antitumor compounds. They contain in their structure the drugs previously synthesized in our Department: C-1311 and C-1748. UAs exhibit different properties than their monomer components. They do not intercalate to dsDNA but stabilize the G-quadruplex structures, particularly those of the MYC and KRAS genes. Since MYC and KRAS are often mutated and constitutively expressed in cancer...
-
In vivo evidence of ascorbate involvement in the generation of epigenetic DNA modifications in leukocytes from patients with colorectal carcinoma, benign adenoma and inflammatory bowel disease
Publication -
Relationship between copper(ii) complexes with FomA adhesin fragments ofF. nucleatumand colorectal cancer. Coordination pattern and ability to promote ROS production
Publication -
Non-disjoint Decomposition Using r-admissibility and Graph Coloring and Its Application in Index Generation Functions Minimization
Publication -
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Open Research DataFor K4 graph, a coloring type (K4,K4;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 K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Colorectal neuroendocrine neoplasms — update of the diagnostic and therapeutic guidelines (recommended by the Polish Network of Neuroendocrine Tumours) [Nowotwory neuroendokrynne jelita grubego — uaktualnione zasady diagnostyki i leczenia (rekomendowane przez Polską Sieć Guzów Neuroendokrynych)]
Publication -
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 (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)...
-
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)...
-
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)...
-
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 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...
-
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...
-
Maciej Jerzy Głowacki
PeopleMaciej Jerzy Głowacki is an alumnus of the Gdańsk University of Technology. He graduated with honors from the Faculty of Mechanical Engineering (B.Eng., 2017) and the Faculty of Electronics, Telecommunications and Informatics (M.S., 2018). Since 2014 he has been continuously actively involved in a research carried out at the Department of Metrology and Optoelectronics. His scientific activities include a deposition of antibacterial...
-
The Effect of Steaming Beech, Birch and Maple Woods on Qualitative Indicators of the Surface
PublicationThis work presents the effect of steaming beech, birch and maple woods on the resulting quality of the milled wood surface. The steaming process of the studied woods results in a targeted change in the color of the wood, which changes from the original light white-gray color to fine reddishbrown to dark brown color shades that are more or less saturated depending on the temperature of the saturated water steam. The color changes...
-
Piotr Bartłomiejczyk dr hab.
PeopleW roku 2014 zostałem zatrudniony w Katedrze Równań Różniczkowych i Zastosowań Matematyki na Wydziale Fizyki Technicznej i Matematyki Stosowanej Politechniki Gdańskiej. Zajmuję się badaniem niezmienników występujących w analizie nieliniowej. W roku 2000 uzyskałem stopień naukowy doktora w zakresie nauk matematycznych w Instytucie Matematycznym Polskiej Akademii Nauk w Warszawie. Uchwałą Rady Wydziału Matematyki, Fizyki i Informatyki...
-
Receiver-side fingerprinting method based on quaternion sandwich product
PublicationIn this paper a new receiver-side fingerprinting method for color images is proposed. The proposed method belongs to the group of Joint Fingerprinting and Decryption (JFD) methods. Each component of the color image is represented as a point in 3D space, which is formed by 3 color channels. Encryption and fingerprinting can be interpreted as rotation, scaling and translation of these points. Calculations are performed using quaternion...
-
On the Hat Problem on the Cycle C7
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...
-
On the hat problem on a graph
PublicationThe topic of this paper is the hat problem in which each of n players is uniformly and independently 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....
-
A modified hat problem
PublicationThe 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...
-
The hat problem on a union of disjoint graphs
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. In this version every player...
-
On the hat problem, its variations, and their applications
PublicationThe 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...
-
Hat problem on the cycle C4
PublicationThe 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 cycles on at least nine vertices
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. In this version every player...
-
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
-
Towards Universal Visualisation of Emotional States for Information Systems
PublicationThe paper concerns affective information systems that represent and visualize human emotional states. The goal of the study was to find typical representations of discrete and dimensional emotion models in terms of color, size, speed, shape, and animation type. A total of 419 participants were asked about their preferences for emotion visualization. We found that color, speed, and size correlated with selected discrete emotion...
-
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.
-
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.
-
Insights into the Thermo-Mechanical Treatment of Brewers’ Spent Grain as a Potential Filler for Polymer Composites
PublicationThis 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....
-
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...
-
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...
-
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...
-
Calibration images under different lighting conditions vol. 1
Open Research DataDataset description: Calibration images under different lighting conditions vol. 1
-
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...
-
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....
-
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...
-
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...
-
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...
-
DIAMENTY JAKO PRZYKŁAD INWESTYCJI ALTERNATYWNEJ
PublicationW artykule scharakteryzowano determinanty decydujące o powodzeniu inwestycji w diamenty. Cel artykułu to zbadanie, jak masa, czystość, szlif, kolor, jednostka certyfikująca i kształt wpływają na cenę diamentu. Aby określić wpływ tych cech na cenę diamentu, zbudowano pięć modeli ekonometrycznych. Dla realizacji postawionego celu badawczego wykorzystano charakterystyki dla ponad 265 tysięcy diamentów. W wyniku przeprowadzonej analizy...
-
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...
-
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....
-
Template chart detection for stoma telediagnosis
PublicationThe paper presents the concept of using color template charts for the needs of telemedicine, particularly telediagnosis of the stoma. Although the concept is not new, the current popularity and level of development of digital cameras, especially those embedded in smartphones, allow common and reliable remote advice on various medical problems, which can be very important in the case of limitations in a physical contact with a doctor....
-
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...