• The Journal of the Convergence on Culture Technology
• /
• v.7 no.1
• /
• pp.439-445
• /
• 2021

This study aims to investigate the distance of culture and life by 'The Relation-Approach.' For this, We identified the path and mechanism of importance of culture and life through the concept of respective distance and closed distance. We found that the structure of closed culture and closed life makes the distance of culture and life dangerous, which is operated as the factor of making dangerous culture and life. This fact shows that respectiveness operates in the process of converting respective distance to closed distance. Also, It was confirmed that the problem of solving dangerous distance can be established in the condition that mutual distance of culture and life can have the possibility of accomplishment. But We found the fact that the distance which is regarded as the true mutual distance having the consistence of the open condition-accomplishment in culture and life is actually operated by making the dangerous path and mechanism. In this point, We suggested the concept of 'The Multi-tier Dangerousness,' not 'The Single-tier Dangerousness.' We also found the importance of dangerousness of perception with a view to resolving dangerousness operating in culture and life. The fact that 'dangerousness of perception' produced 'dangerousness of phenomenon' was identified. Further more, We suggested that intrinsic perception is needed so as to healthy culture and life. And Open perception was emphasized to go to mutual distance beyond respective distance.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.4
• /
• pp.507-512
• /
• 2015

In the wireless localization systems using range measurements, iteration method-based approximated solutions have been used. Also, linear closed-form solutions have been investigated in the light of local minimum problem and computational load. However, each closed-form solution has individual error factors that cause usage limit of the solutions. In this paper, a fusion method integrating two representative closed-form solutions is presented. The presented method cancels the error factors of each solution out. Weights for integrating the standalone solutions are determined using the error factors-based fuzzy method. The performance of the proposed method is verified using some simulation results.

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.1
• /
• pp.35-41
• /
• 2016

Based on correlation and least square method, a closed-form algorithm for estimating the location of mixed far-field and near-field source is presented using the Uniform Circular Array (UCA). Recently, for a homogeneous circular arrangement case, a correlation based closed-form algorithm is proposed to estimate 2-D angle (azimuth, elevation) and the extended algorithm is proposed to 3-D location (azimuth, elevation, range). These algorithms assume the far-field source or near-field source only. Therefore, for mixed source localization, the proposed algorithm estimates source location with the assumption of far-field source, and then estimates the range to distinguish the far-field from the near-field source. For both cases, numerical experiments have been performed, which confirmed the validity of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1000-1009
• /
• 2006

We propose an adaptive linear interpolation locating sub-pixels. We utilize a pixel-based parameter in the conventional linear interpolation. To optimally obtain the parameter, we propose a generic interpolation structure including a low pass filter and minimum mean square error. We also propose a simple version of the generic interpolation method, which obtain a closed-form solution. Simulation results show that the proposed method is superior to the state-of-the-art methods such as warped distance linear interpolation and shifted linear interpolation, as well as the conventional method such as the linear interpolation and the cubic convolution interpolation in terms of the subjective and objective image quality.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.11
• /
• pp.361-368
• /
• 2015

In AAGFCS the effective range is regarded as a range for the bullet's speed exceeding the speed of sound to damage the stationary target. Hence the real engagement range might be extended over the effective range for the approaching target since bullet's relative speed to the target increases depending on the approaching speed. However previous TOF equations have good computation accuracy within the effective range only, and they can not be used above that range due to their bad accuracy. We propose an accurate TOF computation method which can be used both within and above the effective range in real time. Some simulation results are shown to demonstrate usefulness of our algorithm for the 30mm projectile.

• The Korean Journal of Applied Statistics
• /
• v.22 no.2
• /
• pp.415-424
• /
• 2009

As one of the unsupervised learning neural network methods, self-organizing maps(SOM) are applied to various fields. It reduces the dimension of multidimensional data by representing observations on the low dimensional manifold. On the other hand, the minimal spanning tree(MST) of a graph that achieves the most economic subset of edges connecting all components by a single open loop. In this study, we apply the MST technique to SOM with subnodes. We propose SOM's with embedded MST and a distance measure for optimum choice of the size and shape of the map. We demonstrate the method with Fisher's Iris data and a real gene expression data. Simulated data sets are also analyzed to check the validity of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.483-491
• /
• 2012

In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.1
• /
• pp.16-24
• /
• 2011

In this paper, we propose a new guidance law for target observability enhancement, which can control both terminal impact angle and acceleration. The proposed guidance law is simple form, combined conventional time-to-go polynomial guidance and a additional bias term which consists of relative position and proportional gain. The guidance law provides oscillatory flight trajectory and it maintains the conventional time-to-go polynomial guidance performance. To investigate the characteristics of the guidance law, we derive the closed-form solution, and various simulations are performed for proving the validity of the proposed guidance.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.4
• /
• pp.39-43
• /
• 2004

A typical theme of active vision systems is gaze-fixing of a camera. Here gaze-fixing of a camera means by steering orientation of a camera so that a given point on the object is always at the center of the image. For this we need to combine a function to analyze image data and a function to control orientation of a camera. This paper presents an algorithm for gaze-fixing of a camera where image analysis and orientation control are designed in a frame. At this time, for avoiding difficulties in implementing and aiming for real-time applications we design the algorithm to be a simple closed-form without using my information related to calibration of the camera or structure estimation.

• Journal of KIISE
• /
• v.44 no.3
• /
• pp.246-252
• /
• 2017

In this paper, we present an algorithm that computes a minimum-width color spanning axis-parallel rectangular annulus. A rectangular annulus is a closed region between a rectangle and its offset, and it is thus bounded by two rectangles called its outer and inner rectangles. The width of a rectangular annulus is determined by the distance between its outer and inner rectangles. Given n points in the plane each of which has one of the prescribed k colors, we call a rectangular annulus color spanning if it contains at least one point for each of the k colors. Prior to this work, there was no known exact algorithm that computes a minimum-width color-spanning rectangular annulus. Our algorithm is the first to solve this problem and it runs efficiently in $O((n-k)^3nlogn)$ time.