• Title/Summary/Keyword: algorithmic

Search Result 373, Processing Time 0.028 seconds

Grapheme-based on-line recognition of cursive korean characters (자소 단위의 온라인 흘림체 한글 인식)

  • 정기철;김상균;이종국;김행준
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.9
    • /
    • pp.124-134
    • /
    • 1996
  • Korean has a large set of characters, and has a two-dimensional formation: each character is composed of graphemes in two dimensions. Whereas connections between characters are rare, connections inside a grapheme and between graphemes happen frequently and these connections generate many cursive strokes. To deal with the large character set and the cursive strokes, using the graphemes as a recognition unit is an efffective approach, because it naturally accommodates the structural characteristics of the characters. In this paper, we propose a grapheme-based on-line recognition method for cursive korean characters. Our method uses a TDNN recognition engine to segment cursive strokes into graphemes and a graph-algorithmic postprocessor based on korean grapheme composition rule and viterbi search algorithm to find the best recognition score path. We experimented the method on freely hand-written charactes and obtained a recognition rate of 94.5%.

  • PDF

An Introduction to the Edumatrix Set and Its Didactic Capabilities

  • Semenov, Mikhail;Colen, Yong S.;Colen, Jung;Pardala, Antony
    • Research in Mathematical Education
    • /
    • v.23 no.1
    • /
    • pp.47-62
    • /
    • 2020
  • Learning through "recreational mathematics" has become a meaningful outlet to children of all ages. The Edumatrix set is a didactic tool for the development of logical and abstract reasoning among students. In this paper, we provide several illustrative exercises involving Edumatrix that teachers can utilize in their classrooms. We formulate students' expected learning outcomes by aligning each exercise to the CCSSM content standards as well as examining which Standards for Mathematical Practices (SMP) our proposed exercises promote.

Computations of the Lyapunov exponents from time series

  • Kim, Dong-Seok;Park, Eun-Young
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.3
    • /
    • pp.595-604
    • /
    • 2012
  • In this article, we consider chaotic behavior happened in nonsmooth dynamical systems. To quantify such a behavior, a computation of Lyapunov exponents for chaotic orbits of a given nonsmooth dynamical system is focused. The Lyapunov exponent is a very important concept in chaotic theory, because this quantity measures the sensitive dependence on initial conditions in dynamical systems. Therefore, Lyapunov exponents can decide whether an orbit is chaos or not. To measure the sensitive dependence on initial conditions for nonsmooth dynamical systems, the calculation of Lyapunov exponent plays a key role, but in a theoretical point of view or based on the definition of Lyapunov exponents, Lyapunov exponents of nonsmooth orbit could not be calculated easily, because the Jacobian derivative at some point in the orbit may not exists. We use an algorithmic calculation method for computing Lyapunov exponents using time series for a two dimensional piecewise smooth dynamic system.

Implementation of the modified compression field theory in a tangent stiffness-based finite element formulation

  • Aquino, Wilkins;Erdem, Ibrahim
    • Steel and Composite Structures
    • /
    • v.7 no.4
    • /
    • pp.263-278
    • /
    • 2007
  • A finite element implementation of the modified compression field theory (MCFT) using a tangential formulation is presented in this work. Previous work reported on implementations of MCFT has concentrated mainly on secant formulations. This work describes details of the implementation of a modular algorithmic structure of a reinforced concrete constitutive model in nonlinear finite element schemes that use a Jacobian matrix in the solution of the nonlinear system of algebraic equations. The implementation was verified and validated using experimental and analytical data reported in the literature. The developed algorithm, which converges accurately and quickly, can be easily implemented in any finite element code.

An Algorithmic Study on Free-gyro Positioning System( I ) - Measuring Nadir Angle by using the Motion Rate of a Spin Axis -

  • Jeong, Tae-Gweon;Park, Sok-Chu
    • Journal of Navigation and Port Research
    • /
    • v.31 no.9
    • /
    • pp.751-757
    • /
    • 2007
  • The authors aim to establish the theory necessary for developing free gyro positioning system and focus on measuring the nadir angle by using the motion rate of a free gyro. The azimuth of a gyro vector from the North can be given by using the property of the free gyro. The motion rate of the spin axis in the gyro frame is transformed into the platform frame and again into the NED (north-east-down) navigation frame. The nadir angle of a gyro vector is obtained by using the North components of the motion rate of the spin axis in the NED frame. The component has to be transformed into the horizontal component of the gyro by using the azimuth of the gyro vector and then has to be integrated over the sampling interval.

A Study on the Errors in the Free-Gyro Positioning and Directional System (자유자이로 위치 및 방위시스템의 오차에 관한 연구)

  • Jeong, Tae-Gweon
    • Journal of Navigation and Port Research
    • /
    • v.37 no.4
    • /
    • pp.329-335
    • /
    • 2013
  • This paper is to develop the position error equations including the attitude errors, the errors of nadir and ship's heading, and the errors of ship's position in the free-gyro positioning and directional system. In doing so, the determination of ship's position by two free gyro vectors was discussed and the algorithmic design of the free-gyro positioning and directional system was introduced briefly. Next, the errors of transformation matrices of the gyro and body frames, i.e. attitude errors, were examined and the attitude equations were also derived. The perturbations of the errors of the nadir angle including ship's heading were investigated in each stage from the sensor of rate of motion of the spin axis to the nadir angle obtained. Finally, the perturbation error equations of ship's position used the nadir angles were derived in the form of a linear error model and the concept of FDOP was also suggested by using covariance of position error.

Robust Quick String Matching Algorithm for Network Security (네트워크 보안을 위한 강력한 문자열 매칭 알고리즘)

  • Lee, Jong Woock;Park, Chan Kil
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.4
    • /
    • pp.135-141
    • /
    • 2013
  • String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

A Survey on the Application of Expert System and Artificial Intelligence in Production Planning (전문가 시스템 및 인공지능을 이용한 생산관리를 위한 기초조사)

  • Hong, Yu-Shin;Seong, Deok-Hyun;Park, Kee-Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.16 no.1
    • /
    • pp.123-135
    • /
    • 1990
  • An extensive survey is carried out on the applications of AI (Artificial Intelligence) and ES (Expert System) in mathematical programming and simulation, which are the most frequently used tools in production planning. A scheduling field is also reviewed. The scheduling problem is one of the most attractive area for AI and ES researchers, since any practical algorithmic solution methods are not available. The current practice and difficulty of applying AI and ES to production planning are discussed and future research directions are identified.

  • PDF

Geometric Fitting of Parametric Curves and Surfaces

  • Ahn, Sung-Joon
    • Journal of Information Processing Systems
    • /
    • v.4 no.4
    • /
    • pp.153-158
    • /
    • 2008
  • This paper deals with the geometric fitting algorithms for parametric curves and surfaces in 2-D/3-D space, which estimate the curve/surface parameters by minimizing the square sum of the shortest distances between the curve/surface and the given points. We identify three algorithmic approaches for solving the nonlinear problem of geometric fitting. As their general implementation we describe a new algorithm for geometric fitting of parametric curves and surfaces. The curve/surface parameters are estimated in terms of form, position, and rotation parameters. We test and evaluate the performances of the algorithms with fitting examples.

3D PROCESSING OF HIGH-RESOLUTION SATELLITE IMAGES

  • Gruen, Armin;Li, Zhang
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.24-27
    • /
    • 2003
  • High-resolution satellite images at sub-5m footprint are becoming increasingly available to the earth observation community and their respective clients. The related cameras are all using linear array CCD technology for image sensing. The possibility and need for accurate 3D object reconstruction requires a sophisticated camera model, being able to deal with such sensor geometry. We have recently developed a full suite of new methods and software for the precision processing of this kind of data. The software can accommodate images from IKONOS, QuickBird, ALOS PRISM, SPOT5 HRS and sensors of similar type to be expected in the future. We will report about the status of the software, the functionality and some new algorithmic approaches in support of the processing concept. The functionality will be verified by results from various pilot projects. We put particular emphasis on the automatic generation of DSMs, which can be done at sub-pixel accuracy and on the semi-automated generation of city models.

  • PDF