• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.439-452
• /
• 1998

In this Study, I concerned the learning-teaching of the use of letters in algebra. Our Study can be summarized as follows; First, I tried to establish the theoretical Foundation necessary for the learning-teaching of the use of letters in literal expressions. Second, I made a course of study that leads to the understanding of the meaning and the use f literals in algebraic expressions. Third, Based on this course of study, I held classes on First-grade students in middle school and I carried on an investigation their understanding of the meaning and the use of literals in algebraic expressions. Finally, I made an analysis of findings in this investigation and identified student's a better understanding of the meaning and the use of literals in algebraic expressions.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.293-298
• /
• 2006

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored form is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Bryton's co-kernel cube matrix.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.418-424
• /
• 1994

Like the Hermitian function field over GF(q), those subfields defined by y +y=x where s divides q+1 are also maximal, having the maximum number os places of degree one permissible by the Hasse-Weil bound. Geometric Goppa codes(or algebraic geometric codes) arising from these subfields of the Hermitian function field are studied in this paper. Their dimension and minimum distance are explicilty and completely presented for any m with m

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.443-452
• /
• 1995

Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving this claim and the investigation of related issues such as query processing have been hampered by the absence of a formal object-oriented query model. In this paper, we not only define a query model based on aggregation inheritance but also develop semantic rewriting rules which are applied to equivalence preserving rewrite rules in algebraic expression of a query. Analyzing semantically the query model, the query model can be optimized to logically object-oriented query processing. And algebra expresstions of a query can be optimized by applying equivalence preserving rewrite rules.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.111-119
• /
• 2023

In this paper, we investigate the feasibility of functional programming in the Scala language. The main issue is to what extent Scala is able to handle major properties of functional programming such as lambda expression, high-order functions, generic types, algebraic data types, and monads. For this purpose, we implement an interpreter of an imperative language. In this implementation, the same functional programming techniques are applied to both Haskell and Scala languages, and then these two versions of implementations are compared and analyzed. The abstract syntax tree of an imperative language is expressed as algebraic data types with generics and enum classes in Scala, and the state transition of imperative languages is implemented by using state monad. Extension and given, new features of Scala, are used as well.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3227-3233
• /
• 2009

A method for performing Boolean resubstitution is proposed. This method is efficiently implemented using division matrix. It begins by creating an algebraic division matrix from given two logic expressions. By introducing Boolean properties and adding literals into the algebraic division matrix, we make the Boolean division matrix. Using this extended division matrix, Boolean substituted expressions are found. Experimental results show the improvements in the literal counts over well-known logic synthesis tools for some benchmark circuits.

• Communications of Mathematical Education
• /
• v.24 no.3
• /
• pp.543-562
• /
• 2010

The purpose of this thesis is to analyze the error happening in the process of solving the simultaneous inequality with two unknown qualities and to propose the correct teaching method. We first introduce a problem about the simultaneous inequality with two unknown qualities. And we will see the solution which a student offers. Finally we propose the correct teaching method by analyzing the error happening in the process of solving the simultaneous inequality with two unknown qualities. The cause of the error are a wrong conception which started with the process of solving the simultaneous equality with two unknown qualities and an insufficient curriculum in connection with the simultaneous inequality with two unknown qualities. Especially we can find out the problem that the students don't look the interrelation between two valuables when they solve the simultaneous inequality with two unknown qualities. Therefore we insist that we must teach students looking the interrelation between two valuables when they solve the simultaneous inequality with two unknown qualities.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.533-544
• /
• 2021

Using Shor algorithm, factoring and discrete logarithm problem can be solved effectively. The public key cryptography, such as RSA and ECC, based on factoring and discrete logarithm problem can be broken in polynomial time using Shor algorithm. NIST has been conducting a PQC(Post Quantum Cryptography) standardization process to select quantum-resistant public key cryptography. The multivariate quadratic based signature scheme, which is one of the PQC candidates, is suitable for IoT devices with limited resources due to its short signature and fast sign and verify process. We analyzes classic attacks and quantum attacks for Rainbow which is the only multivatiate quadratic based signature scheme to be finalized up to the round 3. Also we compute the attack complexity for the round 3 Rainbow parameters, and analyzes the security level of Rainbow, one of the PQC standardization candidates.

• School Mathematics
• /
• v.12 no.1
• /
• pp.27-43
• /
• 2010

In this article the conceptual meaning of expression, equation and identity used in Korean mathematics textbooks and American mathematics textbooks is compared and discussed. For this purpose definitions and examples in several mathematics textbooks which are used in Korean elementary school, the 1st grade of middle school and American middle school are investigated. It is founded out that at first there are some parts that give rise to misunderstanding and then there are differences between the Korean terminologies and their corresponding English counterparts. The definitions of expression, equation and identity are advised to examine in the view of middle mathematics curriculum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.7 no.1
• /
• pp.25-28
• /
• 1982

A method for finding the symbolic reliability expressision of a conbinational logic circuit is presented. The evaluation of the probabilities of the outputs can be symbolically evaluated by the Boolean operation named sharp operation, provided that every input of such a circuit can be treated as random variables with values set(0, 1) and the output of a circuit can be represented by a Boolean sum of produt expression.