Search
Filters
total: 1485
-
Catalog
displaying 1000 best results Help
Search results for: OPTIMIZATION.
-
International Conference on Optimization: Techniques And Applications
Conferences -
Conference on Integer Programming and Combinatorial Optimization
Conferences -
International Symposium on Code Generation and Optimization
Conferences -
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 -
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...
-
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...
-
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...
-
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 -
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...
-
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ą.
-
Latin-American Algorithms, Graphs and Optimization Symposium
Conferences -
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
Co-gasification of waste biomass-low grade coal mix using downdraft gasifier coupled with dual-fuel engine system: Multi-objective optimization with hybrid approach using RSM and Grey Wolf Optimizer
PublicationThe looming global crisis over increasing greenhouse gases and rapid depletion of fossil fuels are the motivation factors for researchers to search for alternative fuels. There is a need for more sustainable and less polluting fuels for internal combustion engines. Biomass offers significant potential as a feed material for gasification to produce gaseous fuel. It is carbon neutral, versatile, and abundant on earth. The present...
-
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 -
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 -
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Conferences -
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Conferences -
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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.
-
International Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Conferences -
Towards Carbon Neutral Settlements. The Importance of Early-Stage Urban and Energetic Optimizations
PublicationThe aim of the research was to verify the essence of interdisciplinary energy optimizations in earlystage urban design process. A further aim was to the find most optimal design variant and scenario in terms of urban energy efficiency for the future development in Nowy Port, located in Gdansk, Poland - a place requiring complex revitalization. The research combined qualitative and quantitative approaches; an urban design layer...
-
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.
-
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.
-
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.
-
n/d n/d
ProjectsProject realized in Faculty of Chemistry according to Homing Plus/2012-6/16 agreement from 2013-05-22
-
All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns
PublicationTwo novel algorithms for the all-gather operation resilient to imbalanced process arrival patterns (PATs) are presented. The first one, Background Disseminated Ring (BDR), is based on the regular parallel ring algorithm often supplied in MPI implementations and exploits an auxiliary background thread for early data exchange from faster processes to accelerate the performed all-gather operation. The other algorithm, Background Sorted...
-
Chaotic Dynamics and Bifurcations in Impact Systems
Publication -
International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems
Conferences -
Ireneusz Czarnowski Prof.
PeopleIRENEUSZ CZARNOWSKI is a graduate of the Faculty of Electrical Engineering at Gdynia Maritime University. He gained a doctoral degree in the field of computer science at Poznan University of Technology and a postdoctoral degree in the field of computer science at Wroclaw University of Science and Technology. Since 1998 is associated with Gdynia Maritime University, currently is a professor of computer science in the Department...
-
Zdzisław Kowalczuk prof. dr hab. inż.
PeopleZdzislaw Kowalczuk received his M.Sc. degree in 1978 and Ph.D. degree in 1986, both in Automatic Control from Technical University of Gdańsk (TUG), Gdańsk, Poland. In 1993 he received his D.Sc. degree (Dr Habilitus) in Automatic Control from Silesian Technical University, Gliwice, Poland, and the title of Professor from the President of Poland in 2003. Since 1978 he has been with Faculty of Electronics, Telecommunications and Informatics...
-
Adrian Bekasiewicz dr hab. inż.
PeopleAdrian Bekasiewicz received the MSc, PhD, and DSc degrees in electronic engineering from Gdansk University of Technology, Poland, in 2011, 2016, and 2020, respectively. In 2014, he joined Engineering Optimization & Modeling Center at Reykjavik University, Iceland, where he held a Research Associate and a Postdoctoral Fellow positions, respectively. Currently, he is an Associate Professor and the head of Teleinformation Networks...
-
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...
-
Krzysztof Lipiński dr hab. inż.
People -
Jacek Tomków dr hab. inż.
PeopleEducation:1. 2018 - Ph.D. of Technical Sciencesin field of Materials Engineeringthesis: Influence of underwater welding conditions on cold cracking of high strength low alloy steel 2. 2012 - Master of Science Engineer, Gdansk University of Technologyin the field of: Mechanical Engineeringwith specialization in: Manufacturing Engineering and Computer Aided Manufacturing Processesthesis: Non-destructive testing of welding joints...
-
The experimental results of sorption cycles
Open Research DataExperimental studies of sorption cycles were carried out using a prototype research stand, which is a laboratory-scale model of an adsorption chiller. The Intensified Heat Transfer Adsorption Bed (IHTAB) reactor is adapted to the analysis and optimization of various parameters of adsorption systems, e.g., constructions and compositions of adsorption...
-
Cezary Orłowski prof. dr hab. inż.
People -
Practical Eco-Driving Strategy for Suburban Electric Multiple Unit
PublicationIn this paper, a practical approach to velocity profile optimization for electric multiple unit was presented. The study focuses on a case of fast urban railway, which is a popular mean of transport across Tricity, Poland. Based on observations and measurements, a potential for improvement of energy efficiency by modifying the speed profile was recognized. In order to conduct necessary calculations, simulation model of railway...
-
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...
-
Grzegorz Boczkaj dr hab. inż.
People