• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.85-93
• /
• 1984

In the paper, a new constructive initial placement algorithm is proposed in computer aided layout design in LSI. An useful object function are proposed to place the modules in logic design diagram laid down by manual to the fixed chip, reflecting the relative positions between modules and cells, and then an initial placement are determined by the function. In order to show the usefulness of the proposed method, it was compared with clustering development method in maximum cut numbers and total routing lengths by program experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1233-1235
• /
• 2016

It is desirable to place virtual machines for minimizing the number of operational servers in order to save energy in high-density cloud computing environment. However, the compacted servers can incur heat islands. This paper firstly finds out the relationship between the server utilization by the virtual machine placement and the energy consumption of servers and heat from servers. Then, this paper proposes a virtual machine placement algorithm to save energy consumed and avoid heat islands.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.87-92
• /
• 2002

Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a stochastic evolution algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.4
• /
• pp.437-444
• /
• 2024

Bistatic sonar performance varies significantly depending on the ocean environment, the location (latitude, longitude) and water depth of the source and receiver. Therefore, research on optimal deployment of bistatic sonar considering ocean environment is necessary. In this study, we suggest an algorithm to optimize the location and water depth of source and receiver when operating monostatic and bistatic sonar on two spatially separated surface ships in the Ulleung Basin in the East Sea. A particle swarm optimization algorithm was used to search the location and water depth of the source and receiver to maximize the detectable area within the search area. As a result of performing bistatic sonar deployment using the algorithm proposed in this study, the detectable area increased as the number of model iterations increased. Additionally, it was confirmed that the source and receiver on the two surface ships converged to the optimal location and water depth.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.765-772
• /
• 2011

In this paper, a simulation-based method is presented to dispose direction finders in three dimensional space for locating targets using the directional data. A direction finder(DF) is a military weapon that is used to find locations of targets that emit radio frequencies by operating two or more DFs simultaneously. If one or more DFs are operated in the air, the accuracy of location estimation can be enhanced by disposing them in a better configuration. By extending the line method, which is a well-known algorithm for 2-D location estimation, into 3-D space, the problem of 3-D location estimation is defined as an nonlinear programming form and solved analytically. Then the optimal disposition of DFs is considered with the presented method in which methods of simulation and search technique are combined. With the suggested algorithm for 3-D disposition of DFs, regions in which targets exist can be effectively covered so that the operation effect of DF be increased.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.1985-1996
• /
• 1998

A parallelising algorithm for partitioning and mapping methods of matrix/vector multiplication into linear processor array/VLW simulator is presented in this paper. First we discuss the mapping methods for input matrix or vector into the arbitrarily size of processor arrays. Then, we show partitioning the algorithmss of the large size of computational problem into the size of the processor array. We execute the algorithm on VLIW simuhator and show to effectiviness of algorithm. The result which we achived better parallelising performance on our VLIW simulator dsign than on linear processor array.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.261-262
• /
• 2016

본 논문에서는 계기용변압기(Potential Transformer, PT) 1차권선의 절연내력을 향상시키기 위하여 전위분포가 일정하게 되도록 권선 배치를 최적화하는 프로그램을 작성하여 반복 분석하였다. 우선 기존의 권선 배치에 대한 국소점의 전계분포를 고찰하여 전계의 최대치를 구한 후, 권선 배치를 자동화된 순환 계산형 시뮬레이터를 제작하여 적절한 분포로 교정하고 최초의 기대 함수치를 극소화하는 형상을 반복 추적하는 알고리즘을 이용하였다.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2002.11a
• /
• pp.127-135
• /
• 2002

수치지도를 구성하고 있는 요소 중 주기 데이터는 POI(Point of Interest)라는 원시 데이터의 정확한 위치 및 부가적인 속성정보를 요하는데, 이는 실사와 입력 그리고 여러 단계의 가공 체계를 통하여 구축된다. 본 연구는 구축된 POI로부터 주기 데이터로의 가공 공정에 대해서 수행하였고, 이를 다양한 수치지도 사양에 유연하게 적용하고 수작업을 최소화할 수 있도록 자동배치 알고리즘을 개발하였다. 또한, 본 연구는 그 결과로 시가지도 영역과 시가지도 외 지역으로 나누어 배치전과 배치 후 결과를 지도 레벨별로 분석하고, 연구 수행 중에 도출된 장점들과 향후 보완점에 대해서 언급하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.607-610
• /
• 2003

지문 정합을 할 때 특징점 사이의 거리와 각도가 유사한 순서대로 있는가를 비교하는 알고리즘을 제안한다. 한 점에서 가장 가까운 특징점을 찾고 다시 찾은 점에서 가장 가까운 특징점을 찾는데 이러한 세 개의 특징점들 사이의 거리와 끼인 각도를 기본 요소로 하여 이들의 순차를 특징점 배치도로 정의하여 등록지문에도 유사한 순차가 있는지를 검사한다. 정합 시에 특징점 사이의 거리, 각도 순차가 있는가를 검사하기 때문에 중심점을 찾지 않아도 되며 지문의 이동, 회전에 영향을 받지 않는다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.234-237
• /
• 2009

CBL[1](Corner Block List)에 기반한 Non-Slicing 플로 플랜 알고리즘은 빈 공간이 없는 Non-Slicing 플로플랜만 나타낼 수 있다. 본 논문에서는 CBL 단점을 보완하고 실제 블록의 크기를 이용하여 최적의 위치에 블록을 배치 하기 위해 contour map을 이용할 것을 제시한다. 본 알고리즘은 배치시 면적을 최소화 하는 방법을 제시하므로 CBL의 단점을 해결하고 더불어 최적해를 찾기 위한 실행 시간을 단축 시키는 효과를 기대할 수 있다.