• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1363-1371
• /
• 2016

This paper is concerned with best proximity points for multimaps in normed spaces and in hyperconvex metric spaces. Using the generalized KKM theorem, we deduce new best proximity pair theorems for a family of multimaps with unionly open fibers in normed spaces. And we prove a new best proximity point theorem for quasi-lower semicontinuous multimaps in hyperconvex metric spaces.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.2
• /
• pp.189-196
• /
• 2020

In general, fragmented files without signatures and file meta-information are difficult to recover. Multimedia files, in particular, are highly fragmented and have high entropy, making it almost impossible to recover with signature-based carving at present. To solve this problem, research on fragmented files is underway, but research on multimedia files is lacking. This paper is a study that classifies the types of fragmented multimedia files without signature and file meta-information. Extracts the characteristic values of each file type through the frequency differences of specific byte values according to the file type, and presents a method of designing the corresponding Gray-Scale table and classifying the file types of a total of four multimedia types, JPG, PNG, H.264 and WAV, using the CNN (Convolutional Natural Networks) model. It is expected that this paper will promote the study of classification of fragmented file types without signature and file meta-information, thereby increasing the possibility of recovery of various files.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.618-627
• /
• 2010

In this paper, we propose an adaptive K-best algorithm in which the number K of candidates is changed according to the differences of level radii. We also compare the bit error performance and complexity of the proposed algorithm with those of several conventional K-best algorithms, where the complexity is defined as the total number of candidates of which partial Euclidean distances have to be calculated. The proposed algorithm adaptively decides K at each level by eliminating the symbols, whose differences of radii are larger than a threshold, from the set of candidates, and the maximum or average value of differences can be adopted as the threshold. The proposed decoding algorithm shows the better bit error performance and the lower complexity than a conventional K-best decoding algorithm with a constant K, and also has a similar bit error performance and the lower complexity than other adaptive K-best algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.5
• /
• pp.597-607
• /
• 2017

The general control method for Anti-lock Brake System(ABS) is that the wheel slip ratio is observed and the braking force is controlled in real time in order to keep the wheel slip ratio under the value of the best slip ratio. When a wheel runs on the state of the best slip ratio, the ground friction of the wheel approaches the highest value. The value of best slip ratio, theoretically, is known as the value between 10 and 20 % and it is dependant on the ground condition such as dry, wet and ice. It is an important parameter for the braking performance and affects the braking stability and efficiency. In this thesis, an experimental method is suggested, which is a reliable way to decide the best slip ratio through dynamo tests simulating aircraft taxiing conditions. The obtained best slip ratio is proved its validity by results of aircraft taxiing tests.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

• Journal of electromagnetic engineering and science
• /
• v.12 no.1
• /
• pp.8-12
• /
• 2012

In this paper, we evaluate performances of dual-hop decode-and-forward relaying systems with the $N^{th}$ best-relay selection scheme. In some schemes, such as scheduling or load balancing schemes, the best relay is unavailable and hence the system must resort the second best, third best, or generally the $N^{th}$ best relay. We derive the expressions of the outage probability and symbol error rate (SER) for this scenario over Rayleigh fading channels. Monte-Carlo simulations are presented to verify the analytical results.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.127-140
• /
• 1998

In this paper, we discuss the characterizations and uniqueness of a one-sided best simultaneous approximation for a compact subset from a convex subset of a finite-dimensional subspace of a normed linear space $C_1(X)$. The motivation is furnished by the characterizations of the one-sided best simultaneous approximations for a finite subset ${f_1, \ldots, f_\ell}$ for any $\ell \in N$.

• Journal of the Korean Statistical Society
• /
• v.23 no.1
• /
• pp.53-62
• /
• 1994

When a comparison is made with respect to the unknown best treatment, Hsu (1984, 1985) proposed the so called multiple comparisons procedures with the best in the analysis of variance model. Applying Hsu's results to the analysis of covariance model, simultaneous confidence intervals for multiple comparisons with the best in a balanced one-way layout with a random covariate are developed and are applied to a real data example.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.367-376
• /
• 1996

We characterize best simultaneous approximations from a finite-dimensional subspace of a normed linear space. In the characterization we reveal usefulness of a minimax theorem presented in [2,4].

• East Asian mathematical journal
• /
• v.19 no.2
• /
• pp.207-212
• /
• 2003

Some new characterization of best approximants from level sets of convex functions in normed linear spaces in terms of norm derivatives are given.