• Title/Summary/Keyword: string

Search Result 1,083, Processing Time 0.036 seconds

A Swing Characteristics and Application Condition of the V type Suspension String Set (V련 현수애자장치의 횡진특성과 실선로 적용)

  • Sohn H.K.;Lee H.K.;Keum E.Y.;Min B.W.;Choi J.S.;Choi I.H.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.627-629
    • /
    • 2004
  • V type suspension string sets prevent instabilities from swing motion by the horizontal angle and by wind pressure. These installation conditions are controled mainly 3 items - normal swing angle by horizontal angle of line, unusual swing angle by strong wind, minimum vertical loads. We calculated and analysed that factors for the 765kV transmission line condition. And we were tested swing characteristics of V-string sets in real size test situation. So, we find to installation condition for the V type suspension string sets. This results will be used to design of V type suspension string set and to decision of the installation condition.

  • PDF

A VIRTUAL BOUNDARY METHOD FOR SIMULATION OF FLOW OVER SWIMMING STRINGS

  • Huang, Wei-Xi;Sung, Hyung-Jin
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2006.10a
    • /
    • pp.66-69
    • /
    • 2006
  • In the present study, we propose a virtual boundary method for simulation of massive inextensible flexible strings immersed in viscous fluid flow. The fluid motion is governed by the Navier-Stokes equations and a momentum forcing is added in order to bring the fluid to move at the same velocity with the immersed surface. A massive inextensible flexible string model is described by another set of equations with an additional momentum forcing which is a result of the fluid viscosity and the pressure difference across the string. The momentum forcing is calculated by a feedback loop. Simulations of several numerical examples are carried out, inlcuding a hanging string which starts moving under gravity without ambient fluid, a string swimming within a uniform flow and a uniform flow over two side-by side strings. The numerical results agree well with the theoretical analysis and previous experimental observations. Preliminary results of a swimming elongated fishlike body will also be presented.

  • PDF

A SURVEY OF N-STRING TANGLE ANALYSES OF DNA-ENZYME SYNAPTIC COMPLEXES

  • KIM, SOOJEONG;MOON, HYEYONG
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.3_4
    • /
    • pp.349-369
    • /
    • 2017
  • In last 30 years, mathematical tangle theory is applied to molecular biology, especially to DNA topology. The recent issues and research results of this topic are reviewed in this paper. We introduce a tangle which models an enzyme-DNA complex. The studies of 2-string tangle equations related to Topoisomerase II action and site-specific recombination is discussed. And 3-string tangle analysis of Mu-DNA complex, n-string tangle analysis ($n{\geq}4$) of DNA-enzyme synaptic complexes are also discussed.

Reference String Recognition based on Word Sequence Tagging and Post-processing: Evaluation with English and German Datasets

  • Kang, In-Su
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.5
    • /
    • pp.1-7
    • /
    • 2018
  • Reference string recognition is to extract individual reference strings from a reference section of an academic article, which consists of a sequence of reference lines. This task has been attacked by heuristic-based, clustering-based, classification-based approaches, exploiting lexical and layout characteristics of reference lines. Most classification-based methods have used sequence labeling to assign labels to either a sequence of tokens within reference lines, or a sequence of reference lines. Unlike the previous token-level sequence labeling approach, this study attempts to assign different labels to the beginning, intermediate and terminating tokens of a reference string. After that, post-processing is applied to identify reference strings by predicting their beginning and/or terminating tokens. Experimental evaluation using English and German reference string recognition datasets shows that the proposed method obtains above 94% in the macro-averaged F1.

Determination of Total Organic Carbon in Water by Flame Ionization Detector (FID를 이용한 수중의 TOC 분석법)

  • 박만기;한대석;임병연
    • YAKHAK HOEJI
    • /
    • v.22 no.3
    • /
    • pp.157-162
    • /
    • 1978
  • Total organic carbon(TOC) can be determined by means of combustion and flame ionization detector. The principle of string method is that a sample acidified to pH2 and transferred into combustion tube by string is oxidized with air. Another combustion tube method is that organic compounds are oxidized in the combustion tube charged with CuO and cobalt asbestos after the acidified sample is injected directly by microsyringe. Carbon dioxide evolved was reduced under specially treated nickel catalyst and hydrogen, the methane produced was detected by flame ionization detector. Linear relationship was found between concentration and the peak height by the string method. The peak area in the case of combustion tube method is in the range of 1-200ppm. The coefficient of variation by string method was 2.3% and that by combustion tube method was 1.8%. The lower detectable limit was about 10mol. Advantages of the latter are simplicity, sensitivity and reproducibility. TOC in contineous stream can also be determined automatically by means of the string method.

  • PDF

Pattern Recognition Method Using Fuzzy Clustering and String Matching (퍼지 클러스터링과 스트링 매칭을 통합한 형상 인식법)

  • 남원우;이상조
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.11
    • /
    • pp.2711-2722
    • /
    • 1993
  • Most of the current 2-D object recognition systems are model-based. In such systems, the representation of each of a known set of objects are precompiled and stored in a database of models. Later, they are used to recognize the image of an object in each instance. In this thesis, the approach method for the 2-D object recognition is treating an object boundary as a string of structral units and utilizing string matching to analyze the scenes. To reduce string matching time, models are rebuilt by means of fuzzy c-means clustering algorithm. In this experiments, the image of objects were taken at initial position of a robot from the CCD camera, and the models are consturcted by the proposed algorithm. After that the image of an unknown object is taken by the camera at a random position, and then the unknown object is identified by a comparison between the unknown object and models. Finally, the amount of translation and rotation of object from the initial position is computed.

Design and Control of Interleaved Boost converter for Multi-string PV Inverter (멀티스트링 태양광 인버터용 인터리브드 부스트 컨버터의 설계 및 제어)

  • Kang, Young-Ju;Cha, Han-Ju
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.3
    • /
    • pp.538-543
    • /
    • 2011
  • In this paper, design and control of an interleaved boost converter for multi-string PV Inverter are discussed. Interleaved Boost converter can reduce current ripples at input and output side by cancelling an each phase of inductor currents. Therefore, it contributes to increase efficiency and downsize the whole system volume, cost. One of the advantages of the multi-string system is easy to expand power capacity by connecting the converter modules in parallel. In order to reduce current ripples, the inductor currents on each phase are controlled independently in the converter module, and communication between the converter modules is required for further ripple current reduction. Current control algorithm for the balance of the each phase ripple currents and synchronization of the converter modules based on communication are proposed and implemented in the DSP programming. 10kW prototype of the multi-string converter module is assembled and experimental results are presented to verify the proposed ripple current reduction methods.

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 Web-Based Protein Comparison System Using PSAML and Topology String Databases (PSAML과 Topology String 데이터베이스를 이용한 웹 기반 단백질 구조 비교 시스템)

  • 김진홍;안건태;변상희;이수현;이명준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.271-273
    • /
    • 2004
  • 단백질의 기능은 단백질의 구조에 따라 결정되며, 새로운 단백질의 기능을 파악하기 위하여 이미 밝혀진 단백질의 기능과 구조를 비교하는 방법이 사용되고 있다. 단백질 구조를 비교하는 방법은 단백질 구조를 표현하는 방법에 따라 다양하게 개발되고 있으며, 보다 효과적으로 관련된 연구자들이 자신의 연구에 활용하기 위해서는 빠르고 쉽게 활용할 수 있는 인터페이스를 제공하는 도구가 필요하다. 본 논문에서는 PDB 데이터베이스에서 제공하는 단백질 정보를 이용하여 PSAML 및 Topology String 데이터베이스를 구축하고 이를 바탕으로 웹 기반에서 단백질 구조 비교를 보다 빠르고 효과적으로 수행하는 시스템에 대하여 기술한다. PSAML 데이터베이스는 단백질 구조를 단백질 이차구조 및 그들 사이의 관계를 포함하는 PSAML 데이터를 제공하며, Topology String 데이터베이스는 단백질 구조를 단백질 이차구조를 하나의 문자로 기술하여 아미노산 순서와 위상학적(공간적) 정보를 포함하는 문자열로 단백질 구조정보를 제공한다. 이를 이용하여 구축된 웹 기반 단백질 구조 비교 시스템은 Topology String 정렬 방법을 통하여 보다 빠르게 유사성이 높은 부분 구조를 찾는 방법을 제공한다.

  • PDF

Inverted Index based Modified Version of KNN for Text Categorization

  • Jo, Tae-Ho
    • Journal of Information Processing Systems
    • /
    • v.4 no.1
    • /
    • pp.17-26
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the supervised learning algorithms adaptable to string vectors for text categorization.