• Title/Summary/Keyword: arithmetic rule

Search Result 17, Processing Time 0.024 seconds

A Study on the Understanding and Instructional Methods of Arithmetic Rules for Elementary School Students (초등학생의 연산법칙 이해 수준과 학습 방안 연구)

  • Kim, Pan Soo
    • East Asian mathematical journal
    • /
    • v.38 no.2
    • /
    • pp.257-275
    • /
    • 2022
  • Recently, there are studies the argument that arithmetic rules established by the four fundamental arithmetic operations, in other words, commutative laws, associative laws, distributive laws, should be explicitly described in mathematics textbooks and the curriculum. These rules are currently implicitly presented or omitted from textbooks, but they contain important principles that foster mathematical thinking. This study aims to evaluate the current level of understanding of these computation rules and provide implications for the curriculum and textbook writing. To this end, the correct answer ratio of the five arithmetic rules for 1-4 grades 398 in five elementary schools was investigated and the type of error was analyzed and presented, and the subject to learn these rules and the points to be noted in teaching and learning were also presented. These results will help to clarify the achievement criteria and learning contents of the calculation rules, which were implicitly presented in existing national textbooks, in a new 2022 revised curriculum.

The Excess and Deficit Rule in the second volume of San Hak Jeong Ui (산학정의 중편에 나타난 조선시대 영부족술에 대한 고찰)

  • Cho, Jin Hyub;Nam, Young Man
    • East Asian mathematical journal
    • /
    • v.29 no.2
    • /
    • pp.241-254
    • /
    • 2013
  • In this paper, we investigate the contents of Rule of Excess and Deficit in the second volume of San Hak Jeong Ui (Arithmetic Definition) compiled by Nam Byong Kil and corrcted by Lee Sang Hyok in the Choson Dynasty period.(Emperor Ko Jong, 1867).

Image Sharpening based on Cellular Automata with the Local Transition Rule (국소 천이규칙을 갖는 셀룰러 오토마타를 이용한 영상 첨예화)

  • Lee, Seok-Ki
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.502-504
    • /
    • 2010
  • We propose novel transition rule of cellular automata for image enhancement and sharpening algorithm using it. Transition rule present sequential and parallel behavior. it also satisfy Lyapunov function. This image sharpening was developed and experimented by using a dynamic feature of convergence to fixed points. We can obtain efficiently sharpened image by performing arithmetic operation at the gradual parts of difference of brightness without image information.

Fast Fuzzy Inference Algorithm for Fuzzy System constructed with Triangular Membership Functions (삼각형 소속함수로 구성된 퍼지시스템의 고속 퍼지추론 알고리즘)

  • Yoo, Byung-Kook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.7-13
    • /
    • 2002
  • Almost applications using fuzzy theory are based on the fuzzy inference. However fuzzy inference needs much time in calculation process for the fuzzy system with many input variables or many fuzzy labels defined on each variable. Inference time is dependent on the number of arithmetic Product in computation Process. Especially, the inference time is a primary constraint to fuzzy control applications using microprocessor or PC-based controller. In this paper, a simple fast fuzzy inference algorithm(FFIA), without loss of information, was proposed to reduce the inference time based on the fuzzy system with triangular membership functions in antecedent part of fuzzy rule. The proposed algorithm was induced by using partition of input state space and simple geometrical analysis. By using this scheme, we can take the same effect of the fuzzy rule reduction.

음성인식용 DTW PE의 IC화를 위한 ADD 및 ABS 회로의 설계

  • 정광재;문홍진;최규훈;김종교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.8
    • /
    • pp.648-658
    • /
    • 1990
  • There are many methods for speed up counting in speech recongition. A multiple processing method is the one way to achieve the aim using systolic array. This arithmetic operation by the array is achieved pipelining skill. And the operation is multiprocessing by processing element(PE) that is incresing counting efficiencies. The DTW PE cell is seperated into three large blocks. "MIN" is the one block for counting accumulated minimum distance, "ADD" block calculated these minimum distances, and "ABS" seeks for the absolut values to the total sum of local distances. We have accomplished circuit design and verification about the "ADD" and "ABS" blocks, and performed total layout '||'&'||' DRC(design rule check) using 3um CMOS N-Well rule base.le check) using 3$\mu$m CMOS N-Well rule base.

  • PDF

COMPOUNDED METHOD FOR LAND COVERING CLASSIFICATION BASED ON MULTI-RESOLUTION SATELLITE DATA

  • HE WENJU;QIN HUA;SUN WEIDONG
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.116-119
    • /
    • 2005
  • As to the synthetical estimation of land covering parameters or the compounded land covering classification for multi-resolution satellite data, former researches mainly adopted linear or nonlinear regression models to describe the regression relationship of land covering parameters caused by the degradation of spatial resolution, in order to improve the retrieval accuracy of global land covering parameters based on 1;he lower resolution satellite data. However, these methods can't authentically represent the complementary characteristics of spatial resolutions among different satellite data at arithmetic level. To resolve the problem above, a new compounded land covering classification method at arithmetic level for multi-resolution satellite data is proposed in this .paper. Firstly, on the basis of unsupervised clustering analysis of the higher resolution satellite data, the likelihood distribution scatterplot of each cover type is obtained according to multiple-to-single spatial correspondence between the higher and lower resolution satellite data in some local test regions, then Parzen window approach is adopted to derive the real likelihood functions from the scatterplots, and finally the likelihood functions are extended from the local test regions to the full covering area of the lower resolution satellite data and the global covering area of the lower resolution satellite is classified under the maximum likelihood rule. Some experimental results indicate that this proposed compounded method can improve the classification accuracy of large-scale lower resolution satellite data with the support of some local-area higher resolution satellite data.

  • PDF

Rule Discovery for Cancer Classification using Genetic Programming based on Arithmetic Operators (산술 연산자 기반 유전자 프로그래밍을 이용한 암 분류 규칙 발견)

  • 홍진혁;조성배
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.8
    • /
    • pp.999-1009
    • /
    • 2004
  • As a new approach to the diagnosis of cancers, bioinformatics attracts great interest these days. Machine teaming techniques have produced valuable results, but the field of medicine requires not only highly accurate classifiers but also the effective analysis and interpretation of them. Since gene expression data in bioinformatics consist of tens of thousands of features, it is nearly impossible to represent their relations directly. In this paper, we propose a method composed of a feature selection method and genetic programming. Rank-based feature selection is adopted to select useful features and genetic programming based arithmetic operators is used to generate classification rules with features selected. Experimental results on Lymphoma cancer dataset, in which the proposed method obtained 96.6% test accuracy as well as useful classification rules, have shown the validity of the proposed method.

ON LEARNING OF CNAC FOR MANIPULATOR CONTROL

  • Hwang, Heon;Choi, Dong-Y.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.653-662
    • /
    • 1989
  • Cerebellar Model Arithmetic Controller (CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d.o.f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process. A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

  • PDF

ON LEARNING OF CMAC FOR MANIPULATOR CONTROL

  • Choe, Dong-Yeop;Hwang, Hyeon
    • 한국기계연구소 소보
    • /
    • s.19
    • /
    • pp.93-115
    • /
    • 1989
  • Cerebellar Model Arithmetic Controller(CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d. o. f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process; A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

  • PDF

A Fuzzy Microprocessor for Real-time Control Applications

  • Katashiro, Takeshi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1394-1397
    • /
    • 1993
  • A Fuzzy Microprocessor(FMP) is presented, which is suitable for real-time control applications. The features include high speed inference of maximum 114K FLIPS at 20MHz system clocks, capability of up to 128-rule construction, and handing of 8 input variables with 8-bit resolution. In order to realize these features, the fuzzifier circuit and the processing element(PE) are well optimized for LSI implementation. The chip fabricated in 1.2$\mu\textrm{m}$ CMOS technology contains 71K transistors in 82.8 $\textrm{mm}^2$ die size and is packaged in 100-pin plastic QFP.

  • PDF