• The Mathematical Education
• /
• v.58 no.1
• /
• pp.1-20
• /
• 2019

As the importance of algebraic thinking in elementary school has been emphasized, the links between fraction knowledge and algebraic thinking have been highlighted. In this study, we analyzed the solution methods and characteristics of thinking by fifth graders who have not yet learned fraction division when they solved 'reverse fraction problems' (Pearn & Stephens, 2018). In doing so, the contexts of problems were extended from the prior study to include the following cases: (a) the partial quantity with a natural number is discrete or continuous; (b) the partial quantity is a natural number or a fraction; (c) the equivalent fraction of partial quantity is a proper fraction or an improper fraction; and (d) the diagram is presented or not. The analytic framework was elaborated to look closely at students' solution methods according to the different contexts of problems. The most prevalent method students used was a multiplicative method by which students divided the partial quantity by the numerator of the given fraction and then multiplied it by the denominator. Some students were able to use a multiplicative method regardless of the given problem contexts. The results of this study showed that students were able to understand equivalence, transform using equivalence, and use generalizable methods. This study is expected to highlight the close connection between fraction and algebraic thinking, and to suggest implications for developing algebraic thinking when to deal with fraction operations.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.411-420
• /
• 2002

The left-associative grammar model (LAG) has been applied successfully to the morphologic and syntactic analysis of various european and asian languages. The algebraic definition of the LAG is very well suited for the application to natural language processing as it inherently obeys de Saussure's second law (de Saussure, 1913, p. 103) on the linear nature of language, which phrase-structure grammar (PSG) and categorial grammar (CG) do not. This paper describes the so-called Loom-LAGs (LLAG) -a specialization of LAGs for the analysis of natural language. Whereas the only means of language-independent abstraction in ordinary LAG is the principle of possible continuations, LLAGs introduce a set of more detailed language-independent generalizations that form the so-called loom of a Loom-LAG. Every LLAG uses the very smut loom and adds the language-specific information in the form of a declarative description of the language -much like an ancient mechanised Jacquard-loom would take a program-card providing the specific pattern for the cloth to be woven. The linguistic information is formulated declaratively in so-called syntax plans that describe the sequential structure of clauses and phrases. This approach introduces the explicit notion of phrases and sentence structure to LAG without violating de Saussure's second law iud without leaving the ground of the original algebraic definition of LAG, LLAGS can in fact be shown to be just a notational variant of LAG -but one that is much better suited for the manual development of syntax grammars for the robust analysis of free texts.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.1
• /
• pp.63-70
• /
• 1998

The singular value decomposition is a tool which is used to find a linear structure of reduced dimension and to give interpretation of the lower dimensional structure about multivariate data. In this paper the singular value decomposition is reviewed from both algebraic and geometric point of view and, is illustrated the way which the tool is used in the multivariate techniques finding a simpler geometric structure for the data.

• School Mathematics
• /
• v.16 no.2
• /
• pp.355-386
• /
• 2014

Algebraic generalization of patterns is based on the capability of grasping a structure inherent in several objects with awareness that this structure applies to general cases and ability to use it to provide an algebraic expression. The purpose of this study is to investigate how students generalize patterns using an algebraic object such as parameters and what are difficulties in geometric-arithmetic pattern tasks related to algebraic generalization and to determine whether the students can use parameters meaningfully through pattern generalization tasks that this researcher designed. During performing tasks of pattern generalization we designed, students differentiated parameters from letter 'n' that is used to denote a variable. Also, the students understood the relations between numbers used in several linear equations and algebraically expressed the generalized relation using a letter that was functions as a parameter. Some difficulties have been identified such that the students could not distinguish parameters from variables and could not transfer from arithmetical procedure to algebra in this process. While trying to resolve these difficulties, generic examples helped the students to meaningfully use parameters in pattern generalization.

• 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.

• Honam Mathematical Journal
• /
• v.34 no.4
• /
• pp.495-504
• /
• 2012

Let G be a semialgebraic group and M a proper semi-algebraic G-set which is locally complete. In this paper we show that the orbit space M/G has a semialgebraic structure such that the orbit map is semialgebraic.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.333-341
• /
• 2006

We analyze a detailed picture of the algebraic structure of $C^*$-algebras generated by isometric representations of the non-amenable semigroup P = {0,2,3,...,N,...}.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.37-44
• /
• 2002

In this paper, we obtain an algebraic structure which is equivalent to an MV-algebra. Moreover, we show that $t$-norm and $t$-conorm can be obtained from MV-algebras.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.609-615
• /
• 2022

We give a formula for the sizes of the dual groups. It is obtained by generalizing a size estimation of certain algebraic structure that lies in the heart of the proof of the celebrated primality test by Agrawal, Kayal and Saxena. In turn, by using our formula, we are able to give a streamlined survey of the AKS test.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.201-208
• /
• 2014

Park et al. introduced the concept of generalized intuitionistic fuzzy soft sets, which can be seen as an effective mathematical tool to deal with uncertainties. In this paper, we introduce new operations such as restricted union and restricted intersection and study their basic properties, and deal with the algebraic structure of generalized intuitionistic fuzzy soft sets. The lattice structures of generalized intuitionistic fuzzy soft sets are constructed.