Search
Filters
total: 860
filtered: 713
-
Catalog
Chosen catalog filters
Search results for: RECTANGULAR GRID GRAPHS
-
Smart grid technologies in electric traction: Mini inverter station
PublicationThe growing number of trams and trolleybuses equipped with recuperation systems contribute to the increase in the amount of energy recovered during braking. It raises questions about the possibility of its usage. One of such possibilities is the use of smart grid technology. The paper presents a case study of the use of braking energy in the trolleybus system for external loads by implementing mini inverter stations. Analysis is...
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublicationIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
Compact, Order Extensible and Wide-Stopband Bandpass Filter Based on SIW Cavity with Rectangular Ring Slot
PublicationThis article introduces novel architectures of bandpass filters (BPFs) using a substrate integrated waveguide (SIW) cavity with a rectangular ring slot (RRS) for compact size, extensible order, and broad stopband responses. Two bandpass filters, which demonstrate a second-and a fourth-order Chebyshev response, respectively, are realized by employing identical cavities with RRS, without increasing the physical size of the circuit....
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Wybrane rozwiązania występujące w architekturach systemów rozproszonych klasy grid
PublicationOpisano wybrane rozwiązania występujące w architekturach systemów rozproszonych klasy grid. Odniesiono się do zapewnienia przezroczystości, a także do możliwości zarządzania i kontroli wykorzystania zasobów. Omówiono zasady optymalizacji zarządzania takimi systemami.
-
Average distance is submultiplicative and subadditive with respect to the strong product of graphs
PublicationWe show that the average distance is submultiplicative and subadditive on the set of non-trivial connected graphs with respect to the strong product. We also give an application of the above-mentioned result.
-
Automatic evaluation of information credibility in Semantic Web and Knowledge Grid
PublicationThis article presents a novel algorithm for automatic estimation of information credibility. It concerns information collected in Knowledge Grid and Semantic Web. Possibilities to evaluate the credibility of information in such structures are much greater than those available for WWW sites which use natural language. The rating system presented in this paper estimates credibility automatically on the basis of the following metrics:...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn 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.
-
Induction Generator with Direct Control and a Limited Number of Measurements on the Side of the Converter Connected to the Power Grid
PublicationThe article presents an induction generator connected to the power grid using the AC/DC/AC converter and LCL coupling filter. Three-level inverters were used in the converter, both from the generator side and the power grid side. The algorithm realizing Pulse Width Modulation (PWM) in inverters has been simplified to the maximum. Control of the induction generator was based on the Direct Field-Oriented Control (DFOC) method. At...
-
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Efektywne zrównoleglanie obliczeń w systemie klasy grid na przykładzie hipotezy Collatza
PublicationZaprezentowano problem Collatza oraz sposób jego adaptacji, pozwalający na realizację obliczeń w systemie typu grid. Zidentyfikowano również pożądane cechy problemów obliczeniowych, dzięki którym mogą one zostać zrównoleglone w sposób efektywny w systemach typu grid i porównano je z cechami zadań realizowanych typowo przy użyciu klastrów obliczeniowych.
-
Smart Grid in Practise - Implementation of the Billaterall Supply in Gdynia Trolleybus Network
PublicationSince 2001, trolleybus system in Gdynia has been involved in many activities related to the reduction of power consumption, both in terms of implementation and research and development. In 2011 was introduced the first supercapacitor storage energy system. In PKT started applications of Smart Grid technologies in supply network: the bilateral supply. The paper presents results of these this novel investitions.
-
Rectangular waveguides with posts of negative isotropic media
PublicationWykorzystując metodę dopasowania rodzajów opisano metodykę połączenia zastępczego pola rozproszonego od dowolnej konfiguracji prętów dielektrycznych lub wykonanych z metamateriału z pobudzeniem z falowodu prostokątnego. Zaprezentowano częstotliwościowe charakterystyki macierzy rozproszenia dla rodzaju podstawowego. Zaobserwowano filtrujące własności badanych układów.
-
Characterization of rectangular waveguide with a pseudochiral omega slab
PublicationMetodę dopasowania rodzajów zastosowano do rozwiązania falowodu prostokątnego zawierającego materiał pseudochiralny typy Omega. Zdefiniowano własności rodzajów pola w badanej prowadnicy oraz zauważono wystąpienie efektu przemieszczenia pola. Określono pełnofalową macierz rozproszenia sekcji badanego falowodu oraz porównano wyniki symulacji charakterystyk transmisyjnych sekcji z eksperymentem. W oparciu o uzyskane wyniki dokonano...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor 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.
-
Distributed Evacuation in Graphs with Multiple Exits
PublicationWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
Connection graphs
Publication -
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Distributed Detection of Selected Features in Data Streams Using Grid-class Systems
PublicationThis chapter describes basic methodology of distributed digital signal processing. A choice of distributed methods of detection of selected features in data streams using grid-class systems is discussed. Problems related to distribution of data for processing are addressed. A mitigating method for data distribution and result merging is described.
-
SMART GRID TECHNOLOGIES IN ELECTRIC POWER SUPPLY SYSTEMS OF PUBLIC TRANSPORT
PublicationNowadays 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 reducing the transmission losses in a supply system or by the improving the usage of the regenerative breaking. The article presents an analysis of applying these two options...
-
SMART GRID TECHNOLOGIES IN ELECTRIC POWER SUPPLY SYSTEMS OF PUBLIC TRANSPORT
PublicationNowadays 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 reducing of the transmission losses in supply system or by the improving of the usage of the regenerative breaking. The article presents an analysis of applying these two options...
-
Creating Dynamic Maps of Noise Threat Using PL-Grid Infrastructure
PublicationThe paper presents functionality and operation results of a system for creating dynamic maps of acoustic noise employing the PL-Grid infrastructure extended with a distributed sensor network. The work presented provides a demonstration of the services being prepared within the PLGrid Plus project for measuring, modeling and rendering data related to noise level distribution in city agglomerations. Specific computational environments,...
-
The Application Of A Noise Mapping Tool Deployed In Grid Infrastructure For Creating Noise Maps Of Urban Areas
PublicationThe concept and implementation of the system for creating dynamic noise maps in PL-Grid infrastructure are presented. The methodology of dynamic acoustical maps creating is introduced. The concept of noise mapping, based on noise source and propagation models, was developed and employed in the system. The details of incorporation of the system to the PL-Grid infrastructure are presented. The results of simulations performed by...
-
A Compact Self-Hexaplexing Antenna Implemented on Substrate-Integrated Rectangular Cavity for Hexa-Band Applications
PublicationThis brief introduces a novel architecture of a compact self-hexaplexing antenna (SHA) implemented on a substrate-integrated rectangular cavity (SIRC) for hexa-band applications. The proposed SHA is configured by using an SIRC resonator, two Pi-shaped slots (PSSs), and six 50Ω microstrip feedlines. The PSSs are connected back-to-back and loaded on top of the SIRC resonator to produce six patch radiators (PRs). The PRs are excited...
-
A Framework for Searching in Graphs in the Presence of Errors
PublicationWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Propagation in Rectangular Waveguides Periodically Loaded with Cylindrical Posts.
PublicationAnaliza rozchodzenie się fali elektromagnetycznej w falowodach prostokątnych z okresowo rozmieszczonymi cylindrycznymi obiektami. Wynikiem analizy są stałych rozprzestrzeniania rodzajów Floquet, które uzyskuje się z rozwiązania równania własnego. W artykule przeprowadzone zostało badanie teoretyczne i eksperymentalne struktur prawie-okresowych i ich macierzy rozproszenia. Pokazano również istnienie pasm przewodzących i zaporowych,...
-
Rectangular waveguide junctions with posts of negative isotropic media.
PublicationW pracy przedstawiono wpływ ujemnej przenikalności elektrycznej i magnetycznej rezonatorów cylindrycznych umieszczonych w czteroportowym prostokątnym złączu falowodowym na jego parametry odbicia i transmisji. Wykorzystano zmodyfikowaną procedurę iteracyjną i metodę dopasowania rodzajów w celu określenia macierzy rozproszenia w/w złącza.
-
Techniki audytowania zabezpieczeń sieci bezprzewodowej z wykorzystaniem systemów klasy grid
PublicationZaprezentowano efektywne zasady weryfikacji zabezpieczeń sieci bezprzewodowych z wykorzystaniem oprogramowania Back/Track w dystrybucji systemu Linux. Omówiono algorytmy RC4, MIC i AES, które wspierają techniki zabezpieczeń WEP, WPA i WPA2 wchodzące w skład protokołu IEEW 802.11. Zamieszczano także opis wykorzystania systemu rozproszonego Comcute o architekturze typu grid do prowadzenia audytu bezprzewodowej sieci.
-
Big Data Paradigm Developed in Volunteer Grid System with Genetic Programming Scheduler
PublicationArtificial intelligence techniques are capable to handle a large amount of information collected over the web. In this paper, big data paradigm has been studied in volunteer and grid system called Comcute that is optimized by a genetic programming scheduler. This scheduler can optimize load balancing and resource cost. Genetic programming optimizer has been applied for finding the Pareto solu-tions. Finally, some results from numerical...
-
Meta-computations on the CLUSTERIX Grid
Publication -
Analysis of electromagnetic disturbances in DC network of grid connected building-integrated photovoltaic system
PublicationThis paper focuses on conducted electromagnetic interference (EMI) emissions and propagation in the DC network of grid connected building integrated photovoltaic (PV) system. The investigated PV system, consists of ten solar panels, cabling and the grid-connected one phase inverter. The EMI simulation model of the real PV system has been developed with the aid of impedance analyzer measurements of solar panels and the DC network...
-
Grid-Forming Operation of Energy-Router Based on Model Predictive Control with Improved Dynamic Performance
PublicationThe focus of this study is on the grid-forming operation of the Energy Router (ER) based on Model Predictive Control (MPC). ER is regarded as a key component of microgrids. It is a converter that interfaces the microgrid (s) with the utility grid. The ER has a multiport structure and bidirectional energy flow control. The ER concept can be implemented in Nearly Zero-Energy Buildings (NZEB) to provide flexible energy control. A...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Engineering education for smart grid systems in the quasi-industrial environment of the LINTE^2 laboratory
PublicationSmart grid systems are revolutionising the electric power sector, integrating advanced technologies to enhance efficiency, reliability and sustainability. It is important for higher education to equip the prospective smart grid professional with the competencies enabling them to navigate through the related complexities and drive innovation. To achieve this, interdisciplinary education programmes are necessary, addressing inter...
-
Integration of electric vehicle into smart grid: a meta heuristic algorithm for energy management between V2G and G2V
PublicationRecently, Electric Vehicles (EV) have been providing fast response and substantial progress in the power generation model. Further, EVs are exploited as adaptable Energy Storage Systems (ESSs) and show a promising performance in ancillary service markets to increase the demand of Smart Grid (SG) integration. The expansion of Vehicle-to-Grid concept has created an extra power source when renewable energy sources are not available....
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
On the deficiency of bipartite graphs
Publication -
Named Property Graphs
Publication -
Serialization for Property Graphs
Publication -
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublicationRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
Harmonions Coloring of Graphs.
PublicationProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublicationNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.