Filtry
wszystkich: 1540
-
Katalog
- Publikacje 1395 wyników po odfiltrowaniu
- Czasopisma 42 wyników po odfiltrowaniu
- Konferencje 20 wyników po odfiltrowaniu
- Osoby 49 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 18 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 12 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: OPTMIZATION
-
Benchmarking Performance of a Hybrid Intel Xeon/Xeon Phi System for Parallel Computation of Similarity Measures Between Large Vectors
PublikacjaThe paper deals with parallelization of computing similarity measures between large vectors. Such computations are important components within many applications and consequently are of high importance. Rather than focusing on optimization of the algorithm itself, assuming specific measures, the paper assumes a general scheme for finding similarity measures for all pairs of vectors and investigates optimizations for scalability...
-
[ILiT, IŚGiE] Reliability-Based Optimization (RBO)
Kursy Online -
Local Mesh Deformation for accelerated parametric studies based on the Finite Element Method
PublikacjaThis paper presents an approach for enhancing the efficiency of two-dimensional Finite Element Method analysis in parametric studies or optimisation process of microwave components. The new approach involves local mesh deformation applied near the elements that are modified during computations. Since in the proposed approach the topology of the mesh remains unchanged, a new mesh does not have to be generated from scratch when the...
-
Application of Box–Behnken design in the optimization of a simple graphene oxide/zinc oxide nanocomposite-based pipette tip micro-solid phase extraction for the determination of Rhodamine B and Malachite green in seawater samples by spectrophotometry
Publikacja -
Tax system in Poland - current situation and direction of changes
Dane BadawczeThe 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ż.
OsobyMichał Małafiejski urodził się w 1975 roku. Uzyskał tytuł zawodowy magistra inżyniera informatyka w 1999 roku. W 2002 roku uzyskał stopień doktora nauk technicznych w dyscyplinie informatyka, a w 2014 roku stopień doktora habilitowanego w tej samej dziedzinie. Obecnie pracuje jako profesor nadzwyczajny w Katedrze Algorytmów i Modelowania Systemów. Jest autorem licznych prac z zakresu informatyki teoretycznej i matematyki dyskretnej....
-
Mariusz Kaczmarek dr hab. inż.
OsobyReceived 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
PublikacjaBioethanol 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ż.
Osoby -
Reliability Based zoptimization 2023/24
Kursy Online -
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Konferencje -
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Konferencje -
Algorytmy Optymalizacji Dyskretnej - ed. 2021/2022
Kursy OnlineIn 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ż.
OsobyWaldemar Korłub uzyskał tytuł inżyniera w 2011 roku, tytuł magistra w 2012 roku oraz stopień doktora w dyscyplinie informatyki w 2017 roku na Wydziale Elektroniki Telekomunikacji i Informatyki Politechniki Gdańskiej. Jego zainteresowania naukowe obejmują: systemy rozproszone ze szczególnym uwzględnieniem systemów typu grid i chmur obliczeniowych, systemy autonomiczne zdolne do samodzielnej optymalizacji, zarządzania zasobami, ochrony...
-
Wojciech Wyrzykowski dr hab.
OsobyWojciech Wyrzykowski jest pracownikiem Katedry Finansów na Wydziale Zarządzania i Ekonomii Politechniki Gdańskiej. Jest autorem 70 publikacji naukowych w tym 5 monografii oraz współautorem 7 monografii. Najistotniejsze z nich oddające zainteresowania naukowe autora to m.in.: Podatkowe uwarunkowania rozwoju przedsiębiorczości w Polsce, Podatki w Polsce – zarys wykładu, Księgi, ewidencje i rejestry podatkowe małych przedsiębiorców,...
-
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
Publikacja -
Energy-Aware High-Performance Computing: Survey of State-of-the-Art Tools, Techniques, and Environments
PublikacjaThe 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
Dane BadawczeThe 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ż.
OsobyMgr 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
OsobyOlgun 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...
-
European Conference on Evolutionary Computation in Combinatorial Optimisation
Konferencje -
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublikacjaThe 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...
-
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
PublikacjaIn 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...
-
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2022/23
Kursy Online -
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2023/24
Kursy Online -
Packing [1,Delta]-factors in graphs of small degree
PublikacjaRozważ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.
-
Zero-visibility cops and robber and the pathwidth of a graph
PublikacjaWe 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
PublikacjaLet 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
PublikacjaIn 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
PublikacjaLet 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
PublikacjaThe 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...
-
On zero-error codes produced by greedy algorithms
PublikacjaWe 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
PublikacjaGiven 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...
-
Secure Italian domination in graphs
PublikacjaAn 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...
-
Proximal primal–dual best approximation algorithm with memory
PublikacjaWe 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...
-
Bartosz Sawik
OsobyDr 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....
-
Deep Learning Basics 2023/24
Kursy OnlineA 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ż.
OsobyPaweł 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....
-
Lean Manufacturing, W, Mechatronika, IDE, sem. 03, letni 23/24 (PG_00062997)
Kursy OnlineDevelopment 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)
Kursy OnlineDevelopment 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
PublikacjaThe 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
Konferencje -
Wojciech Siwicki dr inż.
Osoby -
Jakub Montewka prof. dr hab. inż.
OsobyJakub 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
OsobyAsystent 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
PublikacjaThe 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...
-
Michał Hoeft dr inż.
OsobyMichał Hoeft z wyrożnieniem ukończył studia na Wydziale ETI Politechniki Gdańskiej w 2011. Obszary jego zainteresowań badawczych obejmują zarządzanie mobilnością w sieciach heterogenicznych oraz optymalizacje przełączania w sieciach IEEE 802.11. Michał Hoeft uczestniczył w licznych projektach B+R m. in. Inżynieria Internetu Przyszłości, PL-LAB2020 oraz netBaltic. Dodatkowo pełnił rolę recenzanta dla czasopism: Ad-Hoc Networks,...
-
Paweł Czarnul dr hab. inż.
OsobyPaweł Czarnul uzyskał stopień doktora habilitowanego w dziedzinie nauk technicznych w dyscyplinie informatyka w roku 2015 zaś stopień doktora nauk technicznych w zakresie informatyki(z wyróżnieniem) nadany przez Radę Wydziału Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej w roku 2003. Dziedziny jego zainteresowań obejmują: przetwarzanie równoległei rozproszone w tym programowanie równoległe na klastrach obliczeniowych,...
-
Przemysław Kalitowski dr inż.
OsobyPrzemyslaw 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.
PublikacjaNa 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....