• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.295-297
• /
• 2005

CEC, 근접방어무기체계, 지휘통제체계 등에 사용되는 위협평가시스템은 자동위협평가, 방어구역 위협지수, 무기할당 등의 공통된 기능을 포함하고 있고, 시스템 환경의 변화 또는 성능 향상에 따라 수시로 업그레이드가 요구된다. 따라서 본 논문에서는 생산성 향상과 중복투자 방지로 인한 비용감소 효과를 거둘 수 있는 제품계열 방법론을 위협평가시스템 개발에 적용하는 방안을 제안한다. 위협평가시스템의 제품계열 방법론 적용을 위해 핵심자산 개발 프로세스를 수행하여 제품계열 영역지정, 핵심자산, 제품계획을 정의한다. 제품계열 영역지정은 Feature 모델링을 이용하여 공통점과 차이점을 식별하고, 핵심자산은 아키텍처 설계 중심으로, 그리고 각 핵심자산의 부착 프로세스를 종합하여 제품계획을 수립한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.779-781
• /
• 2003

최근에 제안된 VA-File［6］은 k-NN 질의 처리에서 아주 효율적이라고 알려져 있다. 제시된 방법은 분할된 데이터의 저장 효율성을 보장하지 못하기 때문에 각 차원에 할당된 비트의 수가 증가하면(비트수＝3~5) 할수륵 거의 모든 데이터에 대하여 MBH를 생성하는 단점이 있다. k-NN 질의는 거의 모든 데이터를 순차 검색을 통한 일차적 가지제거작업을 한 후. 질의를 수행하기 위한 디스크 접근을 한다. 따라서, 질의를 수행하기 위한 디스크 접근 횟수는 다른 방법들에 비하여 거의 최적에 가까운 접근 횟수를 가지나 주 기억 장치에서 최소-힘을 이용하여 수행하는 일차적 가지 제거 작업의 오버 로더는 간과되었다. 우리는 기존에 알려진 재귀적으로 공간을 두개의 부 공간으로 분할하는 방법을 사용하여 VA-File 과 같은 디렉토리 자료구조를 구축하여 k-NN 실험을 하였다. 이러한 분할된 MBH의 정방형성을 선호하는 방법은 저장 효율성을 보장한다. 실제 데이터에 대한 실험에서 우리가 실험한 간단한 방법은 디스크 접근 시간 및 CPU 시간을 합한 전체 수행시간에서 VA-File에 비하여 최대 93% 정도의 성능 향상이 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2000

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.63-69
• /
• 1998

In this paper, we propose a new Bit-Rate control algorithm based on bit usage matching to substitute encoded GOP(s) for new GOP(s) in MPEG-2 bitstream. It iteratively encodes current picture according to quantization value of previous picture and records bit-usage of each slice until nearly target bits are used. With target bits falling in two output bits, quantization value of slice should be changed to alleviate output bit error. We use recorded bit-usage information to decide which slices should be encoded with one quantization value and others with another. As every macroblock has different activity, we change macroblock quantization value using slice quantization value and activity value. The simulation results demonstrate that the fluctuation of the output bits can be kept within few-several tens of bits while maintaining the quality of the reconstructed pictures at a relatively stable level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.414-423
• /
• 2009

This paper considers a linear precoding scheme that achieves near optimal sum rate. While the minimum mean square error (MMSE) precoding provides the better MSE performance at all signal-to-noise ratio (SNR) than the zero forcing (ZF) precoding, its sum rate shows superior performance to ZF precoding at low SNR but inferior performance to ZF precoding at high SNR, From this observation, we first propose a near optimal linear precoding scheme in terms of sum rate. The resulting precoding scheme regularizes ZF precoding to maximize the sum rate, resulting in better sum rate performance than both ZF precoding and MMSE precoding at all SNR ranges. To find regularization parameters, we propose a simple algorithm such that locally maximal sum rate is achieved. As a low complexity alternative, we also propose a simple power re-allocation scheme in the conventional regularized channel inversion scheme. Finally, the proposed scheme is tested under the presence of channel estimation error. By simulation, we show that the proposed scheme can maintain the performance gain in the presence of channel estimation error and is robust to the channel estimation error.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1861-1866
• /
• 1999

ISDN provides mB+1D channel to users. An AO/D1 scheme means D-channel can be used for a permanent low speed connection. When user needs more bandwidth for high speed transfer, the AO/D1 scheme automatically provide greater capacity in the shape of ISDN B-channels. In this paper, we analyze the performance of the AO/D1 scheme with multiple ON-OFF sources in ISDN. We consider multiple ON-OFF sources connected through mB+1D ISDN link. Without the AO/D1 scheme, the required bandwidth will be the sum of peak bandwidth of all sources. With the implementation of the AO/D1 scheme, the required bandwidth is reduced to what is really needed.

• The Journal of Society for e-Business Studies
• /
• v.17 no.4
• /
• pp.141-153
• /
• 2012

According to the environment change of market, supply chain network needs to be redesigned for efficient provision of product within the budget constraint. Also, it is desired that the customer satisfaction such as on time delivery should be considered as an important element at redesigning of supply chain network in addition to the cost reduction. In this paper redesign of supply chain network for its expansion is treated as a problem situation and a related mathematical model is suggested. Moreover, the numerical examples about the total weighted distance of the redesigned supply chain network are presented with various budget constraints by using genetic algorithm to help the managerial decision.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.4
• /
• pp.354-361
• /
• 2011

In this paper, an efficient defense strategy of single naval ship using short range anti-air missiles against the threat of multiple anti-ship missiles is suggested. The defense logic is based on the estimated future trajectory of anti-ship missiles by using current radar information. The logic is designed to maximize the range of interception of anti-ship missiles so that the chance of interception can be increased although the prior tries turn out to be fail. Basically, the decision making for the allocation of a defense missile is achieved by comparing the total kill probability and the estimated intercepting point. Performance of the proposed logic is investigated by nonlinear planar numerical simulations.

• Journal of KIISE:Software and Applications
• /
• v.28 no.4
• /
• pp.369-379
• /
• 2001

본 논문은 부영역 분할과 코드워드 인텍스의 캐시 개념을 이용하여 벡터 양자화를 위한 고속코드북 생성 및 부호화 방법을 제안한다. 제안한 방법은 인접한 입력 벡터는 대개 코드북내 특정 코드워드에 의해 나타내어지는 국부성에 바탕을 두고 있다. 초기에 모든 학습 벡터가 거리에 기반한 근접성을 이용하여 정해진 수의 부영역으로 분할된다. 각 부영역에 하나의 코드워드 인덱스 캐시가 할당되는데 이 캐시는 학습 초기에는 전체 코드북 크기에 대응하는 코드워드 인덱스를 갖는다. 학습이 진행되면서 입력 벡터가 갖는 국부성 때문에 각 부영역내 캐시중 사용되지 않는 코드워드 인덱스가 점차 발생하게 되므로 이들은 LRU(Least Recently Used) 삭제 알고리즘에 의해 제거된다. 학습이 진행됨에 따라 부영역 캐시에는 주어진 입력 벡터에 의해 참조되는 코드워드 인덱스만이 남게 되므로 한 학습 주기 동한 필요한 학습 시간이 점차 짧아지게 되어 전체적으로 코드북 생성 시간을 크게 줄일 수 있게 된다. 제안한 방법은 매 학습주기마다, 코드워드 인덱스 삭제 후보 중 주어진 부영역 중심으로부터 거리에 의해 멀리 떨어진 것부터 반만을 제거함에 따라. 복원된 영상의 화질 열화가 거의 없다. 시뮬레이션 결과 제안한 방법은 기존의 LBG 방법에 비해 화질 열화는 거의 없지만 코드북 생성 (또는 부호화) 속도를 2.6-5.4배 (또는3.7-18.8배) 향상시킨다.