Wyszukiwarka
Filtry
wszystkich: 10360
wybranych: 5628
-
Katalog
- Publikacje 5628 wyników po odfiltrowaniu
- Czasopisma 17 wyników po odfiltrowaniu
- Konferencje 23 wyników po odfiltrowaniu
- Osoby 138 wyników po odfiltrowaniu
- Wynalazki 10 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Laboratoria 6 wyników po odfiltrowaniu
- Zespoły Badawcze 7 wyników po odfiltrowaniu
- Aparatura Badawcza 40 wyników po odfiltrowaniu
- Kursy Online 1147 wyników po odfiltrowaniu
- Wydarzenia 22 wyników po odfiltrowaniu
- Dane Badawcze 3318 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: CHROMATIC COST COLORING, OPTIMUM COST CHROMATIC PARTITION, WEIGHTED GRAPH, BIPARTITE GRAPH, APPROXIMATION ALGORITHM, CHROMATIC COST 3-PSEUDOCOLORING
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven 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...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe 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.
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublikacjaIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
T-colorings, divisibility and circular chromatic number
PublikacjaLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
Equitable coloring of corona products of graphs
PublikacjaIn 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.
-
Optimal backbone coloring of split graphs with matching backbones
PublikacjaFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublikacjaIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublikacjaArtificial 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...
-
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Parallel tabu search for graph coloring problem
PublikacjaTabu 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...
-
Parallel immune system for graph coloring
PublikacjaThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...
-
Chromatic scheduling in a cyclic open shop
PublikacjaPraca jest poświęcona złożoności obliczeniowej problemu cyklicznego szeregowania w systemie otwartym. Autorzy analizując wykazują, że problem jest NP-trudny dla 3 procesorów i konstruują algorytm dokładny dla przypadku dwóch procesorów.Ponadto analizowany jest zwarty wariant cyklicznego systemu otwartego. W tym przypadku autorzy pokazują, że już szeregowanie na dwóch procesorach prowadzi do problemu NP-trudnego.
-
Recent progress in research on the cutting processes of wood. A review COST Action E35 2004-2008: Wood machining - micromechanics and fracture
PublikacjaZaprezentowano postępy w badaniach przecinania drewna ze szczególnym uwzględnieniem nowych metod dedykowanych zwiększeniu wydajności materiałowej w tartacznictwie. Zademonstrowano przydatność współczesnej mechaniki pękania do szacowania mocy skrawania dla pił, których wartości rozwarcia są różne od pił użytych w badaniach skrawalnościowych. W tych ostatnich wyznaczano wiązkość materiału obrabianego oraz naprężenia tnące. Badania...
-
Recent progress in research on the cutting processes of wood. A review COST Action E35 2004-2008: Wood machining - micromechanics and fracture
PublikacjaZaprezentowano postępy w badaniach przecinania drewna ze szczególnym uwzględnieniem nowych metod dedykowanych zwiększeniu wydajności materiałowej w tartacznictwie. Zademonstrowano przydatność współczesnej mechaniki pękania do szacowania mocy skrawania dla pił, których wartości rozwarcia są różne od pił użytych w badaniach skrawalnościowych. W tych ostatnich wyznaczano wiązkość materiału obrabianego oraz naprężenia tnące. Badania...
-
Product Graph Invariants with Applications in the Theory of Information
PublikacjaThere 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...
-
THE COST ANALYSIS OF CORROSION PROTECTION SOLUTIONS FOR STEEL COMPONENTS IN TERMS OF THE OBJECT LIFE CYCLE COST
PublikacjaSteel materials, due to their numerous advantages - high availability, easiness of processing and possibility of almost any shaping are commonly applied in construction for carrying out basic carrier systems and auxiliary structures. However, the major disadvantage of this material is its high corrosion susceptibility, which depends strictly on the local conditions of the facility and the applied type of corrosion protection system....
-
Distributed largest-first algorithm for graph coloring.
PublikacjaW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
A better practical algorithm for distributed graph coloring
Publikacja -
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Edge-chromatic sum of trees and bounded cyclicity graphs
Publikacja -
The circular chromatic index of some class 2 graphs
PublikacjaW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publikacja -
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublikacjaW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
Restrained differential of a graph
PublikacjaGiven a graph $G=(V(G), E(G))$ and a vertex $v\in V(G)$, the {open neighbourhood} of $v$ is defined to be $N(v)=\{u\in V(G) :\, uv\in E(G)\}$. The {external neighbourhood} of a set $S\subseteq V(G)$ is defined as $S_e=\left(\cup_{v\in S}N(v)\right)\setminus S$, while the \emph{restrained external neighbourhood} of $S$ is defined as $S_r=\{v\in S_e : N(v)\cap S_e\neq \varnothing\}$. The restrained differential of a graph $G$ is...
-
Interval incidence coloring of bipartite graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Cost assessment of computer security activities
PublikacjaComprehensive cost-benefit analysis plays a crucial role in the decision-making process when it comes to investments in information security solutions. The cost of breaches needs to be analysed in the context of spending on protection measures. However, no methods exist that facilitate the quick and rough prediction of true expenditures on security protection systems. Rafal Leszczyna of Gdansk University of Technology presents...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
PublikacjaThis paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial...
-
Koala graph coloring library: an open graph coloring library for real-world applications
PublikacjaPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublikacjaWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Mixed graph edge coloring
PublikacjaW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
EvOLAP Graph – Evolution and OLAP-Aware Graph Data Model
PublikacjaThe objective of this paper is to propose a graph model that would be suitable for providing OLAP features on graph databases. The included features allow for a multidimensional and multilevel view on data and support analytical queries on operational and historical graph data. In contrast to many existing approaches tailored for static graphs, the paper addresses the issue for the changing graph schema. The model, named Evolution...
-
Neural network based algorithm for hand gesture detection in a low-cost microprocessor applications
PublikacjaIn this paper the simple architecture of neural network for hand gesture classification was presented. The network classifies the previously calculated parameters of EMG signals. The main goal of this project was to develop simple solution that is not computationally complex and can be implemented on microprocessors in low-cost 3D printed prosthetic arms. As the part of conducted research the data set EMG signals corresponding...
-
Cost efficiency of administrative service in public higher education in Poland
PublikacjaPurpose: The aim of the study is to determine changes in the cost efficiency of the administration of public higher education in Poland. Design/methodology/approach: The biennial cost Malmquist productivity index was used to study changes in cost efficiency of 58 public higher education institutions in 2014-2016. The results were...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublikacjaAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
How Much Does an e-Vote Cost? Cost Comparison per Vote in Multichannel Elections in Estonia
PublikacjaWe are presenting the results of the CoDE project in this paper, where we investigate the costs per vote of different voting channels in Estonian Local Elections (2017). The elections analyzed involve different processes for casting a vote: Early Voting at County Centers, Advance Voting at County Centers, Advance Voting at Ordinary Voting District Committees, Electronic Voting, Election Day Voting, and Home Voting. Our analysis...
-
Low-Cost Surrogate Models for Microwave Filters
PublikacjaA novel low-cost kriging-based multivariable parametric macromodeling technique for microwave filters is presented. Kriging is used to model both the residues and poles of a microwave filter's reflection coefficient, and the zeros of the transmission coefficient. The proposed residue-pole-zero (RPZ) technique is demonstrated to efficiently model a high dimensional (8D) microwave filter with pseudoelliptic characteristics.
-
Cost-Efficient Design Methodology for Compact Rat-Race Couplers
PublikacjaIn this article, a reliable and low-cost design methodology for simulation-driven optimization of miniaturized rat-race couplers (RRCs) is presented. We exploit a two-stage design approach, where a composite structure (a basic building block of the RRC structure) is first optimized using a pattern search algorithm, and, subsequently, the entire coupler is tuned by means of surrogate-based optimization (SBO) procedure. SBO is executed...
-
Influence of passive house technology on time and cost of construction investment
PublikacjaDue to the changes in the energy standards for housing in Poland there are many concerns. Is the standard required by the regulation achievable and if it is, then at what cost? There are many solutions to construct a building in line with the requirements of passive house technology. They are differentiated by price and time required for implementation. This study is based on the solution proposed by one of Polish companies, offering...
-
Rotational Design Space Reduction for Cost-Efficient Multi-Objective Antenna Optimization
PublikacjaCost-efficient multi-objective design of antenna structures is presented. Our approach is based on design space reduction algorithm using auxiliary single-objective optimization runs and coordinate system rotation. The initial set of Pareto-optimal solutions is obtained by optimizing a response surface approximation model established in the reduced space using coarse-discretization EM simulation data. The optimization engine is...
-
Constructing a map of an anonymous graph: applications of universal sequences
PublikacjaWe study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Cost-efficient simulation-driven design of compact impedance matching transformers
PublikacjaIn this paper, an algorithmic framework for cost-efficient design optimization of miniaturized impedance matching transformers has been presented. Our approach exploits a bottom-up design that involves translating the overall design specifications for the circuit at hand to its elementary building blocks (here, compact microstrip resonant cells, CMRCs), as well as fast surrogate-assisted optimization of the cells followed by simulation-based...
-
Life Cycle Cost Assessment and the Optimum Design of Timber Roofs for Sustainable Construction
Publikacja -
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publikacjagenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
The influence of historical conditions on time and cost of construction project
PublikacjaConducting construction works in a building or in an area entered in the historic register is associated with the contracting authority's risk of incurring higher than planned costs of works, as well as delays in their implementation. In many cases, these deviations are completely independent of contracting authority and contractor. The aim of this article is to indicate the reasons for cost and time changes in the construction...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
Publikacja -
Efficient list cost coloring of vertices and/or edges of some sparse graphs
PublikacjaRozważ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.
-
Low Cost Method for Location Service in the WCDMA System
PublikacjaA new and low cost method for a location service (LCS) in the Wideband Code Division Multiple Access (WCDMA) system is outlined. This method, which is called TDOA + RTT, enables calculation of the geographical position of a mobile station (MS) without knowledge of relative time differences (RTDs) between base stations (BSs). The TDOA+RTT method is based on the measurement of round trip times (RTTs) between the MS and the serving...
-
Cost-Efficient Optical Fronthaul Architectures for 5G and Future 6G Networks
PublikacjaFifth-generation and Beyond (5GB) wireless networks have introduced new centralized architectures such as cloud radio access network (CRAN), which necessitate extremely high-capacity low latency Fronthaul (FH). CRAN has many advantageous features in terms of cost reduction, performance enhancement, ease of deployment, and centralization of network management. Nevertheless, designing and deploying a cost-efficient FH is still a...
-
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
Publikacja -
Chromatic scheduling of 1- and 2-processor uet tasks on dedicated machines with availability constraints.
PublikacjaRozważ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.
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Reduced-Cost Microwave Modeling Using Constrained Domains and Dimensionality Reduction
PublikacjaDevelopment of modern microwave devices largely exploits full-wave electromagnetic (EM) simulations. Yet, simulation-driven design may be problematic due to the incurred CPU expenses. Addressing the high-cost issues stimulated the development of surrogate modeling methods. Among them, data-driven techniques seem to be the most widespread owing to their flexibility and accessibility. Nonetheless, applicability of approximation-based...
-
Cost-efficient design optimization of compact patch antennas with improved bandwidth
PublikacjaIn this letter, a surrogate-assisted optimization procedure for fast design of compact patch antennas with enhanced bandwidth is presented. The procedure aims at addressing a fundamental challenge of the design of antenna structures with complex topologies, which is simultaneous adjustment of numerous geometry parameters. The latter is necessary in order to find a truly optimum design and cannot be executed-at the level of high-fidelity...
-
Simple and low-cost wireless voting system
PublikacjaThis paper presents the concept of a simple and low-cost wireless voting system working on the 868 MHz frequency band. Described system is dedicated to general shareholders assemblies but it can be easily adapted for other applications. The main advantage is its simplicity and mobility as it consists solely of three components - voting modules, base station and a PC application from which the whole system is managed. This architecture...
-
Simple and low-cost wireless voting system
PublikacjaThis paper presents the concept of a simple and low-cost wireless voting system working in the 868 MHz frequency band. The described system is dedicated to general shareholders assemblies but it can be easily adapted for other applications. The main advantage is its simplicity and mobility as it consists solely of three components - voting modules, a base station and a PC application from which the whole system is mamaged. This...
-
Low cost set-up for supercapacitors parameters evaluation
PublikacjaSupercapacitors are capable to store relatively high amount of energy comparing to its mass. Growing number of these devices applications requires development of new testing methods. Standard methods of evaluation of supercapacitor parameters, as cycling voltammetry, CV, galvanostatic cycling with potential limitation, GCPL, impedance measurements, require equipment of high cost...
-
Low-Cost EM-Simulation-Driven Multi-Objective Optimization of Antennas
PublikacjaA surrogate-based method for efficient multi-objective antenna optimization is presented. Our technique exploits response surface approximation (RSA) model constructed from sampled low-fidelity antenna model (here, obtained through coarse-discretization EM simulation). The RSA model enables fast determination of the best available trade-offs between conflicting design goals. A low-cost RSA model construction is possible through...
-
Low cost microwave X-band generator
PublikacjaA low cost microwave X-band generator for educational purposes was designed and built. Its simple construction and user's interface makes it suitable for a student laboratory.The generator is based on a single frequency conversion concept. It uses a digitally tunable PLL chip for intermediate frequency generation and an active frequency multiplier for frequency conversion. The generator covers 9,7 - 11 GHz part of the X frequency...
-
On the low-cost design of abbreviated multisection planar matching transformer
PublikacjaA numerically demanding wideband matching transformer composed of three nonuniform transmission lines (NUTLs) has been designed and optimized at a low computational cost. The computational feasibility of the design has been acquired through the exploitation of low-fidelity NUTL models in most steps of the design procedure and an implicit space mapping optimization engine, providing high accuracy results with only a handful of EM...
-
Hat problem on a graph
PublikacjaThe 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...
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublikacjaWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
Low-Cost Automated Design of Compact Branch-Line Couplers
PublikacjaBranch-line couplers (BLCs) are important components of wireless communication systems. Conventional BLCs are often characterized by large footprints which make miniaturization an important prerequisite for their application in modern devices. State-of-the-art approaches to design of compact BLCs are largely based on the use of high-permittivity substrates and multi-layer topologies. Alternative methods involve replacement of transmission-line...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
5G/6G optical fronthaul modeling: cost and energy consumption assessment
PublikacjaIn fifth generation (5G) and the future beyond 5G (6G) radio access networks (RANs), the cost of fronthaul deployment is a main challenge for mobile network operators. Depending on different constraints, there are various solutions to deploy an efficient fronthaul. Fiber-optic-based fronthaul offers long-term support with regard to a rapid increase in capacity demands. When fiber connections, either point-to-point (P2P) or point-to-multipoint...
-
An experimental study of distributed algorithms for graph coloring.
PublikacjaW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Interval vertex-coloring of a graph with forbidden colors
Publikacja -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publikacja -
Interval edge coloring of a graph with forbidden colors
Publikacja -
On the hat problem on a graph
PublikacjaThe 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....
-
Chromatic monitoring technique for thickness measurementof thin transparent films.IV Workshopon Atomic and Molecular Physics.
PublikacjaW pracy opisano nową technikę monitorowania grubości cienkich warstw podczas procesu ich syntezy. Jest to optyczna metoda oparta na zdegenerowanej analizie widmowej tzw. modulacji chromatycznej. Umożliwia ona precyzyjny ciągły pomiar zmian grubości wzrastających warstw stosowanych w optyce.
-
COMPREHENSIVE MODELLING OF THE COST EFFECTIVNESS OF RAILWAY LINE ELECTRIFICATION
PublikacjaSubject of this paper is the mathematical model estimating the Economical threshold between usage of combustion engine traction and electrical traction for new and modernized railway passenger communication lines. Currently available models do not coincide with the whole complexity of the problem. The proposed model was implemented into Matlab and then validated on “Pomorska Kolej Metropolitalna” investment time-frame and its cost...
-
Domain segmentation for low-cost surrogate-assisted multi-objective design optimisation of antennas
PublikacjaAbstract: Information regarding the best possible design trade-offs of an antenna structure can be obtained through multiobjective optimisation (MO). Unfortunately, MO is extremely challenging if full-wave electromagnetic (EM) simulation models are used for performance evaluation. Yet, for the majority of contemporary antennas, EM analysis is the only tool that ensures reliability. This study introduces a procedure for accelerated...
-
Low cost electrochemical sensor module for measurement of gas concentration
PublikacjaThis paper describes a low cost electrochemical sensor module for gas concentration measurement. A module is universal and can be used for many types of electrochemical gas sensors. Device is based on AVR ATmega8 microcontroller. As signal processing circuit a specialized integrated circuit LMP9l000 is used. The proposed equipment will be used as a component of electronic nose system employed for classifying and distinguishing...
-
Low cost set-up for supercapacitors parameters evaluation
PublikacjaWe propose a use of a power amplifier in the circuit of voltage to current converter (current driver) for supercapacitor charging/discharging in controlled conditions. The current driver is controlled by DAC output of DAQ board and voltage of DUT is measured and a control loop is realized by software. In the circuit the DC current method of evaluation of capacitance and equivalent series...
-
Reduced-cost design closure of antennas by means of gradient search with restricted sensitivity update
PublikacjaDesign closure, i.e., adjustment of geometry parameters to boost the performance, is a challenging stage of antenna design process. Given complexity of contemporary structures, reliable parameter tuning requires numerical optimization and can be executed using local algorithms. Yet, EM-driven optimization is a computationally expensive endeavour and reducing its cost is highly desirable. In this paper, a modification of the trust-region...
-
Zgred - Zgred Graph Editor
PublikacjaThe paper presents a graph editor that was developed as a supplementary tool for the Koala graph library. We discuss its requirements, design choices and main ideas behind the implementation. The later part of the paper is meant to be a brief user manual, as we go through the functionality provided by the editor
-
Low-Cost Flight Simulator with Possibility of Modeling of Flight Controls Failures
PublikacjaThe goal of this paper is to present a development of a low cost flight simulator, that allows to simulate flight controls failures. Cessna 172 has been chosen as an example of a general aviation aircraft and the flight model has been implemented in Simulink. The model allows for easy integration of an experimental autopilot, using various strategies. Aerodynamic coefficients have been calculated using software called DATCOM. Such...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublikacjaWe study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...