• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 추계학술대회
• /
• pp.919-922
• /
• 2016

쥐의 배아의 척수신경절로 부터 슈반세포와 뉴런 세포가 각각 분리되어 배양되었다. in vitro 시스템에서 배양되었다. 정제된 뉴런 세포는 항 유사분열제로 처리하였고 정제한 슈반세포들과 함께 공동배양 하였다. 이 때 수초화 과정이 진행되었다. 이렇게 수초화된 공동 배양에 Herpes simplex virus-1을 감염시켜 탈수초화를 진행 시켰다. 우리는 수초화의 존재를 의미하는 neuropeptide Y의 항체를 이용하여 수초화와 탈수초화를 확인하였다.

• Current Optics and Photonics
• /
• 제6권2호
• /
• pp.161-170
• /
• 2022

Three-dimensional (3D) geometric models are introduced to correct vignetting, and a downhill simplex search is applied to determine the coefficients of a 3D model used in digital microscopy. Vignetting is nonuniform illuminance with a geometric regularity on a two-dimensional (2D) image plane, which allows the illuminance distribution to be estimated using 3D models. The 3D models are defined using generalized polynomials and arbitrary coefficients. Because the 3D models are nonlinear, their coefficients are determined using a simplex search. The cost function of the simplex search is defined to minimize the error between the 3D model and the reference image of a standard white board. The conventional and proposed methods for correcting the vignetting are used in experiments on four inspection systems based on machine vision and microscopy. The methods are investigated using various performance indices, including the coefficient of determination, the mean absolute error, and the uniformity after correction. The proposed method is intuitive and shows performance similar to the conventional approach, using a smaller number of coefficients.

• 대한영상의학회지
• /
• 제81권3호
• /
• pp.714-718
• /
• 2020

유방에서 발생하는 헤르페스 감염은 매우 드물며 영상 소견 또한 잘 알려져 있지 않다. 본 증례 보고는 사춘기 여성 환자에서 발생한 헤르페스 유선염의 증례로 임상 소견 및 초음파 영상 소견을 기술하였다. B-mode 초음파에서는 일측성의 유륜 피부 두께 증가 및 액와부 림프절 종대의 소견을 보였고 도플러 초음파 상에서는 분지하는 양상의 선형 혈류 증대가 관찰되었다. 유륜 피부 생검을 통하여 헤르페스 감염으로 확진되었다. 헤르페스 유선염의 영상 소견은 국소적인 유두와 유륜 피부 비후와 혈류 증가로 유방의 Paget 병과 유사할 수 있으므로 감별이 필요하다.

• 한국국방경영분석학회지
• /
• 제11권1호
• /
• pp.79-86
• /
• 1985

A multi-interchange simplex method is presented. This method tries to cut almost half of the set of convex combinations which generate all decreasing feasible directions. Analysis of this method indicates high possibility of the existence of polynomial-time simplex-type methods.

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 2002년도 proceedings of the second asia international conference on tribology
• /
• pp.399-400
• /
• 2002

A numerical procedure for analyzing thermo-elastic contact applied to an automotive disk brake and calculating subsurface stress distribution has been developed. The proposed procedure takes the advantage of the simplex algorithm to save computing time. Flamant's solution and Boussinesq's solution are adopted as Green function in analysis. Comparing the numerical results with the exact solutions has proved the validity of this procedure.

• 충청수학회지
• /
• 제25권2호
• /
• pp.313-318
• /
• 2012

The power inequality ${\prod}_{k=1}^{N}\;{x}_{k}^{x_{k}}\;{\geq}\;{\prod}_{k=1}^{N}\;{p}_{k}^{x_{k}}$ holds for the points $(x_1,{\ldots},x_N),(p_1,{\ldots},p_N)$ of the simplex. We show this using the analytic method combining Frostman's density theorem with the strong law of large numbers.

• 한국국방경영분석학회지
• /
• 제9권2호
• /
• pp.57-60
• /
• 1983

We show that the complexity of Simplex Method for Linear Programming problem is equivalent to the complexity of finding just an adjacent basic feasible solution if exists. Therefore a simplex type method which resolves degeneracy in polynomial time with respect to the size of the given linear programming problem can solve the general linear programming problem in polynomial steps.

• 산업경영시스템학회지
• /
• 제3권3호
• /
• pp.49-53
• /
• 1980

Computer program about the simplex method -one of the most popularity used linear programming- has been studied. Variable and subject to the restriction are growing according to the growing of all of the problem. In this paper, the problem that can be solved by simplex method may be processed with enormous block unit ( $50\;{\times};\50$ ). Because of using computer all of the problem can be solved more accurately and quickly. In appendix, computer program and running example are recorded.

• Journal of Microbiology and Biotechnology
• /
• 제6권2호
• /
• pp.142-144
• /
• 1996

To clone the gene coding for steroid $\Delta^1$-dehydrogenase of Arthrobacter simplex, its genomic library was constructed with a , $\lambda$gt11 expression vector and immunoscreened with antiserum against the enzyme. One positive clone was found to carry a 1.6-kb EcoR I restriction endonuclease fragment of A. simplex DNA. The restriction map of the 1.6-kb EcoR I fragment was determined after cloning of the DNA into pBS vector.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.52-55
• /
• 1997

In this paper, both the generalization of one artificial variable technique to the general bound problem and the efficient implementation of the technique are suggested. When the steepest-edge method is used as a pricing rule in the simplex method, it is easy to update the reduced cost and the simplex multiplier every iteration. Therefore, one artificial variable technique is more efficient than Wolfe's method in which the reduced cost and simplex multiplier must be recalculated in every iteration. When implementing the one artificial variable technique on the LP problems with the general bound restraints on the variables, an arbitrary basic solution which satisfies the bound restraints is sought first, and the artificial column which adjusts the infeasibility is introduced. The phase one of the simplex method minimizes the one artificial variable. The efficient implementation technique includes the splitting, scaling, storage of the artificial column, and the cure of infeasibility problem.