Surrogate models have been widely applied to correlate design variables and performance parameters in turbomachinery optimization applications. With more design variables and uncertain factors taken into account in an optimization design problem, the mathematical relations between the design variables and the performance parameters might present linear, low-order nonlinear or even high-order nonlinear characteristics, and are usually analytically unknown. Therefore, it is required that surrogate models have high adaptability and prediction accuracy for both the linear and nonlinear characteristics. The paper mainly investigates the effectiveness of an adaptive region segmentation combining surrogate model based on support vector regression and kriging model applied to a transonic axial compressor to approximate the complicated relationships between geometrical variables and objective performance outputs with different sampling methods and sizes. The purpose is to explore the prediction accuracy and computational efficiency of this adaptive surrogate model in real turbomachinery applications. Three different sampling techniques are studied: (1) uniform design; (2) Latin hypercube sampling method; (3) Sobol quasi-random design. For the low dimensional case with five variables, the adaptive region segmentation combining surrogate model performs better (not worse) than the single component surrogate in terms of prediction accuracy and computational efficiency. In the meanwhile, it is also noted that the uniform design applied to the adaptive surrogate model has more advantages over the Latin hypercube sampling method especially for the small sample size cases, both performing better than the Sobol quasi-random design. Moreover, a high dimensional case with 12 variables is also utilized to further validate the prediction advantage of the adaptive region segmentation combining surrogate model over the single component surrogate, and the computational results favor it. Overall, the adaptive region segmentation combining surrogate model has produced acceptable to high prediction accuracy in presenting complex relationships between the geometrical variables and the objective performance outputs and performed robustly for a transonic axial compressor problem.
In recent years, the parameterized level set method (PLSM) has attracted widespread attention for its good stability, high efficiency and the smooth result of topology optimization compared with the conventional level set method. In the PLSM, the radial basis functions (RBFs) are often used to perform interpolation fitting for the conventional level set equation, thereby transforming the iteratively updating partial differential equation (PDE) into ordinary differential equations (ODEs). Hence, the RBFs play a key role in improving efficiency, accuracy and stability of the numerical computation in the PLSM for structural topology optimization, which can describe the structural topology and its change in the optimization process. In particular, the compactly supported radial basis function (CS-RBF) has been widely used in the PLSM for structural topology optimization because it enjoys considerable advantages. In this work, based on the CS-RBF, we propose a PLSM for structural topology optimization by adding the shape sensitivity constraint factor to control the step length in the iterations while updating the design variables with the method of moving asymptote (MMA). With the shape sensitivity constraint factor, the updating step length is changeable and controllable in the iterative process of MMA algorithm so as to increase the optimization speed. Therefore, the efficiency and stability of structural topology optimization can be improved by this method. The feasibility and effectiveness of this method are demonstrated by several typical numerical examples involving topology optimization of single-material and multi-material structures.
Forecasting stock prices using deep learning models suffers from problems such as low accuracy, slow convergence, and complex network structures. This study developed an echo state network (ESN) model to mitigate such problems. We compared our ESN with a long short-term memory (LSTM) network by forecasting the stock data of Kweichow Moutai, a leading enterprise in China’s liquor industry. By analyzing data for 120, 240, and 300 days, we generated forecast data for the next 40, 80, and 100 days, respectively, using both ESN and LSTM. In terms of accuracy, ESN had the unique advantage of capturing nonlinear data. Mean absolute error (MAE) was used to present the accuracy results. The MAEs of the data forecast by ESN were 0.024, 0.024, and 0.025, which were, respectively, 0.065, 0.007, and 0.009 less than those of LSTM. In terms of convergence, ESN has a reservoir state-space structure, which makes it perform faster than other models. Root-mean-square error (RMSE) was used to present the convergence time. In our experiment, the RMSEs of ESN were 0.22, 0.27, and 0.26, which were, respectively, 0.08, 0.01, and 0.12 less than those of LSTM. In terms of network structure, ESN consists only of input, reservoir, and output spaces, making it a much simpler model than the others. The proposed ESN was found to be an effective model that, compared to others, converges faster, forecasts more accurately, and builds time-series analyses more easily. 相似文献
Machine Learning - Semantic embedding of knowledge graphs has been widely studied and used for prediction and statistical analysis tasks across various domains such as Natural Language Processing... 相似文献
Neural Computing and Applications - Deep convolutional neural networks have achieved great success for image denoising recently. However, increasing the depth of the neural network cannot... 相似文献
Message Sequence Chart (MSC) is a graphical and textual language for describing the interactions between system components, and MSC specifications (MSSs) are a combination of a set of basic MSCs (bMSCs) and a High-level MSC that describes potentially iterating and branching system behavior by specifying the compositions of basic MSCs, which offer an intuitive and visual way of specifying design requirements. With concurrent, timing, and asynchronous properties, MSSs are amenable to errors, and their analysis is important and difficult. This paper deals with timing analysis of MSC specifications with asynchronous concatenation. For an MSC specification, we require that for any loop, its first node be flexible in execution time and its any associated external timing constraint be enforced on the entire loop. Such an MSC specification is called a flexible loop-closed MSC specification (FLMSS). We show that for FLMSSs, the reachability analysis and bounded delay analysis problems can be solved efficiently by linear programming. The solutions have been implemented into our tool TASS and evaluated by experiments. 相似文献
