• Title/Summary/Keyword: Traversing

Search Result 180, Processing Time 0.024 seconds

On-line Recognition of Chinese Characters Based on ART-l Neural Network (ART-1 신경망을 이용한 온라인 한자 인식)

  • 김상균;정종화;김진욱;김행준
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.2
    • /
    • pp.168-177
    • /
    • 1996
  • In this paper, we propose an on-line recognition system of chinese characters using an adaptive resonance theory-1(ART-1) neural network. Strokes, primitive components of chinese characters are usually warped into a cursive form and classifying them is very difficult. To deal with such cursive strokes, we use an ART-1 neural network that has the following advantages: (1) it automatically assembles similar patterns together to form classes in a self-organized manner: (2) it directly accesses the recognition codes corresponding to binary input patterns after self-stabilizing; (3) it doesn't tends to get trapped in local minima, or globally incorrect solutions. A database for character recognition also dynamically constructed with generalized character lists, and a new character can be included simply by adding a new sequence to the list. Character recognition is achieved by traversing the chinese datbase with a sequence of recognized strokes and positional relations between the strokes. To verify the performance of the system. We tested it for 1800 daily-used basic chinese second per character. This results suggest that the proposed system is pertinent to be put into practical use.

  • PDF

Characteristics of Distribution and Potential Route of Contaminants at Waste Disposal Site (폐기물매립지 주변의 오염물질 분포 및 이동 특성)

  • 박성원;황세호;이평구;박인화;신성천;이상규
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2001.04a
    • /
    • pp.144-148
    • /
    • 2001
  • A geophysical and geochemical study was performed to verify the depth of landfill as well as the horizontal/vertical distribution of leachate at the landfill site located in Gongju. The electrical resistivity, with dipole-dipole array and dipole spacing of 5m, was applied along the nine survey lines and electromagnetic induction survey was conducted along the perimeter traverse surrounding the landfill. Cations, anions and stable isotope ($\delta$D and $\delta$$^{18}$ O) analyses were performed on about 63 water and leachate samples collected in dry and rainy seasons at 31 sites. The result of electromagnetic induction survey make it possible to derive the potential route of leachate in the past or present. The imaging of processed resistivity field data show that the possible route of leachate doesn't exist except the survey line 7. The weak zone traversing the landfill, however, is revealed by the electrical resistivity imaging, which may be the potential route of leachate toward the deep ground. The geochemical data agree well with geophysical data for deducing possible route of leachate of the site.

  • PDF

Improvement of Colored Thread Algorithm for Loop Prevention (루프 방지를 위한 칼라 스레드 알고리즘의 개선)

  • 김한경
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12C
    • /
    • pp.167-173
    • /
    • 2001
  • Colored thread algorithm suggested by Ohba is understood to be effective to prevent from establishing path in loop. 3 kinds of thread state, such as null, colored, transparent, defined in colored thread algorithm which makes difficult and complex to design actions of the thread events, is reconfigured and improved to a 4 states to make the finite state machines simple. The original colored thread algorithm fonds loops by receiving thread of a same color that was generated by the initiator itself and confirms the loops by hop count of unknown thread traversed again along the looped path. This method is modified as to use the same color instead of generating new colored thread for the looped path, leading to save the traversing time. And also redefined the events to make easy coupling with existing protocols.

  • PDF

Fuzzy Output-Tracking Control for Uncertain Nonlinear Systems (불확실 비선형 시스템을 위한 퍼지 출력 추종 제어)

  • Lee, Ho-Jae;Joom, Young-Hoo;Park, Jin-Ba
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.185-190
    • /
    • 2005
  • A systematic output tracking control design technique for robust control of Takagi-Sugeno (T-S) fuzzy systems with norm bounded uncertainties is developed. The uncertain T-S fuzzy system is first represented as a set of uncertain local linear systems. The tracking problem is then converted into the stabilization problem for a set of uncertain local linear systems thereby leading to a more feasible controller design procedure. A sufficient condition for robust asymptotic output tracking is derived in terms of a set of linear matrix inequalities. A stability condition on the traversing time instances is also established. The output tracking control simulation for a flexible-joint robot-arm model is demonstrated, to convincingly show the effectiveness of the proposed system modeling and controller design.

A Database Creation and Retrival Method of Feature Descriptors for Markerless Tracking (마커리스 트래킹을 위한 특징 서술자의 데이터베이스 생성 및 검색방법)

  • Yun, Yo-Seop;Kim, Tae-Young
    • Journal of Korea Game Society
    • /
    • v.11 no.3
    • /
    • pp.63-72
    • /
    • 2011
  • In this paper, we propose a novel database creation and retrieval method of feature descriptors to support real-time marker-less tracking in the augmented reality environments. Each feature descriptor is encoded by integer and multi-level database is created in order to retrieve a feature descriptor efficiently. The retrieval of a feature descriptor is performed as follows: Firstly, candidate feature descriptors are searched by traversing the multi-level database. Secondly, the euclidean distance between input feature descriptor and each candidate one is compared. The shortest one is retrieved. The proposed method is 16 ms faster than previous KD-Tree method for each feature descriptor.

A Study on the Three Dimensional Statistical Turbulent Flow Characteristics Around a Small-Sized Axial Fan for Refrigerator (냉장고용 소형 축류홴의 통계학적 3차원 난류유동 특성에 관한 연구)

  • Kim, Jang-Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.25 no.6
    • /
    • pp.819-828
    • /
    • 2001
  • The operating point of a small-sized axial fan is strongly dependent upon the system resistance. Therefore, the turbulent flow characteristics around a small-sized axial fan may change significantly according to the operating point. This study represents three-dimensional turbulent flow characteristics around a small-sized axial fan measured at the ideal design point $\phi$=0.25, which is equivalent to the maximum total efficiency point, by using three dimensional fiber-optic type LDA system. This LDA system is composed of a 5 W Argon-ion laser, two optics in back-scatter mode, three BSAs, a PC, and a three-dimensional automatic traversing system. A kind of paraffin fluid is used to supply particles by means of fog generator. Mean velocity profiles downstream of a small-sized axial fan along the radial distance show that the streamwise and the tangential components exist in a predominant manner, while the radial component has a small scale distribution and shows the inflection which its flow direction is inward or outward. Moreover, the turbulent intensity profiles show that the radial component exists the most greatly among turbulent energies.

LDA Measurements on the Turbulent Flow Characteristics of a Small-Sized Axial Fan (소형 축류홴의 난류유동 특성치에 대한 LDA 측정)

  • Kim, Jang-Kweon
    • Proceedings of the KSME Conference
    • /
    • 2001.11b
    • /
    • pp.371-376
    • /
    • 2001
  • The operating point of a small-sized axial fan for refrigerator is strongly dependent upon the system resistance. Therefore, the turbulent flow characteristics around a small-sized axial fan may change significantly according to the operating point. This study represents three-dimensional turbulent flow characteristics around a small-sized axial fan measured at the four operating points such as $\varphi=0.1$, 0.18, 0.25 and 0.32 by using fiber-optic type LDA system. This LDA system is composed of a 5 W Argon-ion laser, two optics in back-scatter mode, three BSA's, a PC, and a three-dimensional automatic traversing system. A kind of paraffin fluid is utilized for supplying particles by means of fog generator. Mean velocity profiles downstream of a small-sized axial fan along the radial distance show that both the streamwise and the tangential components exist predominantly in downstream except $\varphi=0.1$ and have a maximum value at the radial distance ratio of about 0.8, but the radial component, which its velocity is relatively small, is acting role that only turns flow direction to the outside or the central part of axial fan. Moreover, all of the velocity components downstream at $\varphi=0.1$ show much smaller than those upstream due to the static pressure rise at the low-flowrate region.

  • PDF

AIT: A method for operating system kernel function call graph generation with a virtualization technique

  • Jiao, Longlong;Luo, Senlin;Liu, Wangtong;Pan, Limin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2084-2100
    • /
    • 2020
  • Operating system (OS) kernel function call graphs have been widely used in OS analysis and defense. However, most existing methods and tools for generating function call graphs are designed for application programs, and cannot be used for generating OS kernel function call graphs. This paper proposes a virtualization-based call graph generation method called Acquire in Trap (AIT). When target kernel functions are called, AIT dynamically initiates a system trap with the help of a virtualization technique. It then analyzes and records the calling relationships for trap handling by traversing the kernel stacks and the code space. Our experimental results show that the proposed method is feasible for both Linux and Windows OSs, including 32 and 64-bit versions, with high recall and precision rates. AIT is independent of the source code, compiler and OS kernel architecture, and is a universal method for generating OS kernel function call graphs.

Passive RFID Based Mobile Robot Localization and Effective Floor Tag Arrangement (수동 RFID 기반 이동로봇 위치 추정 및 효율적 노면 태그 배치)

  • Kim, Sung-Bok;Lee, Sang-Hyup
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.12
    • /
    • pp.1294-1301
    • /
    • 2008
  • Under passive RFID environment, this paper presents a new localization of a mobile robot traversing over the floor covered with tags, which is superior to existing methods in terms of estimation performance and cost effectiveness. Basically, it is assumed that a mobile robot is traveling along a series of straight line segments, each segment at a certain constant velocity, and that the number of tags sensed by a mobile robot at each sampling instant is at most one. First, for a given line segment with known starting point, the velocity and position of a mobile robot is estimated using the spatial and temporal information acquired from the traversed tag. Some discussions are made on the validity of the basic assumptions and the localization for the initial segment with unknown starting point. Second, for a given tag distribution density, the optimal tag arrangement is considered to reduce the position estimation error as well as to make easy the tag attachment on the floor. After reviewing typical tag arrangements, the pseudorandom tag arrangement is devised inspired from the Sudoku puzzle, a number placement puzzle. Third, through experiments using our passive RFID localization system, the validity and performance of the mobile robot localization proposed in this paper is demonstrated.

An Efficient BitmapInvert Index based on Relative Position Coordinate for Retrieval of XML documents (효율적인 XML검색을 위한 상대 위치 좌표 기반의 BitmapInvert Index 기법)

  • Kim, Tack-Gon;Kim, Woo-Saeng
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.35-44
    • /
    • 2006
  • Recently, a lot of index techniques for storing and querying XML document have been studied so far and many researches of them used coordinate-based methods. But update operation and query processing to express structural relations among elements, attributes and texts make a large burden. In this paper, we propose an efficient BitmapInvert index technique based on Relative Position Coordinate (RPC). RPC has good preformance even if there are frequent update operations because it represents relationship among parent node and left, right sibling nodes. BitmapInvert index supports tort query with bitwise operations and does not casue serious performance degradations on update operations using PostUpdate algerian. Overall, the performance could be improved by reduction of the number of times for traversing nodes.