- Akronim projektu:
- InterPhD II
- Program finansujący:
- Program Operacyjny Wiedza Edukacja Rozwój
- Narodowe Centrum Badań i Rozwoju (NCBR) (The National Centre for Research and Development)
- POWR.03.02.00-00-I002/16 z dnia 2017-09-25
- Okres realizacji:
- 2017-09-01 - 2021-12-31
- Kierownik projektu:
- prof. dr hab. inż. Maciej Bagiński
- Członkowie zespołu:
- Koordynator obszarowy prof. dr hab. inż. Robert Jankowski
- Realizowany w:
- Katedra Technologii Leków i Biochemii
- Instytucje zewnętrzne
biorące udział w projekcie:
- Uniwersytet Gdański (Polska)
- Wartość projektu:
- 9 980 960.00 PLN
- Typ zgłoszenia:
- Fundusz Strukturalny
- Projekt krajowy
- Politechnika Gdańska
Publikacje powiązane z tym projektem
Characterization of diatomaceous earth coated with nitrated asphaltenes as superior adsorbent for removal of VOCs from gas phase in fixed bed columnPublikacja
Asphaltenes isolated from bitumen possess unusual adsorption characteristics that can be further enhanced by chemical modifications to promote interactions with VOCs’. Herein, nitrated asphaltenes are used as an active layer coated on a surface of a diatomaceous earth, in order to prepare an efficient adsorbent (AsfNitro). Breakthrough experiments with benzene, pyridine, and 1-nitropropane revealed significant increase in adsorption...
Mono- and bimetallic (Pt/Cu) titanium(IV) oxide core–shell photocatalysts with UV/Vis light activity and magnetic separabilityPublikacja
Titanium(IV) oxide is one of the most widely investigated photocatalysts. However, separation of nano-sized particulate titania might result in profitless technologies for commercial applications. Additionally, bare titania is almost inactive under the Vis range of solar spectrum due to its wide bandgap. Therefore, the present study aims to prepare novel coreinterlayer- shell TiO2 magnetic photocatalysts modified with metal nanoparticles...
In this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
Given 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...
Mono- and bimetallic (Pt/Cu) titanium(IV) oxide photocatalysts. Physicochemical and photocatalytic data of magnetic nanocomposites’ shellPublikacja
Surface modification of titania with noble and semi-noble metals resulted in significant enhancement of photocatalytic activity. Presented data, showing the photocatalytic properties of TiO2-M (where M is Pt and/or Cu) photocatalysts were further used as Fe3O4@SiO2/TiO2-M magnetic nanocomposites shells in "Mono- and bimetallic (Pt/Cu) titanium(IV) oxide core-shell photocatalysts with Vis light activity and magnetic separability"...
Application of cyanated asphaltenes in gas-phase adsorption processes for removal of volatile organic compoundsPublikacja
The paper presents an innovative, chemically modified (methylcyanated) asphaltene-based adsorbent that can be an inter-esting low-cost alternative for traditional adsorbents. Adsorption properties of adsorbents were examined by inverse gas chromatography technique, adsorption isotherms, and breakthrough curves. A significant increase in retention volume for pyridine, 2-pentanone, nitropropane, toluene, and 1-butanol was observed....
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machinesPublikacja
The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
wyświetlono 219 razy