Filters
total: 10476
filtered: 5724
-
Catalog
- Publications 5724 available results
- Journals 17 available results
- Conferences 23 available results
- People 139 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 1151 available results
- Events 24 available results
- Open Research Data 3331 available results
Chosen catalog filters
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
-
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...
-
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,...
-
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.
-
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.
-
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.
-
Graph Approach to the Computation of the Homology of Continuous Maps
Publication -
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...
-
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 -
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...
-
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...
-
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...
-
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...
-
Comparison of radical-driven technologies applied for paraben mixture degradation: mechanism, biodegradability, toxicity and cost assessment
Publication -
Facile and cost-effective technique to control europium oxidation states in glassy fluorophosphate matrices with tunable photoluminescence
Publication -
Analysis of cost structure of international road transport operators in West Pomeranian voivodship in the years 2008-2014
Publication -
PUBLIC GOODS VERSUS THE FARM PRICE-COST SQUEEZE: SHAPING THE SUSTAINABILITY OF THE EU’S COMMON AGRICULTURAL POLICY
Publication -
The cost minimizing solution of the transportation problem for the location of the building machinery yard along the road under construction
Publication -
Finding the Right Solvent: A Novel Screening Protocol for Identifying Environmentally Friendly and Cost-Effective Options for Benzenesulfonamide
PublicationThis study investigated the solubility of benzenesulfonamide (BSA) as a model compound using experimental and computational methods. New experimental solubility data were collected in the solvents DMSO, DMF, 4FM, and their binary mixtures with water. The predictive model was constructed based on the best-performing regression models trained on available experimental data, and their hyperparameters were optimized using a newly...
-
Low-cost nitrogen-doped activated carbon prepared by polyethylenimine (PEI) with a convenient method for supercapacitor application
Publication -
A comprehensive survey on low-cost ECG acquisition systems: Advances on design specifications, challenges and future direction
Publication -
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...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublicationPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Kolorowanie grafów z ograniczeniami na liczbę wierzchołków w określonym kolorze = Graph coloring model with restrictions on cardinalities of vertexes in particular color
PublicationW artykule rozważamy problem takiego kolorowania grafów, w którym klasy kolorów mają ograniczoną z góry moc. Zagadnie to znajduje ciekawe zastosowania praktyczne i jest naturalnym uogólnieniem problemu kolorowania grafów. W artykule ustalamy złożoność obliczeniową dla grafów pełnych $r$-dzielnych i dla kilku innych prostych klas grafów oraz dla problemu dwukolorowania.
-
Switched-capacitor DC-DC converters in arbitrary switching mode - topologically derived resistive models based on incremental graph approach.
PublicationIn the preceding paper we reviewed some of modeling approaches aimed at systematic formulation and solution of switched capacitor DC-DC converters. In our review, special attention was paid to computationally efficient and mathematically elegant methods. In so doing we had tried to demonstrate the virtues of unified Incremental Graph (IG) approach. Incremental Graph is, in concept, a tool originally created for analysis and synthesis...
-
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...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Accelerated senescence as a cost of reproduction: Testing associations between oxidative stress and reproductive effort in rural and urban women
Publication -
Elastic multi-layer resilient IP-over-Flexgrid networking: Detailed cost analysis with bandwidth-variable transponders
Publication -
Circular polarization diversity implementation for correlation reduction in wideband low-cost multiple-input-multiple-output antenna
PublicationIn this paper, a multiple-input-multiple-output (MIMO) antenna featuring circular polarization diversity, and designed on a common coplanar ground is presented. The proposed antenna design utilizes a coplanar waveguide (CPW) feeding technique with three parallel coplanar ground planes, and two feedlines in-between. For circular polarization (CP), quasi-loops are created by etching slots on the outermost ground planes. With this...
-
Cost of Equity of Coal-Fired Power Generation Projects in Poland: Its Importance for the Management of Decision-Making Process
Publication -
Large-Scale and Low-Cost Motivation of Nitrogen-Doped Commercial Activated Carbon for High-Energy-Density Supercapacitor
Publication -
Low-cost Adsorbents Derived from Agricultural By-products/Wastes for Enhancing Contaminant Uptakes from Wastewater: A Review
PublicationA major threat to the comfort of human life has been imposed by increased industrialization and urbanization. The generation and disposal of huge amounts of toxic materials and pollutants have heavily contaminated our environment. Some Organics such as synthetic dyes (SD) and heavy metals (HM) are becoming increasingly prevalent as the most dangerous pollutants in soil and surface water environments. They are...
-
Reliable low-cost surrogate modeling and design optimisation of antennas using implicit space mapping with substrate segmentation
PublicationAbstract: In this work, a reliable methodology for fast simulation-driven design optimisation of antenna structures is proposed. The authors’ approach exploits implicit space mapping (ISM) technology. To adopt it for handling antenna structures, they introduce substrate segmentation with separate dielectric permittivity value assigned for each segment as ISM preassigned parameters. At the same time, the coarse model for space mapping...
-
Assessment of the Steering Precision of a Hydrographic Unmanned Surface Vessel (USV) along Sounding Profiles Using a Low-Cost Multi-Global Navigation Satellite System (GNSS) Receiver Supported Autopilot
Publicationhe performance of bathymetric measurements by traditional methods (using manned vessels) in ultra-shallow waters, i.e., lakes, rivers, and sea beaches with a depth of less than 1 m, is often difficult or, in many cases, impossible due to problems related to safe vessel maneuvering. For this reason, the use of shallow draft hydrographic Unmanned Surface Vessels (USV) appears to provide a promising alternative method for performing...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Comparison of hydrogen bonds and diverse weak interactions of the nitro group in 2-methyl-4-nitroanilinium nitrate, bisulfate and two hexafluoridosilicates: elementary graph-set approach
PublicationCrystal structures of (H2m4na)NO3 (1), (H2m4na)HSO4 (2), (H2m4na)2SiF6 (3) and (H2m4na)2SiF6*2H2O (4), where 2m4na = 2-methyl-4-nitroaniline, are presented. Two layers of interactions occur in the structures, N—H...O/F hydrogen bonds and interactions with the nitro group. Although diverse, hydrogen-bonding patterns are compared with each other by means of interrelations among elementary graph-set descriptors and descriptors of hydrogen-bonding...
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
Publication -
Towards explainable motion prediction using heterogeneous graph representations
Publication -
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublicationW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Modelling of energy flow in electrical machines. A bond graph approach
PublicationPrzedstawiono w ujęcia grafów wiązań model przepływu energii/mocy w maszynach elektrycznych pracujących w hybrydowych systemach przetwarzania energii. Jako przykład do rozważań przyjęto system napędu trakcyjnego pojazdów hybrydowych.