• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.299-306
• /
• 2000

The elastic critical load of a slender compression member plays an important role when the proper design of that member is required. For tapered compression members, however, there are cases when the conventional neutral equilibrium or energy method can't be applied to the determination of critical loads. In this paper, the finite element method is applied to the approximate determination of the linearly tapered members. In this paper, the bars are assumed to be tapered linearly along their axes. The parameters considered in this study are taper parameter, α and the sectional property parameter, m. The member ends are either hinged or fixed. The computed results using the finite element method are represented in the forms of algebraic equations. The regression technique is employed to determine the coefficients of the algebraic equations. Critical loads estimated by the proposed algebraic equations coincide flirty well with those employing the finite element method.

• Journal of Elementary Mathematics Education in Korea
• /
• v.23 no.1
• /
• pp.143-168
• /
• 2019

Along with the significance of algebraic thinking in elementary school, it has been recently emphasized that the properties of number and operations need to be explored in a meaningful way rather than in an implicit way. Given this, the purpose of this study was to analyze how third graders could understand the properties of operations in multiplication after they were taught such properties through a reconstructed unit of multiplication. For this purpose, the students from three classes participated in this study and they completed pre-test and post-test of the properties of operations in multiplication. The results of this study showed that in the post-test most students were able to employ the associative property, commutative property, and distributive property of multiplication in (two digits) × (one digit) and were successful in applying such properties in (two digits) × (two digits). Some students also refined their explanation by generalizing computational properties. This paper closes with some implications on how to teach computational properties in elementary mathematics.

• Journal of Elementary Mathematics Education in Korea
• /
• v.15 no.1
• /
• pp.39-56
• /
• 2011

In 7th grade textbooks, the distributive property is generalized as in algebraic forms, and it seems that the students have not so good grip on this property. To get a good stock of knowledge on that generalized property, full understanding of it in concrete context should take precedence. This study would aim to propose some educational implications for better understanding of that property, through analysing the contents of it comparatively in Korean and Japanese elementary textbooks.

• Honam Mathematical Journal
• /
• v.32 no.3
• /
• pp.375-387
• /
• 2010

The paper studies an existence problem of a (generalized) universal covering space over a digital wedge with a compatible adjacency. In algebraic topology it is well-known that a connected, locally path connected, semilocally simply connected space has a universal covering space. Unlike this property, in digital covering theory we need to investigate its digital version which remains open.

• Communications of the Korean Mathematical Society
• /
• v.29 no.4
• /
• pp.569-579
• /
• 2014

We consider a condition under which the projectivization $P(E^k)$ of a complex k-bundle $E^k{\rightarrow}M$ over an even-dimensional manifold M can have the hard Lefschetz property, affected by [10]. It depends strongly on the rank k of the bundle $E^k$. Our approach is purely algebraic by using rational Sullivan minimal models [5]. We will give some examples.

• Communications of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.1103-1112
• /
• 2018

We study the structure of a generalization of right nilpotent-duo rings in relation with powers of elements. Such a ring property is said to be weakly right nilpotent-duo. We find connections between weakly right nilpotent-duo and weakly right duo rings, in several algebraic situations which have roles in ring theory. We also observe properties of weakly right nilpotent-duo rings in relation with their subrings and extensions.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.267-278
• /
• 2009

As a survey-type article, the paper reviews the recent results on a (generalized) universal covering space in digital covering theory. The recent paper [19] established the generalized universal (2, k)-covering property which improves the universal (2, k)-covering property of [3]. In algebraic topology it is well-known that a simply connected and locally path connected covering space is a universal covering space. Unlike this property, in digital covering theory we can propose that a generalized universal covering space has its intrinsic feature. This property can be useful in classifying digital covering spaces and in studying a shortest k-path problem in data structure.

• Korean Journal of Mathematics
• /
• v.17 no.3
• /
• pp.245-248
• /
• 2009

We consider pm-ring with the property such that every prime ideal is contained in only one maximal ideal. Orsatti[4] characterized pm-rings by means of the retraction. Contessa[1] found algebraic condition, by using that direct product of pm-rings is a pm-ring. We show that C(X, H) and C(X, C) are pm-rings and we extend a quasi pm-domain.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.127-137
• /
• 2009

A practical algorithm of generating most probable states in decreasing order of probability of the network system state is suggested for approximating the performance of multi-mode network system using algebraic structure of the system states. Most complex system having network structure with multi-mode unit state is difficult to evaluate the performance or reliability due to exponentially increasing size of state space. Hence not an exact computing method but an approximated one is reasonable approach to solve the problem. To achieve the goal we should enumerate the network system states in order as a pre-processing step. In this paper, we suggest an improved algorithm of generating most probable multi-mode states to get the ordered system states efficiently. The method is compared with the previous algorithms in respective to memory requirement and empirical computing time. From the experiment proposed method has some advantages with regard to the criterion of algorithm performance. We investigate the advantages and disadvantage by illustrating experiment examples.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1937-1956
• /
• 2013

The aim of this article is to lay a foundation for providing a soft algebraic tool in considering many problems that contain uncertainties. In order to provide these soft algebraic structures, the notion of union-soft sets is introduced, and its application to BCK/BCI-algebras is considered. The notions of union-soft algebras, union-soft (commutative) ideals and closed union-soft ideals are introduced, and related properties and relations are investigated. Conditions for a union-soft ideal to be closed are provided. Conditions for a union-soft ideal to be a union-soft commutative ideal are also provided. Characterizations of (closed) union-soft ideals and union-soft commutative ideals are established. Extension property for a union-soft commutative ideal is established.