Wyszukiwarka
Filtry
wszystkich: 900
-
Katalog
- Publikacje 742 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 5 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 97 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: RECTANGULAR GRID GRAPHS
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Highly-Miniaturized Self-Quadruplexing Antenna Based on Substrate-Integrated Rectangular Cavity
PublikacjaThis paper introduces a novel self-quadruplexing antenna (SQA) architecture using a substrate-integrated rectangular cavity (SIRC) for compact size, wide-frequency re-designability, and high isolation responses. The proposed SQA is developed by engraving two U-shaped slots (USSs) on the top conductor of the SIRC. The USSs are excited by employing four microstrip feedlines to achieve self-quadruplexing antenna characteristics. The...
-
Synchronous black hole search in directed graphs
PublikacjaThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
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 Impact of Micro-Sources on Voltage Distortions in a Power Grid
PublikacjaThe increase in the number of photovoltaic (PV) systems integrated with low voltage (LV) grids has led to a great need to analyse the impact of these systems on the quality of electricity and the reliability of its supply. This paper presents and compares the energy quality requirements imposed by various countries on photovoltaic plants. Then, based on real object tests and simulation in DIgSILENT PowerFactory, the impact has...
-
Genetic Positioning of Fire Stations Utilizing Grid-computing Platform
PublikacjaA chapter presents a model for determining near-optimal locations of fire stations based on topography of a given area and location of forests, rivers, lakes and other elements of the site. The model is based on principals of genetic algorithms and utilizes the power of the grid to distribute and execute in parallel most performance-demanding computations involved in the algorithm.
-
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...
-
Evaluation of Open Source SIEM for Situation Awareness Platform in the Smart Grid Environment
PublikacjaThe smart grid as a large-scale system of systems has an exceptionally large surface exposed to cyber-attacks, including highly evolved and sophisticated threats such as Advanced Persistent Threats (APT) or Botnets. When addressing this situation the usual cyber security technologies are prerequisite, but not sufficient. The smart grid requires developing and deploying an extensive ICT infrastructure that supports significantly...
-
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...
-
Sieciowe systemy przetwarzania rozproszonego typu GRID – rozwiązania systemowe oraz przykłady aplikacyjne
PublikacjaZaprezentowano możliwości wykorzystania oraz integracji rozproszonych mocy obliczeniowych komputerów Internautów w globalnej sieci www. Pokazano paradygmaty internetowego przetwarzania rozproszonego typu grid computing oraz volunteer computing. Zwrócono uwagę na istotność tego typu przetwarzania w rozwiązywaniu zagadnień wymagających bardzo dużych mocy obliczeniowych. Pokazano reprezentatywne przykłady rozwiązań systemowych tego...
-
Modified sliding mode control for seamless integration of P.V. energy in A.C. grid
PublikacjaSolar energy is a potentially abundant and reliable source of renewable energy. While it can undoubtedly increase grid reliability and efficiency, the inverted voltage generated from PV. sources may introduce distortion into the AC. grid. The proposed control mechanism, modified sliding mode control (MSMC), can seamlessly integrate the inverter output generated by obtaining DC. voltage from the boost converter linked with the PV....
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublikacjaMotivated 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
PublikacjaA 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
PublikacjaIn 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.
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe 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...
-
Average distance is submultiplicative and subadditive with respect to the strong product of graphs
PublikacjaWe 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.
-
Compact, Order Extensible and Wide-Stopband Bandpass Filter Based on SIW Cavity with Rectangular Ring Slot
PublikacjaThis 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....
-
Smart grid technologies in electric traction: Mini inverter station
PublikacjaThe 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...
-
Wybrane rozwiązania występujące w architekturach systemów rozproszonych klasy grid
PublikacjaOpisano 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.
-
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.
-
Automatic evaluation of information credibility in Semantic Web and Knowledge Grid
PublikacjaThis 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:...
-
Towards Increasing Density of Relations in Category Graphs
PublikacjaIn 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...
-
Rectangular waveguides with posts of negative isotropic media
PublikacjaWykorzystują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
PublikacjaMetodę 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
PublikacjaGiven 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...
-
Induction Generator with Direct Control and a Limited Number of Measurements on the Side of the Converter Connected to the Power Grid
PublikacjaThe 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...
-
Efektywne zrównoleglanie obliczeń w systemie klasy grid na przykładzie hipotezy Collatza
PublikacjaZaprezentowano 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
PublikacjaSince 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.
-
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.
-
Distributed Evacuation in Graphs with Multiple Exits
PublikacjaWe 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
PublikacjaThe 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
Publikacja -
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublikacjaA 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...
-
IET Smart Grid
Czasopisma -
Journal of Grid Computing
Czasopisma -
Distributed Detection of Selected Features in Data Streams Using Grid-class Systems
PublikacjaThis 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
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 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
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 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
PublikacjaThe 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,...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe 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...
-
A Compact Self-Hexaplexing Antenna Implemented on Substrate-Integrated Rectangular Cavity for Hexa-Band Applications
PublikacjaThis 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...
-
The Application Of A Noise Mapping Tool Deployed In Grid Infrastructure For Creating Noise Maps Of Urban Areas
PublikacjaThe 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...
-
Propagation in Rectangular Waveguides Periodically Loaded with Cylindrical Posts.
PublikacjaAnaliza 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.
PublikacjaW 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.
-
Dc Leakage Current in Isolated Grid-Connected dc Nanogrid - Origins and Elimination Methods
PublikacjaThe LV dc system is a relatively new trend in the distribution sector, which seems to grow widely in the near future due to its promising advantages. In this context, LV dc protection and grounding are challenging issues. Although the galvanically isolated connection mode of dc nanogrid to the ac grid has high reliability, the leakage current can still be injected into the ac grid through the interwinding capacitors and the insulation...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider 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...
-
Techniki audytowania zabezpieczeń sieci bezprzewodowej z wykorzystaniem systemów klasy grid
PublikacjaZaprezentowano 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
PublikacjaArtificial 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...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis 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...
-
Meta-computations on the CLUSTERIX Grid
Publikacja