• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.265-275
• /
• 2014

This paper introduces a new algorithms for reconstructing the suffix tree of character string, when a substring id deleted from the string or a string is inserted into the string as a substring. The algorithem has two main functions, delete-structure and insert-structure. The main objective of this algorithm is to save the time for constructing the suffix tree of an edited string, when the suffix tree of the original string is available. We tested the performance of this algorithm with some DNA sequences. This test shows that delete-reconstructing can save time when the length of the subsequence deleted is less than 30% of the original sequence, and the insert-reconstructing takes less time with regard to the length of inserted sequence.

• Genomics & Informatics
• /
• v.10 no.4
• /
• pp.266-270
• /
• 2012

Grammatical inference methods are expected to find grammatical structures hidden in biological sequences. One hopes that studies of grammar serve as an appropriate tool for theory formation. Thus, we have developed JSequitur for automatically generating the grammatical structure of biological sequences in an inference framework of string compression algorithms. Our original motivation was to find any grammatical traits of several cancer genes that can be detected by string compression algorithms. Through this research, we could not find any meaningful unique traits of the cancer genes yet, but we could observe some interesting traits in regards to the relationship among gene length, similarity of sequences, the patterns of the generated grammar, and compression rate.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.545-553
• /
• 2009

String matching is a fundamental element of an important category of modern packet processing applications which involve scanning the content flowing through a network for thousands of strings at the line rate. To keep pace with high network speeds, specialized hardware-based solutions are needed which should be efficient enough to maintain scalability in terms of speed and the number of strings. In this paper, a novel architecture based upon a recently proposed data structure called the Bloomier filter is proposed which can successfully support scalability. The Bloomier filter is a compact data structure for encoding arbitrary functions, and it supports approximate evaluation queries. By eliminating the Bloomier filter's false positives in a space efficient way, a simple yet powerful exact string matching architecture is proposed that can handle several thousand strings at high rates and is amenable to on-chip realization. The proposed scheme is implemented in reconfigurable hardware and we compare it with existing solutions. The results show that the proposed approach achieves better performance compared to other existing architectures measured in terms of throughput per logic cells per character as a metric.

• Structural Engineering and Mechanics
• /
• v.35 no.1
• /
• pp.67-82
• /
• 2010

The beam string structure (BSS) has been widely applied in large span roof structures, while no analytical solutions of BSS were derived for it in the existing literature. In the first part of this paper, calculation formulas of displacement and internal forces were obtained by the Ritz-method for the most commonly used arc-shaped BSS under the vertical uniformly distributed load and the prestressing force. Then, the failure mode of BSS was proposed based on the static equilibrium. On condition the structural stability was reliable, BSS under the uniformly distributed load would fail by tensile strength failure of the string, and the beam remained in the elastic or semi-plastic range. On this basis, the limit load of BSS was given in virtue of the elastic solutions. In order to verify the linear elastic and limit state solutions proposed in this paper, three BSS modal were tested and the corresponding elastoplastic large deformation analysis was performed by the ANSYS program. The proposed failure mode of BSS was proved to be correct, and the analytical results for the linear elastic and limit state were in good agreement with the experimental and FEM results.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.19 no.7
• /
• pp.98-105
• /
• 2020

This study deals with the passive control of the dynamic characteristics of a theoretical model which is a string with fixed ends and loaded by two point masses - a main mass (M_o) and a secondary mass (M_s). It has been controlled passively by means of a relocation of a secondary mass. A main mass placed on the string is considered as a vibrating receiver which be forced to vibrate by a vibrating source being positioned on the string. By analyzing the motion of a string, the equation of motion for a string was derived by using a method of variation of parameters. To define the optimal conditions for the vibration reduction, the governing equation, which denotes the dynamic response of a string was derived in the closed form and then evaluated numerically. The possibility of reduction of an amplitude and a power being transmitted to a main mass were found to depend on the location and the magnitude of a secondary mass as well as the range of a forcing frequency.

• Steel and Composite Structures
• /
• v.35 no.5
• /
• pp.641-657
• /
• 2020

A unique lightweight string truss deployable bridge assembled by thin-walled fiber reinforced polymer (FRP) and metal profiles was designed for emergency applications. As a new structure, investigations into the static structural performance under the serviceability limit state are desired for examining the structural integrity of the developed bridge when subjected to unsymmetrical loadings characterized by combined torsion and bending. In this study, a full-scale experimental inspection was conducted on a fabricated bridge, and the combined flexural-torsional behavior was examined in terms of displacement and strains. The experimental structure showed favorable strength and rigidity performances to function as deployable bridge under unsymmetrical loading conditions and should be designed in accordance with the stiffness criterion, the same as that under symmetrical loads. In addition, a finite element model (FEM) with a simple modeling process, which considered the multi segments of the FRP members and realistic nodal stiffness of the complex unique hybrid nodal joints, was constructed and compared against experiments, demonstrating good agreement. A FEM-based numerical analysis was thereafter performed to explore the effect of the change in elastic modulus of different FRP elements on the static deformation of the bridge. The results confirmed that the change in elastic modulus of different types of FRP element members caused remarkable differences on the bending and torsional stiffness of the hybrid bridge. The global stiffness of such a unique bridge can be significantly enhanced by redesigning the critical lower string pull bars using designable FRP profiles with high elastic modulus.

• Journal of Korean Association for Spatial Structures
• /
• v.11 no.3
• /
• pp.125-135
• /
• 2011

This study presents the shape creation process using L-system model of morphogenesis technique. In general, L-system model has been applied to represent the visualization of biological plant. But, this study proposes the shape generation process of L-system model to apply the architectural field. The L-system model consists of two parts such as string generation step and string analysis step. The string generation step shows the process for a string rewriting. This step requires alphabet, axiom and rules to generate a string. Also, the string analysis step gives the meaning in string to generate various forms. Especially, through the various application examples, we can find out the shape creation models for the space structures.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.37-46
• /
• 2010

A Suffix Tree is an efficient data structure that exposes the internal structure of a string and allows efficient solutions to a wide range of complex string problems, in particular, in the area of computational biology. However, as the biological information explodes, it is impossible to construct the suffix trees in main memory. We should find an efficient technique to construct the trees in a secondary storage. In this paper, we present a method for constructing a suffix tree in a disk for large set of DNA strings using new index scheme. We also show a typical application example with a suffix tree in the disk.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.171-176
• /
• 2007

Parsing 작업의 결과인 Parse Tree 정보는 문장에 관한 구조적 정보를 가지고 있는 Tree 정보로 이 정보를 이용하여 정보 검색에 활용하는 알고리즘을 제안한다. 제안하는 알고리즘은 XML 기술과 스트링 매칭 기법을 이용하였으며, 사용한 스트링 매칭 기법은 Approximate String Matching 기법이다. Query 정보와 문서 정보를 Parsing하여 얻은 Parse Tree를 XML 형태의 정보로 변환한 후, 두 정보를 가지고 Approximate String Matching 기법을 적용하여 Query 정보와 문서 정보 간의 유사도를 계산한다. 제안하는 알고리즘의 장점은 구조 기반의 정보 검색 기능이 가능하고 비슷한 정보에 대한 검색 기능이 가능하며 비슷한 구조에 대한 검색 기능이 가능하다는 것이다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.410-415
• /
• 2013

This paper proposes a bidirectional platoon control law using a coupled distance error based on the backstepping-like feedback linearization control method for an interconnected mobile agent system with a string structure. Unlike the previous results where the single agent was controlled using the only own information without other agents, the proposed control law cannot show the only distance error convergence of each agent, but also the string stability of the whole system. Also, the control performances are improved by the proposed control law in spite of low performance of bidirectional control strategy in the previous results. The proposed bidirectional platoon control algorithm is based on the backstepping-like feedback linearization control method. The position errors between each agent and the preceding and the behind agents are coupled by weighted summation. By the proposed control law, the distance error of each agent can converge to zero while the string stability is guaranteed when the coupled errors can converge to zero. To this end, the back-stepping control method is employed. The pseudo velocity input is determined considering the kinematic relationship between agents and the string stability. Then, the actual dynamic control input is determined to make the actual velocity converge to the pseudo velocity input. The stability analysis and the simulation results of the proposed method are included in order to demonstrate the practical application of the proposed algorithm.