• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.959-970
• /
• 1994

In this thesis, a printed score is read by using handy scanner and the recognition process is excuted in parallel, finally, on Mesh-Connected Computer. What is read is classified into certain patterns and is recognized, based on knowledge. The preprocessing steps are minimized and simple operations are used in the algorithm proposed in this thesis. The score symbols on a printed score can be recognized irrespective of their sizes but their diversity males it difficult to recognize them all, so it is programmed so as to recognize some symbols that is used necessarily and frequently. The recognized result is transformed into the MIDI standard file format. It is required to use a parallel processing system with multiprocessors because the high speed image processing is required. A digitized two-dimensional image is appropriate in processing on the SIMD Mesh-Connected Computer(MCC). Therefore, we explain this architecture and present parallel algorithm using SIMD MCC with n processors that achieves time complexity0(n).

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• School Mathematics
• /
• v.13 no.4
• /
• pp.581-598
• /
• 2011

Given the growing agreement that algebra should be taught in the early stage of the curriculum, considerable studies have been conducted with regard to early algebra in the elementary school. However, there has been lack of research on how to organize mathematic lessons to develop of algebraic reasoning ability of the elementary school students. This research attempted to gain specific and practical information on effective algebraic teaching and learning in the elementary school. An exploratory qualitative case study was conducted to the fourth graders. This paper focused on the associative law of the multiplication. This paper showed what kinds of activities a teacher may organize following three steps: (a) focus on the properties of numbers and operations in specific situations, (b) discovery of the properties of numbers and operations with many examples, and (c) generalization of the properties of numbers and operations in arbitrary situations. Given the steps, this paper included an analysis on how the students developed their algebraic reasoning. This study provides implications on the important factors that lead to the development of algebraic reasoning ability for elementary students.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.11
• /
• pp.810-820
• /
• 2001

Conventional binary adder requires a carry propagation to the most significant bit, and leads to serial addition. However, optical adder using a modified signed digit(MSD) number system has been Proposed to reduce the carry propagation chain encountered in binary adder. In this paper, in order to minimize the number of symbolic substitution(SS) rules, nine input patterns were divided into five groups of the same addition results. For recognizing the input reference patterns, serial connections of joint spatial encoded patterns and masks without any other spatial operations are used.

• Computational Structural Engineering
• /
• v.5 no.3
• /
• pp.52-55
• /
• 1992

이 글에서는 Mathematica의 고유한 특징과 많은 기능 중의 일부분만을 예를 들어 설명을 하였다. 그러나 Mathematica의 피할 수 없는 단점은 많은 수학적 기능이 포함되어 있기 때문에 처리속도가 늦다는 점이다. 예를 들면 많은 량의 반복작업이나 차수가 큰 매트릭스의 연산작업은 다소 속도가 늦어 PC기종에서는 곤란을 겪을 때가 많다. 따라서 PC대신 workstation 같은 상위기종의 컴퓨터를 이용한다면 처리속도가 빨라져 진행에 문제점이 없다. 한 예로 workstation에서는 차수가 30개인 고유치 해석도 내장함수인 명령어만으로 단지 몇초만에 할 수 있는 데 비하여 PC에서는 기종에 따라 몇배, 몇백배의 시간이 요구되는 것이다. 그리고 또 하나의 단점으로는 방대한 프로그램을 운용하기 위한 비용(ram)이 많이 든다는 점이다. 한 예로 PC에서는 기본적으로 Mathematica를 작동하기 위해 최소한 4 mega ram이 필요하며 여러 수학적 기능을 충분히 이용하기 위해 많은 량의 ram이 필요하다는 점이다. 그러나 위의 단점은 Mathematica가 지니고 있는 고유한 장점을 생각한다면 매우 미미한 것이라 여겨진다. 수학의 대부분의 기능을 포함하고 있으며 기호처리가 가능하고 프로그래밍 기법이 다양하기 때문에 수학을 이용하여 연구를 하는 사람에게는 훌륭한 도구가 생긴 것이라 할 수 있다.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.53-56
• /
• 2006

Genetic algorithms(GA), which are based on the idea of natural selection and natural genetics, have proven successful in solving difficult problems that are not easily solved through conventional methods. The classical GA has the problem to spend much time when population is large. Parallel genetic algorithm(PGA) is an extension of the classical GA. The important aspect in PGA is migration and GA operation. This paper presents PGAs that use fuzzy logic. Experimental results show that the proposed methods exhibit good performance compared to the classical method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.165-168
• /
• 2004

본 연구에서는 근골격계로 구성된 신체 역학계와 신경 진동자로 구성된 신경계의 상호작용에 의해서 자율적인 2족 보행운동 생성하려고 하고 있다. 이를 위해서는 역학계와 신경계의 않은 파라메트(Parameter)의 조절이 필요하다 본 연구에서는 유전적 프로그래밍(GP)을 이용하여 파라메트의 자동조절 수법을 제안하였다. GP는 문제를 해결하기 위한 계산 프로그래밍을 탐색하는 진화형 탐색 알고리즘으로, GP를 이용해서 문제해결을 행하기 위해서는 노드의 선택이 매우 중요하다. 그러나 대상문제에 대한 충분한 정보가 없는 경우에는 노드를 용장성 있게 설계하게 되어, 이로 인한 탐색공간의 확장으로 GP에 대한 탐색성능의 저하를 초래한다. 본 논문에서는 이러한 문제를 해결하기 위해서 용장성 노드 집합으로부터 유용한 노드를 획득하기 위해 제안한 수법을 2족 보행운동 생성 시스템에 적용하기 전에 사전 평가로서 기호회귀(Symbolic Regression)문제에 적용하여 실험을 통해 제안 수법의 타당성과 탐색성능 향상의 효과에 관해서 논하고자 한다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.12
• /
• pp.1433-1441
• /
• 2009

In multibody dynamic analysis, one of the most important problems is to reduce computation times for real-time simulation. This paper presents the derivation procedure of equations of motion of a 6${\times}$6 autonomous vehicle in terms of chassis local coordinates which do not require coordinates transformation matrix to enhance efficiency for real-time dynamic analysis. Also, equations of motion are derived using the VT(velocity transformation) technique and symbolic computation method coded by MATLAB. The Jacobian matrix of the equations of motion of a system is derived from symbolic operations to apply the implicit integration method. The analysis results were compared with ADAMS results to verify the accuracy and approve the feasibility of real time analysis.

• Communications of Mathematical Education
• /
• v.12
• /
• pp.211-232
• /
• 2001

수학 교수-학습에서 기호 연산 조작이 가능한 수학 응용소프트웨어인 Maple을 활용한 지도 방안을 모색해 보고자 한다. Maple의 내장함수를 단순히 이용하는 것보다 모듈을 사용하여 학습자가 학습내용에 능동적으로 단계적인 풀이과정과 수학적 개념을 찾아갈 수 있도록 하였다. 이를 위해 Maple Procedure를 사용하여Package를 생성하고, 이를 Cell sheet에 적용시켜, 이차곡선에 대한 일반화된 개념 확립과 교사 - 매체 - 학생간의 원활한 상호작용으로 학생들의 문제해결력 향상에 도움이 될 수 있는 교수-학습 모형을 탐색해 보고자 한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.13 no.6
• /
• pp.20-23
• /
• 1976

A boolean algebra method for computing the reliability in a communication network is prosented. Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by the Boolean operation which is named parallel operation. The method seems to be promising for both oriented and nonoriented network.