Search
Filters
total: 2652
displaying 1000 best results Help
Search results for: DISCRETE-EVENT SIMULATION
-
Protection System Design of Induction Motor for Industries
PublicationThe fundamental and durable structures of induction motor, as well as their low manufacturing cost, make them popular components in a wide range of current applications. Providing a safety net for employees is a must-have for businesses. This project’s motivation for improvement is to provide industrial motors, lift motors, pumps, and so on with safety. An induction motor’s primary goal is to protect it from problems, such as...
-
Network society: a concept of smart information management
PublicationAutomatic enhancement of Internet broadcasted news has been recently gaining increasing importance and interest. Existing applications and models of textual Event Detection in online media are based on the analysis of news distributed via RSS (Rich Site Summary called also Really Simple Syndication) channels or available at news websites. It assumes that each piece of news is equally available to the reader and, therefore, describes...
-
Acoustic Detector of Road Vehicles Based on Sound Intensity
PublicationA method of detecting and counting road vehicles using an acoustic sensor placed by the road is presented. The sensor measures sound intensity in two directions: parallel and perpendicular to the road. The sound intensity analysis performs acoustic event detection. A normalized position of the sound source is tracked and used to determine if the detected event is related to a moving vehicle and to establish the direction of movement....
-
Total restrained domination numbers of trees
PublicationOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Paired bondage in trees
PublicationW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
Greedy T-colorings of graphs
PublicationTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublicationW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
The circular chromatic index of some class 2 graphs
PublicationW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Interval vertex-coloring of a graph with forbidden colors
Publication -
A linear time algorithm for edge coloring of binomial trees
Publication -
The smallest hard-to-color graph for algorithm DSATUR
Publication -
Consecutive colorings of the edges of general graphs
Publication -
Interval edge coloring of a graph with forbidden colors
Publication -
The smallest hard-to-color graph for the SL algorithm
Publication -
On Directed Lattice Paths With Vertical Steps
Publication -
Enumerations of Plane Trees with Multiple Edges and Raney Lattice Paths
Publication -
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Strategic balance in graphs
PublicationFor 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,...
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
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...
-
Topological degree for equivariant gradient perturbations of an unbounded self-adjoint operator in Hilbert space
PublicationWe present a version of the equivariant gradient degree defined for equivariant gradient perturbations of an equivariant unbounded self-adjoint operator with purely discrete spectrum in Hilbert space. Two possible applications are discussed.
-
PROBABLE RAINFALL IN GDAŃSK IN VIEW OF CLIMATE CHANGE
PublicationOne of the manifestations of climate changes is the occurrence of a greater number of precipitation events, characterized by greater rain intensity that affects the economic stability of cities. Gdańsk is an example of a city in which such events have occurred since the beginning of the twenty-first century. Due to the altitude differences in the area of Gdańsk city (between –2 m and 180 m a.s.l.), the occurrence of extreme atmospheric...
-
Karol Niklas dr hab. inż.
PeopleKarol NIKLAS is a university professor at Gdansk University of Technology (Faculty of Mechanical Engineering and Ship Technology, Institute of Naval Architecture). He defended his master's thesis on Naval Architecture, specialty Design of vessels and yachts in 2007. In 2008, he completed postgraduate studies in the specialty 'Novel Simulation Methods in Engineering' at the Faculty of Applied Physics and Mathematics. In 2014 awarded...
-
Analiza porównawcza sposobów wyznaczania obciążeń wiatrem na podstawie norm projektowych i analizy przepływu CFD
PublicationW pracy poruszono tematykę wykorzystania analizy przepływu CFD do wyznaczania obciążeń wiatru na konstrukcje. Przedstawiono analizę trzech modeli budynków o dachu dwuspadowym o różnych kątach nachylenia, dla których dokonano porównania wielkości współczynników parcia z wynikami dostępnymi w literaurze. Obliczenia analityczne wykonano zgodnie z normą z PN-EN 1991-1-4, natomiast obliczenia numeryczne wykonano w programie R-Wind Simulation....
-
Dynamic analysis of the impact of the wind spectrum according to the theory of Davenport for lightweight structures of the roof in sports hall Czyzyna in Cracow.
PublicationThe main aim of this analysis is to characterize numerical simulations connected with modeling dynamic influence of wind on the lightweight structures of the roof in sports hall – “Czyżyna”. This hall is built in Cracow. The article also involves the proposals of the solutions connected with dynamic influence of the wind – Davenport’s method has been used. These proposals have not been taken into consideration at the detailed engineering...
-
Application of passive acoustic radar to automatic localization, tracking and classification of sound sources
PublicationA concept, practical realization and applications of the passive acoustic radar to automatic localization, tracking and classification of sound sources were presented in the paper. The device consists of a new kind of multichannel miniature sound intensity sensors and a group of digital signal processing algorithms. Contrary to active radars, it does not emit the scanning beam but after receiving surrounding sounds it provides...
-
Video Semantic Analysis Framework based on Run-time Production Rules - Towards Cognitive Vision
PublicationThis paper proposes a service-oriented architecture for video analysis which separates object detection from event recognition. Our aim is to introduce new tools to be considered in the pathway towards Cognitive Vision as a support for classical Computer Vision techniques that have been broadly used by the scientific community. In the article, we particularly focus in solving some of the reported scalability issues found in current...
-
ALLYING SYSTEM THINKING AND SET OF EXPERIENCE KNOWLEDGE STRUCTURE
PublicationThe approach of system thinking is completely different from traditional forms of analysis. Even the ancient meaning of word analysis is “a breaking up”. Set of Experience Knowledge Structure is an atomic record of decision event that can be grouped together and form some form of decision DNA of an organization. The question that this paper is trying to answer in how those concepts can be merged.
-
Collective angst and collective action for progressive city policies: study1
Open Research DataPaweł Adamowicz, the liberal mayor of Gdańsk, died on January 14, 2019, after being stabbed by a man who rushed onstage during a charity event. Three studies were carried out to analyze the predictors of willingness to engage in collective action for the support of the progressive city policies he initiated. In this study 1 (N = 214), the questionnaire,...
-
Robust procedure for flow coefficient calculation. W: Recent advances in simulation, computational methods and soft computing. Ed. W. Nikos, E. Ma-torakis. New York: WSEAS Press**2002 s. 152-155, 5 rys. bibliogr. 7 poz. Krzepka procedura obliczania współczynnika przepływu.
PublicationW pracy przedstawiono efektywne i szybkie metody obliczania współczynnikaprzepływu powietrza na podstawie znanych: stosunku ciśnień statycznych i oporności dźwiekowej (patrz norma ISO6358).
-
Monte Carlo Methods
e-Learning CoursesThis course will introduce the foundations of Monte Carlo simulation methods. Fundamental algorithms will be described. It will be shown how Monte Carlo methods can be used to simulate the transport of energetic particles in condensed matter.
-
Monte Carlo Methods - 2023/24
e-Learning CoursesThis course will introduce the foundations of Monte Carlo simulation methods. Fundamental algorithms will be described. It will be shown how Monte Carlo methods can be used to simulate the transport of energetic particles in condensed matter.
-
Monte Carlo Methods - 2024/25
e-Learning CoursesThis course will introduce the foundations of Monte Carlo simulation methods. Fundamental algorithms will be described. It will be shown how Monte Carlo methods can be used to simulate the transport of energetic particles in condensed matter.
-
Particle Shape Effect on Macroscopic Behaviour of Underground Structures: Numerical and Experimental Study
PublicationThe mechanical performance of underground flexible structures such as buried pipes or culverts made of plastics depend not only on the properties of the structure, but also the material surrounding it. Flexible drains can deflect by 30% with the joints staying tight, or even invert. Large deformations of the structure are difficult to model in the framework of Finite Element Method, but straightforward in Discrete Element Methods....
-
PROPERTIES OF ONE DIMENSIONAL OPEN-CHANNEL STEADY FLOW EQUATIONS
PublicationIn this paper properties of discrete forms of one dimensional steady gradually varied flow equations are discussed. Such forms of flow equations are obtained as a result of approximation of their differential forms, which is required to solve them numerically. For such purpose explicit or implicit numerical approximation schemes for ordinary differential equations can be applied. It turns out that dependently on the chosen approximation...
-
Particle Shape Effect on Macroscopic Behaviour of Underground Structures: Numerical and Experimental Study
PublicationAbstract: The mechanical performance of underground flexible structures such as buried pipes or culverts made of plastics depend not only on the properties of the structure, but also on the material surrounding it. Flexible drains can deflect by 30% with the joints staying tight, or even invert. Large deformations of the structure are difficult to model in the framework of Finite Element Method, but straightforward in Discrete...
-
Modulated crystal structures - periodicity in more than three dimensions
PublicationThe initial definition of a crystal was that it is an object with flat faces. When diffraction studies were developed it turned out that crystal consists of a highly ordered particles and it is possible to isolate a small unique part of their structure - a unit cell - and the definition has been changed to rely on this fact. Nowadays by a crystal we mean any solid having an essentially discrete diffraction diagram. It is because...
-
Hazard Control in Industrial Environments: A Knowledge-Vision-Based Approach
PublicationThis paper proposes the integration of image processing techniques (such as image segmentation, feature extraction and selection) and a knowledge representation approach in a framework for the development of an automatic system able to identify, in real time, unsafe activities in industrial environments. In this framework, the visual information (feature extraction) acquired from video-camera images and other context based gathered...
-
Parametric impulsive noise detector for corrupted audio signals based on hidden Markow model
PublicationThe paper addresses the problem of impulsive noise detection for audio signals. A structure of threshold parameter detectors using modelingof signals was introduced. the algorithm of the noise detection, based on discrete-time hidden Markow model (HMM)of whitened audio signal is elaborated
-
Video content analysis in the urban area telemonitoring system
PublicationThe task of constant monitoring of video streams from a large number of cameras and reviewing the recordings in order to find a specified event requires a considerable amount of time and effort from the system operators and it is prone to errors. A solution to this problem is an automatic system for constant analysis of camera images being able to raise an alarm if a predefined event is detected. The chapter presents various aspects...
-
Międzynarodowa konferencja IATUL Seminar 2019 „Organizacyjne i prawne aspekty Otwartej Nauki” / International IATUL Seminar 2019 "Organizing the Open Science Framework – Strategies and Legal Aspects”
PublicationIATUL Seminar 2019 was held in Gdańsk/Sopot, Poland (December 10-11th, 2019). The theme of the Seminar was „Organizing the Open Science Framework – Strategies and Legal Aspects”. The event was co-organized by Gdańsk University of Technology Library and International Association of University Libraries (IATUL). IATUL Seminar 2019 event attracted delegates, including directors and senior managers of university and research libraries...
-
Hybrid Approach to Networked Control System
PublicationEffcient control of Networked Control System (NCS) is a challenge, as the control methods need to deal with non-deterministic variable delays and data loss. This paper presents a novel hybrid approach to NCS where Model Predictive Control (MPC) is applied as a main controller and implicit switching MPC is used for data transmission control in event-driven shared communication medium, leading to complex control system with active...
-
Collective angst and collective action for progressive city policies: study3
Open Research DataPaweł Adamowicz, the liberal mayor of Gdańsk, died on January 14, 2019, after being stabbed by a man who rushed onstage during a charity event. Three studies were carried out to analyze the predictors of willingness to engage in collective action for the support of the progressive city policies he initiated. We conducted Study 3 to test the model with...
-
The determinants of the Region's and its SMEs' Competitive Position in the Context of Mega Events - the Case of the Euro 2012
PublicationIn this paper a modified Preuss model was used to assess the factors to enhance the competitiveness of the region and the SMEs located in the region. To accomplish the above, six types of event-structure were applied: infrastructure, knowledge, networks, culture, image and emotions. They were described in detail in reference to the case of Euro 2012 in Poland in general and Pomeranian region in particular. Finally the Authors take...