• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.236-239
• /
• 1999

This paper describes a low-power design of decimation filter. To reduce power consumption, an approximate processing method which controls the error in canonic signed digit(CSD) coefficients is proposed. The CSD representation reduces the number of operations by representing multiplications with add and shift operations. The proposed method further reduces the number of operations by controlling the error of CSD coefficient. Processor type architecture is used to implement the proposed method. Simulation result shows that the number of operations is reduced to 56%, 35% and 10% at each approximated filter level.

• The Mathematical Education
• /
• v.45 no.1 s.112
• /
• pp.61-74
• /
• 2006

The ability of understanding the number and number systems, grasping the properties of number systems, and manipulating number systems is the foundation to understand algebra. It is useful to deepen students' mathematical understanding of number systems and operations. The authentic understanding of numbers and operations can make it possible for the students to manipulate algebraic symbols, to represent relationship among sets of numbers, and to use variables to investigate the properties of sets of numbers. The high school students need to understand the number systems from more abstract perspective. The purpose of this study is to study on understanding and application ability of eleventh graders of basic properties of operations with real numbers.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.225-228
• /
• 2004

This paper presents a hybrid decimal division algorithm to improve division speed. In a binary number system, non-restoring algorithm has a smaller number of operations than restoring algorithm. In decimal number system, however, the number of operations differs with respect to quotient values. Since one digit ranges 0 to 9 in decimal, the proposed hybrid algorithm employ either non-restoring or restoring algorithm on each digit to reduce iterative operations. The selection of the algorithm is based on the remainder values. The proposed algorithm improves computation speed substantially over conventional algorithms by decreasing the number of operations.

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

In the teacher's guide of mathematics textbook for the 1st grade of the middle school, the clear and logical reason why the multiplication of negative number to negative number makes positive number, and $a^{-m}$ with a>0 and m>0, is defined by ${\frac{1}{a^m}}$ is not given. When we define the multiplication or the power by successive addition or successive multiplication of the same number, respectively, we encounter this ambiguity, in the case that the number of successive operations is negative, In this paper, we name this number, negative counting number, and we make the following more logical and intuitive definition, which is "negatively many successive operations is defined by positively many successive inverse operations." According to this new definition, we define the multiplication by the successive addition or the successive subtraction of the same number, when the multiplier is positive or negative respectively, and the power by the successive multiplication or the power is positive or negative, respectively. In addition, using this new definition and following the E.R.S Instruction strategy which revised and complemented the Bruner's E.I.S Instruction strategy, we develope new teaching model available in the 1st grade class of middle school where the concept of integers, three operations of integers are introduced.ntroduced.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.53-60
• /
• 2012

Attribute-based encryption (ABE) is an encryption scheme in which the user is able to decrypt a ciphertext with associated attributes. However, the scheme does not offer the capability of decryption to others when the user is offline. For this reason, the attribute-based proxy re-encryption (ABPRE) scheme was proposed, which combines traditional proxy re-encryption with ABE, so a user is able to empower designated users to decrypt the re-encrypted ciphertext with the associated attributes of designated users. However, previous ABPRE schemes demands a number of pairing operations that imply huge computational overhead. To reduce the number of pairing operations, we reduce the pairing operations with exponent operations. This paper provides a novel approach to an ABPRE scheme with constant pairing operation latency.

• Journal of Digital Contents Society
• /
• v.8 no.2
• /
• pp.235-243
• /
• 2007

Students develop mathematical concepts through concrete operations in the area of mathematics. However, most of the learning contents provided on the web are not interactive and limit interactions with learners. To overcome the limitations, there have been needs to develop learning contents to support active interactions with students according to their cognitive levels. In this study, the curriculum of numbers and number operations in elementary mathematics was analyzed. Based on the object-oriented design principle, "Number Classes" on numbers and number operations were designed and implemented. A class-based learning applet was developed with theses "Number Classes". It was developed in small unit programs based on learning themes of mathematics in elementary schools. With this learning applet, the active explorations through easy operations will help students to learn concepts and principles of numbers and number operations. It will strengthen active interactions of students with computer.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.266-273
• /
• 2016

Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location of hole and tool sequence to be followed. It is necessary to find the optimal sequence of operations which minimizes the total processing cost of hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.473-476
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location.

• Communications of the Korean Mathematical Society
• /
• v.28 no.3
• /
• pp.635-642
• /
• 2013

There are many results on the extended operations of two fuzzy numbers based on the Zadeh's extension principle. For the calculation, we have to use existing operations between two ${\alpha}$-cuts. In this paper, we define parametric operations between two ${\alpha}$-cuts which are different from the existing operations. But we have the same results as the extended operations of Zadeh's principle.

• Journal of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1239-1260
• /
• 2021

We study the set of star operations on local Noetherian domains D of dimension 1 such that the conductor (D : T) (where T is the integral closure of D) is equal to the maximal ideal of D. We reduce this problem to the study of a class of closure operations (more precisely, multiplicative operations) in a finite extension k ⊆ B, where k is a field, and then we study how the cardinality of this set of closures vary as the size of k varies while the structure of B remains fixed.