http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
LCVD 법에 의한 Silicon의 박막 생장과 시료의 광학적 성질에 관한 연구
劉東宣 國立 昌原大學校 産業技術硏究所 1988 産技硏論文集 Vol.2 No.-
CO₂laser CVD (laser induced chemical vapor deposition) system was constructed and silicon thin films were deposited by using SiH₄. The silicon films were deposited at a deposition rate of 1600Å/min at room temperature, at CO₂laser 14w/㎠ under SiH₄pressure 0.01 torr on quartz plate when irradiation time was 11 minutes, and the deposition rate depends on the irradiation time. The absorption coefficients and optical gaps were very small at visible region and the conductivities were very large at room temperature and this show that the deposited films has polycrystalline structure.
인구 역 추정에 의한 시조의 연대를 추정하는 수리적 방법
유동선,구자흥,이성철 한국수학사학회 2004 Journal for history of mathematics Vol.17 No.1
There are so many methods in population estimation such as logistic estimation and compound interest estimation. If we have some pieces of information about population of one tribe, we can estimate progenitor chronology of that tribe used by inverse estimation. In this paper, we describe several theory of population estimation, and develop mathematical method for estimation progenitor chronology from prior general data and statistical estimation theory. Several examples are illustrated.
劉東善 한국항공대학교 1983 論文集 Vol.21 No.-
Simulation is one of the most important OR tools in use today. It has been used successfully ot analyze any number of systems. The use of simulation has become so widespread that almost every industry has benefited in some way through the use of simulation. I have shown in this paper that this queueing system can be analyzed analytically. Many realistic systems cannot be modeled for solution by standard OR methods. Hence, some form of simulation must be used to provide the solution. There are several types of simulation, but we will restrict our attention to the simulation of mathematical model of systems in which the variables involved are subject to random variation.
Characterization of CdS Nanoparticles Embedded in Polyvinyl Alcohol
유동선,하성용,Kim I. G.,Choo M. S.,Kim K. W.,Lee E. S. 한국물리학회 2011 새물리 Vol.61 No.7
CdS nanoparticles embedded in a PVA (polyvinyl alcohol) matrix were prepared and characterized by using cadmium chloride (CdCl₂) and sodium sulfide (Na_2S). When CdCl₂of various molar concentrations was a mixed with a PVA aqueous solution, the -OH groups in PVA acted as coordinating sites for cadmium ion Cd^(2+) aggregations to form PVA-Cd^(2+) composites. The CdS nanoparticles embedded in PVA were successfully grown at these sites by dipping PVA-Cd^(2+) composites into a solution that contained 0.5 mM of S^(2-) ions from Na_2S. The optical band gaps of the nanoparticles were increased from 2.51eV to 2.74 eV by decreasing the molar concentration of CdCl₂from 5 mM to 0.5 mM, indicating that the size of the nanoparticles increased with increasing CdCl₂molar concentration. X-ray diffraction results showed that the CdS nanoparticles were in a cubic phase while their sizes,estimated to be 4.7 nm, 4.8 nm and 5.9 nm for CdCl₂concentrations of 0.7 mM, 1.0 mM and 3.0 mM, respectively, were almost identical to the values calculated by using Brus’s formula. The PL emission spectra of the CdS nanoparticles formed by 0.7 mM of Cd^(2+)showed two peaks, one at 471 nm and the other at 606 nm,which were attributed to the band edge and to surface defects,respectively.
劉東善 한국항공대학교 1978 論文集 Vol.14 No.-
本論文은 線型計劃法에서의 諸理論을 간단히 要約하고 Simplex法의 基本理論을 確立하여 그 計算過程에서 線型演算의 保存性에 의하여 改訂 Simplex法을 들었다. 다음은 非線型計劃문제의 一般論을 要約하고 이 理論에 의하여 線型條件下에서 二次計劃문제의 Simplex法에 의한 解法에 대하여 硏究하였다. It is mentioned mainly a very special subclass of programing problems called linear-programming problems and the quadratic-programming problems of the non-linear programming problems. for the purpose of the theoretical development, it is important to establishe some fundamental theorems, and the theoretical and basic concepts which play a crucial role in linear programming and non-linear programming. In linear-programming problems, we mentioned the revised simplex method and related computational algrithm and its properties of linear operations. Finally I discussed how to apply the simplex method to non-linear programming problem of the quadratic-programming problem which is restricted by linear constraints. The solution of these problems can be accomplished by adaptations of the simplex method. This method is gradiend simplex method for solving the problem of minimizing a convex function subject to linear constraints. The procedure uses the tableau structure of the simplex method.