Filters
total: 1352
displaying 1000 best results Help
Search results for: optimalization
-
Team Strategies - sem. 2022/23
e-Learning CoursesThe main aim of the course is to familiarize students with the basic problems in team strategies, such as: the use of the particle swarm optimization algorithms, the ant colony optimization, stochastic distributed searches, algorithms for team strategy, multi-agent systems, modeling intelligent cooperation, simulations of social behavior. The form of passing the course is passing the exam and completing a project task
-
Team Strategies - sem. 2023/24
e-Learning CoursesThe main aim of the course is to familiarize students with the basic problems in team strategies, such as: the use of the particle swarm optimization algorithms, the ant colony optimization, stochastic distributed searches, algorithms for team strategy, multi-agent systems, modeling intelligent cooperation, simulations of social behavior. The form of passing the course is passing the exam and completing a project task
-
Workshop on Computational Optimization [WCO-IMCSIT]
Conferences -
International Conference on Optimization: Techniques And Applications
Conferences -
Conference on Integer Programming and Combinatorial Optimization
Conferences -
International Symposium on Code Generation and Optimization
Conferences -
Application of gas flow headspace liquid phase micro extraction coupled with gas chromatography-mass spectrometry for determination of 4-methylimidazole in food samples employing experimental design optimization
Publication -
Application and optimization of headspace solid-phase microextraction (HS-SPME) coupled with gas chromatography - flame-ionization detector (GC-FID) to determine products of the petroleum industry in aqueous samples
PublicationA simple and solvent-free analytical method has been optimized for the determination of hydrocarbons (C6 - C20) from products of the petroleum industry in aqueous samples. Extraction and analysis was carried out using headspace solid-phase microextraction (HS-SPME) and gas chromatography coupled with flame-ionization detector (GC-FID). A ZB-5 capillary column (30 m × 0.25 mm inner diameter, 0.25 µm film thickness) was used for...
-
Reply to “Comment on ‘Crystal Structure Prediction by Global Optimization as a Tool for Evaluating Potentials: Role of the Dipole Moment Correction Term in Successful Predictions'” by B. P. van Eijck and J. Kroon
Publication -
Separation and determination of ciprofloxacin in seawater, human blood plasma and tablet samples using molecularly imprinted polymer pipette‐tip solid phase extraction and its optimization by response surface methodology
Publication -
Development and optimization of simplified method of fast sequential HR-CS-FAAS analysis of apple juices on the content of Ca, Fe, K, Mg, Mn and Na with the aid of response surface methodology
Publication -
Business Process Analysis and Optimization 2022
e-Learning Courses -
Business Process Analysis and Optimization 2023
e-Learning Courses -
Efficient optimization approaches for microwave assisted extraction of high-quality antioxidant compounds from Salvia officinalis L.: UHPLC-HRMS differential analysis of phenolic profiles obtained by ultrasound and microwave extraction
PublicationThe study aims to optimize MAE of total phenolic compounds (TPC) and antioxidant capacity from Salvia officinalis L. leaves using a definitive screening design (DSD) and I-optimal design. UHPLC-HRMS analysis was used to identify and compare the composition of MAE and UAE optimal extracts. The results showed that DSD and I-optimal design were successfully applied for the optimization of MAE targeting phenolics and other antioxidants...
-
Latin-American Algorithms, Graphs and Optimization Symposium
Conferences -
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
Box-Behnken design optimization of pipette tip solid phase extraction for methyl orange and acid red determination by spectrophotometry in seawater samples using graphite based magnetic NiFe2O4 decorated exfoliated as sorbent
Publication -
Optimization and Modeling of Cr (VI) Removal from Tannery Wastewater onto Activated Carbon Prepared from Coffee Husk and Sulfuric Acid (H2SO4) as Activating Agent by Using Central Composite Design (CCD)
PublicationThe primary goal of this research is to lower the hexavalent chromium (Cr (VI)) concentration that has occurred from the growth of the tannery industry. As a result, the potential for heavy metal concentration is increasing day by day. Industrial effluent containing Cr (VI) contributes significantly to water pollution. Chromium hexavalent ion (Cr (VI)) in wastewater is extremely hazardous to the environment. It is critical to address...
-
Determining heat transfer coefficients using evolutionary alogrithms
PublicationPokazano sposób kalibracji współczynnika wymiany ciepła za pomocą algorytmów ewolucyjnych. Wykorzystano tu minimalizację błędu między pomiarami a obliczeniami. Pokazano dwie metody optymalizacji: wielokryterialną i jednokryterialną.
-
Reduced-cost surrogate modelling of compact microwave components by two-level kriging interpolation
PublicationFull-wave electromagnetic (EM) analysis is a versatile tool for evaluating the performance of high-frequency components. Its potential drawback is its high computational cost, inhibiting the execution of EM-driven tasks requiring massive simulations. The applicability of equivalent network models is limited owing to the topological complexity of compact microstrip components because of EM cross-coupling effects. Development of...
-
Fast surrogate-assisted simulation-driven design of compact microwave hybrid couplers
PublicationThis work presents a robust methodology for expedited simulation-driven design optimization of compact microwave hybrid couplers. The technique relies on problem decomposition, and a bot-tom–up design strategy, starting from the level of basic building blocks of the coupler, and finishing with a tuning procedure that exploits a fast surrogate model of the entire structure. The latter is constructed by cascading local response surface...
-
[ILiT, IŚGiE] Reliability-Based Optimization (RBO)
e-Learning Courses -
Patryk Ziółkowski dr inż.
PeoplePatryk Ziolkowski is a graduate of the Faculty of Civil and Environmental Engineering at the Gdansk University of Technology, specializing in Building and Engineering Structures. He works as an Assistant Professor at the Department of Engineering Structures. He participated in international projects, including projects for the Ministry of Transportation of the State of Alabama (2015), he is also the winner of a grant from the Kosciuszko...
-
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
Publication -
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...
-
Ryszard Strzelecki prof. dr hab. inż.
People -
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...
-
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 -
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...
-
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...
-
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...
-
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2022/23
e-Learning Courses -
[ILiT, IŚGiE] Reliability-Based Optimization (RBO) - 2023/24
e-Learning Courses -
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.
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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.
-
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...
-
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.