• The KIPS Transactions:PartB
• /
• v.19B no.4
• /
• pp.221-224
• /
• 2012

The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can't split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.462-469
• /
• 2002

While the conventional K-means algorithms use a fixed weight to design a vector codebook for all learning iterations, the proposed method employs a variable weight for learning iterations. The weight value of two or more beyond a convergent region is applied to obtain new codevectors at the initial learning iteration. The number of learning iteration applying a variable weight must be decreased for higher weight value at the initial learning iteration to design a better codebook. To enhance the splitting method that is used to generate an initial codebook, we propose a new method, which reduces the error between a representative vector and the member of training vectors. The method is that the representative vector with maximum squared error is rejected, but the vector with minimum error is splitting, and then we can obtain the better initial codevectors.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.380-390
• /
• 1994

In this paper, we propose an equal-cost bifurcated routing algorithm which may be useful in practical computer network design problem. The performance of the routing algorithm is evaluated using the conventional Monte Carlo simulation and a transient queueing approximation. The relative errors between the closure approximation and the Monte Carlo simulation was fairly small. The closure approximation may be used to evaluate the performance of the load splitting algorithms, which results in considerable execution time reduction. The performance of the proposed algorithm is compared to that of the known algorithms based on average packet delay. For networks that have many non-disjoint equal-paths, the proposed algorithm performed better than other algorithms.

• ETRI Journal
• /
• v.40 no.1
• /
• pp.61-71
• /
• 2018

In this study, we developed hybrid control algorithms in smart base stations (SBSs) along with devised communication, caching, and computing techniques. In the proposed scheme, SBSs are equipped with computing power and data storage to collectively offload the computation from mobile user equipment and to cache the data from clouds. To combine in a refined manner the communication, caching, and computing algorithms, game theory is adopted to characterize competitive and cooperative interactions. The main contribution of our proposed scheme is to illuminate the ultimate synergy behind a fully integrated approach, while providing excellent adaptability and flexibility to satisfy the different performance requirements. Simulation results demonstrate that the proposed approach can outperform existing schemes by approximately 5% to 15% in terms of bandwidth utilization, access delay, and system throughput.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.387-396
• /
• 2004

One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause severe interruptions on real-time video streams. Some of these interruptions are too large to be concealed using any sort of video technology, resulting in communications breaks unpleasant for the final end user. We present a solution for enhanced video transmission that increases route stability by using an improved route discovery process based on the DSR routing protocol, along with traffic splitting algorithms and a preventive route discovery mechanism. We also present some video adaptative mechanisms that improve the overall performance of multipath routing in terms of video data replication and video packet splitting strategies. Combining our proposals, we achieve up to 97% less interruptions on communication with high mobility and over 1.2 dB of improvements in terms of video distortion.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.75-89
• /
• 2018

This paper presents the numerical valuation of the arithmetic Asian option by using the operator-splitting method (OSM). Since there is no closed-form solution for the arithmetic Asian option, finding a good numerical algorithm to value the arithmetic Asian option is important. In this paper, we focus on a two-dimensional PDE. The OSM is famous for dealing with plural-dimensional PDE using finite difference discretization. We provide a detailed numerical algorithm and compare results with MCS method to show the performance of the method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.12
• /
• pp.2995-3006
• /
• 1993

An automatic mesh generation scheme has been developed for finite element analysis with two-dimensional, quadrilateral elements. The basic strategies of the method are to transform the analysis domain into loops with key nodes and the loops are recursively subdivided into subloops with the use of best split lines. Finally by using the basic loop operators, the meshes are completed. In this algorithm an eight-node loop operator is proposed, which is useful in the area where the change of element size is large and the splitting criteria for subdividing the loops have also been modified to the existing algorithms. Lines, arcs, and cubic spline curves are used to define the boundaries of analysis domain. Sample meshes for several geometries are presented to demonstrate the robustness of the algorithm.

• Communications of the Korean Mathematical Society
• /
• v.17 no.2
• /
• pp.349-361
• /
• 2002

The ill-posed elliptic wave propagation problems can be transformed into well-posed initial value problems of the reflection and transmission operators characterizing the material structure of the given model by the combination of wave field splitting and invariant imbedding methods. In general, the derived scattering operator equations are of first-order in range, nonlinear, nonlocal, and stiff and oscillatory with a subtle fixed and movable singularity structure. The phase space and path integral analysis reveals that construction and reconstruction algorithms depend crucially on a detailed symbol analysis of the scattering operators. Some information about the singularity structure of the scattering operator symbols is presented and analyzed in the transversely homogeneous limit.

• Management Science and Financial Engineering
• /
• v.17 no.2
• /
• pp.23-37
• /
• 2011

In this paper, we address a layout design problem for determining an optimal 4-class-based dedicated linear storage layout in a class of unit load storage systems. Assuming that space requirement for a class is the sum of the maximum inventory levels of products assigned to the class, and that one-way travel time is a linear function of storage index, we formulate a 4-class-based dedicated linear storage problem PTL[4] and provide an exact splitting algorithm with $O(n{\lceil}logn{\rceil})$. Our algorithms could be applied to more than a 4-class-based dedicated storage layout problem with slight modification in order to reduce computational execution time.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.666-670
• /
• 2008

The low-speed preconditioning technique is applied to solve the compressible Reynolds averaged Navier-Stokes equations for low-speed flows. The space discretization is based on Roe's flux-difference splitting with third-order-accurate MUSCL extrapolation. Time integration is performed employing a diagonal approximate factorization algorithm. The dual-time stepping has been incorporated to solve the unsteady flows. Full multigrid method is implemented to accelerate the convergence rate. To verify the algorithms several cases have been tested. Demonstrated the improvement on convergence and quality of the solution.