• Korean Journal of Construction Engineering and Management
• /
• v.21 no.6
• /
• pp.125-134
• /
• 2020

Natural language encountered in construction documents largely deviates from those that are recommended by the authorities. Such practice that is lacking in coherence will discourage integrated research with automation, and it will hurt the productivity in the industry for the long run. This research aims to compare multiple string similarity (string matching) algorithms to compare each algorithm's performance in recognizing the same task name written in multiple different ways. We also aim to start a debate on how prevalent the aforementioned deviation is. Finally, we composed a small dataset that associates construction task names found in practice with the corresponding task names that are less cluttered w.r.t their formatting. We expect that this dataset can be used to validate future natural language processing approaches.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.476-484
• /
• 2008

Most string problems and their solutions are relevant to diverse applications such as pattern matching, data compression, recently bioinformatics, and so on. However, there have been few works on the relations between string problems and cryptographic problems. In this paper, we consider the following string reconstruction problems and show how these problems can be applied to cryptography. Given a string x of length n over a constant-sized alphabet ${\sum}$ and a set W of strings of lengths at most an integer $k({\leq}n)$, the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L is the sum of all lengths of strings in a given set, using suffix trees and a shortest path algorithm for directed acyclic graphs. The other is a dynamic version of the first problem and we propose an $O(k^3n+L)$-time algorithm. Finally, we show that exponentiation problems that arise in cryptography can be successfully reduced to these problems and propose a new solution for exponentiation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

Recently, the string non-inclusion related problems have been studied vigorously. Given a set of strings F over a constant size alphabet, consider a string x such that x does not include any string in F as a substring. We call x a Common Non-SuperString(CNSS for short) of F. Among the CNSS's of F, the longest one with finite length is called the Longest Common Non-SuperString(LCNSS for short) of F. In this paper, we first propose a new graph model using prefixes of F. Next, we suggest an O(N)-time algorithm for finding the LCNSS of F, where N is the sum of the lengths of all the strings in F.

• 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.

• Physical Therapy Korea
• /
• v.25 no.3
• /
• pp.39-50
• /
• 2018

Background: High string instrument (violin, viola) players are at high risk for developing musculoskeletal problems. In particular, a higher prevalence of shoulder problems has been reported. However, evidence of the effectiveness of therapeutic exercise for musicians with this condition is lacking until now. Objects: This case series study investigated the effect of a specific exercise program on shoulder pain, dysfunction, and posture of professional orchestral high string musicians. Methods: Five professional orchestral high string players with shoulder pain participated in this study. A six-week specific exercise program focus on scapular stability for shoulder pain consisted of scapular muscle exercise. Physical examinations for pain and dysfunction, posture were performed, were identified among all subjects before starting the exercise program. Results: The results revealed that shoulder pain decreased by 67.86% and the effect of pain on instrument play decreased by 63.33%. The shoulder pain and disability Index and the performing arts module-quick disability of the arm, shoulder and hand scale decreased by 71.72% and 51.61% respectively. The exercise program improved function and posture. Conclusion: A specific exercise program for high string players was effective in managing shoulder pain. This case series is intended to provide empirical data on the effectiveness of an exercise program aimed at assessing the effect of exercise on pain, dysfunction, and posture of professional orchestra musicians associated with specific instrument groups.

• Smart Structures and Systems
• /
• v.12 no.3_4
• /
• pp.327-344
• /
• 2013

Beam string structure (BSS) is introduced as a new type of hybrid prestressed string structures. The composition and mechanics features of BSS are discussed. The main principles of wavelet packet transform (WPT), principal component analysis (PCA) and support vector machine (SVM) have been reviewed. WPT is applied to the structural response signals, and feature vectors are obtained by feature extraction and PCA. The feature vectors are used for training and classification as the inputs of the support vector machine. The method is used to a single one-way arched beam string structure for damage detection. The cable prestress loss and web members damage experiment for a beam string structure is carried through. Different prestressing forces are applied on the cable to simulate cable prestress loss, the prestressing forces are calculated by the frequencies which are solved by Fourier transform or wavelet transform under impulse excitation. Test results verify this method is accurate and convenient. The damage cases of web members on the beam are tested to validate the efficiency of the method presented in this study. Wavelet packet decomposition is applied to the structural response signals under ambient vibration, feature vectors are obtained by feature extraction method. The feature vectors are used for training and classification as the inputs of the support vector machine. The structural damage position and degree can be identified and classified, and the test result is highly accurate especially combined with principle component analysis.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.34 no.6
• /
• pp.449-453
• /
• 2021

Interest and investment in renewable energy have increased worldwide, highlighting the need for renewable energy. Solar energy was the most promising energy of all renewable energy sources, and it has the highest investment value. Because photovoltaics require a certain amount of area for installation, high density and high output performance are required. Shingled module is a promising technology in that they are featured by higher density and higher output compared to the conventional modules. Shingled technology uses a laser scribing to divide solar cells that are to be bonded with electrically conductive adhesive (ECA) to produce and connect strings, which has a higher output in the same area than the conventional modules. In the process of producing solar modules, metal ribbons are used to interconnect cells, but they are also needed for string connections in shingled solar cells. Accordingly, in this study, we researched the interconnection that best suits the connector that joins the string to the string. The module outputs produced under the conditions of the string interconnection were compared and analyzed.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.7
• /
• pp.328-333
• /
• 2007

In this paper, we describe characteristics of a movable bridge called the Anjok and propose an improved string model which has delay line controller in physical modeling of the Gayageum. Movable bridge, the Anjok determines the length of vibrating string and transmits the vibration of each string to the body of the Gayageum. We analyze the variations in frequency domain and implement the Anjok model as parametric form using the first-order polynomial fitting in logarithmic scale graph, because the length of string changes fundamental frequency. In order to implement the Anjok model, frequency fitting, tension fitting and frequency fitting using leaky integrator are used. The frequency fitting using leaky integrator has the best results among those. Proposed string model with the Anjok model can represent real tuning system of the real Gayageum and the proposed model could synthesize sounds which is similar to original sounds.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.821-830
• /
• 2006

As internet worms are spread out worldwide, the detection and filtering of worms becomes one of hot issues in the internet security. As one of implementation methods to detect worms, the Linux Netfilter kernel module can be used. Its basic operation for worm detection is a string matching where coming packet(s) on the network is/are compared with predefined worm signatures(patterns). A worm can appear in a packet or in two (or more) succeeding packets where some part of worm is in the first packet and its remaining part is in its succeeding packet(s). Assuming that the maximum length of a worm pattern is less than 1024 bytes, we need to perform a string matching up to two succeeding packets of 2048 bytes. To do so, Linux Netfilter keeps the previous packet in buffer and performs matching with a combined 2048 byte string of the buffered packet and current packet. As the number of concurrent connections to be handled in the worm detection system increases, the total size of buffer (memory) increases and string matching speed becomes low In this paper, to reduce the memory buffer size and get higher speed of string matching, we propose a string matching scheme without using buffer. The proposed scheme keeps the partial matching result of the previous packet with signatures and has no buffering for previous packet. The partial matching information is used to detect a worm in the two succeeding packets. We implemented the proposed scheme by modifying the Linux Netfilter. Then we compared the modified Linux Netfilter module with the original Linux Netfilter module. Experimental results show that the proposed scheme has 25% lower memory usage and 54% higher speed compared to the original scheme.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.349-350
• /
• 2012