• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.1
• /
• pp.17-26
• /
• 2014

This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.20-22
• /
• 2007

The H.264/AVC standard developed by the joint Video Team (JVT) provides better coding efficiency than previous standards. The new emerging H.264/AVC employs variable block size motion estimation using multiple reference frame with 1/4-pel MV(Motion Vector) accuracy. These techniques are a important feature to accomplish higher coding efficiency. However, these techniques are increased overall computational complexity. To overcome this problem, this paper proposes advanced fast mode decision suited for variable block size by classifying inter mode based on Rate Distortion Optimization(RDO) technique. Proposed algorithm is going to use to implement H/W structure for fast mode decision. The experimental results shows that the proposed algorithm provides significant reduction computational complexity without any noticeable coding loss and additional computation. Entire computational complexity is decreased about 30%.

• Journal of Korean Society of Transportation
• /
• v.14 no.2
• /
• pp.45-58
• /
• 1996

In a large signal intersection, it is the most important to set phase sequences and phase intervals of traffic signal in order to improve the efficiency of the capacity as well as safety. These setting allows to select the best sequence of signal phase among several alternatives, and thus to rearrange the starting and ending points of the individual phase using an effective interphase periods (EIP). The EIP is a gap between previous and current traffic movements at a potential collision point in an intersection. Each of traffic movements has an equality for safety and efficiency at the balanced condition of EIP. This paper presents how to set optimally the phase sequences and intervals of traffic signal in an intersection using phase based approach. And in the second part, we applied the theory developed in the first part. In particular, a numerical example of phase base signal setting is presented using a matrix computation method in order to select the best sequence among several alternatives, and thus to rearrange the starting and ending points of the individual phase using the EIP. This method also allows to apply to optimum signal setting even in five-lag or staggered-type intersection.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.3
• /
• pp.363-371
• /
• 1994

This thesis investigates an expert system(ES) to propose fault restoration plan by utilizing tree search strategies. In order to cope with an extensive amount of data and frequent breaker switching operations in distribution systems, the database of system configuration is constructed by using binary trees. This remarkably enhances the efficiency of search algorithm and makes the proposed ES easily adaptable to system changes due to switching operations. The rule-base is established to fully utilize the meris of tree-structured database. The inferring strategy is developed mainly based on the best-first search algorithm to increase computation efficiency. The proposed ES has been implemented to efficiently deal with large distribution systems by reducing computational burden remarkably compared with the conventional ES's.

• Journal of Institute of Convergence Technology
• /
• v.1 no.1
• /
• pp.41-47
• /
• 2011

With the world-wide demand on the emission minimization, the needs on the diesel aftertreatment devices with high efficiency are also increasing. In order to effectively develop or design a high-performance diesel particulate filter, a clear understanding on the deposition and regeneration mechanism is required. In the present study, a theory on the lumped parameter model for wall-flow type diesel particulate filters is described focusing on the deposition efficiency, pressure drop inside the filter. The fourth order explicit Runge-Kutta method is utilized for the mass flow rate computation. Engine operation modes with controlled and uncontrolled regeneration options are selected. The computational lumped parameter model is validated by comparing the computed results with the measured data.

• Korean Journal of Remote Sensing
• /
• v.22 no.5
• /
• pp.439-443
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene. One of which is a reference image, while the other (sensed image) is geometrically transformed to the one. Numerous methods were developed for the automated image co-registration and it is known as a timeconsuming and/or computation-intensive procedure. In order to improve efficiency and effectiveness of the co-registration of satellite imagery, this paper proposes a pre-qualified area matching, which is composed of feature extraction with Laplacian filter and area matching algorithm using correlation coefficient. Moreover, to improve the accuracy of co-registration, the outliers in the initial matching point should be removed. For this, two outlier detection techniques of studentized residual and modified RANSAC algorithm are used in this study. Three pairs of Landsat images were used for performance test, and the results were compared and evaluated in terms of robustness and efficiency.

• Structural Engineering and Mechanics
• /
• v.10 no.6
• /
• pp.603-619
• /
• 2000

Analysis of a framed structure for vertical vibration requires a lot of computational efforts because large number of degrees of freedom are generally involved in the dynamic responses. This paper presents an efficient modeling technique for vertical vibration utilizing substructuring technique and super elements. To simplify the modeling procedure each floor in a structure is modeled as a substructure. Only the vertical translational degrees of freedom are selected as master degrees of freedom in the inside of each substructure. At the substructure-column interface, horizontal and rotational degrees of freedom are also included considering the compatibility condition of slabs and columns. For further simplification, the repeated parts in a substructure are modeled as super elements, which reduces computation time required for the construction of system matrices in a substructure. Finally, the Guyan reduction technique is applied to enhance the efficiency of dynamic analysis. In numerical examples, the efficiency and accuracy of the proposed method are demonstrated by comparing the response time histories and the analysis time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.143-150
• /
• 2014

A high power amplifier(HPA) has widely been used in wireless communications. In order to have a maximum power efficiency, the HPA uses a saturation domain having nonlinear characteristics, which generates nonlinear distortions to decrease the transmission efficiency. In order to solve this problem, various methods to linearize HPA have been reported until now, and the pre-distorter method is very attractive among them. In this paper, a new enhanced adaptive pre-distorter method was proposed to be applied for compensating nonlinear distortions of HPA. Through computer simulations as well as the analytical analysis, it could be shown that it is possible for both conventional adaptive pre-distorter and proposed adaptive pre-distorter, to be applied for linearizing HPA. Also, the simulations results demonstrated that the proposed adaptive pre-distorter may have faster convergence speed and better capability of compensating the nonlinear distortion than the conventional adaptive pre-distorter with nearly equal computation complexity.

• Journal of Information Processing Systems
• /
• v.18 no.3
• /
• pp.293-301
• /
• 2022

Direction of arrival (DOA) estimation of space signals is a basic problem in array signal processing. DOA estimation based on the multiple signal classification (MUSIC) algorithm can theoretically overcome the Rayleigh limit and achieve super resolution. However, owing to its inadequate real-time performance and accuracy in practical engineering applications, its applications are limited. To address this problem, in this study, a DOA estimation algorithm with high parallelism and precision based on an analysis of the characteristics of complex matrix eigenvalue decomposition and the coordinate rotation digital computer (CORDIC) algorithm is proposed. For parallel and single precision, floating-point numbers are used to construct an orthogonal identity matrix. Thus, the efficiency and accuracy of the algorithm are guaranteed. Furthermore, the accuracy and computation of the fixed-point algorithm, double-precision floating-point algorithm, and proposed algorithm are compared. Without increasing complexity, the proposed algorithm can achieve remarkably higher accuracy and efficiency than the fixed-point algorithm and double-precision floating-point calculations, respectively.