• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.658-663
• /
• 2018

In this paper, we consider node deployment algorithms for the sequence-based localization (SBL) which is recently employed for in-door positioning systems, Whereas previous node selection or deployment algorithms seek to place nodes at centrold of the region where more targets are likely to be found, we observe that the boundaries dividing such regions can be good locations for the nodes in SBL systems. Motivated by this observation, we propose an efficient node deployment algorithm that determines the boundaries by using the well-known K-means algorithm and find the potential node locations based on the bi-section method for low-complexity design. We demonstrate through experiments that the proposed algorithm achieves significant localization performance over random node allocation with a substantially reduced complexity as compared with a full search.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.10
• /
• pp.875-887
• /
• 2015

The optimal layout design is used in the development of various areas of industry. In the field of space systems, components must be placed properly in the limited space of spacecraft by considering mechanical, thermal and electrical interfaces. When applying optimal layout design, a proper, even ideal placement of components is possible in the limited space of a satellite platform. Through the optimal placement design, the minimized moment of inertia enhances efficient attitude control, rapid maneuver and mission performance of the satellite. This paper proposes 3D optimal layout design that minimizes the spacecraft's moment of inertia and effect of thermal dissipation between inner components as well as interference between inner components based on a cubic-structure satellite platform. This study proposes the new genetic algorithm for 3D optimal layout design of the satellite platform.

• Journal of Internet Computing and Services
• /
• v.19 no.3
• /
• pp.25-33
• /
• 2018

This paper proposes a cloud workflow model theoretically supported by the information control net modeling methodology as a cloud workflow modeling methodology that is mandatory in implementing realtime enterprise workflow management systems running with cloud computing environments. The eventual goal of the cloud workflow model proposed in this paper is to support those cloud workflow architectures reflecting the types of cloud deployment models such as private, community, public, and hybrid cloud deployment models. Moreover, the proposed model is a mathematical graph model that is extended from the information control net modeling methodology used in conventional enterprise workflow modeling, and it aims to theoretically couple this methodology with the cloud deployment models. Finally, this paper tries to verify the feasibility of the proposed model by building a possible cloud workflow architecture and its cloud workflow services on a realtime enterpeise cloud workflow management system.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.69-77
• /
• 2006

In most positioning and allocation practices, many mathematical models are proposed in various fields. The set covering (SC) problem has many practical applications of modeling not only real world problem but also in military. As our air defense weapon systems are getting older and declining the performance, new plans far acquisition of high-tech air defense weapon system are being conducted. In this paper we established simulation model for optimal allocation of KDX which carries new missile defense weapon system by using partial set covering considering both attacker and defender side. By implementating simulation model, we assess the available scenarios and show the optimal pre-positioning of KDX and interceptor's allocation. Furthermore, we provide a variety of experiments and extensive scale sized situations for Korea Indigenous Missile Defense (KIMD) and support decision-making for efficient positioning of unit.

• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.397-402
• /
• 2003

Generally, container arrangement has been carried out based on the Classification guidelines. However, guidelines provide only container securing forces for the given container arrangement and Classification requirements of the forces. In order to design container arrangement additional information is needed such as container securing forces and arrangement that accounts for lashing bridges, vertical lashing, vertical center of gravity (VCG), and maximum stack weight. Trial and error method using the existing guidelines requires excessive amount of calculation time and cannot provide accurate results of the calculations. In order to fulfill this need, a new container securing system has been established based on the equilibrium conditions that include lashing bridges and vertical lashing. An optimization algorithm has been developed for the new system since current optimization methods such as genetic algorithms and evolution strategies are unsuitable for the container securing problems, which involve equality constraint. Design variables are container weights of tier and objective function is either total container weight or VCG of a stack. The newly developed system provides optimum arrangement of containers for both maximum stack weight and maximum VCG. It also greatly reduces time for designing container arrangement.

• Communications for Statistical Applications and Methods
• /
• v.5 no.2
• /
• pp.327-338
• /
• 1998

이원배치모형에서 급내상관계수에 대한 점 추정문제가 고려된다. 급내 상관계수에 대한 여러 가지 점추정량의 종류를 살펴보고 추정량의 평균자승오차(MSE)과 절대편의를 모의 실험을 통하여 서로 비교하여 본다. 결론적으로 이원배치모형에서의 급내 상관계수는 추정량의 종류에 큰 영향을 받지 않는 것으로 나타났으며, 따라서 계산량이 다른 추정량들에 비하여 적은 헨더슨의 방법 $\textrm{III}$ 추정량을 사용하는 것이 바람직한 것으로 판명되었다.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2007.06a
• /
• pp.72-75
• /
• 2007

본 연구는 TFT-LCD 부품인 Back Light Unit의 광원 역할을 하는 CCFL Assembly 공정을 분석하여 최적의 공정원 배치를 할 수 있도록 하였다. 이에 각 공정의 특성을 파악하고, 이를 Herrmann의 두뇌우성을 적용하여 공정원 배치를 하도록 하였다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.22
• /
• pp.121-127
• /
• 1990

작업능률향상을 위한 설비배치의 문제는 총자재 운반비용을 최소화하고 실비간의 자재흐름을 최소화하는 문제와 배치들간의 근접도를 최대화시키는 정적인 문제로 다루어져 왔다. 본 논문에서는 이 같은 문제가 계획기간을 확장하는 문제나, 그 이전에 빈번한 문제 (system nervousness)를 D.P.를 이용한 동적인 특성으로 해결하는 것을 제시하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.66-68
• /
• 1998

이열 기계 배치 문제는 기계의 수가 많아지면 기존의 알고리즘으로는 실제적으로 해결이 불가능한 조합 최적화 문제이다. 본 논문에서는 최적의 기계 배치를 찾기 위하여 유전자 알고리즘을 사용하고 기존의 방법과 비교하여 선택 과정의 개선을 통해 최적화의 성능을 향상시키는 방법에 대하여 고찰한다. 실험을 통하여 제안된 방법의 성능을 분석하였다.