• Bulletin of the Korean Chemical Society
• /
• 제35권2호
• /
• pp.365-370
• /
• 2014

For real-time monitoring of colloidal nanoparticles (NPs) in aqueous media, a light sheet type dark-field microscopy system combined with a microfluidic concentration gradient generator (${\mu}FCGG$-LSDFM) was developed. Various concentrations of colloidal Au NPs were simultaneously generated with the iFCGG and characterized with the LSDFM setup. The number concentrations and hydrodynamic size distributions were measured via particle counting and tracking analysis (PCA and PTA, respectively) approaches. For the 30 nm Au NPs used in this study, the lower detection limit of the LSDFM setup was 3.6 ng/mL, which is about 400 times better than that of optical density measurements under the same ${\mu}FCGG$ system. Additionally, the hydrodynamic diameter distribution of Au NPs was estimated as $39.7{\pm}12.2nm$ with the PTA approach, which agrees well with DLS measurement as well as the manufacturer's specification. We propose this ${\mu}FCGG$-LSDFM setup with features of automatic generation of NP concentration gradient and real-time monitoring of their physicochemical characteristics (e.g., number concentration, and hydrodynamic size distribution) as an important component of future high-throughput screening or high-content analysis platforms of nanotoxicity.

• 한국정밀공학회지
• /
• 제28권3호
• /
• pp.339-348
• /
• 2011

Reconfigurable manufacturing system (RMS), alternatively called changeable manufacturing, is a new manufacturing paradigm designed for rapid change in hardware and software components in order to quickly adjust production capacity and functionality in response to sudden changes in market or in regulatory requirements. Although there has been much progress in hardware components during the last decade, not much work has been done on operational issues of RMS. As one of starting studies on the operational issues, we suggest a framework for the system setup and scheduling problems to cope with the reconfigurability of RMS. System setup, which includes batching, part grouping, and loading, are concerned with the pre-arrangement of parts and tools before the system begins to process, and scheduling is the problem of allocating manufacturing resources over time to perform the operations specified by system setup. The framework consists of 8 scenarios classified by three major factors: order arrival process, part selection process, and tool magazine capacity. Each of the scenarios is explained with its subproblems and their interrelationships.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2004년도 추계 종합학술대회 논문집
• /
• pp.220-227
• /
• 2004

본 논문에서는 기존의 무선 PKI에서 개선되어야 할 여러 가지 사항 중에서 핸드오버시 인증서 획득시간을 단축하기 위한 새로운 인증구조에서의 블러킹 확률 분석을 알아보고자 한다. 기존의 키 교환방식에서 키 교환 설정단계가 단순히 이산대수문제에 근거하여 수행되었지만 인증서 시간단축을 위한 무선 PKI 인증구조의 상호인증과정에서는 키 교환 설정단계에서 타원곡선을 적용하였다. 제안한 무선 PKI 구조 안에서의 핸드오버 방법과 블러킹 확률 분석에 대하여 알아보았다.

• 한국공작기계학회논문집
• /
• 제16권4호
• /
• pp.22-28
• /
• 2007

The welded defects are usually called user's unsatisfaction for appearance and functional usage. For checking these defects effectively without time loss, setup of weldability estimation system is an important for detecting whole specimen quality. In this study, after catching a rawdata on welded specimen profiles and treating vision processing with these data, the qualitative defects are estimated from getting these information by laser vision camera at first. At the same time, the weldability estimation for whole specimen is produced. For user friendly, the weldability estimation results are shown each profiles, final reports and visual graphics method. So, user can easily determined weldability. By applying these system to welding fabrication, these technologies are contribution to on-line setup of weldability estimation system.

• 한국국방경영분석학회지
• /
• 제27권2호
• /
• pp.25-36
• /
• 2001

In this paper a new heuristic algorithm has been developed and presented for logistics for multiple objectives in an automated manufacturing systems. We proposed Simallest Processing and Average setup time Ratio First(SPARF) algorithm for multiple criteria under sequence setup time. The heuristic algorithm is implemented on the various problem cases by number of jobs and machines. The proposed algorithm provided smaller than the previously documented heuristics. The results obtained show a superior solution by the new heuristic over previous heuristics on all problem sizes. we perform analyses of variance to fortify the above results of comparison with the previous algorithms to the four cases using Statistical Analysis System(SAS) package. The results show that the larger is the number of groups or cells, the bigger is the amount of improvement by the proposed algorithms. It suggests that the algorithms proposed is strongly influenced by the number of cells, groups and interaction of these factors.

• 대한안전경영과학회지
• /
• 제25권2호
• /
• pp.1-8
• /
• 2023

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권12호
• /
• pp.2355-2373
• /
• 2011

Vision-based vehicle detector systems are becoming increasingly important in ITS applications. Real-time operation, robustness, precision, accurate estimation of traffic parameters, and ease of setup are important features to be considered in developing such systems. Further, accurate vehicle detection is difficult in varied complex traffic environments. These environments include changes in weather as well as challenging traffic conditions, such as shadow effects and jams. To meet real-time requirements, the proposed system first applies a color background to extract moving objects, which are then tracked by considering their relative distances and directions. To achieve robustness and precision, the color background is regularly updated by the proposed algorithm to overcome luminance variations. This paper also proposes a scheme of feedback compensation to resolve background convergence errors, which occur when vehicles temporarily park on the roadside while the background image is being converged. Next, vehicle occlusion is resolved using the proposed prior split approach and through reasoning for rule-based tracking. This approach can automatically detect straight lanes. Following this step, trajectories are applied to derive traffic parameters; finally, to facilitate easy setup, we propose a means to automate the setting of the system parameters. Experimental results show that the system can operate well under various complex traffic conditions in real time.

• 대한산업공학회지
• /
• 제33권3호
• /
• pp.373-380
• /
• 2007

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.

• 한국산학기술학회논문지
• /
• 제7권5호
• /
• pp.879-886
• /
• 2006

본 논문에서는 기존의 무선 PKI에서 개선되어야 할 여러 가지 사항 중에서 인증서 획득시간을 단축하기 위한 새로운 인증구조를 제안하고자 한다. 개인키를 기반으로 하는 현재의 무선 PKI 인증은 확장이 힘들다는 단점이 있다. 또한 전자상거래에서 중요한 부인 봉쇄 서비스를 제공할 수 없다. 이러한 문제점을 해결하기 위하여 Sufatrio, K. Lam[4]는 공개키 기반의 인증방법을 제안하였다. 기존의 키 교환방식에서 키 교환 설정단계가 단순히 이산대수문제에 근거하여 수행되었지만, 본 논문에서는 인증서 획득시간 단축을 위해 상호인증과정과 키 교환 설정단계에서 타원곡선을 적용하였다. Sufatrio, K. Lam[4]의 인증구조와 타원곡선을 적용한 인증구조에서 인증서 획득시간을 실험을 통해 비교 분석한 결과 인증서 획득 시간이 효율적으로 단축되었다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.127-133
• /
• 2006

Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product quality. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems. Also, we developed a web based scheduling and monitoring system for a zinc alloy production process using the developed heuristic algorithm. By using this system, we could find a monthly zinc alloy production schedule that significantly reduces the total number of setup changes.