• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.63-69
• /
• 1998

The area optimization of the power distribution network is an important problem in the layout design of VLSI systems. In this paper we propose noval methods to solve the problem of designing minimal area power distribution nets, while satisfying voltage drop and electromigration constraints. We propose two novel greedy heuristics for power net design-one based on bottom-up tree construction using greedy merging and the other based on top-down linearly separable partitioning.

• Korean Institute of Interior Design Journal
• /
• no.29
• /
• pp.145-152
• /
• 2001

Open education, which has been introduced spontaneous1y to many countries, has been giving some strong influence to the primary education in Korea and has been widely used in Korea itself. This report deals with the ineffectiveness of the learning space which has been divided into common classroom and particular classroom. The division of the learning space sets the problem of defining which is the particular of common subject, and the problem of a child to move around for different subject. For the architectural design of school, it is essential for learning space to be suitable for the characteristics of each subjects. The space needed for individual subjects requires tole learning space that is different to the space needed for basic academic subjects. The introduction of different corners in the classroom can be the solution. Individual corners can be divided into the necessary coner, the standard corner, the elective corner and the corner fur facilities.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.121-139
• /
• 1992

AGVS(Automated Guided Vehicle Systems) in material handling have been used widely since late 1970s. Implementation of an AGVS generally requires substantial study to optimize the design and performance of guide-paths. Traditional mathematical approaches have been used with limited success to analyze AGVS. These approaches, however, do not provide a practical tool for guide-path designers. This paper presents a new approach based on rules in designing and assessing AGV guide-paths to improve the design of a closed-loop layout. A framework for the integrated approach is proposed, problem solving procedures are explained, and a case study is reported to demonstrate the framework. Deletion of seldom used guide-paths, and addition of bypasses to solve the congestion problem, are conducted interactively and iteratively through simulation experiments. To visualize the results, a graphic control program is developed and integrated with the AutoMod/AutoGram simulation package.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.93-102
• /
• 1995

This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.4
• /
• pp.255-262
• /
• 2018

In order to determine the three-dimensional position in photogrammetry, a spatial resection is a pre-requisite step to determine exterior orientation parameters. The existing spatial resection method is a non-linear equation that requires initial values of exterior orientation parameters and has a problem that a gimbal lock phenomenon may occur. On the other hand, the spatial resection using quaternion is a closed form solution that does not require initial values of EOP (Exterior Orientation Parameters) and is a method that can eliminate the problem of gimbal lock. In this study, to analyze the stability of the quaternion-based spatial resection, the exterior orientation parameters were determined according to the different layout of control points and were compared with the determined values using existing non-linear equation. As a result, it can be seen that the quaternionbased spatial resection is affected by the layout of the control points. Therefore, if the initial value of exterior orientation parameters could not be obtained, it would be more effective to estimate the initial exterior orientation values using the quaternion-based spatial resection and apply it to the collinearity equation-based spatial resection method.

• 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 Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.151-166
• /
• 1994

The manufacturing environment on which this research is focused is an FMS in which AGVs are used for material handling and each part type has one or more process plans. The research aims at developing a methodology whereby, given a part and volume mix for production during any production session, the best set of process plans including one plan per part type is selected and the best unidirectional AGV guidepath can be dynamically reconfigured in response to changes in parts and lot sizes combination. For the integrated PPS/FGD problem in which two functions of process plan selection (PPS) and flexible AGV guidepath design (FGD) are integrated, a zero-one integer programming model is developed. The integrated problem is decomposed into two subproblems, process plan selection given a directed AGV layout and AGV guidepath design with a fixed process plan per part type. A heuristic algorithm that alternately and iteratively solves these two subproblems is developed. The effectiveness of the heuristic algorithm is tested by solving various randomly generated sample problems and comparing the heuristic solutions with those obtained by an exact procedure. From the test results, the following conclusions are drawn: 1) For a reasonable size problem, the heuristic is very effective. 2) By integrating the two functions of PPS and FGD, a remarkable benefit in total production time for a given part and volume mix is gained.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1097-1108
• /
• 2022

This paper aimed to design and implement an EMS for real-time power generation control based on wake effect optimization of wind farm, and then to test it in commercial operating wind farm. For real-time control, we proposed the wake band-based optimization and setting the wake effect distance limit, and when the wake effect distance limit was set to 7D in the actual wind farm layout, the calculation time was improved by about 93.94%. In addition, we designed and implemented the script-based EMS for flexible operation logic management in preparation for unexpected issues during testing, and it was installed and tested on a wind farm in commercial operation. However, three issues arose during the testing process. These are the communication interface problem of meteorological tower, the problem of an abnormal wake effect, and the problem of wind turbine yaw control. These issues were solved by modifying the operation logic using EMS's script editor, and the test was successfully completed in the wind farm in commercial operation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.9-16
• /
• 2008

For the efficient routing on a Sensor Network, one may consider a deployment problem to interconnect the sensor nodes optimally. There is an analogous theoretic problem: the Steiner Tree problem of finding the tree that interconnects given points on a plane optimally. One may use the approximation algorithm for the problem to find out the deployment that interconnects the sensor nodes almost optimally. However, the Steiner Tree problem is to interconnect mathematical set of points on a Euclidean plane, and so involves particular cases that do not occur on Sensor Networks. Thus the approach of using the algorithm does not make a proper way of analysis. Differently from the randomly given locations of mathematical points on a Euclidean plane, the locations of sensors on Sensor Networks are assumed to be physically dispersed over some moderate distance with each other. By designing an approximation algorithm for the Sensor Networks in terms of that physical property, one may produce the execution time and the approximation ratio to the optimality that are appropriate for the problem of interconnecting Sensor Networks.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.106-110
• /
• 2004

In any large heavy industry like that of ship building, there exist a lot of complications for the arrangement of building blocks optimally for the minimal space consumption. The major problem arises at yard because of laxity in space for arranging the building blocks of ship under construction. A standardized erection sequence diagram is generally available to provide the prioritised erection sequence. This erection sequence diagram serves as the frame work. In order to make a timely erection of the blocks a post plan has to be developed so that the blocks lie in the nearest possible vicinity of the material handling devices while keeping the priority of erection. Therefore, the blocks are arranged in the pre-erection area. This kind of readiness of blocks leads to a very complex problem of space. This arises due to the least available space leading to an urgent need of an availability of intelligent spatial schedule without compromising the rate of production. There exists two critical problems ahead namely, the spatial occupation layout of pre-erection area and the emptying pattern in the spatial vicinity. The block shape is assumed be rectangular. The related input data's are the dates of erection (earliest as well as the latest), geometrical parameters of block available on pre-erection area, slack time and the like.