Search results for: BUBBLE BIOREACTORS
-
Badania Operacyjne 2022
e-Learning Courses -
Seminarium dyplomowe inżynierskie (ID)
e-Learning CoursesKierunek: Inżynieria danych (WETI), I stopnia - inżynierskie, stacjonarne
-
PODSTAWY ANALIZY ALGORYTMÓW 2023
e-Learning Coursesnazwa: PODSTAWY ANALIZY ALGORYTMÓW kod: E:35519W0 kierunek: informatyka poziom kształcenia: I rok: 2
-
BADANIA OPERACYJNE 2023 (niestacjonarne)
e-Learning Courses -
Optical Magnetometry Based on Nanodiamonds with Nitrogen-Vacancy Color Centers
PublicationNitrogen-vacancy color centers in diamond are a very promising medium for many sensing applications such as magnetometry and thermometry. In this work, we study nanodiamonds deposited from a suspension onto glass substrates. Fluorescence and optically detected magnetic resonance spectra recorded with the dried-out nanodiamond ensembles are presented and a suitable scheme for tracking the magnetic-field value using a continuous...
-
Investigating Noise Interference on Speech Towards Applying the Lombard Effect Automatically
PublicationThe aim of this study is two-fold. First, we perform a series of experiments to examine the interference of different noises on speech processing. For that purpose, we concentrate on the Lombard effect, an involuntary tendency to raise speech level in the presence of background noise. Then, we apply this knowledge to detecting speech with the Lombard effect. This is for preparing a dataset for training a machine learning-based...
-
Effects of different hydraulic models on predicting longitudinal profiles of reactive pollutants in activated sludge reactors
PublicationW pracy przedstawiono wpływ dyspersji na prognozowanie stężeń azotu amonowego w komorach osadu czynnego w oczyszczalni ścieków Gdańsk-Wschód. W tym celu wykorzystano jednowymiarowe równanie adwekcji-dyspersji z członem źródłowym (szybkością nitryfikacji). Współczynnik dyspersji został wyznaczony na podstawie pomiarów znacznika fluoroscencyjnego. Model został zweryfikowany w oparciu o pomiary stężeń azotu w 6 sekcjach komory tlenowej...
-
Data points of structures of R1233zd(E) flowing in a circular minichannel at low, medium and high values of saturation pressure
Open Research DataDatabase present structures of two-phase flow of R1233zd(E) in 3 mm vertical channel. Database contains datapoints which contain information of reduced pressure (ratio of saturation pressure and critical pressure), quality and mass velocity. 4 two phase structures are distinguished: bubbly flow, slug flow, intermittent flow and annular flow.
-
The smallest hard-to-color graph for algorithm DSATUR
Publication -
Sonocatalytic degradation of Bisphenol A from aquatic matrices over Pd/CeO2 nanoparticles: Kinetics study, transformation products, and toxicity
PublicationIn this work, different ratios of palladium – cerium oxide (Pd/CeO2) catalyst were synthesized and characterized, while their sonocatalytic activity was evaluated for the degradation of the xenobiotic Bisphenol A (BPA) from aqueous solutions. Sonocatalytic activity expressed as BPA decomposition exhibited a volcano-type behavior in relation to the Pd loading, and the 0.25Pd/CeO2 catalyst characterized by the maximum Pd dispersion...
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublicationW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
Product Graph Invariants with Applications in the Theory of Information
PublicationThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Shannon Capacity and Ramsey Numbers
PublicationRamsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe 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.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Equitable coloring of corona multiproducts of graphs
PublicationWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublicationThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
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 bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Szeregowanie zadań sprzężonych metodą kolorowania grafów
PublicationRozważono problem szeregowania zadań sprzężonych na pojedynczym procesorze w obecności ograniczeń kolejnościowych. Zidentyfikowano przypadki wielomianowe dla tego zagadnienia NP-trudnego.
-
Equitable vertex coloring of graphs
PublicationW 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.
-
Spinning Fluids Reactor: A new design of a gas – liquid contactor
PublicationCurrent trends in chemical reactor design are based on adapting these to the requirements of a particular chemical process. Processes involving reactions between the gas and liquid phase in particular require precise adjustment of all parameters. The common denominator for most modern design solutions is enhancement of the mass transfer area and the overall volumetric mass transfer coefficient. Gas – liquid contactors evolved from...
-
Integrated Application of GPR and Ultrasonic Testing in the Diagnostics of a Historical Floor
PublicationThe paper presents the results of integrated ground penetrating radar (GPR) and ultrasonic testing (UT) measurements conducted on a historical floor in St. Nicholas’ Church, Gdańsk, Poland. The described inspection was the first stage of the technical state assessment of the building. The aim of the study was the detection of underfloor air gaps, which were observed in a few trial pits. The condition of the ground under the floor...
-
Experimental and Computational Fluid Dynamics Studies on Straight and U-Bend Double Tube Heat Exchangers with Active and Passive Enhancement Methods
PublicationIn this work, the authors wanted to demonstrate the possibility to increase the heat transfer efficiency by using simple wire coil inserts to create turbulent flow in the boundary layer as well as air blowing into the annulus of the pipe. Experimental investigations were carried out for four heat exchanger constructions, i.e., plain double tube, turbulized double tube, plain U-bend double tube, U-tube with turbulator, plain double...
-
Personal adaptive tuning of mobile computer audio
PublicationAn integrated methodology for enhancing audio quality in mobile computers is presented. The key features are adaptation of the characteristics of the acoustic track to the changing conditions and to the user's individual preferences. Original signal processing algorithms are introduced, which concern: linearization of frequency response, dialogue intelligibility enhancement and dynamics processing tuned up to the user's preferences....
-
Wyznaczanie współczynnika przejmowania ciepła podczas wrzenia w przepływie dwutlenku węgla (Prediction of flow boling heat transfer coefficient for carbon dioxide in minichannels)
PublicationW pracy przedstawiono wyniki obliczeń uzyskane za pomocą własnego modelu półemirycznego dla wybranych danych eksperymentalnych dla wrzenia w przepływie dwutlenku węgla. Metoda obliczeniowa została zweryfikowana z danymi eksperymentalnymi Docoulombiera i innych (2011) oraz Mastrullo i innych (2009). Badania eksperymentalne dotyczą pełnego zakresu zmienności stopnia suchości oraz zakresu prędkości masowej G=200-1200 kg/m2s. rozwijany...
-
Rapid on-line method of wastewater parameters estimation by electronic nose for control and operating wastewater treatment plants toward Green Deal implementation
PublicationIn order to comply with legal regulations related to wastewater quality, the operational mode of facilities at wastewater treatment plant (WWTP) should be properly adjusted according to parameters of influents, however it is very difficult without frequently performed measurements. Currently there are known many techniques and devices for assesment of wastewater parameters such as chemical oxygen demand, biochemical oxygen demand,...
-
Biological processes modelling for MBR systems: A review of the state-of-the-art focusing on SMP and EPS
PublicationA mathematical correlation between biomass kinetic and membrane fouling can improve the understanding and spread of Membrane Bioreactor (MBR) technology, especially in solving the membrane fouling issues. On this behalf, this paper, produced by the International Water Association (IWA) Task Group on Membrane modelling and control, reviews the current state-of-the-art regarding the modelling of kinetic processes of biomass, focusing on...
-
Comparison of Ozonation and Evaporation as Treatment Methods of Recycled Water for Bioethanol Fermentation Process
PublicationThe paper compared the performance of the ethanol yield after alcoholic fermentation with samples of rejected (RW) and permeate water (PW), RW and PW treated by oxidation with ozone (O3) (5 and 15 min) and evaporation, aiming the recirculation back to the bioethanol process. RW and PW were collected after an anaerobic bioreactor (AnBR) used for stillage treatment. Nine types of fermentations were made, where one used 100% tap...
-
Modelling of sequencing batch reactor operating at various aeration modes
PublicationThe presented study involved designing a computer model of a sequencing batch reactor (SBR) at laboratory scale. The data pertaining to the technical aspects of the bioreactor and quality indicators of wastewater constituted the input for the employed simulation tool, i.e. GPS-X software package. The results of a simulation involving a 12-hour operation cycle are presented in this work; each cycle included 6 phases: filling, mixing,...
-
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
Publication -
Edge-chromatic sum of trees and bounded cyclicity graphs
Publication -
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publication -
Compact scheduling of zero–one time operations in multi-stage systems
Publication -
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Model formalny dla problemu lokalizacji błędów w kodzie programu
PublicationIstnieje szereg sposobów badania poprawności programów komputerowych. W niniejszym referacie podejmujemy problem automatycznego testowania oprogramowania przy założeniu, iż dany jest zbiór testów (asercji) dla poszczególnych fragmentów kodu. Dla uproszczenia analizy zakładamy, że badany fragment kodu zawiera dokładnie jeden błąd, co nie zmniejsza ogólności rozważań. W artykule analizujemy praktyczne aspekty powyższego problemu...
-
Efficient list cost coloring of vertices and/or edges of some sparse graphs
PublicationRozważane jest kolorowanie wierzchołków i krawędzi grafów w modelach klasycznym, totalnym i pseudototalnym z uwzględnieniem dodatkowego ograniczenia w postaci list dostępnych kolorów. Proponujemy wielomianowy algorytm oparty na paradygmacie programowania dynamicznego dla grafów o strukturze drzewa. Wynik ten można uogólnić na grafy o liczbie cyklomatycznej ograniczonej z góry przez dowolnie wybraną stała.
-
Parallel query processing and edge ranking of graphs
PublicationArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Chromatic scheduling of 1- and 2-processor uet tasks on dedicated machines with availability constraints.
PublicationRozważono uogólnienie klasycznego szeregowania jednostkowych zadań jedno- i dwuprocesorowych na maszynach dedykowanych. Przyjęty model pozwala na naturalne wprowadzenie wszystkich klasycznych kryteriów optymalizacyjnych dla harmonogramów. Zaproponowano algorytmy wielomianowe dla systemów rzadkich.
-
program verification strategy and edge ranking of graphs
PublicationW artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Scheduling jobs to contain a natural disaster: a model and complexity
Publicationthis paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...
-
Jak szybko gasić pożar, czyli przypadek szeregowania zadań czasowozależnych
Publicationartykuł poświęcony jest planowaniu pracy brygad strażackich walczących z pożarami lasu. model matematyczny, który tutaj zastosowano to szeregowanie zadań uwarunkowanych czasowo. przedyskutowano złożoność problemu w przypadku zastosowania dwóch kryteriów optymalizacji: długości harmonogramu i średniego czasu przepływu. pokazano, że w ogólności nie istnieją uszeregowania idealne, zapewniające minimalizację obu kryteriów jednocześnie
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublicationIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w nowych sytuacjach
PublicationW kolejnym odcinku serii z Alicją i Bogdanem najpierw ilustrujemy problem dominowania w grafach (kratowych): klasyczny i rzymski. Następnie ilustrujemy znany fakt, że zachłanność nie zawsze się opłaca. Pokażemy mianowicie, że algorytmy zachłanne nie gwarantują uzyskania rozwiązania optymalnego, nawet wówczas gdy problem da się rozwiązać w czasie wielomianowym.
-
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.