• Journal of Navigation and Port Research
• /
• v.45 no.6
• /
• pp.284-297
• /
• 2021

A simple kinematic model for the prediction of ship manoeuvres based on trial data is proposed in this study. The model consists of first order differential equations in surge, sway, and yaw directions which simulate the time series of each velocity component. Actually instead of sea trial data, dynamic model simulations are conducted with randomly varied control inputs such as propeller revolution rates and rudder angles. Based on learning of control inputs and velocity outputs of dynamic model simulations in sufficient time, kinematic model coefficients are optimized so that the kinematic model can be approximately reproduce the velocity outputs of dynamic model simulations with arbitrary control inputs. The resultant kinematic model is verified with new dynamic simulation sets.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.201-208
• /
• 2002

In this paper, we present a new formulation using time-domain electric field integral equation (TD-EFIE) to obtain transient scattering response from arbitrarily shaped three-dimensional conducting bodies. The time derivative of the magnetic vector potential is approximated with a central finite difference and the scalar potential is time averaged by dividing it into two terms. This approach with an implicit method using central difference results in accurate and more stable transient scattering responses from conducting objects. Detailed mathematical steps are included and several numerical results are presented and compared with the inverse discrete Fourier transform (IDFT) of the frequency-domain solution.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a deterministic signal transition graph specification with timing constraints. First, a timing analysis extracts the timed concurrency and timed causality relations between any two signal transitions. Then, a hazard-free implementation under the timing constraints is synthesized by constructing a precedence graph and finding paths in the graph. The major result of this work is that the method does not suffer from the state explosion problem, achieves significant reductions in synthesis time, and generates circuits that have nearly the same area as compared to previous methods.

• Journal of Satellite, Information and Communications
• /
• v.4 no.1
• /
• pp.21-27
• /
• 2009

In this paper, we introduce a simulation result of cross ambiguity function (CAF) using time difference of arrival and frequency difference of arrival. This method is generally used to find a geographical location of the unknown radio transmitter. If multiple signals with the same source information are arrived at a receiver via different paths, then they will have different time delays and Doppler shifts. We can estimate the CAF by using these characteristics, and estimate the location of the unknown transmitter. This paper introduces a technique to improve the estimation performance of CAF.

• Journal of Internet Computing and Services
• /
• v.13 no.6
• /
• pp.1-8
• /
• 2012

Clustering method is divided into hierarchical clustering, partitioning clustering, and more. K-Means algorithm is one of partitioning clustering and is adequate to cluster so many documents rapidly and easily. It has disadvantage that the random initial centers cause different result. So, the better choice is to place them as far away as possible from each other. We propose a new method of selecting initial centers in K-Means clustering. This method uses triangle height for initial centers of clusters. After that, the centers are distributed evenly and that result is more accurate than initial cluster centers selected random. It is time-consuming, but can reduce total clustering time by minimizing the number of allocation and recalculation. We can reduce the time spent on total clustering. Compared with the standard algorithm, average consuming time is reduced 38.4%.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.543-553
• /
• 2001

In this paper, we proposed management strategy of medical image data in order to solve the problem in traditional medical images migration method. As management strategy of medical image data we proposed EAT(Expanded Average Transaction time) data migration method and data storing method based on temporal interrelation. In EAT data migration strategy, we define the dividing criterion which distinguish entity versions to be stored in each storage and also define entity versions to be stored in each storage. We defined degree of overlap and degree of difference for any two entity versions, and integrated those values and described method which place entity versions to storage. In order to compare the number of cluster references when we change rate of temporal queries, the number of cluster references of proposed method is smaller than that of traditional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2376-2385
• /
• 1994

In receiving the digital TV signal, both decoding delay and the channel hopping delay are very critical factors in applications. The intra-slice coding in the MPEG-2 SIMPLE PROFLE of No B-picture is one of the primary methods for short delay time in video decoding. It has the advantage of short decoding delay, but has the drawback of long channel hopping delay time. In this paper, we propose a method to reduce the channel delay with negligible loss in SNR performance. It is shown that dividing pictures into several regions of slices and adding some restriction in motion vector search for inter-frame coding. hence the random acess points are effectively increased. and the channel hopping delay is reduced.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.74-77
• /
• 2021

최근 딥러닝을 이용하여 객체 인식 학습을 위한 데이터셋을 구축하는데 있어 시간과 인력을 단축하기 위해 인조 데이터를 생성하는 연구가 진행되고 있다. 하지만 실제 환경과 관계없이 임의의 배경에 배치되어 구축된 데이터셋으로 학습된 네트워크를 실제 환경으로 구성된 데이터셋으로 테스트할 경우 인식률이 저조하다. 이에 본 논문에서는 실제 배경 이미지에 객체 이미지를 합성하고, 다양성을 위해 3차원으로 회전하여 증강하는 인조 데이터셋 생성 시스템을 제안한다. 제안된 방법으로 구축된 인조 데이터셋으로 학습한 네트워크와 실제 데이터셋으로 학습된 네트워크의 인식률을 비교한 결과, 인조 데이터셋의 성능이 실제 데이터셋의 성능보다 2% 낮았지만, 인조 데이터셋을 구축하는 시간이 실제 데이터셋을 구축하는 시간보다 약 11배 빨라 시간적으로 효율적인 데이터셋 구축 시스템임을 증명하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.68-74
• /
• 2005

In deadline scheduling, jobs have deadlines by which they are completed. The scheduling algorithm determines which jobs are executed at each time. Then only the completed jobs contribute to the throughput or gain of the algorithm. The jobs have arbitrary weights and the gain of the algorithm is given as the sum of weights of the completed jobs. The goal of the scheduling algorithm is to maximize its gain. In this paper, we consider online non-preemptive scheduling, where jobs arrive online and the scheduling algorithm has no information about jobs arriving ahead. Also the jobs cannot be preempted or rejected while they are executed. For this problem, we obtain lower bounds for any online algorithms and also we propose an optimal online algorithm meeting the lower bounds.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.199-201
• /
• 2011

본 논문에서는 현재 표준화가 진행중인 HEVC 의 고정 비트율(CBR) 부호화를 위한 비트율 제어(rate control) 기법을 다룬다. HEVC 의 임의접근(Random Access: RA) 부호화 모드는 계층적-B 부호화 구조를 통해 높은 부호화 효율을 제공할 수 있다. 기존의 HEVC 를 위한 비트율 제어 방식으로는 2 차 비트율-왜곡 모델 기반의 시간계층 및 프레임 타입에 따른 비트율 특성을 반영한 프레임 레벨의 비트율 제어 기법이 제시되었다. 이 같은 기존의 프레임 레벨의 비트율 제어 기법은 임의접근 모드의 계층적-B 구조에서 동작성능이 확인되었으나, HEVC 의 기본적인 부호화 단위(Coding Unit: CU)의 특성이 반영되지 않아 비트율 제어의 정확성이 제한되었다. 본 논문에서는 기존의 계층적 부호화 구조를 고려한 프레임 레벨의 비트율 제어 기법을 확장한 CU 레벨에서의 비트율 제어 기법을 제시하고 모의실험을 통해 제시된 기법의 비트율 제어 성능을 확인한다.