Filters
total: 1729
filtered: 1534
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: SEQUENTIAL MINIMAL OPTIMIZATION
-
Constrained aerodynamic shape optimization using neural networks and sequential sampling
PublicationAerodynamic shape optimization (ASO) involves computational fluid dynamics (CFD)-based search for an optimal aerodynamic shape such as airfoils and wings. Gradient-based optimization (GBO) with adjoints can be used efficiently to solve ASO problems with many design variables, but problems with many constraints can still be challenging. The recently created efficient global optimization algorithm with neural network (NN)-based prediction...
-
Statistical analysis and robust design of circularly polarized antennas using sequential approximate optimization
PublicationIn the paper, reliable yield estimation and tolerance-aware design optimization of circular polarization (CP) antennas is discussed. We exploit auxiliary kriging interpolation models established in the vicinity of the nominal design in order to speed up the process of statistical analysis of the antenna structure at hand. Sequential approximate optimization is then applied to carry out robust design of the antenna, here, oriented...
-
Fast Multi-Objective Aerodynamic Optimization Using Sequential Domain Patching and Multifidelity Models
PublicationExploration of design tradeoffs for aerodynamic surfaces requires solving of multi-objective optimization (MOO) problems. The major bottleneck here is the time-consuming evaluations of the computational fluid dynamics (CFD) model used to capture the nonlinear physics involved in designing aerodynamic surfaces. This, in conjunction with a large number of simulations necessary to yield a set of designs representing the best possible...
-
Fast Multi-Objective Antenna Optimization Using Sequential Patching and Variable-Fidelity EM Models
PublicationIn this work, a technique for fast multi-objective design optimization of antenna structures is presented. In our approach, the initial approximation of the Pareto set representing the best possible trade-offs between conflicting design objectives is obtained by means of sequential patching of the design space. The latter is a stencil-based search that aims at creating a path that connects the extreme Pareto-optimal designs (obtained...
-
Multi-objective design optimization of antenna structures using sequential domain patching with automated patch size deter-mination
PublicationIn this paper, a simple yet efficient and reliable technique for fully automated multi-objective design optimization of antenna structures using sequential domain patching (SDP) is discussed. The optimization procedure according to SDP is a two-step process: (i) obtaining the initial set of Pareto-optimal designs representing the best possible trade-offs between considered conflicting objectives, and (ii) Pareto set refinement...
-
Patch size setup and performance/cost trade-offs in multi-objective EM-driven antenna optimization using sequential domain patching
PublicationPurpose This paper aims to assess control parameter setup and its effect on computational cost and performance of deterministic procedures for multi-objective design optimization of expensive simulation models of antenna structures. Design/methodology/approach A deterministic algorithm for cost-efficient multi-objective optimization of antenna structures has been assessed. The algorithm constructs a patch connecting extreme Pareto-optimal...
-
Volume optimization of high-speed surface-mounted permanent magnet synchronous motor based on sequential quadratic programming technique and analytical solution
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 -
A comparative study of English viseme recognition methods and algorithm
PublicationAn elementary visual unit – the viseme is concerned in the paper in the context of preparing the feature vector as a main visual input component of Audio-Visual Speech Recognition systems. The aim of the presented research is a review of various approaches to the problem, the implementation of algorithms proposed in the literature and a comparative research on their effectiveness. In the course of the study an optimal feature vector...
-
A comparative study of English viseme recognition methods and algorithms
PublicationAn elementary visual unit – the viseme is concerned in the paper in the context of preparing the feature vector as a main visual input component of Audio-Visual Speech Recognition systems. The aim of the presented research is a review of various approaches to the problem, the implementation of algorithms proposed in the literature and a comparative research on their effectiveness. In the course of the study an optimal feature vector construction...
-
Music Data Processing and Mining in Large Databases for Active Media
PublicationThe aim of this paper was to investigate the problem of music data processing and mining in large databases. Tests were performed on a large data-base that included approximately 30000 audio files divided into 11 classes cor-responding to music genres with different cardinalities. Every audio file was de-scribed by a 173-element feature vector. To reduce the dimensionality of data the Principal Component Analysis (PCA) with variable...
-
Method for universal detection of two-photon polarization entanglement
PublicationDetecting and quantifying quantum entanglement of a given unknown state poses problems that are fundamentally important for quantum information processing. Surprisingly, no direct (i.e., without quantum tomography) universal experimental implementation of a necessary and sufficient test of entanglement has been designed even for a general two-qubit state. Here we propose an experimental method for detecting a collective universal...
-
Molecular basis of lipopolysaccharide heterogeneity in Escherichia coli: envelope stress-responsive regulators control the incorporation of glycoforms with a third 3-deoxy-α-D-manno-oct-2-ulosonic acid and rhamnose.
PublicationMass spectrometric analyses of lipopolysaccharide (LPS) from isogenic Escherichia coli strains with nonpolar mutations in the waa locus or overexpression of their cognate genes revealed that waaZ and waaS are the structural genes required for the incorporation of the third 3-deoxy-α-D-manno-oct-2-ulosonic acid (Kdo) linked to Kdo disaccharide and rhamnose, respectively. The incorporation of rhamnose requires prior sequential incorporation...
-
Multi-objective antenna design by means of sequential domain patching
PublicationA 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...
-
Minimal 2-dominating sets in Trees
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
-
Minimal double dominating sets in trees
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Trees having many minimal dominating sets
PublicationWe provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...
-
Minimal surfaces and conservation laws for bidimensional structures
PublicationWe discuss conservation laws for thin structures which could be modeled as a material minimal surface, i.e., a surface with zero mean curvatures. The models of an elastic membrane and micropolar (six-parameter) shell undergoing finite deformations are considered. We show that for a minimal surface, it is possible to formulate a conservation law similar to three-dimensional non-linear elasticity. It brings us a path-independent...
-
From Sequential to Parallel Implementation of NLP Using the Actor Model
PublicationThe article focuses on presenting methods allowing easy parallelization of an existing, sequential Natural Language Processing (NLP) application within a multi-core system. The actor-based solution implemented with the Akka framework has been applied and compared to an application based on Task Parallel Library (TPL) and to the original sequential application. Architectures, data and control flows are described along with execution...
-
Efficient uncertainty quantification using sequential sampling-based neural networks
PublicationUncertainty quantification (UQ) of an engineered system involves the identification of uncertainties, modeling of the uncertainties, and the forward propagation of the uncertainties through a system analysis model. In this work, a novel surrogate-based forward propagation algorithm for UQ is proposed. The proposed algorithm is a new and unique extension of the recent efficient global optimization using neural network (NN)-based...
-
Incremental construction of Minimal Tree Automata [online]
PublicationWe describe an algorithm that allows the incremental addition or removal of unranked ordered trees to minimal frontier-to-root deterministic tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a minimal DTA A' which accepts the language L(A) accepted by A incremented (or decremented) with the tree t. The algorithm can be used to efficiently maintain dictionaries which store large collections...
-
Sequential classification.
PublicationOpisano uogólniony algorytm konstrukcji klasyfikatora sekwencyjnego. Uogólnienie polega na tym, że zbiór klas dzielimy na dwie grupy zamiast oddzielania po jednej klasie w każdym kroku uczenia klasyfikatora. Eksperymenty potwierdzały lepsze własności klasyfikatora.
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
An algorithm for listing all minimal double dominating sets of a tree
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublicationWe describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...
-
Fisher sequential classifiers
PublicationW artykule zproponowano wieloklasowe uogólnione kryterium Fishera. zaproponowano trzy warianty sekencyjneg uczenia, które zilustrowano przykładami.
-
Weighted sequential classifier
PublicationZaproponowano wieloklasowe ważone kryterium Fishera i uzasadniono potrzebę jego wprowadzenia. Na bazie tego kryterium skonstruowano sekwencyjny algorytm uczenia klasyfikatora. Przedstawiono wyniki eksperymentów.
-
Periodic expansion in determining minimal sets of Lefschetz periods for Morse–Smale diffeomorphisms
PublicationWe apply the representation of Lefschetz numbers of iterates in the form of periodic expansion to determine the minimal sets of Lefschetz periods of Morse–Smale diffeomorphisms. Applying this approach we present an algorithmic method of finding the family of minimal sets of Lefschetz periods for Ng, a non-orientable compact surfaces without boundary of genus g. We also partially confirm the conjecture of Llibre and Sirvent (J Diff...
-
Vehicle detector training with minimal supervision
PublicationRecently many efficient object detectors based on convolutional neural networks (CNN) have been developed and they achieved impressive performance on many computer vision tasks. However, in order to achieve practical results, CNNs require really large annotated datasets for training. While many such databases are available, many of them can only be used for research purposes. Also some problems exist where such datasets are not...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Pollutants removal effectiveness in hydrophyte filters with sequential vertical and horizontal flow
PublicationThe object of investigations was the constructed wetland in Wiedersberg in Saxonia in Germany supplied with domestic sewage from 145 inhabitants. The biological part was composed of sequential reed beds with vertical and horizontal flow of sewage. It in one of new solutions, because up till now configuration with vertical bed situated at front of biological part of treatment was applied.The evaluation of object performance was...
-
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
PublicationWe describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions that are unique) for every input...
-
On Inadequacy of Sequential Design of Experiments for Performance-Driven Surrogate Modeling of Antenna Input Characteristics
PublicationDesign of contemporary antennas necessarily involves electromagnetic (EM) simulation tools. Their employment is imperative to ensure evaluation reliability but also to carry out the design process itself, especially, the adjustment of antenna dimensions. For the latter, traditionally used parameter sweeping is more and more often replaced by rigorous numerical optimization, which entails considerable computational expenses, sometimes...
-
Decision making process using deep learning
PublicationEndüstri 4.0, dördüncü endüstri devrimi veya Endüstriyel Nesnelerin İnterneti (IIoT) olarak adlandırılan sanayi akımı, işletmelere, daha verimli, daha büyük bir esneklikle, daha güvenli ve daha çevre dostu bir şekilde üretim yapma imkanı sunmaktadır. Nesnelerin İnterneti ile bağlantılı yeni teknoloji ve hizmetler birçok endüstriyel uygulamada devrim niteliği taşımaktadır. Fabrikalardaki otomasyon, tahminleyici bakım (PdM – Predictive...
-
Randomness Amplification under Minimal Fundamental Assumptions on the Devices
PublicationRecently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components...
-
Surrogate Modeling and Optimization Using Shape-Preserving Response Prediction: A Review
PublicationComputer simulation models are ubiquitous in modern engineering design. In many cases, they are the only way to evaluate a given design with sufficient fidelity. Unfortunately, an added computa-tional expense is associated with higher fidelity models. Moreover, the systems being considered are often highly nonlinear and may feature a large number of designable parameters. Therefore, it may be impractical to solve the design problem...
-
Trawl-Door Shape Optimization with 3D CFD Models and Local Surrogates
PublicationDesign and optimization of trawl-doors are key factors in minimizing the fuel consumption of fishing vessels. This paper discusses optimization of the trawl-door shapes using high-fidelity 3D computational fluid dynamic (CFD) models. The accurate 3D CFD models are computationally expensive and, therefore, the direct use of traditional optimization algorithms, which often require a large number of evaluations, may be prohibitive....
-
Minimal Sets of Lefschetz Periods for Morse-Smale Diffeomorphisms of a Connected Sum of g Real Projective Planes
PublicationThe dataset titled Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes contains all of the values of the topological invariant called the minimal set of Lefschetz periods, computed for Morse-Smale diffeomorphisms of a non-orientable compact surface without boundary of genus g (i.e. a connected sum of g real projective planes), where g varies from 1 to...
-
Self-optimizing generalized adaptive notch filters - comparison of three optimization strategies
PublicationThe paper provides comparison of three different approaches to on-line tuning of generalized adaptive notch filters (GANFs) the algorithms used for identification/tracking of quasi-periodically varying dynamic systems. Tuning is needed to adjust adaptation gains, which control tracking performance of ANF algorithms, to the unknown and/or time time-varying rate of system nonstationarity. Two out ofthree compared approaches are classical...
-
Sequential treatment of landfill leachate by electrocoagulation/aeration, PMS/ZVI/UV and electro-Fenton: Performance, biodegradability and toxicity studies
PublicationThis study presents a systematic study on sequential treatment of highly resistant landfill leachate by electrocoagulation (EC)/aeration, sulfate radical advanced oxidation process (SR-AOP) and electro-Fenton (EF). In case of SR-AOP, peroxymonosulfate (PMS) catalyzed by zero valent iron (ZVI) and ultraviolet irradiation (UV) system was developed. Treatment process was optimized in respect to COD removal. Analysis of results revealed...
-
Determination of the minimal critical rotational speeds of the circular saw blades with the quasi-twin resonant frequencies
PublicationTo determine the minimal critical rotational speeds of the circular saw blades is the fundamental aspect of obtaining the range of the rotational operating speeds, by which the circular saw blade can work with required stability. While for the circular saw blades with full-homogeneous bodies the determination of such rotational speeds is the relatively low level of difficulty function, whereas for circular saw blades with more...
-
Gender approaches to evolutionary multi-objective optimization using pre-selection of criteria
PublicationA novel idea to perform evolutionary computations (ECs) for solving highly dimensional multi-objective optimization (MOO) problems is proposed. Following the general idea of evolution, it is proposed that information about gender is used to distinguish between various groups of objectives and identify the (aggregate) nature of optimality of individuals (solutions). This identification is drawn out of the fitness of individuals...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublicationThe article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm,...
-
Shape and force control of cable structures with minimal actuators and actuation
PublicationShape adjustment and stress control can be considered as one of the effective parameters in prestressed cable structures since such structures are widely constructed nowadays due to their characteristics. The assembly errors and applied loads hugely affect the cables’ nodal positions and stress due to their delicacy. The former could disturb the shape, which affects the appearance and the function of the structure. In contrast,...
-
Post-comatose patients with minimal consciousness tend to preserve reading comprehension skills but neglect syntax and spelling
PublicationModern eye tracking technology provides a means for communication with patients suffering from disorders of consciousness (DoC) or remaining in locked-in-state. However, being able to use an eye tracker for controlling text-based contents by such patients requires preserved reading ability in the first place. To our knowledge, this aspect, although of great social importance, so far has seemed to be neglected. In the paper, we...
-
Additive Effect of Bromides and Chlorides on the Performance of Perovskite Solar Cells Fabricated via Sequential Deposition
PublicationA two-step sequential deposition method has been applied to prepare the solar cells with two types of perovskites Cs0.15FA0.85Pb(I0.95Cl0.05)3 and Cs0.15FA0.85Pb(I0.95Br0.05)3. In order to obtain the perovskite layers, the different sources of bromine and chlorine atoms were used for synthesis. The performance and time stability of chloride-based photocells are worse in comparison to the bromide-based devices. It can be explained...
-
Modal parameters identification with Particle Swarm Optimization
PublicationThe paper presents method of the modal parameters identification based on the Particle Swarm Optimization (PSO) algorithm [1]. The basic PSO algorithm is modified in order to achieve fast convergence and low estimation error of identified parameters values. The procedure of identification as well as algorithm modifications are presented and some simple examples for the SISO systems are provided. Results are compared with the results...
-
Minimal number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublicationLet M be a smooth compact and simply-connected manifold with simply-connected boundary ∂M, r be a fixed odd natural number. We consider f, a C1 self-map of M, preserving ∂M . Under the assumption that the dimension of M is at least 4, we define an invariant Dr(f;M,∂M) that is equal to the minimal number of r-periodic points for all maps preserving ∂M and C1-homotopic to f. As an application, we give necessary and sufficient...
-
Optimization of Automata
PublicationThis book is conceived as an effort to gather all algorithms and methods developed by the author of the book that concern three aspects of optimization of automata: incrementality, hashing and compression. Some related algorithms and methods are given as well when they are needed to complete the picture.
-
Minimal and maximal solutions of differential equations with a singularmatrix.
PublicationPraca dotyczy zagadnień początkowych dla układów równań różniczkowych z macierzą osobliwą. Równania różniczkowo-algebraiczne są szczególnym przypadkiem takich zagadnień.Stosując metodę iteracji monotonicznych pokazano, że przy pewnych założeniach problem wyjściowy ma ekstremalne rozwiązania w pewnym sektorze.Teoretyczne rozważania zilustrowano przykładem.