• 한국음향학회지
• /
• 제42권2호
• /
• pp.161-167
• /
• 2023

최근 바닥충격음 사후 성능검사 제도의 시행에 따라 공동주택 바닥 슬래브 상부에 설치되는 바닥 마감재에 대한 바닥충격음 성능 개선의 요구사항은 증가하고 있다. 하지만 현재의 KS F ISO 717-2 및 KS F 2863에서의 바닥 마감재 성능 평가방법은 완충층이 설치되지 않은 조건에서 저감량을 측정하는 것으로 되어 있다. 준공 전 성능측정 의무화로 인해 본인이 거주하는 공동주택 바닥충격음 성능의 확인이 가능한 상황에서 입주민이 거주하는 공동주택의 특성을 반영하는 온돌층이 설치된 구조에서의 성능평가는 마감재의 바닥충격음 성능에서 더 필요한 부분일 것이다. 따라서 본 논문에서는 바닥슬래브 상부 마감구조의 저감량 평가를 위해서 완충층 조건을 포함한 저감성능 평가를 제안하고, 완충층 성능에 따른 저감량의 차이를 확인할 수 있도록 마감재가 설치되지 않은 상태의 바닥충격음 성능을 동시에 표시하는 것을 제안한다.

• 산업공학
• /
• 제21권3호
• /
• pp.262-273
• /
• 2008

In Korean peninsular, Air Defense with SAM(Surface-to-Air Missile) is very important, because of threatening by North Korea's theater ballistic missiles installed with nuclear or biochemistry. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Multi-heuristic algorithm which can handle both factors simultaneously for solving allocation problem of the batteries and missile assignment problem in each battery. To solve allocation problem, genetic algorithm is used to decide location of the batteries. To solve missile assignment problem, a heuristic algorithm is applied to determine the number of SAM for each target. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of missile defense operations.

• 대한산업공학회지
• /
• 제26권4호
• /
• pp.384-391
• /
• 2000

Most of the previous works on classical location models are based on the assumption that the value(or utilities) of inventory remains constants over time. In this study a special case of location problem is studied for both ameliorating and deteriorating items in two-echelon supply-chain management such as agricultural and fishery products. The objective of this study is to determine the minimum number of storage facilities among a discrete set of location sites so that the probability for each customer to be covered is not less than a critical value. We have formulated this problem using stochastic set-covering problem which can be solved by 0-1 programming method. Also we developed a computer program and applied to a set of problems for fish culture storage and distribution centers and the sample results well show the impact of ameliorating and deteriorating rate on the location problem. For the further study, a graphical user-interface with visualization for input and output is needed to be developed.

• 대한산업공학회지
• /
• 제18권2호
• /
• pp.43-49
• /
• 1992

Edge coloring problem is to find a minimum cardinality coloring of the edges of a graph so that any pair of edges incident to a common node do not have the same colors. Edge coloring problem is NP-hard, hence it is unlikely that there exists a polynomial time algorithm. We formulate the problem as a covering of the edges by matchings and find valid inequalities for the convex hull of feasible solutions. We show that adding the valid inequalities to the linear programming relaxation is enough to determine the minimum coloring number(chromatic index). We also propose a method to use the valid inequalities as cutting planes and do the branch and bound search implicitly. An example is given to show how the method works.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.17-24
• /
• 2006

We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

• 한국경영과학회지
• /
• 제37권4호
• /
• pp.197-209
• /
• 2012

This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2002년도 가을 학술발표회 논문집
• /
• pp.495-500
• /
• 2002

The purpose of this study is to develop and to apply this permanent cement mortar form as one of those system forms to improve existing form's problems. (1) In the fire proof test with combined specimen, the fire proof covering including form section thickness is satisfied with the fire proof criterion. It is considered that form section thickness has no problem (2) The suitable method of normal pressure steam curing for the form's mass production is 4 hours in 65℃ considering production cost, the silica fume admixture is economic.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권10호
• /
• pp.489-492
• /
• 2001

The connection method of CCPU has been changed from connection between sheath and grounding to connection between sheaths without grounding since 1997. In domestic, there is so many cases that cables circuits were installed before 1997, added in same route after that, operated as multi-connecting systems of CCPU in same route. This paper examine the problem of multi-connecting system by EMTP simulation, and presents methods to improve the system characteristics.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (1)
• /
• pp.247-249
• /
• 2003

임베디드 시스템을 위한 가상기계 기술은 모바일 디바이스와 디지털 TV등의 다운로드 솔루션에 꼭 필요한 소프트웨어 기술이다. 현재 EVM(Embedded Virtual Machine)이라 명명되어진 임베디드 시스템을 위한 가상기계에 대한 연구가 진행 중이며, EVM의 중간 언어로 SIL(Standard Intermediate Language)이 설계되었다. 본 논문에서는 임베디드 시스템을 위한 가상기계의 표준 중간 언어로서 SIL의 완벽성을 증명한다. 기존에 이미 널리 사용되고 있는 가상기계 코드를 SIL 카테고리에 매핑시킴으로써 구조적으로 SIL의 완벽성을 증명한다. SIL은 표준 중간 언어로서의 요구 사항을 갖추고 있으며 6개의 메인 카테고리와 16개의 서브 카테고리로 나누어진다. Oolong과 .NET IL등 기존의 가상기계 코드들의 카테고리는 SIL카테고리에 매핑된다.

• 충청수학회지
• /
• 제24권2호
• /
• pp.319-335
• /
• 2011

We classify equivariant topoligical complex vector bundles over real projective plane under a compact Lie group (not necessarily effective) action. It is shown that nonequivariant Chern classes and isotropy representations at (at most) three points are sufficient to classify equivariant vector bundles over real projective plane except one case. To do it, we relate the problem to classification on two-sphere through the covering map because equivariant vector bundles over two-sphere have been already classified.