• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.57-66
• /
• 2005

The Interconnecting Highways problem is an abstract of many practical Layout Design problems in the areas of VLSI design, the optical and wired network design, and the planning for the road constructions. For the road constructions, the shortest-length road layouts that interconnect existing positions will provide many more economic benefits than others. That is, finding new road layouts to interconnect existing roads and cities over a wide area is an important issue. This paper addresses an approximation scheme that finds near optimal road layouts for the Interconnecting Highways problem which is NP-hard. As long as computational resources are provided, the near optimality can be acquired asymptotically. This implies that the result of the scheme can be regarded as the optimal solution for the problem in practice. While other approximation schemes can be made for the problem, this proposed scheme provides a big merit that the algorithm designed by this scheme fits well to given problem instances.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.3
• /
• pp.120-128
• /
• 2018

OLED Display fabrication system is one of the most complicated discrete processing systems in the world. As the glass size grows from $550{\times}650mm$ to $1,500{\times}1,850mm$ in recent years, the efficiency of Automated Material Handling System (AMHS) has become very important and OLED glass manufacturers are trying to improve the overall efficiency of AMHS. Aiming to meet the demand for high efficiency of transportation, various kind of approaches have been applied for improving dispatching rules and facility layout, while simultaneously considering the system parameters such as glass cassettes due date, waiting time, and stocker buffer status. However, these works did not suggest the operational policy and conditions of distribution systems, especially for handling unnecessary material flows such as detour. Based on this motivation, in this paper, we proposed an efficient algorithm for improving detour transportation in OLED FAB. Specifically, we considered an OLED FAB simplifying OLED production environment in a Korean company, where four stockers are constructed for the delivery of Lot in a bay and linked to processing equipments. We developed a simulation model using Automod and performed a numerical experiment using real operational data to test the performance of three operation policies under considerations. We showed that a competitive policy for assigning alternative stocker in case of detour was superior to the current dedicated policy using a specified stocker and other considered policies.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.35-40
• /
• 2010

Due to the distribution of digital camera, many work for photo management has been studied. However, most work use a sequential grid layout which arranges photos considering one criterion of digital photo. This interface makes users have lots of scrolling and concentrate ability when they manage their photos. In this paper, we propose a clustering method based on a temporal sequence considering their color similarity in detail. First we cluster photos using Cooper's event clustering method. Second, we makes more detailed clusters from each clustered photo set, which are clustered temporal clustering before, using maximal clique finding algorithm of interval graph. Finally, we arrange each detailed dusters on a user screen with their overlap keeping their temporal sequence. In order to evaluate our proposed system, we conducted on user studies based on a simple questionnaire.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.85-94
• /
• 2002

EMRCA(Explicit Max_min Rate Control Algorithm) switch, which has been proposed in the ATM(Asychronous Transfer Mode) standard, controls the ABR(Available Bit Rate) service traffic in the ATM networks. The ABR service class of ATM networks uses a feedback control mechanism to adapt to varying link capacities. The VS/VD(Virtual Source/Virtual Destination) technique offers the possibility to segment the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and the control of ABR traffic inside closed segments provide a better performance and QoS(Quality of Service) for ABR connections with respect to throughput, delay, and jitter. This paper is study of an ABR VS/VD flow control method. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, like stability of the system, during the design phase. The performance goals are a high link utilization, fair bandwidth distribution and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of linear control theory to model and design an ABR flow control method tailored for the special layout of a VS/VD switch, the simulation shows that this techniques better than conventional method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1765-1794
• /
• 2019

Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

• Journal of the Korea Computer Graphics Society
• /
• v.30 no.3
• /
• pp.1-8
• /
• 2024

We present a novel algorithm for creating 2D maps tailored for autonomous navigation within orchards. Recognizing that fruit trees in orchards are typically aligned in rows, our primary goal is to accurately detect these tree rows and project this information onto the map. Initially, we propose a simple algorithm that recognizes trees from point cloud data by analyzing the spatial distribution of points. We then introduce a method for detecting fruit tree rows based on the positions of recognized fruit trees, which are integrated into the 2D orchard map. Validation of the proposed approach was conducted using real-world orchard point cloud data acquired via LiDAR. The results demonstrate high tree detection accuracy of 90% and precise tree row mapping, confirming the method's efficacy. Additionally, the generated maps facilitate the development of natural navigation paths that align with the orchard's layout.

• Journal of the HCI Society of Korea
• /
• v.10 no.1
• /
• pp.5-17
• /
• 2015

Nowadays various public data have been serviced to the public. Through the opening of public data, the transparency and effectiveness of public policy developed by governments are increased and users can lead to the growth of industry related to public data. Since end-users of using public data are citizens, it is very important for everyone to figure out the meaning of public data using proper visualization techniques. In this work, to indicate the significance of widespread public data, we consider UN voting record as public data in which many people may be interested. In general, it has high utilization value by diplomatic and educational purposes, and is available in public. If we use proper data mining and visualization algorithms, we can get an insight regarding the voting patterns of UN members. To visualize, it is necessary to measure the voting similarity values among UN members and then a social graph is created by the similarity values. Next, using a graph layout algorithm, the social graph is rendered on the screen. If we use the existing method for visualizing the social graph, it is hard to understand the meaning of the social graph because the graph is usually dense. To improve the weak point of the existing social graph visualization, we propose Friend-Matching, Friend-Rival Matching, and Bubble Heap algorithms in this paper. We also validate that our proposed algorithms can improve the quality of visualizing social graphs displayed by the existing method. Finally, our prototype system has been released in http://datalab.kunsan.ac.kr/politiz/un/. Please, see if it is useful in the aspect of public data utilization.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.245-254
• /
• 2002

IC package marking inspection system using machine vision locates and identifies the target elements from input image, and decides the quality of marking by comparing the extracted target elements with the standard patterns. This paper proposes an adaptive multi-level thresholding (AMLT) method which is suitable for a series of operations such as locating the target IC package, extracting the characters, and detecting the Pinl dimple. It also proposes a dynamic matching unit selection (DMUS) method which is robust to noises as well as effective to catch out the local marking errors. The main idea of the AMLT method is to restrict the inputs of Otsu's thresholding algorithm within a specified area and a partial range of gray values. Doing so, it can adapt to the specific domain. The DMUS method dynamically selects the matching unit according to the result of character extraction and layout analysis. Therefore, in spite of the various erroneous situation occurred in the process of character extraction and layout analysis, it can select minimal matching unit in any environment. In an experiment with 280 IC package images of eight types, the correct extracting rate of IC package and Pinl dimple was 100% and the correct decision rate of marking quality was 98.8%. This result shows that the proposed methods are effective to IC package marking inspection.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.2 s.72
• /
• pp.195-202
• /
• 2006

Thin-walled structures are efficiently utilized an automobiles, aircraft, satellite and ship as well as needed light weight simultaneously. This paper presents new shape of automobile hood reinforcement that rotating parts as engine, transmission are protected by thin-walled structures. The automobile hood is concerned about the resonance occurs due to the frequency of the rotating parts. The hood must be designed by supporting the stiffness of design loads and considering the natural frequencies. Hence, it is sustained the stiffness and considered the vibration by resonance. It is deep related to ride. Therefore, the topology, shape and size optimization methods are used to design the automobile hood. Topology technique is applied to determine the layout of a structural component optimum size with maximized natural frequency by volume reduction. In this research, The optimal structure layout of an inner reinforcement of an automobile hood for the natural frequency of a designated mode is obtained by using topology optimization method. The optimum size and the optimum shape are determined by PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.10 s.352
• /
• pp.80-89
• /
• 2006

The rapid development of process technology and the introduction of new materials not only make it difficult for process control but also as a result increase process variations. These process variations are barriers to successful implementation of design circuits because there are disparities between data on layout and that on wafer. This paper proposes a new design environment to determine the interconnect worstcase with accuracy and speed so that the interconnect effects due to process-induced variations can be applied to designs of $0.13{\mu}m$ and below. Common Geometry and Maximum Probability methods have been developed and integrated into the new worstcase optimization algorithm. The delay time of the 31-stage Ring Oscillator, manufactured in UMC $0.13{\mu}m$ Logic, was measured, and the results proved the accuracy of the algorithm. When the algorithm was used to optimize worstcase determination, the relative error was less than 1.00%, two times more accurate than the conventional methods. Furthermore, the new worstcase design environment improved optimization speed by 32.01% compared to that of conventional worstcase optimizers. Moreover, the new worstcitse design environment accurately predicted the worstcase of non-normal distribution which conventional methods cannot do well.