• Defense and Technology
• /
• no.3 s.217
• /
• pp.78-87
• /
• 1997

유도무기는 표적을 인지하는 탐색기 성능과 유도 조종기술에 따라 정확도가 결정되며, 탐색기의 종류는 적외선(IR), 레이다 전자파(RF)를 사용하는 레이다파, 현재 실용화의 첫발을 내딛은 밀리미터파 탐색기가 있다. 모든 탐색기의 생명은 센서라고해도 과언이 아니며 센서의 성능에 따라 미사일의 정확도가 결정된다

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.165-168
• /
• 2004

본 연구에서는 근골격계로 구성된 신체 역학계와 신경 진동자로 구성된 신경계의 상호작용에 의해서 자율적인 2족 보행운동 생성하려고 하고 있다. 이를 위해서는 역학계와 신경계의 않은 파라메트(Parameter)의 조절이 필요하다 본 연구에서는 유전적 프로그래밍(GP)을 이용하여 파라메트의 자동조절 수법을 제안하였다. GP는 문제를 해결하기 위한 계산 프로그래밍을 탐색하는 진화형 탐색 알고리즘으로, GP를 이용해서 문제해결을 행하기 위해서는 노드의 선택이 매우 중요하다. 그러나 대상문제에 대한 충분한 정보가 없는 경우에는 노드를 용장성 있게 설계하게 되어, 이로 인한 탐색공간의 확장으로 GP에 대한 탐색성능의 저하를 초래한다. 본 논문에서는 이러한 문제를 해결하기 위해서 용장성 노드 집합으로부터 유용한 노드를 획득하기 위해 제안한 수법을 2족 보행운동 생성 시스템에 적용하기 전에 사전 평가로서 기호회귀(Symbolic Regression)문제에 적용하여 실험을 통해 제안 수법의 타당성과 탐색성능 향상의 효과에 관해서 논하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.7
• /
• pp.640-650
• /
• 1991

In the paper, the threepoint search algorithm used direct search method for optimal design is proposed. Proposed algorithm is composed of two iteration procedure to determine the minimum value of performance index. The minumum value of three-point existing in the inner N-order searching is firstly determined and next searching space is then reduced by the result of first procedure. To compute performance index. 3N iteration for a searching is necessary. 3N searching method is also described and confirmed with exception of parameter included multiphicator and divisor. Proposed algorithm have good stability and reliability when performance index is linear or quadratic function.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.6
• /
• pp.740-747
• /
• 2012

An Active Electronically Scanned Array(AESA) radar required necessarily as the Fire Control Radar(FCR) of recent fighters has ununiform detection range with regard to scan angle due to scan loss. Although the compensation method of scan loss in an AESA radar with variable dwell time is investigated, the effectiveness of the method in a fighter FCR with multi-function such as search, track, and missile guidance within limited resources should be considered systematically. In this paper, uniform search performance of an AESA radar using variable dwell time with regard to scan angle is derived. We assumed the search load of 50 % for case without changing dwell time in fixed frame time and showed the fighter FCR requirement for multi-function is not satisfied because the search load for the uniform search performance should be increased by about 100 %. On the other hand, in case of increasing the frame time for the uniform search performance and search load of 50 %, degradation of the search performance is shown by 86.7 % compared with the former. Based on these analyses, the effective beam operation strategy on an airborne AESA radar with uniform search performance in whole scan area is described with consideration of frame time, search load and performance as a whole.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.199-208
• /
• 2000

The k-nearest neighbor search query based on similarity is very important for content-based multimedia information retrieval(MIR). The conventional exact k-nearest neighbor search algorithm is not efficient for the MIR application because multimedia data should be represented as high dimensional feature vectors. Thus, an approximate k-nearest neighbor search algorithm is required for the MIR applications because the performance increase may outweigh the drawback of receiving approximate results. For this, we propose a new approximate k-nearest neighbor search algorithm for high dimensional data. In addition, the comparison of the conventional algorithm with our approximate k-nearest neighbor search algorithm is performed in terms of retrieval performance. Results show that our algorithm is more efficient than the conventional ones.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2003.08a
• /
• pp.185-192
• /
• 2003

국내 인터넷 검색엔진의 성능을 질문의 유형별로 비교해보았다. 실험에는 30명의 대학생이 참여하여 탐색질문을 작성하고 직접 탐색하여 검색결과의 적합성을 판정하였다. 실험참가자마다 탐색어 1개, 2개, 3개짜리 질문을 하나씩 작성하도록 한 결과 총 90개의 질문이 실험에 사용되었다. 질문의 유형은 질문의 길이 이외에 주제의 최신성 여부와 고유명사의 포함 여부를 기준으로 나누었다. 실험 결과 전체적인 성능은 구글이 가장 뛰어났으나, 고유명사를 포함한 최신주제 질문에 대해서는 네이트와 엠파스가 구글보다 좋은 성능을 보였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.139-147
• /
• 2023

The compact tracking radar system is a pulsed radar tracking system that searches, detects, and tracks targets in real time against aircraft targets with a small RCS(Radar Cross Section) maneuvering at high speed. This paper describes the development of comprehensive performance test equipment to verify the performance of the radar system in a anechoic chamber environment. Describes the design and manufacture of comprehensive performance test equipment to meet requirements, including the generation of simulated target signals to simulate aircraft target signals to verify performance in the laboratory environment of radar systems. It also describes a GUI(Graphic User Interface) program to check performance through a test in conjunction with the tracking radar system. Verify the comprehensive performance test equipment implemented through the performance test.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.5
• /
• pp.48-55
• /
• 1999

본 논문에서는 움직임 추정시 인접된 블록간의 탐색 영역이 중첩됨을 이용하여 전역 탐색 기법과 동일한 성능을 유지하면서 계산량을 현저히 감소시킬수 있는 고속 움직임 추정 기법을 제안하였다. 제안한 기법에서는 현재 움직임 추정을 행하고자 하는 블록에 대한 탐색점 중에서 인접된 블록과 중첩되는 탐색점에 대하여는 먼저 평균 절대 오차 (mean absoulte difference; MAD)를 계산할 필요가 있을지에 대한 판별을 행한 뒤 MAD 계산이 필요한 경우에 대하여서만 MAD를 구한다. MAD 계산 여부에 대한 판별에는 현재 블록과 인접 블록간의 MAD 와 인접 블록의 각 탐색점에 대한 MAD를 이용한다. 여기에 사용된 현재 블록과 인접 블록간의 MAD는 각 블록에 대하여 한번만 계산하면 되고, 인접 블록의 각 탐색점에 대한 MAD는 이미 구해져 있기 때문에 한번의 MAD 계산을 추가함으로써 탐색점 수를 현저히 감소시킬 수 있었다. 컴퓨터 모의 실험 결과로부터 제안한 방법이 전역 탐색 알고리즘과 동일한 성능을 유지하면서 많은 계산량의 감소를 얻을 수 있음을 확인 할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12B
• /
• pp.1758-1765
• /
• 2010

This paper proposes an architecture exploration methodology for the design of embedded cores exploiting design hierarchy. The proposed method performs systematic architecture exploration by taking different approaches for verifying designs and estimating performances depending on the hierarchy level in design process. Performance estimation tools generate profile having performance data related with design modules of an embedded core. Profile analyzer performs data-mining to acquire association rules between the design modules and performance parameters. Inference engine in the profile analyzer updates the association rules which will be used to improve the design performance at next exploration steps. To show the efficiency of the proposed architecture explorations methodology, experiments had been performed for JPEG encoder, Chen-DCT, and FFT application functions. The embedded cores designed by taking the proposed method show performance improvement by 60.8% in terms of clock cycles on the average when compared with the initial embedded core in MIPS R3000.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.245-248
• /
• 2009

Recently, Many studies have been progressing to path-finding with dynamic information on the Terminal Based Navigation System(TBNS). However, the most of existing algorithms are based on $A{\ast}$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, two abstract graph(AG) that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. The abstract graph is a simple graph of real road network. The method of using the abstract graph is proposed for reducing dependency of heuristic and exploring cost. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost but $AG^C$ has worse performance than $AG^H$ exploring cost.