Search
Filters
total: 1146
filtered: 881
-
Catalog
- Publications 881 available results
- Journals 15 available results
- People 24 available results
- Inventions 4 available results
- Projects 8 available results
- Research Equipment 11 available results
- e-Learning Courses 16 available results
- Events 10 available results
- Open Research Data 177 available results
Chosen catalog filters
Search results for: VORTEX GENERATORS
-
All graphs with paired-domination number two less than their order
PublicationLet 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...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
2-outer-independent domination in graphs
PublicationWe 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,...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Investigation of the Aerodynamics of an Innovative Vertical-Axis Wind Turbine
PublicationThe paper presents the results of an experimental investigation and a three dimensional numerical analysis of the transient aerodynamic phenomena occurring in the innovative modification of classic Savonius wind turbine. An attempt to explain the increased efficiency of the innovative design a comparison with the traditional solution is undertaken. A vorticity measure based on the integral of the velocity gradient tensor second...
-
An Impact of Environmental Disturbances on Combined Cycle Power Plant Control
PublicationCombined cycle power plants operate at thermal efficiency approaching 60 percent. In the same time their performance presents several problems that have to be addressed. E.g. gas turbines are very sensitive to backpressure exerted on them by the heat recovery steam generators as well as to ambient pressure and temperature.
-
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.
-
3D Hand Shape Modeling for Automatic Assessing Motor Performance in Parkinson's Disease
PublicationIn this paper a method for hand pattern processing to create a 3D hand model is presented. By applying a complete hand armature to the model obtained, an interpolation of three motor tests for an individual Parkinson's disease patient can be performed. To obtain the 3D hand model the top view of the hand from a web cam is analyzed. The hand contour is examined to find characteristic points that allows for dividing hand image into...
-
Independent dynamics of low, intermediate, and high frequency spectral intracranial EEG activities during human memory formation
PublicationA wide spectrum of brain rhythms are engaged throughout the human cortex in cognitive functions. How the rhythms of various frequency ranges are coordinated across the space of the human cortex and time of memory processing is inconclusive. They can either be coordinated together across the frequency spectrum at the same cortical site and time or induced independently in particular bands. We used a large dataset of human intracranial...
-
Graph Decomposition for Memoryless Periodic Exploration
PublicationWe consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...
-
Ruch wirowy wywoływany przez ultradźwięk w płynach z relaksacją
PublicationRozprawa doktorska poświęcona jest badaniu ruchu wirowego wywoływanego przez ultradźwięk w różnych modelach płynów z relaksacją. Ma ona charakter teoretyczny, jednak wykorzystanie uzyskanych dzięki niej wyników może przynieść lepsze zrozumienie ruchu wirowego wywoływanego przez siłę akustyczną. W I rozdziale rozprawy przedstawione zostały ogólne rozważania dotyczące akustyki nieliniowej. Rozdział II dotyczy ruchu wirowego wywoływanego...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
ANALIZA PARAMETRÓW PRZEPŁYWOWYCH CZYNNIKÓW ROBOCZYCH PRZEZ STOPNIE TURBIN GAZOWYCH
PublicationW rozdziale przedstawiono charakterystyki statyczne głównych parametrów turbiny gazowej dla częściowych obciążeń. Przebiegi poszczególnych parametrów podano dla różnych konfiguracji turbin gazowych: jednowałowej napędzającej generator elektryczny i jednowałowej z regulacją kąta ustawienia łopatek sprężarki również napędzającej generator elektryczny oraz dwuwałowej turbiny transportowej. Charakterystyki wyznaczono eksperymentalnie,...
-
Reactive Energy Billing in Operator Tariffs in Poland
PublicationThe paper describes the current method of reactive energy billing in the tariffs of distribution grid operators in Poland. The current solutions are subject to critical assessment. Issues related to the motivation effect of the current solutions on consumers are analysed. Problems that occur in relation with connecting distributed generators to the distribution grid and challenges related to prosumer billing are indicated.
-
The QDMC Model Predictive Controller for the Nuclear Power Plant Steam Turbine Control
PublicationThere are typically two main control loops with PI con trollers operating at each turbo-generator set. In this paper a model predictive controller QDMC for the steam turbine is proposed - instead of a typical PI controller. The QDMC controller utilize a step-response model for the controlled system. This model parameters are determined, based on the simplified and linear model of turbo-generator set, which parameters are identified...
-
Fast Collaborative Graph Exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Investigation of the aerodynamics of an innovative verticalaxis wind turbine
PublicationThis paper presents a preliminary three dimensional analysis of the transient aerodynamic phenomena occurring in the innovative modification of classic Savonius wind turbine. An attempt to explain the increased efficiency of the innovative design in comparison with the traditional solution is undertaken. Several vorticity measures such as enstrophy, absolute helicity and the integral of the velocity gradient tensor second invariant...
-
Revalorisation of the Szewalski’s concept of the law of varying the last-stage blade retraction in a gas-steam turbine
PublicationThe article presents the implementations of the free vortex law to the blade of the last stage of a gas-steam turbine. First, a thermodynamic analysis was carried out, determining the parameters at the inlet, then the number of stages of the high and low-pressure part of the turbine was constructed, together with the kinematics and velocity vectors for subsequent stages of the axial turbine. The last step of article was to take...
-
Design of horizontal axis wind and water turbines
PublicationThe basic hydrodynamic principles of horizontal axis turbines are presented. Computational methods based on vortex theory for design of such turbines and for calculation of their hydro or aerodynamic characteristics are described in detail. These methods are applicable both to wind and water turbines. The influence of detailed turbine geometry on its characteristics is presented. Several practical computational examples of different...
-
Hardware cryptography coprocessor for system on chip soft processor
PublicationW artykule przedstawiono realizację sprzętową i programową szyfrującejo i deszyfrującego algorytmu AES.Obydwie implementacje zostały zralizowane z wykorzystaniem układu Virtex II i przetestowane. Jako kryterium porónawcze wybrano zużycie zasobów układu oraz wydajność. Realizacja sprzętowa wykonuje operację szyfrowania 2 dekady szybcie niż wersja programowa, ale wymaga pięciokrotnie więcej zasobówIn this paper hardware and software...
-
Steam turbines governors in power system restoration process
PublicationThe paper discusses problems related to electric power system restoration process. The turbine controller operating mode influence in small subsystem is analyzed. There are considered abilities, advantages and drawbacks of the controller's two operating modes: power control and speed (frequen-cy) control, to rebuild electric power system from a single generating unit to a few parallel running generators.
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
The influence of SVC on the progress of voltage collapse
PublicationThe article presents the simulation concerning the cooperation of SVC circuit with a generative set in time, when of power system reaches low values which may lead to the fall-out of generator from the synchronous operation.
-
The concept of intergenerational cooperation network - the transfer of knowledge and skills
PublicationThe aim of this article is to present the idea of networking with regard to the exchange of knowledge between generations.
-
Electrohydrodynamic Flow Patterns in a Narrow Electrostatic Precipitator with Longitudinal Wire Electrode for Various Electrode Geometries
PublicationRecently narrow electrostatic precipitators (ESPs) have become a subject of interest because of their possible application in diesel engines. In this paper results of 2-dimensional (2D) Particle Image Velocimetry (PIV) measurements of the flow patterns in a narrow ESP for a various electrode geometries are presented. The PIV measurements were carried out in the observation plane that is perpendicular to the ESP duct. The ESP was...
-
Graph classes generated by Mycielskians
PublicationIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Design and realization of two-operand modular adders in the FPGA
PublicationW pracy zaprezentowano strukturę sumatorów modularnych w środowisku Xilinx z użyciem rodziny układów Virtex-6. Rozważono dwa typy sumatorów, jeden dla modułów 5-bitowych i drugi dla 6-bitowych. Zaprojektowano ich struktury i podano eksperymentalne wyniki implementacji.
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Application of a catalytic combustion sensor (Pellistor) for the monitoring of the explosiveness of a hydrogen-air mixture in the upper explosive limit range
PublicationA new technique is presented for continuous measurements of hydrogen contamination by air in the upper explosive limit range. It is based on the application of a catalytic combustion sensor placed in a cell through which the tested sample passes. The air content is the function of the quantity of formed heat during catalytic combustion of hydrogen inside the sensor. There is the possibility of using the method in industrial installations...
-
Wpływ układów SVC na rozwój awarii napięciowej
PublicationArtykuł prezentuje badania symulacyjne dotyczące wspłpracy układu SVC z zespołem wytwórczym w czasie, gdy napięcie systemu elektroenergetycznego osiąka niskie wartości mogące prowadzić do utraty synchronizmu przez generator synchroniczny.
-
An adaptive fuzzy excitation control for turbogenerators.
PublicationOpracowano rozmyty układ regulacji turbogeneratora. Układ ten spełnia dwie funkcji: utrzymanie napięcia generatora synchronicznego do poziomu zadanego i tłumienia kołysań elektromechanicznych. Parametry rzomytego układu sterowania optymalizowano z wykorzystaniem algorytmów genetycznych.
-
Comparative study of methods for artificial neural network training.
PublicationPrzedstawiono wyniki badań porównawczych następujących metod uczenia sieci neuronowych: propagacji wstecznej błędów, rekursywnej metody najmniejszych kwadratów, metody Zangwill'a i algorytmów ewolucyjnych. Badania dotyczyły projektowania adaptacyjnego regulatora neuronowego napięcia generatora synchronicznego.
-
Ekspertyza przyczyn awarii turbozespołu nr 5 w Elektrowni Turów
PublicationGłównym celem pracy było określenie przyczyn awarii łożysk nr 4 oraz generatora 50WT20H-100 turbozespołu nr 5 Elektrowni Turów. Opisano przebieg zdarzenia oraz opracowano wnioski zawierające przyczyny zaistniałej awarii łożysk.
-
Identification et modélisation d'ordre fractionnaire des machines synchrones fonctionnant comme générateur
PublicationW pracy przedstawiono oryginalny model matematyczny generatora synchronicznego wykorzystujący pochodne rzędów niecałkowitych. W przeciwieństwie do modeli klasycznych, zbudowanych z dużej liczby drabinek R-L, zawiera on impedancje rzędu połówkowego, które pozwalają w dokładny sposób opisać zjawiska indukcji elektromagnetycznej w szerokim zakresie częstotliwości, minimalizując jednocześnie rząd i liczbę parametrów modelu. Zaproponowany...
-
A random signal generation method for microcontrollers with DACs
PublicationA new method of noise generation based on software implementation of a 7-bit LFSR based on a common polynomial PRBS7 using microcontrollers equipped with internal ADCs and DACs and a microcontroller noise generator structure are proposed in the paper. Two software applications implementing the method: written in ANSI C and based on the LUT technique and written in AVR Assembler are also proposed. In the method the ADC results are...
-
Zbiór zadań z odpowiedziami do ćwiczeń z elektroniki. [online]. [dostęp 2009.06.15]. Dostępny w World Wide Web: http://www.ely.pg.gda.pl/kelime/
PublicationZadania obejmowały następującye zagadnienia: bierne elementy nieliniowe, diody , tranzystor bipolarny - układy polaryzacji, tranzystor unipolarny - układy polaryzacji, wzmacniacze oparte na tranzystorze bipolarnym, wzmacniacze operacyjne, wzmacniacze oparte na tranzystorze unipolarnym, źródła prądowe, filtry, generatory.
-
Common Independence in Graphs
PublicationAbstract: 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|...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
A memoryless direct digital synthesizer based on Taylor series approach.
PublicationW pracy rozważono dwa podejścia do projektowania cyfrowego, kwadraturowego generatora syntezy bezpośredniej (DDS). Pierwsze z nich wykorzystuje małą pamięć na próbki jednego okresu bazowej sinusoidy zespolonej o małej szybkości próbkowania i interpolację tej sinusoidy szeregiem Taylora do docelowej, większej szybkości próbkowania. Drugie jest rozwiązaniem bezpamięciowym z bezpośrednią aproksymacją zespolonej sinusoidy za pomocą...
-
Ocena wpływu drgań przekazywanych na budynek przez agregat prądotwórczy
PublicationW artykule opisano zakres badań polowych niezbędnych do określenia poziomu drgań w budynku biurowo-usługowym podczas pracy agregatu prądotwórczego zlokalizowanego na dachu tego budynku. Dokonano oceny szkodliwości pomierzonych drgań na budynek i ludzi, którzy się w nim znajdują. Przedstawiono także krótki przegląd literatury dotyczącej oceny szkodliwości oddziaływań dynamicznych na budynki lub ludzi.
-
Urban Waterfront Regeneration: Origins of the Issue
PublicationThis paper deals with the origins of the issue of urban waterfront regeneration. The process of city-water interface was described with references to the three generations of port structures.
-
Sterowanie mocą bierną maszyny dwustronnie zasilanej w elektrowni wiatrowej
PublicationWartość mocy biernej produkowanej/pobieranej przez park wiatrowy jest wielkością podlegającą sterowaniu a na jej wartość wpływ ma wiele czynników: warunki wiatrowe, struktura parku, długość linii kablowych, rodzaj elektrowni a także algorytm sterowania. Są dwie metody sterowania mocą bierną farmy wiatrowej: pasywna (przez kondensatory i dławiki) i aktywna (przez generator i/lub filtr aktywny). W artykule przedstawiono problemy...
-
Double bondage in graphs
PublicationA 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...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe 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”,...
-
Constructing a map of an anonymous graph: applications of universal sequences
PublicationWe study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...
-
Skutki zwarć łukowych w średnionapięciowych rozdzielnicach okrętowych z izolacją powietrzną
PublicationW artykule scharakteryzowano moc i napięcie łuku, jak również przedstawiono model termodynamiczny służący do obliczania ciśnienia i temperatury gazów w otoczeniu łuku zwarciowego. Przedstawiono przykładowy układ elektrowni okrętowej i zasilania najważniejszych odbiorników na statku do przewozu kontenerów, w tym 600 kontenerów chłodzonych. Na podstawie parametrów prądnic i silników, odbiorników zasilanych z rozdzielnicy głównej...