• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.11
• /
• pp.787-794
• /
• 2019

In this paper, a Mixed Integer Linear Programming(MILP) approach for solving optimal Weapon-Target Assignment(WTA) problem of multiple dissimilar Closed-In Weapon Systems (CIWS) is proposed. Generally, WTA problems are formulated in nonlinear mixed integer optimization form, which often requires impractical exhaustive search to optimize. However, transforming the problem into a structured MILP problem enables global optimization with an acceptable computational load. The problem of interest considers defense against several threats approaching the asset from various directions, with different time of arrival. Moreover, we consider multiple dissimilar CIWSs defending the asset. We derive a MILP form of the given nonlinear WTA problem. The formulated MILP problem is implemented with a commercial optimizer, and the optimization result is proposed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2260-2266
• /
• 2009

In this paper, the problem of electromagnetic coupling between a slit fed by a flanged parallel-plate waveguide (FPPW) and a nearby conducting strip parallel to the slit is studied as a simplified problem for a near-field scanning microscopy (NSM). The characteristics of the FPPW are investigated from the results for the variations of the equivalent slit admittance, the reactive powers near the slit inside and outside the FPPW, the magnitude and phase of the voltage reflection coefficient of the TEM wave. The performance of the proposed apparatus as an NSM is tested by examining the effects of various geometrical parameters such as guide height, slit width, strip width, distance between slit and strip, and the ratio of slit width to guide height on the magnitude and phase of the voltage reflection coefficient of the TEM wave. From the results for the voltage reflection coefficient against the strip offset from the slit, it is found that a slit in the FPPW with smaller guide height gives higher scanning resolution and the phase variation is more sensitive than the magnitude variation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.139-144
• /
• 2008

Generally, real system that is the object of decision-making is very variable and sometimes it lies situations with uncertainty. To solve these problem, it has used statistical methods as significance level, certainty factor, sensitivity analysis and so on. In this paper, we propose a method for fuzzy decision-making based on MFAC(Multiple Fuzzy Alpha Cut) to improve the definiteness of classification results with similarity evaluation. In the proposed method, MFAC is used for extracting multiple a ${\alpha}$-level with proximity degree at proximity relation between relative Hamming distance and max-min method and for minimizing the number of data which are associated with the partition intervals extracted by MFAC. To determine final alternative of decision-making, we compute the weighted value between extracted data by MFAC From the experimental results, we can see the fact that the proposed method is simpler and more definite than classification performance of the conventional methods and determines an alternative efficiently for decision-maker by testing significance of sample data through statistical method.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.23 no.7
• /
• pp.783-790
• /
• 2017

An acceptable proximity assessment collision probability is widely considered to be less than $10^{-4}$ in maritime traffic safety audit schemes. In the 1970s, Fujii, Macduff and colleagues introduced various models for collision probability of aberrancy in the community. Although existing studies ensured acceptable proximity collision probability, around $10^{-4}$, they were constrained by assumptions. A lack of support for the proximity probability criterion has been investigated in this study for practical use. The appropriate proximity probability for different size vessels in both straight and curved lanes has been analyzed based on GICOMS data. As a result, reasonable proximity collision probabilities were determined for various vessel traffic conditions. Accordingly, necessary improvements in the maritime traffic system have been suggested in consideration for various maritime traffic situations and conditions.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.99-114
• /
• 2011

Collaborative Filtering (CF) suffers from two major problems:sparsity and cold-start recommendation. This paper focuses on the cold-start problem for new customers with no purchase records and the sparsity problem for the customers with very few purchase records. For the purpose, we propose a method for the new customer recommendation by using a combined measure based on three well-used centrality measures to identify the customers who are most likely to become neighbors of the new customer. To alleviate the sparsity problem, we also propose a hybrid approach that applies our method to customers with very few purchase records and CF to the other customers with sufficient purchases. To evaluate the effectiveness of our method, we have conducted several experiments using a data set from a department store in Korea. The experiment results show that the combination of two measures makes better recommendations than not only a single measure but also the best-seller-based method and that the performance is improved when applying the hybrid approach.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.82-88
• /
• 2008

In this paper, Runge-Kutta (RK)-Butcher algorithm is proposed to study the periodic and oscillatory problems. Simulation results obtained using RK-Butcher algorithms and the classical fourth order Runge-Kutta (RK(4)) methods are compared with the exact solutions of a few periodic and oscillatory problems to confirm the performance of the proposed algorithm. The simulation results from RK-Butcher algorithms are always found to be very close to the exact solutions of these problems. Further, it is found that the RK-Butcher algorithm is superior when compared to RK(4) methods in terms of accuracy. The RK-Butcher algorithm can be easily implemented in a programming language and a more accurate solution may be obtained for any length of time. RK-Butcher algorithm is applicable as a good numerical algorithm for studying the problems of orbit and two body as it gives the nearly identical solutions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.661-663
• /
• 2002

현대의 Deep-Submicron Technology(DSM)에선 배선에 관련된 문제, 예를 들어 crosstalk이나 노이즈 등이 큰 문제가 된다. 그리하여, 배선은 논리 구성요소들보다 더욱 중요한 위치를 차지하게 되었다. 우리는 이러한 배선을 고려하여 연산식을 최적화하기 위해 carry-save-adder(CSA)를 이용한 모듈 함성 알고리즘을 제시한다. 즉, 상위 단계에서 생성 된 규칙적인 배선 토폴로지를 유지하며 CSA간의 배선을 좀더 향상시키는 최적의 알고리즘을 제안한다. 우리는 우리의 이러한 방법으로 생성된 지연시간이 [1]에 가깝거나 거의 근접하는 것을 많은 testcase에서 보이며(배선을 포함하지 않은 상태에서), 그리고 그와 동시에 최종 배선의 길이가 짧고 규칙적인 구조를 갖는것을 보인다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.896-899
• /
• 2001

본 논문에서는 외판원 문제를 분산 시스템 환경에서, 다중 에이전트를 이용해 수법시간을 단축시키고, 더욱 우수한 근접해를 구할 수 있는 분산 유전 알고리즘을 개발하였다. 다중 후보해를 이용한 분산 유전 알고리즘을 수행할 때, 고려해야 할 중요한 요소는 후보해들 간의 개체들을 어떤 노드의 후보해 개체와 교환할 것인가와 어떤 개체들을 선택해서, 얼마만큼의 개체를 이동시킨 것인가가 중요하게 고려독어야 한다. 따라서 본 논문에서는 교환해야 할 개체의 크기를 동적으로 윈도우 크기를 변경하면서 교환하는 방법을 개발하였고, 교환할 개체들의 위치를 결정하는 새로운 유전 이동 정책 2가지 방법을 개발하고 실험하였다.

• Communications of Mathematical Education
• /
• v.8
• /
• pp.3-15
• /
• 1999

현재 진행되고 있는 수준별 수업에서 교사들이 직면한 가장 큰 문제 중에 하나가 수준별 평가에 관한 문제이다. 교육내용을 3단계(상${\cdot}$중${\cdot}$하)로 나눌 경우 평가의 단계도 3단계로 나누는 것이 이상적이다. 하지만 실제로 학교현장에서는 가르친 내용과 평가가 불일치하는 경우가 있으며 이러한 수업과 평가의 불일치가 심화반 및 보충반 학생들 모두에게 학습의욕을 저하시킬 수 있다. 따라서 본 연구에서는 수준별로 나누어 학습한 학생들을 수업에서 가르친 내용과 근접하게 평가하는 방안을 연구하였다.

• Proceedings of the Korea Air Pollution Research Association Conference
• /
• 2002.11a
• /
• pp.101-102
• /
• 2002

과거 50여년간 전산기는 성능과 효율면에서 획기적인 발전을 거듭하여 왔다. 더욱이 최근 20여년간 microcomputer와 PC 분야의 발전으로 저렴한 가격으로 전산자원을 활용할 수 있게 되었다. 그러나, 1개의 CPU로 도달할 수 있는 속도의 한계에 근접함에 따라서, CPU 성능의 향상 속도가 느려지고 있다. 현재 초고성능 전산기로도 많은 시간과 비용이 소요되는 문제가 과학 및 공학 분야에 아직 많이 있는 상황에서 이러한 전산속도 발전의 둔화는 심각한 문제가 되고 있다. (중략)