Filtry
wszystkich: 1358
wybranych: 1235
-
Katalog
- Publikacje 1235 wyników po odfiltrowaniu
- Czasopisma 40 wyników po odfiltrowaniu
- Konferencje 18 wyników po odfiltrowaniu
- Osoby 38 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 15 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 8 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: optimalization
-
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)
PublikacjaThe 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...
-
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 -
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 -
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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...
-
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....
-
Four-point boundary-value problems for differential-algebraic systems
PublikacjaBadane 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
PublikacjaPraca 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
PublikacjaDyskutowane 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
PublikacjaPraca 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ń.
-
Zero-Pole Approach in Microwave Passive Circuit Design
PublikacjaIn 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...
-
Optymalizacja efektywności hamowania odzyskowego w transporcie szynowym przez sterowanie czasem przyjazdu na stację
PublikacjaArtykuł 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...
-
Expedited Design Closure of Antennas By Means Of Trust-Region-Based Adaptive Response Scaling
PublikacjaIn 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
PublikacjaArtificial 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
PublikacjaDesign 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
PublikacjaA 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...
-
Size-Reduction-Oriented Design of Compact CPW-Fed UWB Monopole Antenna
PublikacjaA 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.
-
Projektowanie układów geometrycznych toru z zastosowaniem optymalizacji wielokryterialnej
PublikacjaW 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...
-
Fast and reliable knowledge-based design closure of antennas by means of iterative prediction-correction scheme
PublikacjaA 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
PublikacjaMulti-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
PublikacjaIn 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...
-
Expedited Gradient-Based Design Closure of Antennas Using Variable-Resolution Simulations and Sparse Sensitivity Updates
PublikacjaNumerical 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...
-
Semi-definite programming and quantum information
PublikacjaThis 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,...
-
A robust design of a numerically demanding compact rat-race coupler
PublikacjaA 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...
-
Application of MARKAL model to optimisation of electricity generation structure in Poland in the long-term time horizon Part I - concept of the model
PublikacjaIn 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,...
-
Novel structure and size-reduction-oriented design of microstrip compact rat-race coupler
PublikacjaIn 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...
-
Multi-objective antenna design by means of sequential domain patching
PublikacjaA 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
PublikacjaIn 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...
-
Reduced-cost constrained miniaturization of wideband antennas using improved trust-region gradient search with repair step
PublikacjaIn the letter, an improved algorithm for electromagnetic (EM)-driven size reduction of wideband antennas is proposed. Our methodology utilizes variable-fidelity EM simulation models, auxiliary polynomial regression surrogates, as well as multi-point response correction. The constraint handling is implicit, using penalty functions. The core optimization algorithm is a trust-region gradient search with a repair step added in order...
-
Power efficient thrust allocation algorithms in design of dynamically positioned ships
PublikacjaAssessment of power consumption on a Dynamically Positioned (DP) ship in the early design stage can assist crucial design choices. The study presents a comparison between two algorithms of optimal thrust allocation in a propulsion system for an over-actuated DP ship. Applied algorithms were Quadratic Programming (QP) and Non- dominated Sorting Genetic Algorithm II (NSGAII). Based on both approaches, tools were developed for ship...
-
On geometry parameterization for simulation-driven design closure of antenna structures
PublikacjaFull-wave electromagnetic (EM) simulation tools have become ubiquitous in antenna design, especially final tuning of geometry parameters. From the reliability standpoint, the recommended realization of EM-driven design is through rigorous numerical optimization. It is a challenging endeavor with the major issues related to the high computational cost of the process, but also the necessity of handling several objectives and constraints...
-
Two-phase optimizing approach to design assessments of long distance heat transportation for CHP systems
PublikacjaCogeneration or Combined Heat and Power (CHP) for power plants is a method of putting to use waste heat which would be otherwise released to the environment. This allows the increase in thermodynamic efficiency of the plant and can be a source of environmental friendly heat for District Heating (DH). In the paper CHP for Nuclear Power Plant (NPP) is analyzed with the focus on heat transportation. A method for effectivity and feasibility...
-
PODEJŚCIE WARIANTOWE WE WSTĘPNYM PROJEKTOWANIU STATKÓW Variant methods approach to the preliminary ship design.
PublikacjaKlasyczna 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...
-
Simulation-Based Design of Microstrip Linear Antenna Arrays Using Fast Radiation Response Surrogates
PublikacjaFast yet accurate technique for simulation-based design of linear arrays of microstrip patch antennas is presented. Our technique includes: (i) optimization of the corrected array factor of the antenna array under design for a phase excitation taper resulting in reduced side lobes; (ii) simulation-driven optimization of the array element for element dimensions resulting in matching at and about operational frequency, and (iii)...
-
Deflated Preconditioned Solvers for Parametrized Local Model Order Reduction
PublikacjaOne of steps in the design of microwave filters is numerical tuning using full-wave simulators. Typically, it is a time-consuming process as it uses advanced computational methods, e.g. the finite-element method (FEM) and it usually requires multiple optimization steps before the specification goals are met. FEM involves solving a large sparse system of equations at many frequency points and therefore its computational cost is...
-
Improving SBR Performance Alongside with Cost Reduction through Optimizing Biological Processes and Dissolved Oxygen Concentration Trajectory
PublikacjaAuthors of this paper take under investigation the optimization of biological processes during the wastewater treatment in sequencing batch reactor (SBR) plant. A designed optimizing supervisory controller generates the dissolved oxygen (DO) trajectory for the lower level parts of the hierarchical control system. Proper adjustment of this element has an essential impact on the efficiency of the wastewater treatment process as well...
-
A simple approach to heat exchanger sizing optimisation by means of entrophy generation minimisation
PublikacjaIn the paper an attempt is presented to find the method of optimization of microtube diameter with respect to optimal thermal-hydraulic conditions in the single-phase shell-and-tube heat exchangers. The approach is based on consideration of pumping power at the condition of maximum heat transfer by the heat exchanger tube system. In the optimization method the tube diameter is first specified and then appropriate calculations are...
-
On Decision-Making Strategies for Improved-Reliability Size Reduction of Microwave Passives: Intermittent Correction of Equality Constraints and Adaptive Handling of Inequality Constraints
PublikacjaDesign optimization of passive microwave components is an intricate process, especially if the primary objective is a reduction of the physical size of the structure. The latter has become an important design consideration for a growing number of modern applications (mobile communications, wearable/implantable devices, internet of things), where miniaturization is imperative due to a limited space allocated for the electronic circuitry....
-
Robust Parameter Tuning of Antenna Structures by Means of Design Specification Adaptation
PublikacjaParameter tuning through numerical optimization has become instrumental in the design of high-performance antenna systems. Yet, practical optimization faces several major challenges, including high cost of massive evaluations of antenna characteristics, normally involving full-wave electromagnetic (EM) analysis, large numbers of adjustable variables, the shortage of reasonable initial solutions in the case of topologically complex...
-
Chaotic Dynamics and Bifurcations in Impact Systems
Publikacja -
All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns
PublikacjaTwo 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...