Wyszukiwarka
Filtry
wszystkich: 849
-
Katalog
- Publikacje 702 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....
-
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 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)...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...