• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.873-891
• /
• 2018

This paper suggests an automatic approach to extracting Java method implementation patterns associated with method identifiers using Cascade K-Medoids. Java method implementation patterns indicate recurring implementations for achieving the purpose described in the method identifier with the given parameters and return type. If the implementation is different from the purpose, readers of the code tend to take more time to comprehend the method, which eventually affects to the increment of software maintenance cost. In order to automatically identify implementation patterns and its representative sample code, we first propose three groups of feature vectors for characterizing the Java method signature, method body and their relation. Then, we apply Cascade K-Medoids by enhancing the K-Medoids algorithm with the Calinski and Harrabasez algorithm. As the evaluation of our approach, we identified 16,768 implementation patterns of 7,169 method identifiers from 50 open source projects. The implementation patterns have been validated by the 30 industrial practitioners with from 1 to 6 years industrial experience, resulting in 86% of the precision.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.4
• /
• pp.79-85
• /
• 2018

This paper presents an implementation method of Long Term Evolution-Advanced (LTE-A) Physical Downlink Shared Channel (PDSCH) decoder using a general-purpose multicore Digital Signal Processor (DSP), TMS320C6670. Although the DSP provides some useful coprocessors such as turbo decoder, fast Fourier transformer, Viterbi Coprocessor, Bit Rate Coprocessor etc., it is specific to the base station platform implementation not the mobile terminal platform implementation. This paper shows an implementation method of the LTE-A PDSCH decoder using programmable DSP cores as well as the coprocessors of Fast Fourier Transformer and turbo decoder. First, it uses the coprocessor supported by the TMS320C6670, which can be used for PDSCH implementation. Second, we propose a core programming method using DSP optimization method for block diagram of PDSCH that can not use coprocessor. Through the implementation, we have verified a real-time decoding feasibility for the LTE-A downlink physical channel using test vectors which have been generated from LTE-A Reference Measurement Channel (RMC) Waveform R.6.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.3
• /
• pp.66-81
• /
• 2021

In this paper, we review the lowest order staggered discontinuous Galerkin methods on polygonal meshes in 2D. The proposed method offers many desirable features including easy implementation, geometrical flexibility, robustness with respect to mesh distortion and low degrees of freedom. Discrete function spaces for locally H¹ and H(div) spaces are considered. We introduce special properties of a sub-mesh from a given star-shaped polygonal mesh which can be utilized in the construction of discrete spaces and implementation of the staggered discontinuous Galerkin method. For demonstration purposes, we consider the lowest case for the Poisson equation. We emphasize its efficient computational implementation using only geometrical properties of the underlying mesh.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.91-104
• /
• 2004

A modification of the gradient method of convex programming is introduced. Also, we describe symbolic implementation of the gradient method and its modification by means of the programming language MATHEMATICA. A few numerical examples are reported.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.27-33
• /
• 1993

This paper describes the hardware implementation of 2-D FIR digital filter for a real-time image processing. Generally, the most time-consuming operation in signal processing is the multiplication operation. To avoid it in digital filter. Pelid and Liu proposed the distributed arithmetic method for the one-dimensional case. The implementation method proposed in this paper is to extend Pelid's method to two-dimensional FIR filter using simple ROM lookup table and to use the technique of pipe lining two main operations of memory access and arithmetic. As a result, the speed of our proposed hardware implementation is two times faster than that of conventional methods and can be close to the real time speed.

• Journal of Mechanical Science and Technology
• /
• v.20 no.1
• /
• pp.110-124
• /
• 2006

The multi scale wavelet-Galerkin method implemented in an adaptive manner has an advantage of obtaining accurate solutions with a substantially reduced number of interpolation points. The method is becoming popular, but its numerical efficiency still needs improvement. The objectives of this investigation are to present a new numerical scheme to improve the performance of the multi scale adaptive wavelet-Galerkin method and to give detailed implementation procedure. Specifically, the subdomain technique suitable for multiscale methods is developed and implemented. When the standard wavelet-Galerkin method is implemented without domain subdivision, the interaction between very long scale wavelets and very short scale wavelets leads to a poorly-sparse system matrix, which considerably worsens numerical efficiency for large-sized problems. The performance of the developed strategy is checked in terms of numerical costs such as the CPU time and memory size. Since the detailed implementation procedure including preprocessing and stiffness matrix construction is given, researchers having experiences in standard finite element implementation may be able to extend the multi scale method further or utilize some features of the multiscale method in their own applications.

• Korean Management Science Review
• /
• v.19 no.2
• /
• pp.155-168
• /
• 2002

In this paper, some efficient implementation techniques for the multifrontal method, which can be used to compute the Cholesky factor of a symmetric positive definite matrix, are presented. In order to use the cache effect in the cache-based computer architecture, a hybrid method for factorizing a frontal matrix is considered. This hybrid method uses the column Cholesky method and the submatrix Cholesky method alternatively. Experiments show that the hybrid method speeds up the performance of the supernodal multifrontal method by 5%～10%, and it is superior to the Cholesky method in some problems with dense columns or large frontal matrices.

• Journal of the Korean Statistical Society
• /
• v.9 no.1
• /
• pp.13-29
• /
• 1980

The statistical theory of factor analysis is briefly reviewed with emphasis on the maximum-likelihood method. A modified version of Joreskog(1975) is used for the implementation of the maximum-likelihood method. For the minimization of the conditional minimum function, an adaptive Newton-Raphson method is applied.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.1-12
• /
• 2000

In this study, we deals with the implementation of an optimal basis identification procedure for interior point methods. Our implementation is based on Megiddo’s strongly polynomial algorithm applied to Andersen and Ye’s approximate LP construction. Several techniques are explained such as the use of effective indicator for obtaining optimal partition when constructing the approximate LP, the efficient implementation of the problem reduction technique proposed by Andersen, the crashing procedure needed for fast dual phase of Megiddo’s algorithm and the construction of the stable initial basis. By experimental comparison, we show that our implementation is superior to the crossover scheme implementation.

• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.97-114
• /
• 2008

Many companies have implemented ERP systems to enhance their process competitiveness. Since most ERP systems down to date are implemented and managed on each separated business-unit or company level, such systems run short of the consideration about global business processes and global system managements. In order to integrate a successful global ERP, it is essential to apply the well-systematic implementation methodology which considers global standardization and global IT requirements. It is, however, the actual circumstance that such well-structured methodologies for global ERP implementation are hardly shown not only from domestic site but from foreign one. This paper indicates the global ERP implementation guideline with integrated approach including; the standard process design for efficient execution of global business; the ERP implementation method considering global IT requirements; and, the management method for global system operation. GSI ERP methodology is composed of 3 Phase：Global Strategy Planning, Global Template Construction and Global Roll-Out. Phase1; Global Strategy Planning contains Environment Analysis, GSI direction and Implementation Plan. Phase2; Global Template Construction contains Business blueprint, GSI operation design and Global template implementation. Phase3; Global Roll-out contains local business analysis, local ERP implementation and Global ERP Operation.