http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Epidermal Growth Factor가 人體纖維芽細胞 增殖에 미치는 影響
金友濟,鄭豆泳,金良均,梁鍾大 朝鮮大學校 附設 醫學硏究所 1985 The Medical Journal of Chosun University Vol.10 No.1
The effects of epidermal growth factor(EGF) on the cell proliferation were estimated in normal human fibroblast and established adenovirus type 12-simian murine sarcoma virus 40 hybrid virus-transformed human fibroblast. In the presence of culture medium containing 1.0ng per ㎖ epidermal growth factor had more effect on the cell proliferation of transformed cell lines than normal cell lines. The data suggest that epidermal growth factor stimulates cell proliferation in additive manner of virus-transformed human fibroblast.
김우제,도승용,박순달,Katta G. Murty 한국로지스틱스학회 2001 로지스틱스연구 Vol.9 No.2
일일 간선수송문제는 각 화물터미널간에 수송물량이 주어진 상태에서 하루내에 수송하는 차량경로를 결정하는 문제이다. 소량화물을 가지는 일일 수송문제에 대해서는 각 화물터미널 간의 수송물량에 대해 중계지점을 통해 운송을 하는 수송체계가 유리하다. 본 연구에서는 이러한 수송체계를 효율적으로 구현하기 위한 유전알고리즘을 제시한다. 유전알고리즘에서는 중계지점을 선정하기 위한 유전알고리즘의 개체표현과 개체를 이용한 수송계획을 세우기 위해 절약개념을 이용한 휴리스틱 방법을 제시하였다. 그리고 유전알고리즘의 최적모수를 결정하기 위한 실험결과와 유전알고리즘의 해의 수렴을 검증하기 위한 실험결과가 제시되었다. Overnight linehaul scheduling is to determine the vehicle routing to move all freight from its originating terminal to its destination terminal after each shipment is picked up from the shipping dock. The transportation system to have several transshipment points is efficient for overnight linehaul scheduling with small amout shipment since each shipment may have a different transshipment point for overnight linehaul operations carrying small amount of shipment, The purpose of this paper is to present a genetic algorithm for the transportation system. It is suggested how to generate a chromosome for representing transshipment points and a heuristic for vehicle routing using the transshipment points. The computational results are resented for determining optimal parameters for the genetic algorithm, and showed the convergence of the genetic algorithm.
김우제,안재근,박순달 한국경영과학회 1994 經營 科學 Vol.11 No.3
In this paper we studied an integration scheme of some simplex algorithms and some efficient techniques to get the stable solution in linear programming code. And we developed a linear programming package (LPAK) by introducing this scheme and techniques. In LPAK three different algorithms were integrated, which were two primal simplex algorithms using Two phase method and big-M method respectively, and the dual simplex algorithm. LPAK introduces several heuristic techniques in each step of simplex method in order to enhance the stability and efficiency. They were new heuristic methods in structuring initial basis, choosing entering variable, choosing dropping variable and performing reinversion. The experimental results on the NETLIB problems showed that LPAK provided the stable solutions.
김우제 대진대학교 1995 大眞論叢 Vol.3 No.-
The purpose of this paper is to develop an efficient simplex program in Linear Programming. First, the data structure is designed in the form of LU decomposition for the inverse basis matrix. Second, some techniques are introduced for the numerical stabilization. The methods of scaling and measuring of the numerical error are implemented and tested for the NETLIB problems. Finally some modules are developed for the speed-up of simplex program. The experimental results on the NETLIB problems show that this program provides the stable solutions.
김우제 대진대학교 생산기술연구소 1998 생산기술연구소 논문집 Vol.1 No.-
This paper presents a new method of sensitivity analysis for the primal-dual barrier method on the cost coefficients and the right hand sides. Tod develop the method of sensitivity analysis, we first derive the expressions for the final solution from data which are maintained in the primal-dual barrier method. Then we extract the characteristic regions on the cost coefficients and the right hand sides by manipulating the mathematical expressions for the final solution.