• Title/Summary/Keyword: Division Algorithm

Search Result 3,039, Processing Time 0.026 seconds

An Analysis on Elementary Pre-Service Teachers' Word Problems and Problem Solving Methods in Fraction Division (초등 예비교사들이 제시한 분수 나눗셈 문장제와 해결 방법 분석)

  • Lee, Daehyun
    • Journal of Science Education
    • /
    • v.46 no.1
    • /
    • pp.109-120
    • /
    • 2022
  • Fraction division is the content that is important but difficult to learn because it includes the process of finding a numerical expression in the real-world context, the process of making a context that matches a numerical expression, how to solve division, and the justification of standard algorithm. This study analyzes the word problems and problem solving methods about fraction division which elementary pre-service teachers represented. Pre-service teachers have more difficulty in making word problem where the dividend is less than the divisor and they also show typical errors in making the word problems. There were differences in the methods presented according to the contexts of division in problem solving. Through this study, it is necessary to rethink the teaching methods for fraction division instruction in the curriculum for pre-service teachers and analyze the formation process of 'knowledge for content and teaching' because of the differences in responses between grades.

Data mining Algorithms for the Development of Sasang Type Diagnosis (사상체질 진단검사를 위한 데이터마이닝 알고리즘 연구)

  • Hong, Jin-Woo;Kim, Young-In;Park, So-Jung;Kim, Byoung-Chul;Eom, Il-Kyu;Hwang, Min-Woo;Shin, Sang-Woo;Kim, Byung-Joo;Kwon, Young-Kyu;Chae, Han
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.6
    • /
    • pp.1234-1240
    • /
    • 2009
  • This study was to compare the effectiveness and validity of various data-mining algorithm for Sasang type diagnostic test. We compared the sensitivity and specificity index of nine attribute selection and eleven class classification algorithms with 31 data-set characterizing Sasang typology and 10-fold validation methods installed in Waikato Environment Knowledge Analysis (WEKA). The highest classification validity score can be acquired as follows; 69.9 as Percentage Correctly Predicted index with Naive Bayes Classifier, 80 as sensitivity index with LWL/Tae-Eum type, 93.5 as specificity index with Naive Bayes Classifier/So-Eum type. The classification algorithm with highest PCP index of 69.62 after attribute selection was Naive Bayes Classifier. In this study we can find that the best-fit algorithm for traditional medicine is case sensitive and that characteristics of clinical circumstances, and data-mining algorithms and study purpose should be considered to get the highest validity even with the well defined data sets. It is also confirmed that we can't find one-fits-all algorithm and there should be many studies with trials and errors. This study will serve as a pivotal foundation for the development of medical instruments for Pattern Identification and Sasang type diagnosis on the basis of traditional Korean Medicine.

A Computer-Aided Inspection Planning System for On-Machine Measurement - Part II : Local Inspection Planning -

  • Cho, Myeong-Woo;Lee, Hong-Hee;Yoon, Gil-Sang;Choi, Jin-Hwa
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.8
    • /
    • pp.1358-1367
    • /
    • 2004
  • As a part II of theis research, new local inspection planning strategy is proposed in this paper based on the proposed inspection feature extraction method. In the local inspection planning stage, each feature is decomposed into its constituent geometric elements for more effective inspection planning. The local inspection planning for the decomposed features are performed to determine: (1) the suitable number of measuring points, (2) their locations, and (3) the optimum probing paths to minimize measuring errors and times. The fuzzy set theory, the Hammersley's algorithm and the TSP method are applied for the local inspection planning. Also, a new collision checking algorithm is proposed for the probe and/or probe holder based on the Z-map concept. Finally, the results are simulated and analyzed to verify the effectiveness of the proposed methods.

Development of the Algorithm for Strapdown Inertial Navigation System for Short Range Navigation

  • Lee, Sang-Jong;Naumenko, C.;Bograd, V.;Kim, Jong-Chul
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.1 no.1
    • /
    • pp.81-91
    • /
    • 2000
  • The mechanization of navigation equation is depending on the designer according to the orientation vector relating the body frame to a chosen to inertial and navigation frames for its purposes. This paper considers the appropriate Earth Fixed frame for short range vehicle and develops a mechanization and algorithm for Strapdown Inertial Navigation System(SDINS). This mechanization consists of two parts : translational mechanization and rotational mechanization{attitude determination). The accuracy, availability and performance of this SDINS mechanization are verified on the simulation and the numerical method for integration attitude propagation is compared with a well-known method in a precession motion.

  • PDF

Developments of a Path Planning Algorithm for Unmanned Vehicle (무인차량을 위한 경로계획 알고리즘 개발)

  • Cho, Kyoung-Hwan;Ahn, Dong-Jun;Kim, Gun-Sik;Kim, Yong-Il
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.14 no.2
    • /
    • pp.53-57
    • /
    • 2011
  • Military and commercial unmanned vehicle navigation systems are being actively studied in the field of robotics. In this study, GPS-based path generation algorithm Film Festival and the system can compensate for the shortcomings of applying a map-based path plan, the unmanned vehicle navigation systems to improve the performance of path planning algorithms are introduced.

NON-CONVEX HYBRID ALGORITHMS FOR A FAMILY OF COUNTABLE QUASI-LIPSCHITZ MAPPINGS CORRESPONDING TO KHAN ITERATIVE PROCESS AND APPLICATIONS

  • NAZEER, WAQAS;MUNIR, MOBEEN;NIZAMI, ABDUL RAUF;KAUSAR, SAMINA;KANG, SHIN MIN
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.3_4
    • /
    • pp.313-321
    • /
    • 2017
  • In this note we establish a new non-convex hybrid iteration algorithm corresponding to Khan iterative process [4] and prove strong convergence theorems of common fixed points for a uniformly closed asymptotically family of countable quasi-Lipschitz mappings in Hilbert spaces. Moreover, the main results are applied to get the common fixed points of finite family of quasi-asymptotically nonexpansive mappings. The results presented in this article are interesting extensions of some current results.

Field Test Results of CDGPS Precision Positioning Using Single Frequency, CA Code GPS Receivers (단일주파수 CA코드 GPS 수신기를 이용한 CDGPS 정밀측위실험)

  • Won, Jong-Hoon;Ko, Sun-Jun;Park, Heun-Jun;Lee, Ja-Sung
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2436-2438
    • /
    • 2000
  • In this paper, field test results of a new efficient integer ambiguity resolution algorithm for precision Carrier Differential GPS(CDGPS) positioning are presented. The new algorithm is based on a reconfiguration Kalman filter which is designed to be used for the real-time precise positioning with low cost, single frequency, conventional C/A code GPS receivers. The tests were performed both in static and kinematic environment

  • PDF

Recognition of the Passport by Using Self-Generating Supervised Learning Algorithm (자가 생성 지도 학습 알고리즘을 이용한 여권 인식)

  • Kim, Kyoung-Hwa;Jung, Sung-Ye;Nam, Mi-Young;Kim, Kwang-Baek
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.10a
    • /
    • pp.567-570
    • /
    • 2001
  • 현재의 출입국 관리자는 여권을 제시하면 여권을 육안으로 검색하고 수작업으로 정보를 입력하여 여권 데이터베이스와 대비하는 것이다. 본 논문에서는 이러한 문제점을 해결하기 위하여 자동으로 여권을 인식할 수 있는 방법을 제안한다. 여권에는 사용자에 대한 많은 정보들이 있는데 여권 영상에서 코드 정보 영역을 히스토그램 방식과 소벨 연산자를 이용하여 코드 영역 및 개별 코드 문자를 추출하고 새로운 자가 생성 지도학습 알고리즘(Self-Generating Supervised Learning Algorithm)을 제안하여 여권 인식에 적응하였다. 10개의 여권 영상을 실험한 결과 모든 코드의 문자 영역이 추출되었고 인식되었다.

  • PDF

Selecting the Number and Location of Knots for Presenting Densities

  • Ahn, JeongYong;Moon, Gill Sung;Han, Kyung Soo;Han, Beom Soo
    • Communications for Statistical Applications and Methods
    • /
    • v.11 no.3
    • /
    • pp.609-617
    • /
    • 2004
  • To present graph of probability densities, many softwares and graphical tools use methods that link points or straight lines. However, the methods can't display exactly and smoothly the graph and are not efficient from the viewpoint of process time. One method to overcome these shortcomings is utilizing interpolation methods. In these methods, selecting the number and location of knots is an important factor. This article proposes an algorithm to select knots for graphically presenting densities and implements graph components based on the algorithm.