• Title/Summary/Keyword: vector optimization

Search Result 473, Processing Time 0.024 seconds

Use of multi-hybrid machine learning and deep artificial intelligence in the prediction of compressive strength of concrete containing admixtures

  • Jian, Guo;Wen, Sun;Wei, Li
    • Advances in concrete construction
    • /
    • v.13 no.1
    • /
    • pp.11-23
    • /
    • 2022
  • Conventional concrete needs some improvement in the mechanical properties, which can be obtained by different admixtures. However, making concrete samples costume always time and money. In this paper, different types of hybrid algorithms are applied to develop predictive models for forecasting compressive strength (CS) of concretes containing metakaolin (MK) and fly ash (FA). In this regard, three different algorithms have been used, namely multilayer perceptron (MLP), radial basis function (RBF), and support vector machine (SVR), to predict CS of concretes by considering most influencers input variables. These algorithms integrated with the grey wolf optimization (GWO) algorithm to increase the model's accuracy in predicting (GWMLP, GWRBF, and GWSVR). The proposed MLP models were implemented and evaluated in three different layers, wherein each layer, GWO, fitted the best neuron number of the hidden layer. Correspondingly, the key parameters of the SVR model are identified using the GWO method. Also, the optimization algorithm determines the hidden neurons' number and the spread value to set the RBF structure. The results show that the developed models all provide accurate predictions of the CS of concrete incorporating MK and FA with R2 larger than 0.9972 and 0.9976 in the learning and testing stage, respectively. Regarding GWMLP models, the GWMLP1 model outperforms other GWMLP networks. All in all, GWSVR has the worst performance with the lowest indices, while the highest score belongs to GWRBF.

Parameter Extraction of HEMT Small-Signal Equivalent Circuits Using Multi-Bias Extraction Technique (다중 바이어스 추출 기법을 이용한 HEMT 소신호 파라미터 추출)

  • 강보술;전만영;정윤하
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.353-356
    • /
    • 2000
  • Multi-bias parameter extraction technique for HEMT small signa] equivalent circuits is presented in this paper. The technique in this paper uses S-parameters measured at various bias points in the active region to construct one optimization problem, of which the vector of unknowns contains only a set of bias-independent elements. Tests are peformed on measured S-parameters of a pHEMT at 30 bias points. Results indicate that the calculated S-parameters is similar to the measured data.

  • PDF

Optimization of Groove Sizing in CMP using CFD (CFD를 이용한 CMP의 Groove Sizing 최적화)

  • Jang, Ji-Hwan;Lee, Do-Hyung
    • Proceedings of the KSME Conference
    • /
    • 2004.11a
    • /
    • pp.1522-1527
    • /
    • 2004
  • In this paper, slurry fluid motion, abrasive particle motion, and effects of groove sizing on the pads are numerically investigated in the 2D geometry. Groove depth is optimized in order to maximized the abrasive effect. The simulation results are analyzed in terms of shear stress on pad, groove and wafer, streamline and velocity vector. The change of groove depth entails vortex pattern change, and consequently affects material removal rate. Numerical analysis is very helpful for disclosing polishing mechanism and local physics.

  • PDF

JACOBI DISCRETE APPROXIMATION FOR SOLVING OPTIMAL CONTROL PROBLEMS

  • El-Kady, Mamdouh
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.1
    • /
    • pp.99-112
    • /
    • 2012
  • This paper attempts to present a numerical method for solving optimal control problems. The method is based upon constructing the n-th degree Jacobi polynomials to approximate the control vector and use differentiation matrix to approximate derivative term in the state system. The system dynamics are then converted into system of algebraic equations and hence the optimal control problem is reduced to constrained optimization problem. Numerical examples illustrate the robustness, accuracy and efficiency of the proposed method.

A Study on Development of Commercial PIV Utilizing Multimedia (멀티미디어 대응 상용 PIV의 국산화개발에 관한 연구)

  • 최장운
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.22 no.5
    • /
    • pp.652-659
    • /
    • 1998
  • The present study is aimed to develop a new PIV operating software through optimization of vector tracking identification including versatile pre-processings and post-processing techniques. And the result exhibits an improved version corresponding various input and output multimedia compared to previous commercial software developed by other makers. An upgraded identification method called grey-level cross correlation coefficient method by direct calculation is suggested and related user-friendly pop-up menu are also represented. Post-processings comprising turbulence statistics are also introduced with graphic output functions.

  • PDF

Inverse Bin-Packing Number Problems: Polynomially Solvable Cases

  • Chung, Yerim
    • Management Science and Financial Engineering
    • /
    • v.19 no.1
    • /
    • pp.25-28
    • /
    • 2013
  • Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

New Method for Station Keeping of Geostationary Spacecraft Using Relative Orbital Motion and Optimization Technique (상대 운동과 최적화 기법을 이용한 정지궤도 위치유지에 관한 연구)

  • Jung, Ok-Chul;No, Tae-Soo;Lee, Sang-Cherl;Yang, Koon-Ho;Choi, Seong-Bong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.33 no.1
    • /
    • pp.39-47
    • /
    • 2005
  • In this paper, a method of station keeping strategy using relative orbital motion and numerical optimization technique is presented for geostationary spacecraft. Relative position vector with respect to an ideal geostationary orbit is generated using high precision orbit propagation, and compressed in terms of polynomial and trigonometric function. Then this relative orbit model is combined with optimization scheme to propose a very efficient and flexible method of station keeping planning. Proper selection of objective and constraint functions for optimization can yield a variety of station keeping methods improved over the classical ones. Results from the nonlinear simulation have been shown to support such concept.

A Study on Automatic Learning of Weight Decay Neural Network (가중치감소 신경망의 자동학습에 관한 연구)

  • Hwang, Chang-Ha;Na, Eun-Young;Seok, Kyung-Ha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.12 no.2
    • /
    • pp.1-10
    • /
    • 2001
  • Neural networks we increasingly being seen as an addition to the statistics toolkit which should be considered alongside both classical and modern statistical methods. Neural networks are usually useful for classification and function estimation. In this paper we concentrate on function estimation using neural networks with weight decay factor The use of weight decay seems both to help the optimization process and to avoid overfitting. In this type of neural networks, the problem to decide the number of hidden nodes, weight decay parameter and iteration number of learning is very important. It is called the optimization of weight decay neural networks. In this paper we propose a automatic optimization based on genetic algorithms. Moreover, we compare the weight decay neural network automatically learned according to automatic optimization with ordinary neural network, projection pursuit regression and support vector machines.

  • PDF

Efficiency Optimization Control of IPMSM Drive using Multi AFLC (다중 AFLC를 이용한 IPMSM 드라이브의 효율 최적화 제어)

  • Choi, Jung-Sik;Ko, Jae-Sub;Chung, Dong-Hwa
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.59 no.3
    • /
    • pp.279-287
    • /
    • 2010
  • Interior permanent magnet synchronous motor(IPMSM) adjustable speed drives offer significant advantages over induction motor drives in a wide variety of industrial applications such as high power density, high efficiency, improved dynamic performance and reliability. This paper proposes efficiency optimization control of IPMSM drive using adaptive fuzzy learning controller(AFLC). In order to optimize the efficiency the loss minimization algorithm is developed based on motor model and operating condition. The d-axis armature current is utilized to minimize the losses of the IPMSM in a closed loop vector control environment. The design of the current based on adaptive fuzzy control using model reference and the estimation of the speed based on neural network using ANN controller. The controllable electrical loss which consists of the copper loss and the iron loss can be minimized by the optimal control of the armature current. The minimization of loss is possible to realize efficiency optimization control for the proposed IPMSM. The optimal current can be decided according to the operating speed and the load conditions. This paper considers the design and implementation of novel technique of high performance speed control for IPMSM using AFLC. Also, this paper proposes speed control of IPMSM using AFLC1, current control of AFLC2 and AFLC3, and estimation of speed using ANN controller. The proposed control algorithm is applied to IPMSM drive system controlled AFLC, the operating characteristics controlled by efficiency optimization control are examined in detail.

Study on Support Vector Machines Using Mathematical Programming (수리계획법을 이용한 서포트 벡터 기계 방법에 관한 연구)

  • Yoon, Min;Lee, Hak-Bae
    • The Korean Journal of Applied Statistics
    • /
    • v.18 no.2
    • /
    • pp.421-434
    • /
    • 2005
  • Machine learning has been extensively studied in recent years as effective tools in pattern classification problem. Although there have been several approaches to machine learning, we focus on the mathematical programming (in particular, multi-objective and goal programming; MOP/GP) approaches in this paper. Among them, Support Vector Machine (SVM) is gaining much popularity recently. In pattern classification problem with two class sets, the idea is to find a maximal margin separating hyperplane which gives the greatest separation between the classes in a high dimensional feature space. However, the idea of maximal margin separation is not quite new: in 1960's the multi-surface method (MSM) was suggested by Mangasarian. In 1980's, linear classifiers using goal programming were developed extensively. This paper proposes a new family of SVM using MOP/GP techniques, and discusses its effectiveness throughout several numerical experiments.