Performance Comparison of Different Regression Methods for a Polymerization Process with Adaptive Sampling

Developing complete mechanistic models for polymerization reactors is not easy, because complex reactions occur simultaneously; there is a large number of kinetic parameters involved and sometimes the chemical and physical phenomena for mixtures involving polymers are poorly understood. To overcome these difficulties, empirical models based on sampled data can be used instead, namely regression methods typical of machine learning field. They have the ability to learn the trends of a process without any knowledge about its particular physical and chemical laws. Therefore, they are useful for modeling complex processes, such as the free radical polymerization of methyl methacrylate achieved in a batch bulk process. The goal is to generate accurate predictions of monomer conversion, numerical average molecular weight and gravimetrical average molecular weight. This process is associated with non-linear gel and glass effects. For this purpose, an adaptive sampling technique is presented, which can select more samples around the regions where the values have a higher variation. Several machine learning methods are used for the modeling and their performance is compared: support vector machines, k-nearest neighbor, k-nearest neighbor and random forest, as well as an original algorithm, large margin nearest neighbor regression. The suggested method provides very good results compared to the other well-known regression algorithms.

Elitist Self-Adaptive Step-Size Search in Optimum Sizing of Steel Structures

This paper covers application of an elitist selfadaptive step-size search (ESASS) to optimum design of steel skeletal structures. In the ESASS two approaches are considered for improving the convergence accuracy as well as the computational efficiency of the original technique namely the so called selfadaptive step-size search (SASS). Firstly, an additional randomness is incorporated into the sampling step of the technique to preserve exploration capability of the algorithm during the optimization. Moreover, an adaptive sampling scheme is introduced to improve the quality of final solutions. Secondly, computational efficiency of the technique is accelerated via avoiding unnecessary analyses during the optimization process using an upper bound strategy. The numerical results demonstrate the usefulness of the ESASS in the sizing optimization problems of steel truss and frame structures.

Adaptive Sampling Algorithm for ANN-based Performance Modeling of Nano-scale CMOS Inverter

This paper presents an adaptive technique for generation of data required for construction of artificial neural network-based performance model of nano-scale CMOS inverter circuit. The training data are generated from the samples through SPICE simulation. The proposed algorithm has been compared to standard progressive sampling algorithms like arithmetic sampling and geometric sampling. The advantages of the present approach over the others have been demonstrated. The ANN predicted results have been compared with actual SPICE results. A very good accuracy has been obtained.