Search results for: STOCHASTIC OPTIMISATION - Bridge of Knowledge

Search

Search results for: STOCHASTIC OPTIMISATION

Search results for: STOCHASTIC OPTIMISATION

  • Stateczność i niezawodność pełnomorskich platform wiertniczych

    Publication

    - Year 2019

    W pracy przedstawiono wieloletnie doświadczenia Autora w zakresie wybranych aspektów numerycznej analizy pełnomorskich platform wiertniczych, w szczególności stacjonarnych platform stalowych poddanych działaniu fal wiatrowych i wiatru. W opisie zachowania się platform uwzględniono współoddziaływanie trzech ośrodków: materiału konstrukcji, morskich fal wiatrowych i podłoża gruntowego. Przyjęcie do opisu stochastycznych właściwości...

    Full text to download in external service

  • Testing the impact of simplifications adopted in models describing wave loads on ship

    Publication

    - Year 2011

    The wave-ship system in naval architecture is generally assumed to be a linear one. This allows for the computation of a transfer function of ship response to waves including wave loads on ship. The transfer function and the wave spectral density function enable the development of the stochastic process of wave loads on ship, corresponding to the irregular wave generating that loads. If the mathematical models of wave load transfer...

    Full text to download in external service

  • Testing the impact of simplifications adopted in models describing wave loads on ship

    Publication

    - Year 2012

    The wave-ship system in naval architecture is generally assumed to be a linear one. This allows for the computation of a transfer function of ship response to waves including wave loads on ship. The transfer function and the wave spectral density function enable the development of the stochastic process of wave loads on ship, corresponding to the irregular wave generating that loads. If the mathematical models of wave load transfer...

  • Synchronization system for underwater acoustic communications using in shallow waters

    A reliable synchronization system of the transmitted data frame has a significant impact on the efficiency of the underwater communication system. This applies in particular to communication systems dedicated to work in shallow waters, where the phenomenon of multipath permanently occurs. To overcome these difficulties, the concept of a synchronization system consisting of two broadband signals of opposite monotonicity was presented....

    Full text available to download

  • Proximal primal–dual best approximation algorithm with memory

    Publication

    - COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - Year 2018

    We propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...

    Full text available to download

  • Packing [1,Delta]-factors in graphs of small degree

    Publication

    Rozważano problem znalezienia w grafie zadanej liczby k krawędziowo rozłącznych [1,Delta]-faktorów, gdzie Delta oznacza stopień grafu. Problem ten można rozwiązać w czasie liniowym dla k=2, jest on jednak NP-trudny dla każdego k>=3. Pokazano, że wariant minimalizacjny problemu dla k=2 jest NP-trudny dla grafów planarnych podkubicznych, jednak w ogólności istnieje algorytm (42 Delta - 30) / (35 Delta - 21) - aproksymacyjny.

    Full text to download in external service

  • An O ( n log n ) algorithm for finding edge span of cacti

    Let G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...

    Full text available to download

  • Zero-visibility cops and robber and the pathwidth of a graph

    Publication

    - JOURNAL OF COMBINATORIAL OPTIMIZATION - Year 2015

    We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...

    Full text to download in external service

  • Secure Italian domination in graphs

    Publication

    - JOURNAL OF COMBINATORIAL OPTIMIZATION - Year 2021

    An 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...

    Full text available to download

  • Paired domination versus domination and packing number in graphs

    Publication

    Given 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...

    Full text available to download

  • On zero-error codes produced by greedy algorithms

    We present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.

    Full text available to download

  • Sensitivity analysis based on non-intrusive regression-based polynomial chaos expansion for surgical mesh modelling

    Publication

    The modelling of a system containing implants used in ventral hernia repair and human tissue suffers from many uncertainties. Thus, a probabilistic approach is needed. The goal of this study is to define an efficient numerical method to solve non-linear biomechanical models supporting the surgeon in decisions about ventral hernia repair. The model parameters are subject to substantial variability owing to, e.g., abdominal wall...

    Full text available to download

  • Computational aspects of greedy partitioning of graphs

    In this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...

    Full text available to download

  • The convex domination subdivision number of a graph

    Publication

    Let G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...

    Full text available to download

  • [ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2022/23

    e-Learning Courses
    • J. Górski
    • K. Winkelmann
    • M. Skowronek

  • [ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2023/24

    e-Learning Courses
    • J. Górski
    • K. Winkelmann
    • M. Skowronek

  • Rigorous numerics for critical orbits in the quadratic family

    Publication

    - CHAOS - Year 2020

    We develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...

    Full text available to download

  • Pounding Between Superstructure Segments in Multi-Supported Elevated Bridge with Three-Span Continuous Deck Under 3D Non-Uniform Earthquake Excitation

    Reports after severe ground motions show that the earthquake-induced structural pounding may lead to significant damage in elevated bridges. The aim of this paper is to analyse pounding between superstructure segments of a highway elevated bridge with three-span continuous deck under 3D non-uniform earthquake excitation, which is induced by spatial seismic effects related to the propagation of seismic wave. The conditional stochastic...

    Full text to download in external service

  • Deep Learning Basics 2023/24

    e-Learning Courses
    • K. Draszawka

    A course about the basics of deep learning intended for students of Computer Science. It includes an introduction to supervised machine learning, the architecture of basic artificial neural networks and their training algorithms, as well as more advanced architectures (convolutional networks, recurrent networks, transformers) and regularization and optimization techniques.

  • Paweł Rościszewski dr inż.

    People

    Paweł 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....

  • Local basis function estimators for identification of nonstationary systems

    Publication

    The problem of identification of a nonstationary stochastic system is considered and solved using local basis function approximation of system parameter trajectories. Unlike the classical basis function approach, which yields parameter estimates in the entire analysis interval, the proposed new identification procedure is operated in a sliding window mode and provides a sequence of point (rather than interval) estimates. It is...

    Full text to download in external service

  • Parallelization of large vector similarity computations in a hybrid CPU+GPU environment

    Publication

    The paper presents design, implementation and tuning of a hybrid parallel OpenMP+CUDA code for computation of similarity between pairs of a large number of multidimensional vectors. The problem has a wide range of applications, and consequently its optimization is of high importance, especially on currently widespread hybrid CPU+GPU systems targeted in the paper. The following are presented and tested for computation of all vector...

    Full text available to download

  • Hierarchical random models in road transport safety

    Publication

    - Year 2015

    In this paper multilevel approach to the issue of road safety level on the road network of European regions, classified as NUTS 2 in statistical databases of the EU, has been presented. The risk calculated as the number of death casualties in road accidents per 100,000 inhabitants of a given region has Poisson distribution. Therefore, generalized Poisson model has been assumed in the modelling process. Multilevel stochastic analysis...

    Full text to download in external service

  • International Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks

    Conferences

  • Generalized adaptive comb filters/smoothers and their application to the identification of quasi-periodically varying systems and signals

    Publication

    The problem of both causal and noncausal identification of linear stochastic systems with quasiharmonically varying parameters is considered. The quasi-harmonic description allows one to model nonsinusoidal quasi-periodic parameter changes. The proposed identification algorithms are called generalized adaptive comb filters/smoothers because in the special signal case they reduce down to adaptive comb algorithms used to enhance...

    Full text available to download

  • Identification of Fast Time-varying Communication Channels Using the Preestimation Technique

    Accurate identification of stochastic systems with fast-varying parameters is a challenging task which cannot be accomplished using model-free estimation methods, such as weighted least squares, which assume only that system coefficients can be regarded as locally constant. The current state-of-the-art solutions are based on the assumption that system parameters can be locally approximated by a linear combination of appropriately...

    Full text available to download

  • Uncertainty assessment of ultimate strength of corroded stiffened plates subjected to different maintenance actions

    Publication

    - Year 2019

    The study deals with the uncertainty assessment of different governing factors related to the ultimate strength of the corroded stiffened plates. The load-carrying capacity is predicted with the use of the nonlinear Finite Element Method. The most influencing governing factors in the non-linear FE analysis, such as material properties and initial imperfections are modeled and analysed as stochastic variables. The ultimate strength...

    Full text to download in external service

  • Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators

    The paper presents the optimization process of the evolutionary sets of safe ship trajectories method, with a focus on its problem-dedicated operators. The method utilizes a customized evolutionary algorithm to solve a constrained optimization problem. This problem is defined as finding a set of cooperating trajectories (a set is an evolutionary individual) of all the ships involved in the encounter situation. The resulting trajectories...

  • Anna Wendt mgr

    Asystent  w Katedrze Inżynierii Zarządzania i Jakości od 2017 r.  Jest absolwentką kierunku Zarządzanie jakością i środowiskiem na Wydziale Zarządzania Uniwersytetu Gdańskiego.  W trakcie studiów doktoranckich na Wydziale Zarządzania i Ekonomii Politechniki Gdańskiej w dyscyplinie Nauki o Zarządzaniu.  Jest audytorem wewnętrznym systemów ISO 9001, 14001, 18001 oraz 22000. Ukończyła wiele kursów z zakresu zarządzania jakością i...

  • Distributed state estimation using a network of asynchronous processing nodes

    Publication

    We consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...

    Full text to download in external service

  • Distributed state estimation using a network of asynchronous processing nodes

    We consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...

    Full text to download in external service

  • Multi-objective Weather Routing with Customised Criteria and Constraints

    Publication

    The paper presents a weather routing algorithm utilising a multi-objective optimisation with constraints, namely the Multi-objective Evolutionary Weather Routing Algorithm (MEWRA). In the proposed approach weather route recommendations can be made simultaneously e.g. for passage time, fuel consumption and safety of passage by means of Pareto optimisation. The sets of criteria and constraints in the optimisation process are fully...

    Full text available to download

  • Dimensionality-Reduced Antenna Modeling with Stochastically Established Constrained Domain

    Over the recent years, surrogate modeling methods have become increasingly widespread in the design of contemporary antenna systems. On the one hand, it is associated with a growing awareness of numerical optimization, instrumental in achieving high-performance structures. On the other hand, considerable computational expenses incurred by massive full-wave electromagnetic (EM) analyses, routinely employed as a major design tool,...

    Full text to download in external service

  • On a Method of Efficiency Increasing in Kaplan Turbine

    This paper presents a method of increasing efficiency in Kaplan-type turbine. The method is based on blade profile optimisation together with modelling the interaction between rotor and stator blades. Loss coefficient was chosen as the optimisation criterion, which is related directly to efficiency. Global optimum was found by means of Genetic Algorithms, and Artificial Neural Networks were utilised for approximations to reduce...

  • Jakub Montewka prof. dr hab. inż.

    Jakub Montewka is an associate professor at Gdańsk University of Technology in Poland and visiting processor at Aalto University in Espoo, Finland and Wuhan University of Technology in China. Jakub is researching in the field of maritime traffic risk and safety. His primary interests lie in the risk assessment of maritime transportation, quantification of safety of maritime navigation, route optimization for ships in ice-covered...

  • Paweł Czarnul dr hab. inż.

    Paweł Czarnul obtained a D.Sc. degree in computer science in 2015, a Ph.D. in computer science granted by a council at the Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology in 2003. His research interests include:parallel and distributed processing including clusters, accelerators, coprocessors; distributed information systems; architectures of distributed systems; programming mobile devices....

  • A new look at the statistical identification of nonstationary systems

    Publication

    The paper presents a new, two-stage approach to identification of linear time-varying stochastic systems, based on the concepts of preestimation and postfiltering. The proposed preestimated parameter trajectories are unbiased but have large variability. Hence, to obtain reliable estimates of system parameters, the preestimated trajectories must be further filtered (postfiltered). It is shown how one can design and optimize such...

    Full text available to download

  • Przemysław Kalitowski dr inż.

    Przemyslaw Kalitowski (born 26 July 1991) currently works at the Gdansk University of Technology in Gdansk, Poland. He acts as the Professor's Assistant at the Department of Rail Transportation and Bridges. In 2015 he started PhD studies at the Department of Rail Transportation and Bridges. He has over 4 years experience in static and dynamic analysis of structures - primarily with FEM programs. The scope of analysis are mainly...

  • OPTIMISING RIG DESIGN FOR SAILING YACHTS WITH EVOLUTIONARY MULTIOBJECTIVE ALGORITHM

    The paper presents a framework for optimising a sailing yacht rig using Multi-objective Evolutionary Algorithms and for filtering obtained solutions by means of a Multi-criteria Decision Making method. A Bermuda sloop with discontinuous rig is taken under consideration as a model rig configuration. It has been decomposed into its elements and described by a set of control parameters to form a responsive model which can be used...

    Full text available to download

  • Simulation-driven size-reduction-oriented design of multi-band antennas by means of response features

    This study addresses the problem of explicit size reduction of multi-band antennas by means of simulation-driven optimisation. The principal difficulty of electromagnetic (EM)-based miniaturisation of multi-band antennas is that several resonances have to be controlled independently (both in terms of their frequency allocation and depth) while attempting to reduce physical dimensions of the structure at hand. The design method...

    Full text to download in external service

  • Optymalizacja rozkładu jazdy na kolei z uwzględnieniem efektywności hamowania odzyskowego.

    Publication

    - Logistyka - Year 2015

    Na wstępie artykułu przybliżono czytelnikowi, czym jest rozkład jazdy na sieci kolejowej, na czym polega jego optymalizacja oraz odwołano się do literatury opisującej proces jego konstrukcji. W dalszej części przedstawiono kryteria optymalizacji rozkładu jazdy i zaproponowano podejście od strony efektywności wykorzystania energii pochodzącej z hamowania rekuperacyjnego, realizowanego metodą odzysku bezpośrednio do sieci trakcyjnej....

    Full text available to download

  • Optimally regularized local basis function approach to identification of time-varying systems

    Publication

    Accurate identification of stochastic systems with fast-varying parameters is a challenging task which cannot be accomplished using model-free estimation methods, such as weighted least squares, which assume only that system coefficients can be regarded as locally constant. The current state of the art solutions are based on the assumption that system parameters can be locally approximated by a linear combination of appropriately...

    Full text to download in external service

  • Evaluating the mobile robot positions using accelerometer data

    Publication

    - Year 2015

    This paper analyzes the problem of determining the position of a robot using an accelerometer, which is an essential part of inertial measurement units (IMU). The information gained from such a gauge, however, requires double integration of sensor data. To assure an expected effect, a mathematical model of a low-cost accelerometer of the MEMS type is derived. Moreover, in order to improve the performance of positioning based on...

    Full text to download in external service

  • Evaluating the position of a mobile robot using accelerometer data

    Publication

    - Year 2016

    This paper analyses the problem of determining the position of a robot using an accelerometer, which is an essential part of inertial measurement units (IMU). The information gained from such a gauge, however, requires double integration of sensor data. To assure an expected effect, a mathematical model of a low-cost accelerometer of the MEMS type is derived. Moreover, in order to improve the performance of positioning based on...

  • Positive solutions of one-dimensional p-Laplacian boundary value problems for fourth-order differential equations with deviating arguments

    Praca dotyczy istnienia dodatnich rozwiązań dla równań różniczkowych rzędu czwartego z warunkami brzegowymi z odchylonymi argumentami. Stosując twierdzenie o punkcie stałym dla stożków podano warunki dostateczne na istnienia takich rozwiązań.

    Full text to download in external service

  • Four-point boundary-value problems for differential-algebraic systems

    Badane są czteropunktowe problemy brzegowe dla układów równań różniczkowo-algebraicznych. Stosując metodę iteracji monotonicznych, podano warunki dostateczne na istnienie rozwiązań (jednego lub ekstremalnych) takich problemów. Podano przykład ilustrujacy otrzymane wyniki teoretyczne.

    Full text to download in external service

  • Multiple solutions of boundary-value problems for fourth-order differential equations with deviating arguments

    Praca dotyczy równań różniczkowych rzędu czwartego z warunkami brzegowymi i odchylonymi argumentami. Podano wystarczające warunki, dla których problemy dotyczące takich równań mają dodatnie rozwiązania. W pracy rozważa się przypadki kiedy argumenty odchylone są typu opóźnionego lub wyprzedzonego. W celu zapewnienia istnienia przynajmniej trzech dodatnich rozwiązań wykorzystano twierdzenie Avery-Petersona.

    Full text to download in external service

  • Boundary value problems for ordinary differential equations with deviated arguments

    Dyskutowane są równania różniczkowe z dwupunktowym nieliniowym warunkiem brzegowym z argumentami typu odchylonego. Podano warunki dostateczne które gwarantują iż problem wyjściowy ma kwazi-rozwiązania. Podano też warunki przy których problem ten ma rozwiązanie. Wyniki uzyskano stosując metodę iteracji monotonicznych.Badano też pewne nierówności różniczkowe z odchylonymi argumentami.

  • Zero-Pole Approach in Microwave Passive Circuit Design

    Publication

    - Year 2017

    In this thesis, optimization strategies for design of microwave passive structures including filters, couplers, antenna and impedance transformer and construction of various surroogate models utilized to fasten the design proces have been discussed. Direct and hybrid optimization methodologies including space mapping and multilevel algorithms combined with various surrogate models at different levels of fidelity have been utilized...

    Full text available to download

  • Szkoła letnia na WETI

    Events

    05-09-2017 00:00 - 12-09-2017 23:59

    Katedra Algorytmów i Modelowania Systemów WETI organizuje szkołę letnią pt.: "Gdansk Summer School of Advanced Science on Algorithms for Discrete Optimization" dla osób zainteresowanych algorytmiką i teorią grafów.