Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 31 for “"exchange algorithm"”.
-
Investigating the Effect of Greediness on the Coordinate Exchange Algorithm for Generating Optimal Experimental Designs
… experimental designs. One of the most popular algorithms used today to generate optimal designs is the Coordinate Exchange (CEXCH) Algorithm. CEXCH is known to be a greedy algorithm, which means it tends to favor immediate, locally best designs instead of globally optimal designs. Previous …
-
Development of the D-Optimality-Based Coordinate-Exchange Algorithm for an Irregular Design Space and the Mixed-Integer Nonlinear Robust Parameter Design Optimization
… and the hybrid nonlinear based branch-and-cut algorithm. Finally, there exist some special situations during the experimental phase where the situation may call for reducing the number of experimental runs or using a reduced regression model in fitting the data. Furthermore, there are special …
-
Optimal design of non-linear multi-factor experiments
… we can use the conventional point or coordinate exchange approach, which however can incorporate a new continuous optimisation method. On the basis of this idea, we further develop and implement a multistage hybrid method to construct local and (pseudo-)Bayesian optimal designs. The recommended …
-
Near optimal design of fixture layouts in multi-station assembly processes
… and an effective and efficient optimization algorithm. Multi-station design may have high dimensions of design space, which can contain a lot of local optima. In this dissertation, I investigated two algorithms for optimal fixture layout designs. The first algorithm is an exchange algorithm, …
-
Optimal Design In Multi-State Models For Clinical Trials
… sampling methods improve precision and speed. An exchange algorithm constructs exact optimal designs, accommodating both censored and non-censored data.<br/><br/>The sample covariance matrix of parameter estimators is derived, and an exchange algorithm is implemented to construct exact optimal …
-
Minimizing Multi-zone Orders in the Correlated Storage Assignment Problem
… to give upper bounds for the model. A cyclic exchange improvement method is also developed. This exponential size neighborhood can be efficiently searched in polynomial time. Even for poor initial solutions, this method finds solutions which outperform the best approaches from the literature. …
-
Approximation and Optimization Approaches for Graph Cuts, Experimental Design, and Routing Problems
… crossing edges. We present a new approximation algorithm that improves upon the best-known factor by rounding a semidefinite programming relaxation. The second topic focuses on design of experiments, where the objective is to select a limited subset of experiments from a universe to maximize the …
-
Selecting optimal follow-up split-plot designs
… designs. We modify Pareto-based coordinate exchange algorithm and apply it to follow-up split-plot designs. The algorithm allows for selecting optimal follow-up designs based on multiple criteria under user-specified models. We use DP- and I-criteria to select optimal follow-up split-plot …
-
A Zero Extraction and Separation Technique for Surface Acoustic Wave and Digital Signal Processing Fir Filter Implementation
… implementation. Overviews of zero extraction algorithms and of FIR filter design using the Remez Exchange algorithm are presented (McClellen et al. 1973). The computer aided design (CAD) procedure presented allows the designer to specify the general filter characteristic which the Remez …
-
Optimal Supersaturated Design for Finite Sample Populations
… part of the thesis introduces introduces a row exchange algorithm construction methodology to construct optimal SSDs efficiently from a finite sample population using UE(s2) as the evaluation criteria. Computational results show the algorithm consistently produces optimal SSDs in a …
-
Symmetric link key management for secure neighbor discovery in a decentralized wireless sensor network
… protocol and implements the Diffie-Hellman key exchange algorithm for symmetric key management. We simulate our scheme in MATLAB to demonstrate its effectiveness in securing the neighbor discovery protocol while providing energy efficiency, key security, and error resistance.
-
Cooperative Modeling and Design History Tracking Using Design Tracking Matrix
… Matrix (DTM), which provide a design data exchange algorithm allowing seamless integration of design modifications between participating designers. This framework can be used for effective cooperative modeling, and helps identify and eliminate conflicts and minimize delay. The proposed …
-
A tabu search approach for the dynamic space allocation problem.
… a mathematical formulation, a clustering algorithm based on group technology concepts and storage policies used to solve the storage layout problem, and a tabu search heuristic (TS) for solving the DSAP. In addition, a set of 72 test problems was developed to test these algorithms. Because …
-
An Aerodynamic Model for Use in the High Angle of Attack Regime
… Response (FIR) is designed using the Remez exchange algorithm. Based on the reduced data, a state–space model is developed to describe the unsteady aerodynamic characteristics of the aircraft during roll oscillations. For this model, we chose to separate the aircraft into panels and model …
-
Force Field Optimization, Advanced Sampling, And Free Energy Methods With Gpu-Optimized Monte Carlo (gomc) Software
… and low temperatures, a generalized identity exchange algorithm is developed for grand canonical Monte Carlo simulations. The algorithm, referred to as Molecular Exchange Monte Carlo (MEMC), is implemented in the GPU-Optimized Monte Carlo (GOMC) software and may be applied to multicomponent …
-
Chebyshev Approximation of Discrete polynomials and Splines
… root operation allows an efficient shading algorithm for rendering an image in a computer graphics system. The approach reduces the number of multiplies and makes it possible for the entire rendering process to be implemented using an integer processor. In many applications, Chebyshev …
-
Designing experiments on networks
… properties of networks. We also develop an algorithmic approach for finding efficient designs by utilising the network symmetry as defined by the automorphism group of the underlying graph. This approach reduces considerably the search time for finding a good design in moderate-sized …
-
New techniques for digital filter design
… response. To overcome this, a rapidly converging algorithm is presented for the design of symmetric FIR filters according to a square error criterion that does not require specified transition bands. It does not exclude from the integral square error a region around the cut-off frequency, and yet, …
-
Existence and uniqueness of best approximants, with numerical applications
… optimization. Chapter 7 deals with a modified exchange algorithm for Chebyshev approximation. In chapter 8, closed formulae for linear Chebyshev approximants are derived. A computer approximation is obtained which is subject to restrictions on the number of non-zero bits in its binary …
-
Radial basis functions for color conversion
… (GCR) transformations, optimized toner saving algorithms and numerical/perceptual based gamut mapping methods. Radial Basis Functions (RBFs) combined with the Lp norm approximation with emphasis on L1, L2, and L∞ were developed for color conversion. The exchange algorithm was employed in the L∞ …
Page 1 of 2