• Structural Engineering and Mechanics
• /
• v.39 no.1
• /
• pp.21-46
• /
• 2011

The natural frequencies of continuous systems depend on the governing partial differential equation and can be numerically estimated using the finite element method. The accuracy and convergence of the finite element method depends on the choice of basis functions. A basis function will generally perform better if it is closely linked to the problem physics. The stiffness matrix is the same for either static or dynamic loading, hence the basis function can be chosen such that it satisfies the static part of the governing differential equation. However, in the case of a rotating beam, an exact closed form solution for the static part of the governing differential equation is not known. In this paper, we try to find an approximate solution for the static part of the governing differential equation for an uniform rotating beam. The error resulting from the approximation is minimized to generate relations between the constants assumed in the solution. This new function is used as a basis function which gives rise to shape functions which depend on position of the element in the beam, material, geometric properties and rotational speed of the beam. The results of finite element analysis with the new basis functions are verified with published literature for uniform and tapered rotating beams under different boundary conditions. Numerical results clearly show the advantage of the current approach at high rotation speeds with a reduction of 10 to 33% in the degrees of freedom required for convergence of the first five modes to four decimal places for an uniform rotating cantilever beam.

• Honam Mathematical Journal
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2007

In this paper we show that for each finite frame for a Hilbert space there are two orthonormal elements related to the optimal lower and upper bounds of the frame. Based on this we show that an orthonormal basis is naturally associated with every finite frame. We then analyze the relationship between such an orthonormal basis and the given finite frame.

• Korean Business Review
• /
• v.3
• /
• pp.183-210
• /
• 1990

In this study traditional depreciation method has been analysed carefully and then compared with the depreciation on current cost basis for the purpose of reviewing the basic theory underlying depreciation on current cost basis in view of the current situation demanding new method of depreciation. In this treatise the inevitability of rejecting the basic theory of depreciation and traditional depreciation method has been treated. Furthermore the probable consequence when such refutation of traditional depreciation occurs is studied. How to resolve such problems and what is the basis for claiming for depreciation on current cost basis have been also analysed. Through this analysis and research the following conclusions have been drawn: 1. For the purpose of complete recovery of invested capital depreciation on current cost basis is demanded. 2. For the purpose of undertaking realistic profit computation and accounting to apply to comparison and analysis of business operation depreciation on current cost basis is required. 3. When the feasibility of depreciation on current cost basis is guaranteed' then depreciation on current cost basis can be promoted. 4. Depreciation on current cost basis should be studied from the standpoint of evaluation position.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.553-561
• /
• 2007

In this paper we propose the concept of fuzzy basis of fuzzy submachine, which is the generalized form of crisp basis of submachine, and we extend the system of generators and free subset to fuzzy forms, from which we prove that minimal system of fuzzy generators, maximally free fuzzy subset, and fuzzy basis are equivalent forms.

• Journal of Multimedia Information System
• /
• v.5 no.1
• /
• pp.63-66
• /
• 2018

In this work, the smoothing and the interpolation basis splines are analyzed. As well as the possibility of using the spectral properties of the basis splines for digital signal processing are shown. This takes into account the fact that basic splines represent finite, piecewise polynomial functions defined on compact media.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.41-62
• /
• 2010

In this article, we discuss a Grobner basis algorithm related to the stability of algebraic varieties in the sense of Geometric Invariant Theory. We implement the algorithm with Macaulay 2 and use it to prove the stability of certain curves that play an important role in the log minimal model program for the moduli space of curves.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.303-308
• /
• 2004

The Gabor cosine and sine transform can be applied to image and video compression algorithm by representing image frequency components locally The computational complexity of forward and inverse matrix transforms used in the compression and decompression requires O($N^3$)operations. In this paper, the length of basis functions is truncated to produce a sparse basis matrix, and the computational burden of transforms reduces to deal with image compression and reconstruction in a real-time processing. As the length of basis functions is decreased, the truncation effects to the energy of basis functions are examined and the change in various Qualify measures is evaluated. Experiment results show that 11 times fewer multiplication/addition operations are achieved with less than 1% performance change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.21-27
• /
• 2009

We present an efficient exponentiation algorithm for a finite field $GF(2^n)$ determined by an optimal normal basis of type II using signed digit representation of the exponents. Our signed digit representation uses a non-adjacent form (NAF) for $GF(2^n)$. It is generally believed that a signed digit representation is hard to use when a normal basis is given because the inversion of a normal element requires quite a computational delay. However our result shows that a special normal basis, called an optimal normal basis (ONB) of type II, has a nice property which admits an effective exponentiation using signed digit representations of the exponents.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.617-623
• /
• 2008

This paper presents a human motion recognition method using both centroid shift and local basis images. The centroid shift based on 1st moment balance technique is applied to get the robust motion images against position or size changes, the extraction of local basis images based on independent component analysis(ICA) is also applied to find a set of statistically independent motion features, which is included in each motions. Especially, ICA of fixed-point(FP) algorithm based on Newton method is used for being quick to extract a local basis images of motions. The proposed method has been applied to the problem for recognizing the 160(1 person * 10 animals * 16 motions) sign language motion images of 240*215 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate) than the method using local eigen images and the method using local basis images without centroid shift respectively.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.49-61
• /
• 2009

Finite Field multiplication operation is one of the most important operations in the finite field arithmetic. Recently, Fan and Dai introduced a Shifted Polynomial Basis(SPB) and construct a non-pipeline bit-parallel multiplier for $F_{2^n}$. In this paper, we propose a new bit-parallel shifted polynomial basis type I and type II multipliers for $F_{2^n}$ defined by an irreducible trinomial $x^{n}+x^{k}+1$. The proposed type I multiplier has more efficient the space and time complexity than the previous ones. And, proposed type II multiplier have a smaller space complexity than all previously SPB multiplier(include our type I multiplier). However, the time complexity of proposed type II is increased by 1 XOR time-delay in the worst case.