Search
Filters
total: 1393
displaying 1000 best results Help
Search results for: OPTIMALIZATION
-
Natalia Stawicka-Morawska dr inż.
PeopleMgr inż. Natalia Stawicka-Morawska pracuje na Politechnice Gdańskiej od października 2017 r. na stanowisku Asystenta, na Wydziale Inżynierii Mechanicznej i Okrętownictwa (poprzednio: Wydziale Mechanicznym), w Instytucie Mechaniki i Konstrukcji Maszyn (poprzednio: Katedrze Mechaniki i Mechatroniki).Prowadzona przez nią działalność naukowa dotyczy dziedziny nauk technicznych w dyscyplinie naukowej budowa i eksploatacja maszyn. Główną...
-
Olgun Aydin dr
PeopleOlgun Aydin finished his PhD by publishing a thesis about Deep Neural Networks. He works as a Principal Machine Learning Engineer in Nike, and works as Assistant Professor in Gdansk University of Technology in Poland. Dr. Aydin is part of editorial board of "Journal of Artificial Intelligence and Data Science" Dr. Aydin served as Vice-Chairman of Why R? Foundation and is member of Polish Artificial Intelligence Society. Olgun is...
-
Mateusz Muchlado dr
PeopleMateusz Muchlado - assistant professor at the Department of Management and Quality Engineering. He obtained a doctoral degree in management and quality sciences in 2020 at the Faculty of Management and Economics of the Gdańsk University of Technology, defending his thesis entitled "Outsourcing in selected medical entities of the Pomeranian Voivodeship". Associated with the Gdańsk University of Technology since 2010, a graduate...
-
Packing [1,Delta]-factors in graphs of small degree
PublicationRozważ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.
-
On zero-error codes produced by greedy algorithms
PublicationWe 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.
-
Paired domination versus domination and packing number in graphs
PublicationGiven 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...
-
The convex domination subdivision number of a graph
PublicationLet 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...
-
Sensitivity analysis based on non-intrusive regression-based polynomial chaos expansion for surgical mesh modelling
PublicationThe 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...
-
Secure Italian domination in graphs
PublicationAn 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...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublicationWe 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...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet 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...
-
Computational aspects of greedy partitioning of graphs
PublicationIn 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...
-
Proximal primal–dual best approximation algorithm with memory
PublicationWe 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...
-
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2022/23
e-Learning Courses -
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2023/24
e-Learning Courses -
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....
-
Deep Learning Basics 2023/24
e-Learning CoursesA 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.
-
International Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Conferences -
Jakub Montewka prof. dr hab. inż.
PeopleJakub 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...
-
Anna Wendt mgr
PeopleAsystent 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...
-
Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators
PublicationThe 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...
-
Paweł Czarnul dr hab. inż.
PeoplePaweł 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....
-
Przemysław Kalitowski dr inż.
PeoplePrzemyslaw 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...
-
Optymalizacja rozkładu jazdy na kolei z uwzględnieniem efektywności hamowania odzyskowego.
PublicationNa 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....
-
Szkoła letnia na WETI
EventsKatedra 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.
-
Four-point boundary-value problems for differential-algebraic systems
PublicationBadane 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.
-
Boundary value problems for ordinary differential equations with deviated arguments
PublicationDyskutowane 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.
-
Positive solutions of one-dimensional p-Laplacian boundary value problems for fourth-order differential equations with deviating arguments
PublicationPraca 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ń.
-
Multiple solutions of boundary-value problems for fourth-order differential equations with deviating arguments
PublicationPraca 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.
-
Optymalizacja efektywności hamowania odzyskowego w transporcie szynowym przez sterowanie czasem przyjazdu na stację
PublicationArtykuł nawiązuje do poprzednich prac autorów, w których przedstawiono model organizacji ruchu kooperujących pociągów z uwzględnieniem optymalizacji wykorzystania energii zwracanej do sieci jezdnej. W przedstawionej pracy zmodyfikowano model zmieniając główną zmienną sterującą, mającą wpływ na efektywne wykorzystanie energii, z czasu odjazdu na czas przyjazdu pociągu na stację lub przystanek. Optymalizacja dokonywana jest przez...
-
Zero-Pole Approach in Microwave Passive Circuit Design
PublicationIn 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...
-
Expedited Design Closure of Antennas By Means Of Trust-Region-Based Adaptive Response Scaling
PublicationIn the letter, a reliable procedure for expedited design optimization of antenna structures by means of trust-region adaptive response scaling (TR-ARS) is proposed. The presented approach exploits two-level electromagnetic (EM) simulation models. A predicted high-fidelity model response is obtained by applying nonlinear frequency and amplitude correction to the low-fidelity model. The surrogate created this way is iteratively rebuilt...
-
Marine and Cosmic Inspirations for AI Algorithms
PublicationArtificial Intelligence (AI) is a scientific area that currently sees an enormous growth. Various new algorithms and methods are developed and many of them meets practical, successful applications. Authors of new algorithms draw different inspirations. Probably the most common one is the nature. For example, Artificial Neural Networks were inspired by the structure of human brain and nervous system while the classic Genetic Algorithm...
-
Low-cost multiband compact branch-line coupler design using response features and automated EM model fidelity adjustment
PublicationDesign closure of compact microwave components is a challenging problem because of significant electromagnetic (EM) cross-couplings in densely arranged layouts. A separate issue is a large number of designable parameters resulting from replacement of conventional transmission line sections by compact microstrip resonant cells. This increases complexity of the design optimization problem and requires employment of expensive high-fidelity...
-
Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces
PublicationA deterministic technique for fast surrogate-assisted multi-objective design optimization of antennas in highly-dimensional parameters spaces has been discussed. In this two-stage approach, the initial approximation of the Pareto set representing the best compromise between conflicting objectives is obtained using a bisection algorithm which finds new Pareto-optimal designs by dividing the line segments interconnecting previously...
-
Projektowanie układów geometrycznych toru z zastosowaniem optymalizacji wielokryterialnej
PublicationW pracy przedstawiono metodę projektowania odcinków trasy kolejowej położonych w łuku, dostosowaną do techniki mobilnych pomiarów satelitarnych. Rozwiązanie problemu projektowego wykorzystuje zapis matematyczny i polega na wyznaczeniu uniwersalnych równań opisujących całość układu geometrycznego. Odbywa się to sekwencyjnie, obejmując kolejne fragmenty tegoż układu. Procedura projektowania ma charakter uniwersalny, gdyż w ogólnym...
-
Size-Reduction-Oriented Design of Compact CPW-Fed UWB Monopole Antenna
PublicationA structure and design optimization of compact CPW-fed UWB monopole antenna is presented. Explicit size reduction through constrained numerical optimization of all relevant geometry parameters of the structure leads to a very small footprint of only 321 mm2. At the same time, a very wide antenna bandwidth is achieved from 3.1 GHz to 17 GHz.
-
Fast and reliable knowledge-based design closure of antennas by means of iterative prediction-correction scheme
PublicationA novel framework for expedited antenna optimization with an iterative prediction-correction scheme is proposed. The methodology is comprehensively validated using three real-world antenna structures: narrow-band, dual-band and wideband, optimized under various design scenarios. The keystone of the proposed approach is to reuse designs pre-optimized for various sets of performance specifications and to encode them into metamodels...
-
Strategies for computationally feasible multi-objective simulation-driven design of compact RF/microwave components
PublicationMulti-objective optimization is indispensable when possible trade-offs between various (and usually conflicting) design objectives are to be found. Identification of such design alternatives becomes very challenging when performance evaluation of the structure/system at hand is computationally expensive. Compact RF and microwave components are representative examples of such a situation: due to highly compressed layouts and considerable...
-
Optimized Stress and Geometry Control of Spherical structures under Lateral Loadings
PublicationIn this paper, a numerical model of a double-layer spherical structure has been examined under lateral loadings. When the structure has been distorted due to loadings, the dislocated joints have been moved to their original positions utilizing the adjustment techniques based on the force method. Meanwhile, the members’ internal forces were kept in the desired domain. Optimization techniques were also implemented in order to minimalize...
-
Anna Brillowska-Dąbrowska dr hab. inż.
PeopleAnna Brillowska-Dąbrowska, born in 1971 in Gdańsk, Poland, graduated in 1996 in Biotechnology from the Faculty of Chemistry, Gdańsk University of Technology (GUT). In 2001 she got her PhD, in 2013 became a DSc (habilitation). She was employed in 2004 as a researcher in Statens Serum Institut in Denmark. Currently she is an Associate Professor (adiunkt) in the Department of Molecular Biotechnology and Microbiology and Vice-dean...
-
Expedited Gradient-Based Design Closure of Antennas Using Variable-Resolution Simulations and Sparse Sensitivity Updates
PublicationNumerical optimization has been playing an increasingly important role in the design of contemporary antenna systems. Due to the shortage of design-ready theoretical models, optimization is mainly based on electromagnetic (EM) analysis, which tends to be costly. Numerous techniques have evolved to abate this cost, including surrogate-assisted frameworks for global optimization, or sparse sensitivity updates for speeding up local...
-
A robust design of a numerically demanding compact rat-race coupler
PublicationA fast and accurate design procedure of a computationally expensive microwave circuit has been presented step-by-step and experimentally validated on the basis of a compact rat-race coupler (RRC) comprising slow-wave resonant structures (SWRSs). The final compact RRC solution has been obtained by means of a sequential optimization scheme exploiting the implicit space mapping (ISM) algorithm. A well-suited surrogate optimization...
-
Semi-definite programming and quantum information
PublicationThis paper presents a comprehensive exploration of semi-definite programming (SDP) techniques within the context of quantum information. It examines the mathematical foundations of convex optimization, duality, and SDP formulations, providing a solid theoretical framework for addressing optimization challenges in quantum systems. By leveraging these tools, researchers and practitioners can characterize classical and quantum correlations,...
-
Marek Tobiszewski dr hab. inż.
PeopleBorn on April 7, 1984 in Gdańsk. In 2012, he defended his doctorate with honors, in 2017 he obtained his habilitation on the basis of the scientific achievement "Development of analytical procedures and solvents for the assessment of environmental nuisance". He has been working at the Department of Analytical Chemistry since 2012. His research interests includes analytical chemistry, especially the analytics of organic compounds...
-
PODEJŚCIE WARIANTOWE WE WSTĘPNYM PROJEKTOWANIU STATKÓW Variant methods approach to the preliminary ship design.
PublicationKlasyczna metoda projektowania okrętów jest metodą iteracyjną, bazującą na zgromadzonym doświadczeniu ze statków już zbu-dowanych. Natomiast w przypadku statku całkowicie nowego typu, bez „posagu wcześniejszych doświadczeń”, projektowanie polega na opracowaniu szeregu równoległych, wariantowych rozwiązań z wykorzystaniem optymalizacji. Artykuł wskazuje wybrane metody projektowe wykorzystujące optymalizacje, używane we wstępnym...
-
Novel structure and size-reduction-oriented design of microstrip compact rat-race coupler
PublicationIn this paper, a novel structure of a miniaturized microstrip rat-race coupler has been proposed. Surrogate-based optimization procedures are applied to explicitly reduce the coupler size while maintaining equal power split at the operating frequency of 1 GHz and sufficient bandwidth for return loss and isolation characteristics. The optimization is performed using the objective function with four penalty components. The footprint...
-
Application of MARKAL model to optimisation of electricity generation structure in Poland in the long-term time horizon Part I - concept of the model
PublicationIn this paper, which inaugurates a series of papers on this subject, a concept is proposed of a power system development model with regard to the technological structure of electricity generation in Poland, in the long-term time perspective – until 2060. The model is based on the mathematical structure of the MARKAL optimization package. The paper presents a brief description of the tool used in the model research. In addition,...
-
Multi-objective antenna design by means of sequential domain patching
PublicationA simple yet robust methodology for rapid multiobjective design optimization of antenna structures has been presented. The key component of our approach is sequential domain patching of the design space which is a stencil-based search that aims at creating a path that connects the extreme Pareto-optimal designs, obtained by means of single-objective optimization runs. The patching process yields the initial approximation of the...
-
Cost-efficient simulation-driven design of compact impedance matching transformers
PublicationIn this paper, an algorithmic framework for cost-efficient design optimization of miniaturized impedance matching transformers has been presented. Our approach exploits a bottom-up design that involves translating the overall design specifications for the circuit at hand to its elementary building blocks (here, compact microstrip resonant cells, CMRCs), as well as fast surrogate-assisted optimization of the cells followed by simulation-based...