http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Lee, Misook,Park, Wook,Chung, Changkwon,Lim, Jaehoon,Kwon, Sunghoon,Ahn, Kyung Hyun,Lee, Seung Jong,Char, Kookheon Royal Society of Chemistry 2010 Lab on a chip Vol.10 No.9
<P>We demonstrate that polyelectrolyte (PE) multilayer thin films deposited on patterned posts with incredibly large numbers of bilayers, which would not be possible with the conventional Layer-by-Layer (LbL) deposition methods, can be obtained in a short process time using alternating polyelectrolyte droplets generated in a microfluidic channel, representing a significant advantage over the conventional processes based on polyelectrolyte deposition followed by the separation of such substrates (typically colloidal particles) with centrifugation and sonication. Positively- and negatively-charged polyelectrolyte droplets were alternatively generated in a microfluidic channel by controlling the capillary number (<I>Ca</I>) as well as the fraction of dispersed phase over the continuous phase. Patterned posts, serving as the substrates for the PE deposition, were created with photo-curable polymers using the optofluidic maskless lithography. The impact of these PE droplets onto the patterned posts allowed the alternative adsorption of PEs, similar to the conventional LbL deposition methods. It was shown that the intensity of fluorescence dye tagged onto (+)-charged PEs adsorbed on the post(s), taken with confocal laser scanning microscopy, increases with deposition time and varies around the post(s). The effect of post shape and interval between the two posts for the droplet-based LbL deposition was also experimentally investigated and analyzed, in connection with the numerical simulations, to elucidate the underlying principles of relevant two-phase flows.</P> <P>Graphic Abstract</P><P>We demonstrate that polyelectrolyte (PE) multilayer thin films deposited on lithographically defined patterned posts can be achieved in a facile manner using alternating polyelectrolyte droplets generated in a microfluidic channel. <IMG SRC='http://pubs.rsc.org/services/images/RSCpubs.ePlatform.Service.FreeContent.ImageService.svc/ImageService/image/GA?id=b919753b'> </P>
A Quick Sequencing Algorithm for a Mixed Model Assembly Line with Multiple Stations
Kim, Yearn-Min,Park, Changkwon,Choi, Wonjoon 한국경영과학회 2001 한국경영과학회 학술대회논문집 Vol.- No.1(1)
This paper addresses a quick sequencing algorithm for a mixed assembly line with multiple work stations where each product is characterized by the presence or absence of each of a set of available options. We compare the proposed algorithm with several heuristics of the sequencing problem that minimize the total utility works and show the computational experiences of the proposed heuristics.
상이한 납기와 도착시간을 갖는 단일기계 일정계획을 위한 유전 알고리즘 설계
이동현,이경근,김재균,박창권,장길상 한국경영과학회 1999 韓國經營科學會誌 Vol.24 No.3
In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.
최원준(Wonjoon Choi),김연민(Yearnmin Kim),이용일(Yongil Lee),박창권(Changkwon Park) 대한산업공학회 2004 대한산업공학회지 Vol.30 No.4
In mixed-model production systems, various models of products are produced alternately on the same production line. When the total number of models or the total production quantity is large, it takes a long time to determine the production sequence of the products. In this paper, we will show that in case of product rate variation problem (PRV) problem with nonidentical symmetric convex discrepancy function, an optimum sequence can be obtained by repeating an optimum sequence in a reduced subproblem.