Ensemble Techniques for Determining Globally Optimal Designs for Problems with Broadly Stated Design Objectives

2008 ◽  
Author(s):  
Chunming Wang ◽  
Gary I. Rosen
Keyword(s):  
Optimal Designs ◽  
Ensemble Techniques

Q-optimal experimental designs and close to them experimental designs for polynomial regression on the interval

2020 ◽  
Vol 86 (5) ◽  
pp. 65-72
Author(s):  
Yu. D. Grigoriev
Keyword(s):  
Optimal Design ◽  
Polynomial Regression ◽  
Direct Consequence ◽  
Experimental Designs ◽  
Optimal Designs ◽  
Software Systems ◽  
General Character ◽  
Support Points ◽  
Optimal Weights ◽  
Universal Expression

The problem of constructing Q-optimal experimental designs for polynomial regression on the interval [–1, 1] is considered. It is shown that well-known Malyutov – Fedorov designs using D-optimal designs (so-called Legendre spectrum) are other than Q-optimal designs. This statement is a direct consequence of Shabados remark which disproved the Erdős hypothesis that the spectrum (support points) of saturated D-optimal designs for polynomial regression on a segment appeared to be support points of saturated Q-optimal designs. We present a saturated exact Q-optimal design for polynomial regression with s = 3 which proves the Shabados notion and then extend this statement to approximate designs. It is shown that when s = 3, 4 the Malyutov – Fedorov theorem on approximate Q-optimal design is also incorrect, though it still stands for s = 1, 2. The Malyutov – Fedorov designs with Legendre spectrum are considered from the standpoint of their proximity to Q-optimal designs. Case studies revealed that they are close enough for small degrees s of polynomial regression. A universal expression for Q-optimal distribution of the weights pi for support points xi for an arbitrary spectrum is derived. The expression is used to tabulate the distribution of weights for Malyutov – Fedorov designs at s = 3, ..., 6. The general character of the obtained expression is noted for Q-optimal weights with A-optimal weight distribution (Pukelsheim distribution) for the same problem statement. In conclusion a brief recommendation on the numerical construction of Q-optimal designs is given. It is noted that in this case in addition to conventional numerical methods some software systems of symbolic computations using methods of resultants and elimination theory can be successfully applied. The examples of Q-optimal designs considered in the paper are constructed using precisely these methods.

Constrained optimal designs

1984 ◽  
Author(s):  
Moun-Shen Carl Lee
Keyword(s):  
Optimal Designs

scholarly journals The Effectiveness of Ensemble-Neural Network Techniques to Predict Peak Uplift Resistance of Buried Pipes in Reinforced Sand

2021 ◽  
Vol 11 (3) ◽  
pp. 908
Author(s):  
Jie Zeng ◽  
Panagiotis G. Asteris ◽  
Anna P. Mamou ◽  
Ahmed Salih Mohammed ◽  
Emmanuil A. Golias ◽  
...  
Keyword(s):  
Neural Network ◽  
Numerical Models ◽  
Correlation Coefficients ◽  
Network Models ◽  
Small Scale ◽  
Offshore Platforms ◽  
Neural Network Models ◽  
Buried Pipes ◽  
Ensemble Techniques ◽  
Uplift Resistance

Buried pipes are extensively used for oil transportation from offshore platforms. Under unfavorable loading combinations, the pipe’s uplift resistance may be exceeded, which may result in excessive deformations and significant disruptions. This paper presents findings from a series of small-scale tests performed on pipes buried in geogrid-reinforced sands, with the measured peak uplift resistance being used to calibrate advanced numerical models employing neural networks. Multilayer perceptron (MLP) and Radial Basis Function (RBF) primary structure types have been used to train two neural network models, which were then further developed using bagging and boosting ensemble techniques. Correlation coefficients in excess of 0.954 between the measured and predicted peak uplift resistance have been achieved. The results show that the design of pipelines can be significantly improved using the proposed novel, reliable and robust soft computing models.

scholarly journals Estimating Software Development Efforts Using a Random Forest-Based Stacked Ensemble Approach

Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1195
Author(s):  
Priya Varshini A G ◽  
Anitha Kumari K ◽  
Vijayakumar Varadarajan
Keyword(s):  
Deep Learning ◽  
Random Forest ◽  
Software Development ◽  
Weighted Averaging ◽  
Software Project ◽  
Effort Estimation ◽  
Software Effort Estimation ◽  
Single Model ◽  
Ensemble Techniques ◽  
Project Estimation

Software Project Estimation is a challenging and important activity in developing software projects. Software Project Estimation includes Software Time Estimation, Software Resource Estimation, Software Cost Estimation, and Software Effort Estimation. Software Effort Estimation focuses on predicting the number of hours of work (effort in terms of person-hours or person-months) required to develop or maintain a software application. It is difficult to forecast effort during the initial stages of software development. Various machine learning and deep learning models have been developed to predict the effort estimation. In this paper, single model approaches and ensemble approaches were considered for estimation. Ensemble techniques are the combination of several single models. Ensemble techniques considered for estimation were averaging, weighted averaging, bagging, boosting, and stacking. Various stacking models considered and evaluated were stacking using a generalized linear model, stacking using decision tree, stacking using a support vector machine, and stacking using random forest. Datasets considered for estimation were Albrecht, China, Desharnais, Kemerer, Kitchenham, Maxwell, and Cocomo81. Evaluation measures used were mean absolute error, root mean squared error, and R-squared. The results proved that the proposed stacking using random forest provides the best results compared with single model approaches using the machine or deep learning algorithms and other ensemble techniques.

Dynamic modeling and power optimization of a 4RPSP+PS parallel flight simulator machine

Robotica ◽  
2021 ◽  
pp. 1-26
Author(s):  
Soheil Zarkandi
Keyword(s):  
Power Consumption ◽  
Dynamic Modeling ◽  
Parallel Manipulator ◽  
Degrees Of Freedom ◽  
Pareto Front ◽  
Essential Role ◽  
Power Optimization ◽  
Optimal Designs ◽  
Flight Simulator ◽  
Lagrange Method

Abstract Reducing consumed power of a robotic machine has an essential role in enhancing its energy efficiency and must be considered during its design process. This paper deals with dynamic modeling and power optimization of a four-degrees-of-freedom flight simulator machine. Simulator cabin of the machine has yaw, pitch, roll and heave motions produced by a 4RPSP+PS parallel manipulator (PM). Using the Euler–Lagrange method, a closed-form dynamic equation is derived for the 4RPSP+PS PM, and its power consumption is computed on the entire workspace. Then, a newly introduced optimization algorithm called multiobjective golden eagle optimizer is utilized to establish a Pareto front of optimal designs of the manipulator having a relatively larger workspace and lower power consumption. The results are verified through numerical examples.

scholarly journals Asymptotic Inference for Optimal Rerandomization Designs

2021 ◽  
Vol 1 (1) ◽  
pp. 49-58
Author(s):  
Mårten Schultzberg ◽  
Per Johansson
Keyword(s):  
Experimental Design ◽  
Normal Distribution ◽  
Mahalanobis Distance ◽  
Design Strategy ◽  
Sampling Distribution ◽  
Optimal Designs ◽  
Asymptotic Inference ◽  
Optimal Allocations ◽  
Asymptotic Sampling

AbstractRecently a computational-based experimental design strategy called rerandomization has been proposed as an alternative or complement to traditional blocked designs. The idea of rerandomization is to remove, from consideration, those allocations with large imbalances in observed covariates according to a balance criterion, and then randomize within the set of acceptable allocations. Based on the Mahalanobis distance criterion for balancing the covariates, we show that asymptotic inference to the population, from which the units in the sample are randomly drawn, is possible using only the set of best, or ‘optimal’, allocations. Finally, we show that for the optimal and near optimal designs, the quite complex asymptotic sampling distribution derived by Li et al. (2018), is well approximated by a normal distribution.

Sign in / Sign up

Export Citation Format

Share Document