Wyszukiwarka
Filtry
wszystkich: 852
-
Katalog
- Publikacje 705 wyników po odfiltrowaniu
- Czasopisma 15 wyników po odfiltrowaniu
- Konferencje 18 wyników po odfiltrowaniu
- Osoby 15 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 3 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 88 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: RECTANGULAR GRID GRAPHS
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Computing internodal conductivities in numerical modeling of two dimensional unsaturated flow on rectangular grid
PublikacjaW artykule porównano rozwiązania numeryczne dwuwymiarowego równania przepływu nienasyconego z użyciem różnych metod uśredniania współczynnika przewodności hydraulicznej między sąsiednimiwęzłami. Uwzględniono średnia arytmetyczną, geometryczną, "pod prad" oraz całkową, a także niedawno zaproponowany sposób uśredniania oparty na analizie przepływu ustalonego. Ten ostatni sposób okazałsię najbardziej uniwersalny, gdyż umożliwiał otrzymanie...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublikacjaSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Hydrodynamic reanalysis of ice conditions in the Baltic Sea using the PM3D model
Dane BadawczeThe dataset contains the results of numerical modeling of sea ice in the Baltic Sea since 1998. A long-term reanalysis was performed using the three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). A numerical dynamic-thermodynamic model of sea ice (Herman et al. 2011)...
-
Long-term hindcast simulation of sea ice in the Baltic Sea
Dane BadawczeThe data set contains the results of numerical modeling of sea ice over a period of 50 years (1958-2007) in the Baltic Sea. A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). A numerical dynamic-thermodynamic model...
-
Hydrodynamic reanalysis of currents in the Baltic Sea using the PM3D model
Dane BadawczeThe dataset contains the results of numerical modeling of currents in the Baltic Sea since 1998. A long-term reanalysis was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997).
-
Hydrodynamic reanalysis of sea level in the Baltic Sea using the PM3D model
Dane BadawczeThe data set contains the results of numerical modelling of sea level fluctuations in the Baltic Sea in the Baltic Sea since 1998. A long-term reanalysis was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997).
-
Hydrodynamic reanalysis of water temperature and salinity in the Baltic Sea using the PM3D model
Dane BadawczeThe dataset contains the results of numerical modeling of water temperature and salinity in the Baltic Sea since 1998. A long-term reanalysis was performed using the three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). A numerical dynamic-thermodynamic model of sea...
-
Long-term hindcast simulation of sea level in the Baltic Sea
Dane BadawczeThe dataset contains the results of numerical modelling of sea level fluctuations over a period of 50 years (1958-2007) in the Baltic Sea. A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). The hydrodynamic model...
-
Long-term hindcast simulation of water temperature and salinity in the Baltic Sea
Dane BadawczeThe dataset contains the results of numerical modelling of water temperature and salinity over a period of 50 years (1958-2007) in the Baltic Sea. A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). The hydrodynamic...
-
Long-term hindcast simulation of currents in the Baltic Sea
Dane BadawczeThe dataset contains the results of numerical modelling of currents over a period of 50 years (1958-2007) in the Baltic Sea . A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). The hydrodynamic model was coupled...
-
GRAPHS AND COMBINATORICS
Czasopisma -
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Resonance in Rectangular Microstrip Structure Loaded with a Pseudochiral Medium Layer
PublikacjaA rectangular microstrip structure with multilayer substrate containing dielectric and pseudochiral medium layers is studied in this paper. The effect of Omega medium layer location in the substrate and its thickness on the complex resonant frequency of the rectangular microstrip structure is investigated.
-
Propagation in rectangular waveguides with a pseudochiral Ω slab
PublikacjaThe transfer matrix approach is applied for analysis of waveguides loaded with a uniaxial pseudochiral Ω slab. In particular a pseudochiral parallel plate and rectangular guides are investigated. Based on the numerical analysis the influence of the pseudochirality on propagation characteristics and field distribution are examined. Other feature such as a field displacement phenomenon appearing in the both considered structures...
-
Charakterystyka środowiska Knowledge Grid
PublikacjaZorganizowanie wiedzy zgromadzonej w Internecie to współcześnie ważne zagadnienie badawcze. Artykuł opisuje środowisko Knowledge Grid i mechanizmy jego działania. Wiedza przechowywana w Knowledge Grid może zostać zorganizowana w trójwymiarową strukturę. Opracowany został również Knowledge Grid Operating Language, który jest językiem służącym do operowania na danych udostępnianych w tym środowisku. Za jego pomocą możliwe jest umieszczenia...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
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...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
On the double bondage in graphs
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
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...
-
Multi agent grid systems
PublikacjaThis chapter presents an idea of merging grid and volunteer systemswith multi agent systems. It gives some basics concerning multi agentsystem and the most followed standard. Some deliberations concerningsuch an existing systems were made in order to finally present possibilities of introducing agents into the Comcute system.
-
Simplified Distribution Grid Modelling for Connection Analyses
PublikacjaThis paper considers the modelling of medium and low voltage grids for the purpose of connection studies by distribution grid operators. Possible simplifications in grid modelling are discussed, which are acceptable from the viewpoint of the final result. The main driver of the modelling simplification is the MS Excel environment used as the computation platform, and the limitation of time for grid modelling.
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Voltage Conditions in Low Voltage Grid with Connected Mictogeneration
PublikacjaThe introduction of distributed generation into a low voltage grid may cause voltage problems in it. The paper discusses the effect of microgeneration on voltage levels in a low voltage grid. A real low voltage grid of considerable length was selected for the analysis. The grid primarily supplies residential buildings in a rural area. Results of tests that consider potential measures which could be applied in this grid to improve...
-
Rectangular Waveguide Filters Based on Deformed Dual-Mode Cavity Resonators
PublikacjaIn this paper, a novel design for rectangular waveguide filters with deformed dual-mode (DM) cavity resonators is demonstrated. The new resonant cavity shape is a result of applying shape deformation to the basic rectangular cavity to enable its dual-mode operation. Internal coupling between the two orthogonal cavity modes is realized by geometry deformation, eliminating the need for additional coupling elements. The designs are...
-
2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Standards on Cyber Security Assessment of Smart Grid
PublikacjaSecurity evaluation of communication systems in smart grid poses a great challenge to the developers and operators. In recent years many new smart grid standards were proposed, which paradoxically results in the difficulty in finding a relevant publication in this plethora of literature. This paper presents the results of a systematic analysis which aimed at addressing this issue by identifying standards that present sound security...
-
Standing Waves in a Rectangular Resonator Containing Acoustically Active Gases
PublikacjaThe distribution of perturbations of pressure and velocity in a rectangular resonator is considered. A resonator contains a gas where thermodynamic processes take place, such as exothermic chemical reaction or excitation of vibrational degrees of a molecule’s freedom. These processes make the gas acoustically active under some conditions. We conclude that the incident and reflected compounds of a sound beam do not interact in the...
-
Comprehensive distortion compensation of grid-connected inverter currents
PublikacjaThe paper presents a comprehensive approach to the compensation of phase current distortion of grid-connected power inverters. Four different sources of current distortion are addressed: imperfect grid synchronization caused by the distortion in the grid voltages, voltage fluctuations in the dc link, time delays in the estimation of grid voltages, and the distortion of inverter output voltages due to dead-time effects and related...
-
Toward knowledge-grid model for academic purposes
PublikacjaNowadays we face a huge amount of data and information sharing on the Web by different users worldwide. For example, the academic environment is one of such places where teachers share and manage knowledge for groups of students. This paper proposes a multi-dimensional knowledge space model, designed to distribute and manage knowledge resources efficiently. We view our model as a foundation of a knowledge grid platform. Two crucial...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
On the metric dimension of corona product graphs
PublikacjaWe give several results on the metric dimension of corona product graphs.
-
comparison of circular and rectangular narrow esps with longitudinal wire electrode
PublikacjaDiesel engines emit fine particles, which are harmful to human and animal health. There are several methods for decrease particulate emission from a diesel engines, but up to now, these methods are not enough effective or very expensive. An electrostatic precipitation was proposed as an alternative method for control of a diesel particulate emission. Therefore, narrow electrostatic precipitators (ESPs) have become a subject of...
-
Quality Modeling in Grid and Volunteer-Computing Systems
PublikacjaA model of computational quality in large-scale computing systems was presented in the previous chapter of this book. This model describes three quality attributes: performance, reliability and energy efficiency. We assumed that all processes in the system are incessantly ready to perform calculations and that communication between the processes occurs immediately. These assumptions are not true for grid and volunteer computing...
-
Edge and Pair Queries-Random Graphs and Complexity
PublikacjaWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Theory and Applications of Graphs
Czasopisma -
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Colorings of the Strong Product of Circulant Graphs
PublikacjaGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
Non-isolating bondage in graphs
PublikacjaA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
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...
-
Comprehensive compensation of grid current distortion by shunt active power filters
PublikacjaThe paper presents a comprehensive approach to the compensation of grid current distortion in shunt active power filter systems. Four sources of current distortion are addressed: imperfect grid synchronization caused by the distortion in the grid voltages, time delays in the evaluation of grid voltages and computation of compensating currents, fluctuations of the dc bus voltage, and the distortion of inverter output voltages due...
-
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly 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. In this version every player...
-
Standards with cybersecurity controls for smart grid - A systematic analysis
PublikacjaIn recent years numerous standards related to the cybersecurity of smart grids have been published, which led to the challenge for operators in obtaining indications that match their specific objectives and contexts. Although several studies approached this problem by providing more or less comprehensive surveys and overviews of smart grid cybersecurity standards, none of them was dedicated to the actual and important subject of...
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid
PublikacjaConsider an orthogonal grid of streets and avenues in a Manhattan-like city populated by stationary sensor modules at some intersections and mobile robots that can serve as relays of information that the modules exchange, where both module-module and module-robot communication is limited to a straight line of sight within the grid. The robots are oblivious and move asynchronously. We present a distributed algorithm that, given...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
A Review of Standards with Cybersecurity Requirements for Smart Grid
PublikacjaAssuring cybersecurity of the smart grid is indispensable for the reliable operation of this new form of the electricity network. Experts agree that standardised solutions and practices should be applied in the first place. In recent years many new standards for smart grids have been published, which paradoxically results in the difficulty of finding a relevant publication in this plethora of literature. This paper presents results...
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
Mersenne Number Finding and Collatz Hypothesis Verification in the Comcute Grid System
PublikacjaIn this chapter, some mathematic applications have been described to test scalability of the Comcute grid system. Especially, a verification of the Collatz hypothesis and finding Mersenne numbers were applied to prove the scalability and high performance of this grid system. Results were compared with outcomes obtained by the other grid systems.
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
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...
-
Internetowe systemy przetwarzania rozproszonego typu grid w zastosowaniach biznesowych
PublikacjaSkoncentrowano się na możliwościach wykorzystania oraz integracji rozproszonych mocy obliczeniowych komputerów Internautów w globalnej sieci www. Zaprezentowano paradygmaty sieciowego przetwarzania typu grid computing oraz volunteer computing. Podkreślono istotność tego typu przetwarzania w zagadnieniach wymagających bardzo dużych mocy obliczeniowych. Zaprezentowano przykłady rozwiązań systemowych tego typu: system BOINC, będący...
-
A Paradigm for HV, MV, LV Distribution Grid Development Planning
PublikacjaIn the literature, including that relating to businesses in the energy (and power) sector, the concept of these organizations’ operating paradigm may be found. The paper discusses the concept of the paradigm, with a focus on the power grid development planning paradigm. Against this background, issues related to energy security and power systems development trends and problems are presented. A new paradigm is proposed for distribution...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
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.
-
Application of PL-Grid Platform for Modeling of the Selected Acoustic Phenomena
PublikacjaDomain grids are specific computational environments, developed within the PLGrid Plus project. For the Acoustic domain grid two supercomputer grid based services were prepared. Dedicated software consists of the outdoor sound propagation module and psychoacoustical noise dosimeter. The results are presented in a form of maps of sound level and Temporary Threshold Shift (TTS) values, therefore the services may play an informative...
-
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...
-
Genetic Programming for Workload Balancing in the Comcute Grid System
PublikacjaA genetic programming paradigm is implemented for reliability optimization in the Comcute grid system design. Chromosomes are generated as the program functions and then genetic operators are applied for finding Pareto-suboptimal task assignment and scheduling. Results are compared with outcomes obtained by an adaptive evolutionary algorithm.
-
Block graphs with large paired domination multisubdivision number
PublikacjaThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Graphs hard-to-process for greedy algorithm MIN
PublikacjaWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
Estimation of the Maximum Permissible PV Power to be Connected to the MV Grid
PublikacjaIn recent decades, a significant increase in the share of renewable energy sources in power grids at various voltage levels has been observed. A number of articles have been published highlighting emerging problems in low-voltage grids with a large share of prosumers and in medium- and high-voltage grids to which photovoltaic (PV) plants are connected. The article analyzes the medium-voltage grid in terms of the possibility of...
-
An Analysis of Probe-Fed Rectangular Patch Antennas With Multilayer and Multipatch Configurations on Cylindrical Surfaces
PublikacjaA multi-patch configuration of probe-fed rectangular microstrip antennas mounted on a cylindrical body, with electrically small radius, with an arbitrary number of substrate and superstrate layers is investigated in this paper. A full-wave analysis and a moment-method calculation are employed. A unified procedure for creating proper matrices for the investigated geometry of the structure is outlined here. Numerical results for...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
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),...
-
Non-isolating 2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
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.
-
Optymalizacja równoważenia obciążeń w systemach klasy grid
PublikacjaZaprezentowano techniki równoważenia obciążeń testowane w systemie rozproszonym Comcute o architekturze typu grid. Omówiono niezbędne uwarunkowania środowiska prowadzenia obliczeń w zestawie laboratoryjnym Politechniki Gdańskiej, a także odniesiono się do kryteriów kierunkujących równoważenie obciążeń. Przedstawiono wielopoziomową metodę równoważenia obciążeń.
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
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.
-
Power Electronic Transformer For Smart Grid Application
PublikacjaIn this paper the control system of Power Electronic Transformer (PET) for the Smart Grid application is proposed. The structure of PET is based on two Cascaded H-bridge (CHB) converters. The electrical energy is transferred between converters using Dual-Active-Bridges (DAB) and high-frequency transformers. This type of coupling has been used to connect the DC-links of all H-bridges. The proposed control system for PET makes it...
-
Foundations of Grid Processing Architecture for the Comcute System
PublikacjaFundamental system algorithms and structures implemented in the Comcute system are described and analysed in detail. Layered architecture of the system model is highlighted. System tasks of the layers are elaborated, presented and described. Operational details of communication interfaces among layers are worked out and examined. The focus is put onto implemented system components with regard to their operability and efficiency....
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Frequently updated noise threat maps created with use of supercomputing grid
PublikacjaAn innovative supercomputing grid services devoted to noise threat evaluation were presented. The services described in this paper concern two issues, first is related to the noise mapping, while the second one focuses on assessment of the noise dose and its influence on the human hearing system. The discussed services were developed within the PL-Grid Plus Infrastructure which accumulates Polish academic supercomputer centers....
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
An Overview of Bidirectional EV Chargers: Empowering Traction Grid-Powered Chargers
PublikacjaIn recent years, the number of electric vehicles has been at least doubling year after year. As a result, today electric vehicles already account for approximately 10% of the global automotive market, which positively affects environment in urbanized areas. However, to take full advantage of the EV integration it is necessary to use renewable sources for their charging; optimally place charging stations/terminals; optimally manage...
-
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe 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.
-
Parity vertex colouring of graphs
PublikacjaA 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...
-
Dobór elementów instalacji fotowoltaicznych - instalacje on-grid
PublikacjaObecnie instalacje fotowoltaiczne dołączone do sieci stanowią 72% wszystkich systemów fotowoltaicznych.System PV podłączony do sieci elektroenergetycznej wytwarza energię, która jest w sposób ciągły przekazywana do sieci, co (przeciwnie niż w instalacjach off-grid) pozwala na całkowite niedopasowanie liczby zamontowanych w instalacji modułów fotowoltaicznych do zapotrzebowania obiektu na energię elektryczną. W efekcie instalacja...
-
Image Processing Techniques for Distributed Grid Applications
PublikacjaParallel approaches to 2D and 3D convolution processing of series of images have been presented. A distributed, practically oriented, 2D spatial convolution scheme has been elaborated and extended into the temporal domain. Complexity of the scheme has been determined and analysed with respect to coefficients in convolution kernels. Possibilities of parallelisation of the convolution operations have been analysed and the results...
-
An Analysis of Elliptical-Rectangular Multipatch Structure on Dielectric-Coated Confocal and Nonconfocal Elliptic Cylinders
PublikacjaA rigorous analysis of the resonance frequency problem of an elliptical-rectangular microstrip structure mounted on dielectric-coated elliptic conducting cylinder, with electrically small radius, is investigated in this paper. A full-wave analysis and a moment-method calculation are employed. The analysis is carried out considering the expansion of the field as a series of Mathieu functions. The complex resonance frequencies of...
-
Use of AMI Meters in the Process of Low Voltage Grid Optimization
PublikacjaThis is a report of a project involving, inter alia, low voltage grid performance optimization with data from AMI meters . The study was supported with a European UPGRID grant, and executed by a consortium of companies from seven European countries, including Poland .
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
SMART GRID TECHNOLOGIES IN ELECTRIC POWER SUPPLY SYSTEMS OF PUBLIC TRANSPORT
PublikacjaNowadays the issue of electric energy saving in public transport is becoming a key area of interest which is connected both with a growth in environmental awareness of the society and an increase in the prices of fuel and electricity. It can be achieved by improving the usage of regenerative breaking. In 2016 the Przedsiębiorstwo Komunikacji Trolejbusowej (PKT, Trolleybus Transport Company) in Gdynia began practical implementation...
-
Single-phase power electronics transformer with active functions for smart grid
PublikacjaThis paper presents the control of one cell of a modular single-phase power electronics transformer with active functions for meeting the smart grid concept. In this way, the converter could be used not only as a conventional transformer but also for grid such as reactive power, harmonic elimination and energy storage. The topology of the cell is composed by a bidirectional converter with three stages: a half bridge in the input...
-
Some Optimization Methods for Simulations in Volunteer and Grid Systems
PublikacjaIn this chapter, some optimization methods have been presented for improving performance of simulations in the volunteer and grid computing system called Comcute. Some issues related to the cloud computing can be solved by presented approaches as well as the Comcute platform can be used to simulate execution of expensive and energy consuming long-term tasks in the cloud environment. In particular, evolutionary algorithms as well...
-
The paired-domination and the upper paired-domination numbers of graphs
PublikacjaIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Design of Frequency-Reconfigurable Branch-Line Crossover Using Rectangular Dielectric Channels
PublikacjaThis paper presents an efficient yet straightforward passive reconfiguration technique to tune the operating frequency of a branch-line crossover (BLCO). The underlying principle is to fill rectangular dielectric channels (RDCs) prepared beforehand with either air or materials of different relative permittivity. Two configurations (one RDC and three RDCs in each arm) of the branch-line crossover are employed to estimate the tunability...