• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.88-95
• /
• 2009

This paper presents a traffic pattern matching hardware that can be used in high performance network applications. The presented hardware is designed for a contents security system which is to block various kinds of information drain or intrusion activities. The hardware consists of two parts: the header lookup and string pattern matching parts. For implementing the header lookup part in hardware, the TCAMs(ternary CAMs) are popularly used. Since the TCAM approach is inefficient in terms of the hardware and memory costs and the power consumption, however, we adopt and modify an alternative approach based on the comparator arrays and the HiCuts tree. Our implementation results, using Xilinx FPGA XC4VSX55, show that our design can reduce the usage of the FPGA slices by about 26%, and the Block RAM by about 58%. In the design of string pattern matching part, we design and use a hashing module based on cellular automata, which is hardware efficient and consumes less power by adaptively changing its configuration to reduce the collision rates.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.5
• /
• pp.656-662
• /
• 2018

Pattern matching algorithm is widely used in many application fields such as bio-informatics, intrusion detection, etc. Among many string matching algorithms, KMP (Knuth-Morris-Pratt) algorithm is commonly used because of its fast execution time when using large texts. However, the processing speed of KMP algorithm is also limited when the text size increases significantly. In this paper, we propose a high throughput parallel KMP algorithm considering CPU-GPU memory hierarchy based on OpenCL in GPGPU (General Purpose computing on Graphic Processing Unit). We focus on the optimization for the allocation of work-times and work-groups, the local memory copy of the pattern data and the failure table, and the overlapping of the data transfer with the string matching operations. The experimental results show that the execution time of the optimized parallel KMP algorithm is about 3.6 times faster than that of the non-optimized parallel KMP algorithm.

• Journal of the Korean Society of Costume
• /
• v.65 no.2
• /
• pp.92-104
• /
• 2015

Colored thread quilting is sewed up padded with Han-Ji (한지, korean paper) string using colored thread. This showed up geometric pattern with repeated line of straight, diagonal, curve. According to geometric pattern, Colored thread quilting showed visual effects. The purpose of this study is to present manufacturing techniques, kinds, use, shape of traditional colored thread quilting. furthermore, This study has produced fashion items that can be used in modern life by using techniques of colored thread quilting. According to the fashion items, It present succession and utilization of techniques of colored thread quilting. This study was conducted in the following manner First, It studied traditional colored thread quilting techniques through the documents consideration, previous researches and by surveying antiquity in the museum. 2nd, It tried to make a reproduction about techniques of traditional colored thread quilting. 3rd, This study has selected and developed item and design of fashion items that can be used pragmatically in modern life by using techniques of colored thread quilting. And Fashion items that have been produced in this study is a total 10 kinds that was composed of Vest 4ea, Pendant & Brooch 6ea. Colored thread quilting is a unique technique of thread quilting that combines powerful practicality with decorativeness only in korea. These technique hope that it can developed more variety of items in modern life.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.6
• /
• pp.144-150
• /
• 1996

The purpose of this paper is to develop a simulation program to predict resist prifile in electron-beam lithography, where the main issue is proximity effect. The simualtion program composes of monte-carlo simulation, exposure simulation and development simulation. In nonte-carlo simulation, the absorbed energy in the resist is calculated when one electron is incident into resist, using hybrid model on the basis of the rutherford differential scattering cross section and moller theory. In exposure simulation, the absorbed energy in the resist is calculated when electrons are incident in exposure pattern. In the program, the developed profile depending on time is obtained by string model. The 0.2$\mu$m and the 0.3$\mu$m line and space patterns are experimentally delineated and compared to the simulation results to check the relevance of the program.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.4
• /
• pp.127-135
• /
• 1994

In this paper we propose an EWLD(Enhanced Weighted Levenshtein Distance) algorithm to organize code-string pattern matching linear array processor based on the mappting to an one-dimensional array from a two-dimensional matching matrix, and design a processing element(PE) of the processor, N PEs are required instead of NS02T in the processor because of the mapping. Data input and output between PEs and all internal operations of each PE are performed in bit-serial fashion. The bit-serial operation consists of the computing of word distance (WD) by comparison and the selection of optimal code transformation path, and takes 22 clocks as a cycle. The layout of a PE is designed based on the double metal $1.5\mu$m CMOS rule. About 1,800 transistors consistute a processing element and 2 PEs are integrated on a 3mm$\times$3mm sized chip.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.748-750
• /
• 2001

최근 Human Genome Project(HGP)에서 사람의 염기 서열의 초안이 발표되었다. 생물체의 염기 서열을 분석하는 방법은 매우 많은데, 그 중 하나가 k-mer 분석이다. k-mer는 유전자의 염기 서열내의 길이가 k인 연속된 염기 서열이다. k-mer 분석은 염기서열이 가진 k-mer들의 빈도의 분포나 대칭성 등을 탐색하는 것이다. 그런데 유전자의 염기 서열은 대용량 텍스트이고 k가 줄 때 기존의 온메모리 알고리즘으로는 처리가 불가능하므로 효율적인 자료구조와 알고리즘이 필요하다. 본 논문에서는 패턴 일치(pattern matching)에 적합하고 외부 메모리를 지원하는 스트링 B-트리(string B-tree)를 이용한 k-mer 분석 방법을 제시하고, 그것을 구현하였으며 몇 가지 실험 결과에 대하여 기술한다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.9
• /
• pp.38-45
• /
• 2003

This research is concerned with the dynamic modeling of the multi-purpose satellite with deployable solar arrays equipped with strain energy hinges(SEH). To this end, we proposed the use of the equivalent torsional spring for the SEH and derived the equations of motion assuming that the satellite and solar arrays are being rigid. We also considered the effect of the support string for the ground experiment model, which has been observed as a critical factor affecting the deployment in the ground experiments. From the numerical simulation results, it is found that solar arrays are deployed in a similar pattern but the hub motions are different because of the support strings. It was concluded that the non-gravity deployment of the solar arrays can be approximately simulated by the ground experimental facility. The effects of the support string are also investigated by varying the length of the string. It was found that the current length of the string is adequate for the ground experiment. Ground experimental results will follow.

• The Korean Journal of Malacology
• /
• v.32 no.2
• /
• pp.83-93
• /
• 2016

For the continuous stable production of oyster, estimation of food availability (F) was carried out in Goseong Bay, south of coast Korea. Primary productivity ranged from 0.07 to $0.44gC/m^2/day$ (average $0.25gC/m^2/day$), lowest in July and highest in January. The distribution of primary productivity at Goseong Bay showed the pattern of "high in the south and low in the north." Food availability (F) was $F{\leq}0$, indicating insufficient food supply, from August to November and F > 0 from January to April. Continuous insufficient food supply was observed at 18 oyster farms in the southern part of the bay and 4 in its northern part. Mortality at the oyster farms was 56% on the average, and around 58% of death occurred during November when food supply was insufficient. The optimal population of cultured oyster per unit flow area was calculated to be $110-115indiv./m^2$ (198-201 indiv./string). When the sea area was divided into 3 regions (A, B, C) according to carrying capacity, the carrying capacity of (A) regions was $52-53indiv./m^2$ (93-95 indiv./string), (B) regions was $142-144indiv./m^2$ (255-259 indiv./string), and (C) regions was $198-202indiv./m^2$ (356-363 indiv./string). In particular, (A) regions showed extremely low productivity. For continuous stable oyster farming at Goseong Bay, it is necessary to control point and non-point source pollution through continuous environmental monitoring and to adjust harvest according to the base carrying capacity during the season of high water temperature.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2003.07a
• /
• pp.730-733
• /
• 2003

Dual coding technique is one of the popular techniques to reduce the dynamic false contours on PDP. Subfield pattern is a key factor affecting the performance of dual coding technique. In this paper, an optimum subfield selection method based on genetic algorithm is proposed. Two types of string structures are defined to account for all the possible configurations of the dual coding subfield patterns. Genetic operators are proposed for optimization of dual coding subfield pattern. Quantitative measures to describe degrees of dynamic false contours and checkerboard patterns are defined. Experimental results indicate that dual coding subfield pattern that is determined by proposed method reduces dynamic false contours and checkerboard patterns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2258-2274
• /
• 2020

In this paper we first propose a new cryptosystem based on our data hiding scheme (2,9,8) introduced in 2019 with high security, where encrypting and hiding are done at once, the ciphertext does not depend on the input image size as existing hybrid techniques of cryptography and steganography. We then exploit our automata approach presented in 2019 to design two algorithms for exact and approximate pattern matching on secret data encrypted by our cryptosystem. Theoretical analyses remark that these algorithms both have O(n) time complexity in the worst case, where for the approximate algorithm, we assume that it uses ⌈(1-ε)m)⌉ processors, where ε, m and n are the error of our string similarity measure and lengths of the pattern and secret data, respectively. In searchable encryption, our cryptosystem is used by users and our pattern matching algorithms are performed by cloud providers.