• Title/Summary/Keyword: String

Search Result 1,084, Processing Time 0.028 seconds

An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System

  • Chang, Gwo-Ching;Lin, Yue-Der
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.956-967
    • /
    • 2010
  • Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.

Photogrammetry-based Modal Parameter Extraction from Motion Pictures (사진측량 기반 동영상 동특성 추출)

  • Kim, Byeong-Hwa;Yeo, Keum-Soo;Kim, Soo-Jin
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.20 no.3
    • /
    • pp.308-315
    • /
    • 2010
  • This study introduces a new technique to estimate modal parameters of a vibrating string using motion pictures. The approach requires two motion pictures for a vibrating string captured simultaneously by typical potable digital cameras or camcorders. Applying the space intersection theory and the space resection theory in photogrammetry, the steroscopic images for the string are constructed from two flat plane pictures. Then the three dimensional displacement components of the string are extracted by a multiple template matching technique. Finally the modal parameters of the string are estimated from the resulting displacement time histories. The accuracy of the approach has been examined through a small-scale mock-up of a string.

Transmission Line Based Plucked String Model (전송선로 기반 탄현 모델)

  • Lee, Jingeol;French, Mark
    • The Journal of the Acoustical Society of Korea
    • /
    • v.32 no.4
    • /
    • pp.361-368
    • /
    • 2013
  • As one way to describe the behavior of a vibrating string, analogies to a transmission line have been made based on the fact that they have oppositely travelling waves on each of them. In such analogies, a rigid end to the string has been represented as an open circuit, and the displacement of the string as the current on the transmission line. However it turns out that the rigid end corresponds to a short circuit, the displacement to the voltage by the theory of the transmission line, and it is confirmed by experiments with circuit simulations. Based on these discoveries, a transmission line based plucked string model comprising a transmission line, two piecewise linear current sources, and switches is proposed. The proposed model is validated by showing that the voltage at the arbitrarily chosen location, and the voltage calculated over an infinitesimal portion at the end of the transmission line are consistent with the displacement at the corresponding location and the force on the rigid end of the string from the well known difference form of a wave equation governing the behavior of the string with its fundamental frequency tuned to that for the proposed model, respectively. Moreover, the applicability of the proposed model to modeling string and wind instruments is presented.

Composition Method and Character for Beam String Structure in Structural Planning (구조계획에 있어 들림형 보구조의 특성과 구성방식)

  • Lee, Ju-Na;Park, Sun-Woo
    • Journal of Korean Association for Spatial Structures
    • /
    • v.6 no.3 s.21
    • /
    • pp.111-121
    • /
    • 2006
  • Beam String Structure is a structure system that is composed with beam, strut and string, and the structural capacity of this structure system is enhanced by introducing prestress force in string and controling the stress and deformation of beam. Researching on the established studies and examples, character and composition methods of Beam String Structure was investigated. At the result, It was examined that the design elements of the system are shape and rise of beam, sag of string, plan arrangement and the composition and number of strut, in addition, detailed composition methods of the design elements were represented. Also, it was showed that the method to form the individual mechanism against additional load can be employed in order to reduce stress of Beam String Structure under the heavy additional load.

  • PDF

Quality Characteristics of String Cheese Prepared with Barley Sprouts (새싹보리를 첨가한 스트링치즈의 품질 특성)

  • Park, Seong-Eun;Seo, Seung-Ho;Kim, Eun-Ju;Lee, Kwang-Moon;Son, Hong-Seok
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.46 no.7
    • /
    • pp.841-847
    • /
    • 2017
  • The objective of this study was to evaluate the quality characteristics of string cheese with different concentrations (0, 1, and 2%) of barley sprout (Hordeum vulgare L.) powder. The pH of barley sprout string cheese (6.26) was significantly lower compared to that of the control (6.46). Chromaticity tended to decrease with increasing amounts of barley sprout powder in terms of L* (lightness) and a* (redness), whereas b* (yellowness) tended to increase. In the texture profile analysis, string cheese prepared with barley sprout powder showed higher values of hardness, gumminess, and chewiness but lower value of cohesiveness. The string cheese prepared with barley sprout powder also showed higher values for total amino acids and stretchability. Total polyphenol contents of string cheese showed the highest value when barley sprout powder was 2%. Therefore, addition of barley sprout powder to string cheese can be valuable for improving quality of string cheese.

Simulation of Shingled String Characteristics Depending on Cell Strips Type for High Power Photovoltaic Modules (고출력 태양광 모듈을 위한 분할 셀 종류에 따른 슁글드 스트링 특성 시뮬레이션)

  • Park, Ji Su;Oh, Won Je;Lee, Jae Hyeong
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.33 no.1
    • /
    • pp.10-15
    • /
    • 2020
  • Recently, with the increase in the use of urban solar power, solar modules are required to produce high power in limited areas. In this report, we proposed the fabrication of a high-power photovoltaic module using shingles technology, and developed accurate string characteristic simulations based on circuit modeling. By comparing the resistance components between the interconnected cells and the cell strips, the ECA resistance was determined to be 0.003 Ω. Based on the equivalent circuit of the modeled shingled string, string simulation was performed according to the type of cell strip. As a result, it was determined that the cell efficiency of the 4-cell strip was the highest at 19.66%, but the efficiency of the string simulated with the 6-cell strip was the highest at 20.48% in the string unit.

A Memory-Efficient Two-Stage String Matching Engine Using both Content-Addressable Memory and Bit-split String Matchers for Deep Packet Inspection (CAM과 비트 분리 문자열 매처를 이용한 DPI를 위한 2단의 문자열 매칭 엔진의 개발)

  • Kim, HyunJin;Choi, Kang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.7
    • /
    • pp.433-439
    • /
    • 2014
  • This paper proposes an architecture of two-stage string matching engine with content-addressable memory(CAM) and parallel bit-split string matchers for deep packet inspection(DPI). Each long signature is divided into subpatterns with the same length, where subpatterns are mapped onto the CAM in the first stage. The long pattern is matched in the second stage using the sequence of the matching indexes from the CAM. By adopting CAM and bit-split string matchers, the memory requirements can be greatly reduced in the heterogeneous string matching environments.

Efficient External Memory Algorithm for Finding the Maximum Suffix of a String (스트링의 최대 서픽스를 계산하는 효율적인 외부 메모리 알고리즘)

  • Kim, Sung-Kwon;Kim, Soo-Cheol;Cho, Jung-Sik
    • The KIPS Transactions:PartA
    • /
    • v.15A no.4
    • /
    • pp.239-242
    • /
    • 2008
  • We study the problem of finding the maximum suffix of a string on the external memory model of computation with one disk. In this model, we are primarily interested in designing algorithms that reduce the number of I/Os between the disk and the internal memory. A string of length N has N suffixes and among these, the lexicographically largest one is called the maximum suffix of the string. Finding the maximum suffix of a string plays a crucial role in solving some string problems. In this paper, we present an external memory algorithm for computing the maximum suffix of a string of length N. The algorithm uses four blocks in the internal memory and performs at most 4(N/L) disk I/Os, where L is the size of a block.

Digit Segmentation in Digit String Image Using CPgraph (CPgraph를 이용한 숫자열 영상에서 숫자 분할)

  • Oh, Jeong-su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.9
    • /
    • pp.1070-1075
    • /
    • 2019
  • In this paper, I propose an algorithm to generate an input digit image for a digit recognition system by detecting a digit string in an image and segmenting the digits constituting the digit string. The proposed algorithm detects blobbed digit string through blob detection, designates a digit string area and corrects digit string skew using the detected blob information. And the proposed algorithm corrects the digit skew and determines the boundary points for the digit segmentation in the corrected digit sequence using three CPgraphs newly defined in this paper. In digit segmentation experiments using the image group including digit strings printed with a range of the font sizes and the image group including handwritten digit strings, the proposed algorithm successfully segments 100% and 90% of the digits in each image group.

A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection

  • Kim, HyunJin;Lee, Seung-Woo
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.154-157
    • /
    • 2013
  • This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions.