• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.79-86
• /
• 2005

The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

• Structural Engineering and Mechanics
• /
• v.51 no.6
• /
• pp.923-937
• /
• 2014

The rational finite element method is different from the standard finite element method, which is constructed using basic solutions of the governing differential equations as interpolation functions in the elements. Therefore, it is superior to the isoparametric approach because of its obvious physical meaning and accuracy; it has successfully been applied to the isotropic elasticity problem. In this paper, the formulation of rational finite elements for plane orthotropic elasticity problems is deduced. This method is formulated directly in the physical domain with full consideration of the requirements of the patch test. Based on the number of element nodes and the interpolation functions, different approaches are applied with complete polynomial interpolation functions. Then, two special stiffness matrixes of elements with four and five nodes are deduced as a representative application. In addition, some typical numerical examples are considered to evaluate the performance of the elements. The numerical results demonstrate that the present method has a high level of accuracy and is an effective technique for solving plane orthotropic elasticity problems.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.631-634
• /
• 2006

Three main important sources for establishing GIS are the orthomap in scale 1:5 000 with Ground Sampling Distance of 0,5m; DEM/DTM data with height error of ${\pm}$1,0m and topographic map in scale 1: 10 000. The new era with Very High Resolution Satellite (VHRS) images as IKONOS, QuickBird, EROS, OrbView and other ones having Ground Sampling Distance (GSD) even lower than 1m has been in potential for producing orthomap in large scale 1:5 000, to update existing maps, to compile general-purpose or thematic maps and for GIS. The accuracy of orthomap generated from VHRS image affects strongly on GIS reliability. Nevertheless, orthomap accuracy taken from VHRS image is at first dependent on chosen sensor geometrical models. This paper presents, at fist, theoretical basic of the Rational Polynomial Coefficient (RPC) model installed in the commercial ImageStation Systems, realized for orthorectifying VHRS images. The RPC model of VHRS image is a replacement camera mode that represents the indirect relation between terrain and its image acquired on the flight orbit. At the end of this paper the practical accuracies of IKONOS and QuickBird image orthorectified by RPC model on Canadian PCI Geomatica System have been presented. They are important indication for practical application of producing digital orthomaps.

• East Asian mathematical journal
• /
• v.30 no.5
• /
• pp.617-623
• /
• 2014

Due to Bell, a ring R is usually said to be IFP if ab = 0 implies aRb = 0 for $a,b{\in}R$. It is shown that if f(x)g(x) = 0 for $f(x)=a_0+a_1x$ and $g(x)=b_0+{\cdots}+b_nx^n$ in R[x], then $(f(x)R[x])^{2n+2}g(x)=0$. Motivated by this results, we study the structure of the IFP when proper ideals are taken in place of R, introducing the concept of insertion-of-ideal-factors-property (simply, IIFP) as a generalization of the IFP. A ring R will be called an IIFP ring if ab = 0 (for $a,b{\in}R$) implies aIb = 0 for some proper nonzero ideal I of R, where R is assumed to be non-simple. We in this note study the basic structure of IIFP rings.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1993.10a
• /
• pp.248-255
• /
• 1993

Recently, due to the increasing attention to the structural safety under uncertain environments, many researches on the structural reliability analysis have been peformed. Some useful methods are available to evaluate performance reliability of structures with explicit limit states. However, for large structures, in which structural behaviors can be analyzed with finite element models and the limit states are only expressed implicitly, Monte-Carlo simulation method has been mainly used. However, Monte-Carlo simulation method spends too much computational time on repetitive structural analysis. Many alternative methods are suggested to reduce the computational work required in Monte-Carlo simulation. Response surface method is widely used to improve the efficiency of structural reliability analysis. Response surface method is based on the concept of approximating simple polynomial function of basic random variables for the limit state which is not easily expressed in explicit forms of design random variables. The response surface method has simple algorithm. However, the accuracy of results highly depends on how properly the stochastic characteristics of the original limit state has been represented by approximated function, In this study, an improved response surface method is proposed in which the sampling points for creating response surface are modified to represent the failure surface more adequately and the combined use of a linear response surface function and Rackwitz-Fiessler method has been employed. The method is found to be more effective and efficient than previous response surface methods. In addition more consistent convergence is achieved, Accuracy of the proposed method has been investigated through example.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.6
• /
• pp.580-598
• /
• 1987

This paper presents a method to realize the sequential multiple-valued Logic on Galois field. First, We develop so that Taylor series can be corresponded the irreducible polynomial to realize over the finite field, and produce the matrix. This paper object expanded a basic concept of the conbinational Logic circuit so as to apply in the sequential Logic circuit. First of all, We suggest a theory for constructing sequential multiple-valued Logic circuit. Then, We realized the construction with the single input and the multi-output that expanded its function construction. In case of the multi-output, the circuit process by the partition function concept as the mutual independent. This method can be reduced a enormous computer course to need a traditional extention that designed the sequential multi-valued Logic circuit.

• International Journal of Highway Engineering
• /
• v.15 no.4
• /
• pp.21-29
• /
• 2013

PURPOSES : The objective of this study is to provide for the overall SPL (Sound Pressure Level) prediction model by using the NCPX (Noble Close Proximity) measurement method in terms of regression equations. METHODS: Many methods can be used to measure the traffic noise. However, NCPX measurement can powerfully measure the friction noise originated somewhere between tire and pavement by attaching the microphone at the proximity location of tire. The overall SPL(Sound Pressure Level) calculated by NCPX method depends on the vehicle speed, and the basic equation form of the prediction model for overall SPL was used, according to the previous studies (Bloemhof, 1986; Cho and Mun, 2008a; Cho and Mun, 2008b; Cho and Mun, 2008c). RESULTS : After developing the prediction model, the prediction model was verified by the correlation analysis and RMSE (Root Mean Squared Error). Furthermore, the correlation was resulted in good agreement. CONCLUSIONS: If the polynomial overall SPL prediction model can be used, the special cautions are required in terms of considering the interpolation points between vehicle speeds as well as overall SPLs.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.41-46
• /
• 2013

Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Recently, many semi-systolic architectures have been proposed for multiplications over finite fields. Also, Montgomery multiplication algorithm is well known as an efficient arithmetic algorithm. In this paper, we induce an efficient multiplication algorithm and propose an efficient semi-systolic Montgomery multiplier based on polynomial basis. We select an ideal Montgomery factor which is suitable for parallel computation, so our architecture is divided into two parts which can be computed simultaneously. In analysis, our architecture reduces 30%~50% of time complexity compared to typical architectures.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.33-40
• /
• 2015

The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.