Filters
total: 1523
displaying 1000 best results Help
Search results for: OPTMIZATION
-
Tax system in Poland - current situation and direction of changes
Open Research DataThe study conducted on a group of 259 entrepreneurs from various regions of Poland concerns the opinions of business owners on the current tax situation, as well as potential changes in the tax system.
-
Michał Małafiejski dr hab. inż.
PeopleMichał Małafiejski was born in 1975. He received the M.Sc. in computer science (in 1999). He received the Ph.D. in computer science in 2002 and habilitation in the same area in 2014. He works as associate professor in Department of Algorithms and Modelling of Systems. He is the author or coauthor of many papers related to theoretrical computer science. Main area of his research is the design of efficient algorithms and the analysis...
-
Mariusz Kaczmarek dr hab. inż.
PeopleReceived M.Sc., Eng. in Electronics in 1995 from Gdansk University of Technology, Ph.D. in Medical Electronics in 2003 and habilitation in Biocybernetics and Biomedical Engineering in 2017. He was an investigator in about 13 projects receiving a number of awards, including four best papers, practical innovations (7 medals and awards) and also the Andronicos G. Kantsios Award and Siemens Award. Main research activities: the issues...
-
Swarm-Assisted Investment Planning of a Bioethanol Plant
PublicationBioethanol is a liquid fuel for which a significant increase in the share of energy sources has been observed in the economies of many countries. The most significant factor in popularizing bioethanol is the profitability of investments in construction of facilities producing this energy source, as well as the profitability of its supply chain. With the market filled with a large amount of equipment used in the bioethanol production...
-
Ryszard Strzelecki prof. dr hab. inż.
People -
Reliability Based zoptimization 2023/24
e-Learning Courses -
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Conferences -
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Conferences -
Algorytmy Optymalizacji Dyskretnej - ed. 2021/2022
e-Learning CoursesIn real-world applications, many important practical problems are NP-hard, therefore it is expedient to consider not only the optimal solutions of NP-hard optimization problems, but also the solutions which are “close” to them (near-optimal solutions). So, we can try to design an approximation algorithm that efficiently produces a near-optimal solution for the NP-hard problem. In many cases we can even design approximation algorithms...
-
Waldemar Korłub dr inż.
PeopleWaldemar Korłub obtained an Eng. degree in 2011, MSc.Eng. degree in 2012 and PhD in Computer Science in 2017 granted by the Faculty of Electronics, Telecommunications and Informatics at Gdansk University of Technology. His research interests include: distributed systems mainly grid and cloud computing platforms, autonomous systems capable of self-optimization, self-management, self-healing and self-protection, artificial intelligence...
-
Application of polyethylene glycol-coated iron oxide nanoparticles for magnetic solid phase extraction of copper from seawater samples and its determination by graphite furnace atomic absorption spectrometry using response surface methodology for optimization of extraction
Publication -
Wojciech Wyrzykowski dr hab.
PeopleWojciech Wyrzykowski is an employee of the Department of Finance at the Faculty of Management and Economics of the Gdańsk University of Technology. He is the author of 70 scientific publications, including 5 monographs, and co-author of 7 monographs. The most important of them reflecting the author's scientific interests include: Tax conditions for the development of entrepreneurship in Poland, Taxes in Poland - outline of the...
-
Energy-Aware High-Performance Computing: Survey of State-of-the-Art Tools, Techniques, and Environments
PublicationThe paper presents state of the art of energy-aware high-performance computing (HPC), in particular identification and classification of approaches by system and device types, optimization metrics, and energy/power control methods. System types include single device, clusters, grids, and clouds while considered device types include CPUs, GPUs, multiprocessor, and hybrid systems. Optimization goals include various combinations of...
-
The OpenMolcas Web: A Community-Driven Approach to Advancing Computational Chemistry
Open Research DataThe developments of the open-source OpenMolcas chemistry software environment since spring 2020 are described, with a focus on novel functionalities accessible in the stable branch of the package or via interfaces with other packages. These developments span a wide range of topics in computational chemistry and are presented in thematic sections: electronic...
-
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ą...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
European Conference on Evolutionary Computation in Combinatorial Optimisation
Conferences -
Modelling and optimisation of MXene-derived TiO2/Ti3C2 synthesis parameters using Response Surface Methodology based on the Box–Behnken factorial design. Enhanced carbamazepine degradation by the Cu-modified TiO2/Ti3C2 photocatalyst
PublicationIn the present study, a hydrothermal method in a water/ethanol environment was used for the first time to obtain novel Cu/TiO2/Ti3C2 composites with high photocatalytic activity for the degradation of carbamazepine (CBZ) under simulated solar light. The Box–Behnken factorial design was coupled with Response Surface Methodology (RSM) for synthesis parameter optimisation. The effect of different synthesis parameters, including temperature, time...
-
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2022/23
e-Learning Courses -
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2023/24
e-Learning Courses -
Bartosz Sawik
PeopleDr Bartosz Sawik is a Professor at the Department of Business Informatics and Engineering Management, AGH University of Science and Technology, Krakow, Poland and at the Institute of Smart Cities, GILT-OR Group, Department of Statistics, Computer Science and Mathematics, Public University of Navarre, Pamplona, Spain. He is a Visiting Researcher at the University of California, Berkeley, USA. He has a Ph.D. and a M.Sc. and Eng....
-
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.
-
Lean Manufacturing, W, Mechatronika, IDE, sem. 03, letni 23/24 (PG_00062997)
e-Learning CoursesDevelopment of Production Systems and Lean Management. Strategies in Process Optimisation. Analytical Methods. Lean Principles and Lean Methods. Change Management. Roll-out Strategies for Lean Manufacturing. Total productive Management.
-
Lean Manufacturing, W, Energetyka, sem. 03, letni 23/24 (PG_00062998)
e-Learning CoursesDevelopment of Production Systems and Lean Management. Strategies in Process Optimisation. Analytical Methods. Lean Principles and Lean Methods. Change Management. Roll-out Strategies for Lean Manufacturing. Total productive Management.
-
Parallelization of large vector similarity computations in a hybrid CPU+GPU environment
PublicationThe 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...
-
International Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Conferences -
Wojciech Siwicki dr inż.
People -
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...
-
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...
-
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...
-
Michał Hoeft dr inż.
PeopleMichał Hoeft graduated with distinction form Gdansk University of Technology (GUT), Gdansk, Poland in 2011. His main areas of research interest contain: effective mobility management and handover optimisation in 802.11 networks. Michał Hoeft has been involved in major communication-oriented projects including the EU-funded Polish Future Internet Engineering initiative, PL-LAB2020 and netBaltic projects. He has served as a reviewer...
-
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....
-
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ń.
-
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.
-
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.
-
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.