Filters
total: 10618
-
Catalog
- Publications 5802 available results
- Journals 17 available results
- Conferences 23 available results
- People 140 available results
- Inventions 10 available results
- Projects 4 available results
- Laboratories 6 available results
- Research Teams 7 available results
- Research Equipment 40 available results
- e-Learning Courses 1202 available results
- Events 24 available results
- Open Research Data 3343 available results
displaying 1000 best results Help
Search results for: chromatic cost coloring, optimum cost chromatic partition, weighted graph, bipartite graph, approximation algorithm, chromatic cost 3-pseudocoloring
-
Pointing device for elders with low cost and mixed manual-gaze control interface
PublicationW artykule przedstawiono projekt interfejsu pozwalającego na zastąpienie standardowej myszki komputerowej sterowaniem wzrokowym, z nieznacznym manualnym wspomaganiem. Manualne wspomaganie ma na celu korekcję współrzędnych kursora.
-
Cost-Efficient Globalized Parameter Optimization of Microwave Components through Response-Feature Surrogates and Nature-Inspired Metaheuristics
PublicationDesign of contemporary microwave devices predominantly utilizes computational models, including both circuit simulators, and full-wave electromagnetic (EM) evaluation. The latter constitutes the sole generic way of rendering accurate assessment of the system outputs that considers phenomena such as cross-coupling or radiation and dielectric losses. Consequently, for reliability reasons, the final tuning of microwave device parameters...
-
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.
-
Emotion Recognition from Physiological Channels Using Graph Neural Network
PublicationIn recent years, a number of new research papers have emerged on the application of neural networks in affective computing. One of the newest trends observed is the utilization of graph neural networks (GNNs) to recognize emotions. The study presented in the paper follows this trend. Within the work, GraphSleepNet (a GNN for classifying the stages of sleep) was adjusted for emotion recognition and validated for this purpose. The...
-
Polymer derived SiOC/Sn nanocomposites from a low-cost single source precursor as anode materials for lithium storage applications
PublicationMetal- based materials capable of lithium (Li) alloy formation are key to realization of the next generation of high-energy density anodes for Li-ion batteries, owing to their high storage capacity. Designing a good sup- porting matrix is essential for homogeneously nesting these metallic nanodomains, to effectively utilize their high capacity while tackling the volume expansion issues. Silicon oxycarbides (SiOC), obtained via...
-
The outer-connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.
-
On the total restrained domination number of a graph
PublicationW pracy przedstawione są ograniczenia i własności liczby dominowania podwójnie totalnego.
-
The task graph assignment for KASKADA platform
PublicationArtykuł opisuje model obliczeniowy wykorzystany w platformie KASKADA. Opiera się on na dwóch podstawowych elementach: węzłach klastra obliczeniowego oraz grafie zadań. Przeanalizowane zostały algorytmy przydzielania węzłów obliczeniowych dla zadań w zależności od kryteriów: minimalizacja fragmentacji klastra i minimalizacja opóźnienia przetwarzania danych. Zostały przedstawione wyniki symulacji opisanych algorytmów oraz ich...
-
On the doubly connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania podwójnie spójnego i przedstawiono jej podstawowe własności.
-
Pharmaceuticals wastewater treatment via different advanced oxidation processes: Reaction mechanism, operational factors, toxicities, and cost evaluation – A review
PublicationPharmaceuticals comprises different drugs used for treating different infections in human being and animals. The huge quantities of pharmaceuticals used are found to discharge into different water resources and cause different health and environmental problems. The continuous and large-scale discharge of pharmaceuticals increases their persistency which can consequently make them more toxic. The different advanced oxidation processes...
-
Tomasz Edward Berezowski dr inż.
PeopleHe was born in 1986 in Warsaw. He graduated in 2009 with honors from the Interfaculty Study of Environmental Protection at SGGW in Warsaw, specialty Restoration and Management of Environment. He defended his doctorate with honors at Vrije UIniversiteit Brussels in 2015. In 2015-2017 he worked as an assistant and then assistant professor at the Faculty of Civil and Environmental Engineering at SGGW. In 2017, he was employed as an...
-
Macro-nutrients recovery from liquid waste as a sustainable resource for production of recovered mineral fertilizer: Uncovering alternative options to sustain global food security cost-effectively
PublicationGlobal food security, which has emerged as one of the sustainability challenges, impacts every country. As food cannot be generated without involving nutrients, research has intensified recently to recover unused nutrients from waste streams. As a finite resource, phosphorus (P) is largely wasted. This work critically reviews the technical applicability of various water technologies to recover macro-nutrients such as P, N, and...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
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...
-
Low cost real time UAV stereo photogrammetry modelling technique – accuracy considerations
PublicationThe paper presents accuracy considerations regarding three 3D modelling techniques. The tested new consumer type stereo camera (ZED 3D Stereolabs) has been implemented info an aerial mapping system, on board micro air vehicle MAV) and tested object has been mapped using a real-time photogrammetry with original real-time software application. The evaluated results has been compared with model gained with a state of art unmanned...
-
Waste tire rubber as low-cost and environmentally-friendly modifier in thermoset polymers – A review
Publication -
The cost of reproduction in women: Reproductive effort and oxidative stress in premenopausal and postmenopausal American women
Publication -
Cost Effectiveness of Open Repair of Abdominal Aortic Aneurysms with a Novel Peri-Operative Bundle
Publication -
Cost-Effective and Sufficiently Precise Integration Method Adapted to the FEM Calculations of Bone Tissue
PublicationThe technique of Young’s modulus variation in the finite element is not spread in biomechanics. Our future goal is to adapt this technique to bone tissue strength calculations. The aim of this paper is to present the necessary studies of the element’s integration method that takes into account changes in material properties. For research purposes, a virtual sample with the size and distribution of mechanical properties similar...
-
Potato Juice, a Starch Industry Waste, as a Cost-Effective Medium for the Biosynthesis of Bacterial Cellulose
Publication -
Pareto Optimal Decisions in Multi-Criteria Decision Making Explained with Construction Cost Cases
Publication -
Uniform sampling in constrained domains for low-cost surrogate modeling of antenna input characteristics
PublicationIn this letter, a design of experiments technique that permits uniform sampling in constrained domains is proposed. The discussed method is applied to generate training data for construction of fast replacement models (surrogates) of antenna input characteristics. The modeling process is design-oriented with the surrogate domain spanned by a set of reference designs optimized with respect to the performance figures and/or operating...
-
Analysis of exhaled breath for dengue disease detection by low-cost electronic nose system
PublicationThis paper presents a procedure and a set-up of an electronic nose system analyzing exhaled breath to detect the patients suffering from dengue – a mosquito-borne tropical disease. Low-power resistive gas sensors (MiCS-6814, TGS8100) were used to detect volatile organic compounds (VOCs) in the exhaled breath. The end-tidal phase of patients exhaled breath was collected with a BioVOCTM breath sampler. Two strategies were assessed...
-
A new method for searching optimal path on a raster plane including cost of direction changes
PublicationArtykuł przedstawia nowy algorytm znajdowania optymalnych tras na siatkach rastrowych. Szczegółowo opisano zastosowane struktury danych, dzięki który algorytm ma liniową złoŻoność obliczeniową. Zamieszczono również propozycje możliwych zastosowań.
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublicationWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Agnieszka Landowska dr hab. inż.
PeopleAgnieszka Landowska works for Gdansk University of Technology, FETI, Department of Software Engineering. Her research concentrates on usability, accessibility and technology adoption, as well as affective computing methods. She initiated Emotions in HCI Research Group and conducts resarch on User eXperiene evaluation of applications and other technologies.
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Optimum. Studia Ekonomiczne
Journals -
Graph Approach to the Computation of the Homology of Continuous Maps
Publication -
Efficient parallel query processing by graph ranking
PublicationW artykule analizujemy przybliżony algorytm dla problemu szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym, co znajduje zastosowanie w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie uporządkowanego indeksu chromatycznego drzewa, które prowadzi do uzyskania lepszej funkcji dobroci wspomnianego algorytmu.
-
Packing three-vertex paths in a subcubic graph
PublicationW pracy rozważany jest problem pakowania scieżek P3 w grafach podkubicznych, pokazano oszacowania dolne na ilość ścieżek w zależności od stopnia spójności grafu oraz minimalnego stopnia.
-
Graph Neural Networks and Structural Information on Ionic Liquids: A Cheminformatics Study on Molecular Physicochemical Property Prediction
PublicationIonic liquids (ILs) provide a promising solution in many industrial applications, such as solvents, absorbents, electrolytes, catalysts, lubricants, and many others. However, due to the enormous variety of their structures, uncovering or designing those with optimal attributes requires expensive and exhaustive simulations and experiments. For these reasons, searching for an efficient theoretical tool for finding the relationship...
-
Improving SBR Performance Alongside with Cost Reduction through Optimizing Biological Processes and Dissolved Oxygen Concentration Trajectory
PublicationAuthors of this paper take under investigation the optimization of biological processes during the wastewater treatment in sequencing batch reactor (SBR) plant. A designed optimizing supervisory controller generates the dissolved oxygen (DO) trajectory for the lower level parts of the hierarchical control system. Proper adjustment of this element has an essential impact on the efficiency of the wastewater treatment process as well...
-
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...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
Identifying Surface Runoff Pathways for Cost-Effective Mitigation of Pollutant Inputs to Drinking Water Reservoir
Publication -
Comparison between industrial and simulated textile wastewater treatment by AOPs – Biodegradability, toxicity and cost assessment
Publication -
New Low-Cost Video Camera Pointing Mechanism for Stratospheric Balloons: Design and Operational Tests
Publication -
The Risk Indicators of Construction Projects’ Cost Overruns Assessed with PCA, Decision Trees, and Pearson’s Correlations
Publication -
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Electronic Journal of Graph Theory and Applications
Journals -
CAUSALITY IN MODELS OF THERMAL PROCESSES IN SHIP ENGINE ROOMS WITH THE USE OF BOND GRAPH (BG) METHOD
PublicationWith a single approach to modeling elements of different physical nature, the method of Bond Graph (BG) is particularly well suited for modeling energy systems consisting of mechanical, thermal, electrical and hydraulic elements that operate in the power system engine room. The paper refers to the earlier presented new concept of thermal process modeling using the BG method. The authors own suggestions for determining causality...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using Johnson’s algorithm
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
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)...
-
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...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
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)...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublicationPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Hard carbon derived from rice husk as low cost negative electrodes in Na-ion batteries
PublicationHere, we report the synthesis of hard carbon materials (RH) made from natural rice husk through a single pyrolysis process and their application as an anode in sodium-ion batteries. The studies show that the electrochemical properties of RHs are affected by the treatment temperatures, which determine the materials morphology, in particular, their degree of graphitization and extent of continuous channels (nanovoids). The latter...
-
Comparison of radical-driven technologies applied for paraben mixture degradation: mechanism, biodegradability, toxicity and cost assessment
Publication