• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1736-1743
• /
• 2011

In Network Centric Warfare (NCW) environment, having a tactical communication network which provides high data exchange rate is very important. In the process, Korean Army developed Mobile Subscriber Access Point (MSAP) which is based on the commercial Wireless BroadBand (Wibro). MSAP is a vehicle attached base station which provide high data exchange communication environment in a given area. Thus MSAP can provide high data exchange rate and mobility to accomplish missions in the battlefield more effectively. In this paper, we propose an operational strategy of using MSAP to provide tactical communication network in the battlefield. The idea is to find the optimal location point of the MSAP in the operational area where all the troops in the operational area can be supported by the MSAP with a minimum number of MSAP. Since the current Korean Army's basic idea of using MSAP is just distribute this MSAP to each troop, so by applying our strategy we can save MSAP devices for more flexible operation. We will show our strategy's benefits through the mathematical model and the algorithm of the presented problem.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.7
• /
• pp.923-929
• /
• 2021

TCP communication and packet communication require transmission control technology to ensure high quality and high reliability. However, in the case of real-time data transmission, an inefficient transmission problem occurs. In order to overcome this problem and transmit the packet reliability, in general, early congestion control using the buffer level as an index was used. Control of the congestion control point and the cancellation point is delayed because the point at which congestion is controlled is based on the buffer level. Therefore, in this paper, not only the buffer level indicator, but also the ideal buffer level, which determines the packet discard probability, is classified so that the transmission rate and buffer level that measure network congestion are close to the level above the optimal setting. As a result, it was shown that the average buffer level can be directly controlled by maintaining the average buffer level by the ideal buffer level set in the experiment to prove the proposed method.

• KNOM Review
• /
• v.23 no.1
• /
• pp.34-42
• /
• 2020

Network Function Virtualization (NFV) environment can deal with dynamic changes in traffic status with appropriate deployment and scaling of Virtualized Network Function (VNF). However, determining and applying the optimal VNF deployment is a complicated and difficult task. In particular, it is necessary to predict the situation at a future point because it takes for the process to be applied and the deployment decision to the actual NFV environment. In this paper, we randomly generate service requests in Multiaccess Edge Computing (MEC) topology, then obtain training data for machine learning model from an Integer Linear Programming (ILP) solution. We use the simulation data to train the machine learning model which predicts the optimal VNF deployment in a predefined future point. The prediction model shows the accuracy over 90% compared to the ILP solution in a 5-minute future time point.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.95-105
• /
• 1986

This paper presents an adaptive algorithm to generate a near-optimal closed-loop solution for a non-zero sum differential game by periodically updating the solutions of the two-point boundary-value problem. Applications to competitive advertising problem show that the adaptive algorithm can be used as an efficient tool to solve the differential game problem in which one player may take advantage of the other's non-optimal play.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.1 no.1
• /
• pp.147-150
• /
• 1976

Optimal stopping problem without recall from a multivariate distribution is solved by using the concept of an equilibrium point which was introduced by J. Nash. The solution is derived for the two cases: 1. The case where the observation cost C is positive and the given upper bound K on the number of observations is infinite. 2. The case where the observation cost C is zero and the given upper bound K on the number of observations is finite.

• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.249-265
• /
• 2017

Interface problem here refers to a second order elliptic problem with a discontinuous coefficient for the second order derivatives. For the corresponding boundary value problem, the maximum principle still holds but Hopf's boundary point lemma may fail. We will give an optimal power type estimate that replaces Hopf's lemma at those boundary points, where this coefficient jumps.

• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.53-68
• /
• 1999

To improve the slow convergence property of the steepest ascent type algorithm for continuous D-optimal design problems. we develop a new algorithm. We apply the nonlinear system of equations as the necessary condition of optimality and develop the two-point algorithm that solves the problem of clustering. Because of the nature of the steepest coordinate ascent algorithm avoiding the problem of clustering itself helps the improvement of convergence speed. The numerical examples show the performances of the new method is better than those of various steepest ascent algorithms.

• Journal of the Korean Institute of Navigation
• /
• v.6 no.1
• /
• pp.19-39
• /
• 1982

There may be a lor of studies on the economic design of ship for the most favorable combination of design basis on the owner's request. However, there are few on the economical ship's size and speed for the ship owner's stand point. This paper describes on the optimal ship's size and speed to the given marine commercial environments for the owner's requirement to the shipyard. As the result of the paper, the criterion curve of bulk carrier will also be used to assess existing ships for their profitability.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.468-471
• /
• 2003

The A＊ algorithm is usually used in game programming, mainly because it is fast in finding a optimal path to goal. In this paper. This algorithm was utilized for path finding, HIMM(Histogramic In-Motion Mapping) method is used in map-building. Map is updated continuously with range data sampled by PSD sensors From the map, A＊ algorithm finds a optimal path and sends subsequently the most suitable point to the Eyebot. A＊ algorithm has been tested on the Eyebot in various unknown maps of unknown and proved to work well. It could escape the local minimum, also.