Filters
total: 2605
displaying 1000 best results Help
Search results for: DISCRETE-EVENT SIMULATION
-
Ships Shore Service Optimization Using the Queueing Theory
Publication -
Geometric methods in dynamical systems modelling: electrical, mechanical and control systems
PublicationRozważono zagadnienia modelowania systemów dynamicznych z zastosowaniem metod geometrii różniczkowej. Równania dynamiczne otrzymano w postaci inkluzji różniczkowych. Przestrzenie konstytucyjne przyjęto w postaci subwiązek włóknistych. Rozważono przestrzenie konstytucyjne układów elektrycznych, układów mechanicznych i układów sterowania. Podstawowe wyniki pracy dotyczą struktury przestrzeni rozwiązań rozważanych systemów.
-
Robust design in delta domain for SISO plants: PI and PID controllers
PublicationW pracy przedstawiono zunifikowaną metodę numerycznie odpornej syntezy sterowników (regulatorów) działających w dyskretnym czasie w układach sterowania skalarnymi obiektami czasu ciągłego. Wykorzystano dyskretnoczasowe modele takich obiektów, oparte na tak zwanym operatorze delta, charakteryzującym się korzystnymi odpornościowymi cechami w przypadku stosowania dostatecznie małych wartości okresu próbkowania przetwarzanych sygnałów....
-
Conceptual system development in a concurrent environment
PublicationW artykule omówiono możliwości wspomagania jednego z najważniejszych obszarów projektowania, a mianowicie projektowania koncepcyjnego. Rozważania te odniesiono do otoczenia inżynierii wspozadaniowej, co dodatkowo skomplikowano problemy decyzyjne podejmowane na tym etapie projektowania. Zaproponowano szereg elementów wspomagania projektowania koncepcyjnego ze szczególnym uwzględnieniem możliwości praktycznej implementacji takiego...
-
I-lossless factorisations for robust H-inf-control in delta-domain
Publication...
-
Non-regular, incomplete and singular dynamical systems: impasse points indynamical systems
PublicationRozważono nieregularne, niezupełne i osobliwe różniczkowe systemy dynamicznez zastosowaniem metod geometrii różniczkowej.
-
Robust pole placement in delta domain for SISO plans
Publication...
-
Qualitative and quantitative mechanisms in managing IT projects in concur-rent engineering environment
PublicationW artykule przedstawiono wprowadzenie do twardych i miękkich moetod modelowania. Nastepnie wprowadzono czytelnika do obszaru inżynierii równoległej (współzadaniowej). Całość zaproponowano jakośrodowisko wspomagania decyzji w procesach zarządzania złożonymi międzynarodowymi projektami badawczymi w obszaru Information Technology.
-
Simulations of Shear Zones and Cracks in Engineering Materials Using eXtended Finite Element Method
PublicationNumerical simulations of cracks and shear zones in quasi-brittle materials are presented. Extended Finite Element Method is used to describe both cracks and shear zones. In a description of tensile cracks, a Rankine criterion is assumed. A discrete Mohr-Coulomb law is adopted for simulations of shear zones. Results of simple numerical tests: unixial tension, bending and biaxial compression are demonstrated.
-
The Rayleigh model of the multipath fading channel
Open Research DataThe dataset contains the results of simulations that are part of the research on modelling the multipath fading in the communication channel. The Rayleigh fading envelope is generated using the Monte-Carlo simulation (MCS) in the LabVIEW programming environment.
-
The α-µ model of the multipath fading channel
Open Research DataThe dataset contains the results of simulations that are part of the research on modelling the multipath fading in the communication channel. The envelope of the α-µ fading process is generated using the Monte-Carlo simulation (MCS) in the LabVIEW programming environment.
-
Real-time simulator of agricultural biogas plant
PublicationThis article presents a real-time simulator of an agricultural biogas plant. The project contains biogas and biomass circuits simulation, as well as heating circuit simulation with a complete control system and visualization interface of the whole process. The software tool used to simulate the plant work is CFD (Computational Fluid Dynamics), which enables a user to create and test simulation objects based on fundamental physical...
-
Automatic detection of abandoned luggage employing a dual camera system
PublicationA system for automatic detection of events using a system of fixed and PTZ (pan-tilt-zoom) cameras is described. Images from the fixed camera are analyzed by means of object detection and tracking. Event detection system uses a set of rules to analyze data on the tracked moving objects and to detect defined events. A PTZ camera is used to obtain a detailed view of a selected object. A procedure for conversion between the pixel...
-
Cartographic Representation of Route Reconstruction Results in Video Surveillance System
PublicationThe video streams available in a surveillance system distributed on the wide area may be accompanied by metadata are obtained as a result of video processing. Many algorithms applied to surveillance systems, e.g. event detection or object tracking, are strictly connected with localization of the object and reconstruction of its route. Drawing related information on a plan of a building or on a map of the city can facilitate the...
-
Public Perception of Intangible Benefits and Costs in the Valuation of Mega Sports Events: The Case of Euro 2012 in Poland
PublicationThis article estimates the intangible benefits and costs of Euro 2012 in Poland. Using the contingent valuation method (CVM), a study was conducted among residents of all four host regions of the event and one nonhost region. This provided the basis for determining the net intangible benefit arising from Poland’s hosting of the European football championships (Euro 2012), which was estimated at 5.3 billion PLN2012. The aggregate...
-
Short-Term Price Reaction to Filing for Bankruptcy and Restructuring Proceedings—The Case of Poland
PublicationThis study aims to check market reaction to filing for bankruptcy and restructuring proceedings and to verify the short-term effect of a price reversal in the Polish market in the years 2004–2019. The research was conducted by dividing the analysed companies according to the procedure (bankruptcy and restructuring) and market (the main market and the NewConnect market). The research methodology used in the study is the event analysis...
-
Marine traffic risk modelling – an innovative approach and a case study
PublicationThis paper presents a model to analyse the risk of two common marine accidents: collision and grounding. Attention is focused on oil tankers since they pose the highest environmental risks. A case study in selected areas of the Gulf of Finland in ice-free conditions is presented. The model utilizes a formula for risk calculation that considers both the probability of an unwanted event and its consequences. The model can be decomposed...
-
A Stand for Measurement and Prediction of Scattering Properties of Diffusers
PublicationIn this paper we present a set of solutions which may be used for prototyping and simulation of acoustic scattering devices. A system proposed is capable of measuring sound field. Also a way to use an open source solution for simulation of scattering phenomena occurring in proximity of acoustic diffusers is shown. The result of our work are measurement procedure and a prototype of the simulation script based on FEniCS - an open source...
-
Comments on “Closed Form Variable Fractional Time Delay Using FFT”
PublicationIn this letter drawbacks of the aforementioned paper are pointed out. The proposed approach is improved with minor modifications of the discrete frequency response. This allows for design of fractional delay filters which are close to optimal and can be efficiently implemented in the frequency domain using the sliding DFT based structure. Alternatively, the derived equivalent closed form formulae for offset windows can be used...
-
Koncepcja, modelowanie i symulacja układu napędowego prototypu samochodu elektrycznego "ELV001"
PublicationAbstract: In this paper a conception, modelling and simulation tool for drive system of the prototype electric vehicle ''ELV001'' have been presented. The design and building of this vehicle have been carried out in frame of the project: ''Building a market of electric vehicle and charging infrastructure - fundamentals of energy safety''. The simulation tools are of great assistance to engineers and researchers to reduce product-development...
-
Paweł Rościszewski dr inż.
PeoplePaweł Rościszewski received his PhD in Computer Science at Gdańsk University of Technology in 2018 based on PhD thesis entitled: "Optimization of hybrid parallel application execution in heterogeneous high performance computing systems considering execution time and power consumption". Currently, he is an Assistant Professor at the Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Poland....
-
A comparison of geometric analogues of holographic reduced representations, original holographic reduced representations and binary spatter codes
PublicationGeometric Analogues of Holographic Reduced Representations (GA HRR) employ role-filler binding based on geometric products. Atomic objects are real-valued vectors in n-dimensional Euclidean space and complex statements belong to a hierarchy of multivectors. The paper reports a battery of tests aimed at comparison of GA HRR with Holographic Reduced Representation (HRR) and Binary Spatter Codes (BSC). Firstly, we perform a test of...
-
Euro 2012 economic impact on host cities in Poland
PublicationThe UEFA European Championship (Euro) is among the world's most important sporting events staged nowadays. Apart from tremendous excitement among football fans, such a major event has a number of other implications, above all of economic nature. This study, as one of the few concerned with the Polish circumstances, is intended to determine what significance should be attributed to stage the Euro 2012 in Polish host cities. aware...
-
Edge ranking and searching in partial orders
PublicationArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Forwarding and optical indices of a graph
PublicationW pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.
-
Total outer-connected domination numbers of trees
PublicationNiech G=(V,E) będzie grafem bez wierzchołków izolowanych. Zbiór wierzchołków D nazywamy zbiorem dominującym totalnym zewnętrznie spójnym jeżli każdy wierzchołek grafu ma sąsiada w D oraz podgraf indukowany przez V-D jest grafem spójnym. Moc najmniejszego zbioru D o takich własnościach nazywamy liczbą dominowania totalnego zewnątrznie spójnego. Praca m.in. zawiera dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego...
-
A note on the strength and minimum color sum of bipartite graphs
PublicationSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
A note on the weakly convex and convex domination numbers of a torus
PublicationW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
A note on total reinforcement in graphs
PublicationIn 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.
-
The complexity of the T-coloring problem for graphs with small degree
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
Compact scheduling of zero–one time operations in multi-stage systems
Publication -
Open shop problem with zero-one time operations and integer release date/deadline intervals
Publication -
On the deficiency of bipartite graphs
Publication -
A polynomial algorithm for finding T-span of generalized cacti
Publication -
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn 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...
-
Interval incidence coloring of bipartite graphs
PublicationIn 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...
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
A station strategy to deter backoff attacks in IEEE 802.11 LANs
PublicationDla konstrukcji strategii zapobiegającej atakom na mechanizm odczekania w sieciach lokalnych IEEE 802.11 zastosowano wybór konfiguracji MAC sterowany przez liczniki etapów gry z losowymi wartościami początkowymi. Wykazano, że przy pewnych warunkach nałożonych na rozkady prawdopodobieństwa liczników standardowe ustawienia parametrów MAC stają się punktem doskonałej równowagi strategicznej.
-
Easy and hard instances of arc ranking in directed graphs
PublicationArtykuł dotyczy uporządkowanego kolorowania łuków grafów skierowanych. Problem polega na takim przyporządkowaniu liczb łukom digrafu, aby każda skierowana ścieżka łącząca dwa łuki o tej samej liczbie (kolorze) zawierała łuk o kolorze wyższym. Praca podaje liniowy optymalny algorytm dla pewnego szczególnego przypadku, oraz zawiera dowód, iż problem ten jest obliczeniowo trudny dla 3-dzielnych acyklicznych digrafów i stałej liczby...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublicationW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
The complexity of the T-coloring problem for graphs with small degree.
PublicationW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
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...