• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.839-844
• /
• 2003

This paper presents a method to segment wafer ID marks on poor quality images under uncontrolled lighting conditions of the semiconductor process. The active multiple templates matching method is suggested to search ID areas on wafers and segment them into meaningful regions and it would have been impossible to recognize characters using general OCR algorithms. This active template model is designed by applying a snake model that is used for active contour tracking. Active multiple template model searches character areas and segments them into single characters optimally, tracking each character that can vary in a flexible manner according to string configurations. Applying active multiple templates, the optimization of the snake energy is done using Greedy algorithm, to maximize its efficiency by automatically controlling each template gap. These vary according to the configuration of character string. Experimental results using wafer images from real FA environment are presented.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• 한국멀티미디어학회논문지
• /
• 제7권12호
• /
• pp.1700-1707
• /
• 2004

Nowaday, market size of digital image in world around is looks to rapidly growth. For this, Texture mapping has traditionally been used to add realism to computer graphics images. Therefore to make our image realistic, we need to give the various kind of objects material parameter and environment lighting. To present the completed marble we use passing back algorithm and combination with channel of a material. In experimental result of this paper that application by passing back algorithm and varying the parameter such as scale, period, distortion, octaves of noise make showing the superiority of optimized rendering of spheres and perfect another marble effects.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2013년도 춘계학술대회
• /
• pp.743-744
• /
• 2013

본 논문에서는 XGPON (10-Gigabit-capable passive optical network)을 기반으로 하는 TWDM (time and wave-division multiplexing) PON의 새로운 동적대역할당 알고리즘을 제안한다. 대부분의 TWDM PON은 EPON (Ethernet PON)을 기반으로 하여 동작하며 동적대역할당도 EPON의 동적대역할당 알고리즘을 변형시켜 사용한다. 본 논문에서는 XGPON의 동적대역할당 알고리즘을 개선하여 TWDM PON에 적합한 새로운 동적대역할당 알고리즘을 제안한다.

• Journal of Information Processing Systems
• /
• 제15권5호
• /
• pp.1055-1067
• /
• 2019

In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권3호
• /
• pp.211-216
• /
• 2011

The detection of defective parts in a factory is usually performed by the human eye. Therefore, heavy manpower is in demand for minor enterprises. An image processing system is desired to solve this drawback. However, due to the variety of the products characteristics, an general algorithm is needed that can adapt to these characteristics. Therefore, in this paper, the key pad parts' characteristics which need to be dealt with are analyzed in order to embody the image processing algorithm that is suggested. The experimental results show the probability of detecting a defective part is 95% with a detection time of 0.203 seconds, on the average.

• 산업경영시스템학회지
• /
• 제35권1호
• /
• pp.10-15
• /
• 2012

This paper considers an economic design problem of a tree-based network which is a kind of computer network. This problem can be modeling to be an objective function to minimize installation costs, on the constraints of spanning tree and maximum traffic capacity of sub tree. This problem is known to be NP-hard. To efficiently solve the problem, a tabu list coupled genetic algorithm approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic algorithm approach.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.783-786
• /
• 2008

외판원문제(Traveling Salesman problem: TSP)는 전형적인 조합최적화 문제로 위치하는 n개의 모든 지점을 오직 한번씩만 방문하는 순회경로를 결정하는 과정에서 순회비용 또는 순회거리를 최소화한다. 따라서 본 논문에서는 종래의 NP-hard문제로 널리 알려진 TSP를 해결하기 위해서 메타 휴리스틱기법 중에서 가장 널리 이용되고 있는 유전 알고리즘(Genetic Algorithm: GA)을 이용한다. 마지막으로, 유전 알고리즘을 이용해 외판원문제에 적합한 성능을 보이는 유전 연산자를 찾아내기 위해 수치 실험을 통해 그 성능에 대한 평가를 한다.

• 동의생리병리학회지
• /
• 제23권6호
• /
• pp.1234-1240
• /
• 2009

This study was to compare the effectiveness and validity of various data-mining algorithm for Sasang type diagnostic test. We compared the sensitivity and specificity index of nine attribute selection and eleven class classification algorithms with 31 data-set characterizing Sasang typology and 10-fold validation methods installed in Waikato Environment Knowledge Analysis (WEKA). The highest classification validity score can be acquired as follows; 69.9 as Percentage Correctly Predicted index with Naive Bayes Classifier, 80 as sensitivity index with LWL/Tae-Eum type, 93.5 as specificity index with Naive Bayes Classifier/So-Eum type. The classification algorithm with highest PCP index of 69.62 after attribute selection was Naive Bayes Classifier. In this study we can find that the best-fit algorithm for traditional medicine is case sensitive and that characteristics of clinical circumstances, and data-mining algorithms and study purpose should be considered to get the highest validity even with the well defined data sets. It is also confirmed that we can't find one-fits-all algorithm and there should be many studies with trials and errors. This study will serve as a pivotal foundation for the development of medical instruments for Pattern Identification and Sasang type diagnosis on the basis of traditional Korean Medicine.