• Title/Summary/Keyword: simplex

Search Result 664, Processing Time 0.033 seconds

Optimum Design of Power Screw Efficiency by Fuzzy Simplex Search Algorithm (퍼지 simplex search 알고리듬을 이용한 동력 스크류 효율의 최적설계)

  • Hyun, Chang-Hun;Lee, Byeong-Ki
    • Journal of Industrial Technology
    • /
    • v.22 no.A
    • /
    • pp.19-28
    • /
    • 2002
  • The Nelder-Mead simplex algorithm has been one of the most widely used methods for the nonlinear unconstrained optimization, since 1965. Recently, the new algorithm, (so-called the Fuzzy Simplex Algorithm), with fuzzy logic controllers for the expansion, reflection and contraction process of this algorithm has been proposed. In this paper, this new algorithm is developed. And, the formulation for the optimum design of the power screw's efficiency is made. And then, the developed fuzzy simplex algorithm as well as the original one is applied to this optimum design problem. The Fuzzy simplex algorithm results in a faster convergence in this problem, as reported in other study, too.

  • PDF

Efficient Implementation Techniques the Dual Simplex Method (쌍대단체법의 효율적인 구현을 위한 기법)

  • 임성묵;박찬규;김우제;박순달
    • Korean Management Science Review
    • /
    • v.16 no.1
    • /
    • pp.1-9
    • /
    • 1999
  • The purpose of this paper is to develope efficient techniques for implementing the dual simplex method. In this paper we proposed one artificial row technique to get an initial dual feasible basic solution, a dual steepest-edge method coupled with a dropping row selection rule, and an anti-degeneracy technique which resembles the EXPAND procedure for the primal simplex method. The efficiency of the above techniques is shown by experiments. Finally, the dual simplex method is shown to be superior to the primal simplex method when it is used in the integer programming.

  • PDF

A comparison of the hydrolase activities of excretory-secretory products and somatic extracts from fish parasitic nematodes, Anisakis simplex sensu stricto and Anisakis pegreffii larvae (어류 기생성 선충 Anisakis simplex sensu stricto와 Anisakis pegreffii 유충의 excretory-secretory products 및 somatic extracts의 가수분해효소 활성 비교)

  • Jeon, Chan-Hyeok;Wi, Seong;Kim, Jeong-Ho
    • Journal of fish pathology
    • /
    • v.27 no.1
    • /
    • pp.25-33
    • /
    • 2014
  • Hydrolase activities of excretory-secretory products (ESP) and somatic extracts (SE) from Anisakis simplex sensu stricto (s.s.) and Anisakis pegreffii larvae were investigated by using API ZYM kit. In esterase group, acid phosphatase showed high activity from both of A. simplex (s.s.) and A. pegreffii. Esterase (C4) showed activity only from SE and A. simplex (s.s.) showed higher activity than A. pegreffii. Alkaline phosphatase, acid phosphatase and naphthol-AS-BI-phosphohydrolase showed higher activity in 3rd stage larvae than in 4th stage larvae of both species. In aminopeptidase group, only leucine arylamidase showed remarkable activity in SE of both anisakid species, and A. simplex (s.s.) SE showed higher activity than A. pegreffii SE. In glycosidase group, N-acetyl-${\beta}$-glucosaminidase, ${\alpha}$-mannosidase, ${\alpha}$-fucosidase showed higher activity in A. simplex (s.s.) than A. pegreffii, and 4th larvae showed higher activity than 3rd larvae. These differences in hydrolase activity of anisakid nematodes larvae are thought to be due to different metabolism such as growth, moulting, digestion and feeding.

Effect of Three Microalgal Species on Growth and Survival of Larvae and Spat of Ark Shell Scapharca broughtonii (미세조류 3종의 먹이에 따른 피조개 Scapharca broughtonii 유생과 부착치패의 성장과 생존)

  • Min, Byeong-Hee;Kim, Byeong-Hak;Kwon, O-Nam;Park, Heum-Gi;Hur, Sung Bum
    • The Korean Journal of Malacology
    • /
    • v.28 no.4
    • /
    • pp.293-303
    • /
    • 2012
  • Growth and survival (%) of the larvae and spats of Scapharca broughtonii fed on three different microalgal species (Isochrysis galbana, Pavlova lutheri and Chaetoceros simplex) were investigated with the analysis of fatty acid composition. The larvae fed on mixed diet with three microalgal species showed the highest growth in shell length ($261.3{\pm}13.5{\mu}m$) and survival ($27.4{\pm}5.3%$). The growth and survival (%) of the larvae fed on the single diet with C. simplex were significantly higher than those of the larvae fed on I. galbana or P. lutheri (P < 0.05). The growth and survival (%) of S. broughtonii spats reared for 30 days were also highest in the mixed diet group with $1,114.8{\pm}128.0{\mu}m$ and $61.3{\pm}5.5%$, respectively, and followed by C. simplex, I. galbana and P. lutheri. With respect to composition of fatty acid of the single or mixed microalgal diet, the content of PUFA and n-3 HUFA were the highest in C. simplex. This result can be considered as the reason for high growth and survival (%) of the larvae and the spats. C. simplex was the best species as the single diet, but the mixed diet with three microalgal species showed better dietary value than single diet did for the larvae and spat of S. broughtonii.

A Design of Teaching Unit to Foster Secondary Pre-service Teachers' Mathematising Ability: Inquiry into n-volume of n-simplex (예비중등교사의 수학화 능력을 신장하기 위한 교수단원의 설계: n-단체(simplex)의 n-부피 탐구)

  • Kim Jin-Hwan;Park Kyo-Sik
    • School Mathematics
    • /
    • v.8 no.1
    • /
    • pp.27-43
    • /
    • 2006
  • The objective of this paper is to design teaching units to foster secondary pre-service teachers' mathematising abilities. In these teaching units we focus on generalizing area of a 2-dimensional triangle and volume of a 3-dimensional tetrahedron to n-volume of n-simplex In this process of generalizing, principle of the permanence of equivalent forms and Cavalieri's principle are applied. To find n-volume of n-simplex, we define n-orthogonal triangular prism, and inquire into n-volume of it. And we find n-volume of n-simplex by using vectors and determinants. Through these teaching units, secondary pre-service teachers can understand and inquire into n-simplex which is generalized from a triangle and a tetrahedron, and n-volume of n-simplex which is generalized from area of a triangle and volume of a tetrahedron. They can also promote natural connection between school mathematics and academic mathematics.

  • PDF

A Low Complicate Reverse Rake Beamforming Algorithm Based On Simplex Downhill Optimization Method For DS/CDMA Communication (Simplex Downhill 최적화 기법을 기반으로 하는 간략화 된 DS/CDMA 역방향 링크 Rake Beamforming Method)

  • Lee Sang-Keun;Lee Yoon-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.249-253
    • /
    • 2006
  • We propose a new beamforming algorithm, which is based on simplex downhill optimization method in the presence of pilot channels in cdma2000 reverse-link, for the rake structure antenna array in DS/CDMA communication system. Our approach uses the desired signal(pilot) covariance matrix and the interference covariance matrix. The beamforming weights are made according to maximum SINR criteria using simplex downhill optimization procedure. Our proposed scheme provides lower computational load, better convergence speed, better performance than existingadaptive beamforming algorithm. The simplex downhill method is well suited to finding the optimal or sub-optimal weight vector, since they require only the value of the deterministic function to be optimized. The rake beamformer performances are also evaluated under several set of practical parameter values with regard to spatial channel model. We also compare the performance between conventional rake receiver and the proposed one under same receiving power.

The multi-use interfernce cancellation of synchronous DS/CDMA system using SIMPLEX coed and PN code (SIMPLEX 부호와 PN 부호를 사용한 동기 DS/CDMA 시스템의 다원접속간섭제거)

  • 김남선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.4
    • /
    • pp.967-975
    • /
    • 1998
  • This paper presents a system to cancel the multi-user interference of synchronous DS/CDMA systems by using the estimation circuit and the reference correlator. In the code-division multiple access(CDMA) scheme, the spectrum of the user's signal is directly spreaded by means of the Simplex coed or the phase offsetted PN code. It is interesting for the Simplex code and the PN code to have a similar correalation property. It these codes are used in DS/CDMA systems, the number of acceptable users can be increased in comparison with conventioal DS/CDMA systems. This thesis presents a interference cancellation model to cancel the multi-use interference in DS/CDMA systems by using Simples code of PN code as a spreading sequence. In AWGN environment, we analyze interference generated from other users and compare the resulting performance with that of the conventioanl receiver in same user side.

  • PDF

GENERATION OF SIMPLEX POLYNOMIALS

  • LEE JEONG KEUN
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.797-802
    • /
    • 2005
  • We generate simplex polynomials by using a method, which produces an OPS in (d + 1) variables from an OPS in d variables and the Jacobi polynomials. Also we obtain a partial differential equation of the form $${\Sigma}_{i,j=1}^{d+1}\;A_ij{\frac{{\partial}^2u}{{\partial}x_i{\partial}x_j}}+{\Sigma}_{i=1}^{d+1}\;B_iu\;=\;{\lambda}u$$, which has simplex polynomials as solutions, where ${\lambda}$ is the eigenvalue parameter.

A NOTE ON THE GENERALIZED BERNSTEIN POLYNOMIALS

  • Bayad, A.;Kim, T.;Lee, S.H.;Dolgy, D.V.
    • Honam Mathematical Journal
    • /
    • v.33 no.3
    • /
    • pp.431-439
    • /
    • 2011
  • We prove two identities for multivariate Bernstein polynomials on simplex, which are considered on a pointwise. In this paper, we study good approximations of Bernstein polynomials for every continuous functions on simplex and the higher dimensional q-analogues of Bernstein polynomials on simplex.

An Implementation of Preprocessing for the Simplex Method (단체법을 위한 사전처리의 구현)

  • Lim, Sung-Mook;Seong, Myeong-Ki;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.2
    • /
    • pp.217-225
    • /
    • 1999
  • Preprocessing is the essential technique in the implementation of the simplex method for large scale linear programming problems. In this research, we explained the effect of preprocessing in the simplex method, classified the techniques into four categories, and compared our results with those of HOPDM, CPLEX and Soplex by computational experiments. We also noted some implementing issues of preprocessing for the simplex method and the recovery of the optimal basis of the original problem from that of the preprocessed problem.

  • PDF