• Title/Summary/Keyword: string pattern

Search Result 112, Processing Time 0.018 seconds

A Study on Patterning Techniques by sliced unit with square woods's color bars (각목 색상 배치에 의한 문양막대의 횡절단 무늬편을 이용한 문양구성 연구)

  • Kim, Ji-Geon
    • Journal of the Korea Furniture Society
    • /
    • v.20 no.5
    • /
    • pp.431-439
    • /
    • 2009
  • When we look at the pattern techniques of wooden furniture in the 19th century Joeson Dynasty, we see that furniture patterns in the main living room were showy and colorful while furniture patterns in the library room, where noble men used to study, were natural and moderate, retaining the actual color of the material without any artificial coloring. Even the serial patterns in the Hwe-Jang technique, Which were used rarely, used moderate techniques. such as weaving in patterns with colorless woods - willow and black persimmon ets. - rather than using excessive techniques. However, considering the marquetry&intarsia technique of ceramic and the silver string intarsia technique of metal then current, wood work must also have been technically advanced. Korean modern wood furniture needs remedies to improve the standard of sound wood work techniques. This study shows that pattern unit production, composition techniques, and color effects etc. Using colored patterns bars, by improving the pattern composition techniques of Marquetry&Intarsia, can be substituted for the production logic of modern manufactured furniture.

  • PDF

Developing Stock Pattern Searching System using Sequence Alignment Algorithm (서열 정렬 알고리즘을 이용한 주가 패턴 탐색 시스템 개발)

  • Kim, Hyong-Jun;Cho, Hwan-Gue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.6
    • /
    • pp.354-367
    • /
    • 2010
  • There are many methods for analyzing patterns in time series data. Although stock data represents a time series, there are few studies on stock pattern analysis and prediction. Since people believe that stock price changes randomly we cannot predict stock prices using a scientific method. In this paper, we measured the degree of the randomness of stock prices using Kolmogorov complexity, and we showed that there is a strong correlation between the degree and the accuracy of stock price prediction using our semi-global alignment method. We transformed the stock price data to quantized string sequences. Then we measured randomness of stock prices using Kolmogorov complexity of the string sequences. We use KOSPI 690 stock data during 28 years for our experiments and to evaluate our methodology. When a high Kolmogorov complexity, the stock price cannot be predicted, when a low complexity, the stock price can be predicted, but the prediction ratio of stock price changes of interest to investors, is 12% prediction ratio for short-term predictions and a 54% prediction ratio for long-term predictions.

A Study on the Analysis and Measurement for the Elasticity of the Catenary System (전차선로 탄성도 해석 및 측정에 관한 연구)

  • 조용현;최강윤;조기조;권삼영
    • Proceedings of the KSR Conference
    • /
    • 2002.10b
    • /
    • pp.1100-1105
    • /
    • 2002
  • The elasticity of the contact wire is one of important static parameters for the catenary system. This paper presents how to analyse the elasticity of the catenary system using both simple string model method and finite element method with their formula. Analysis results obtained by these two methods for KTX catenary system are compared. A measurement of the elasticity for the KTX catenary under construction which is located near Kumkang bridge is made for the comparison with the analysis results. Both a dynamic and a static methods are tried for the measurement. Because of wave propagation, the dynamic method with 5 km/h running presented an asymmetric variational pattern of the elasticity while the static method presented a symmetric pattern of the elasticity in the span. Measured elasticity using the static method is found to be a little higher than the analysis results. But, the static method can presented us a variational pattern of the elasticity in the span similar to the analysed results. Therefore, the static method can be used for evaluating the elasticity of the catenary system

  • PDF

Design and Implementation of Intermediate Code Translator using String Pattern Matching Technique (스트링 패턴 매칭 기법을 이용한 중간 코드 변환기의 설계 및 구현)

  • 고광만
    • Journal of Internet Computing and Services
    • /
    • v.3 no.3
    • /
    • pp.1-9
    • /
    • 2002
  • The various researches are investigated for transforming byte code into objective machine code which can be implemented in the specific processor using classical compiling methods to improve the execution speed of the JAVA language. The code generation techniques using pattern matching can generate more high-quality code than code expansion techniques. We provide, in this research, the standardized pattern describing methods and pattern matching techniques that can be used to generate the register-based inter-language which is for the effective native code generation from byte code. And we designed and realized the inter-code transformer with which we can generate the high-quality register-based inter-code using standardized pattern described formerly.

  • PDF

Code Optimization Using Pattern Table (패턴 테이블을 이용한 코드 최적화)

  • Yun Sung-Lim;Oh Se-Man
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.11
    • /
    • pp.1556-1564
    • /
    • 2005
  • Various optimization techniques are deployed in the compilation process of a source program for improving the program's execution speed and reducing the size of the source code. Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to excessive time required for optimized pattern search. The tree matching pattern technique can result in many redundant comparisons for pattern determination, and there is also the disadvantage of high cost involved in constructing a code tree. The objective of this paper is to propose a table-driven code optimizer using the DFA(Deterministic Finite Automata) optimization table to overcome the shortcomings of existing optimization techniques. Unlike other techniques, this is an efficient method of implementing an optimizer that is constructed with the deterministic automata, which determines the final pattern, refuting the pattern selection cost and expediting the pattern search process.

  • PDF

Evaluation and Numerical Model of Hydraulic Resistance by Hanging Aquaculture Facilities (수하식 양식시설에 의한 운수저항의 평가와 수치모형)

  • LEE Jong Sup;PARK Il Heum
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.28 no.5
    • /
    • pp.607-623
    • /
    • 1995
  • A numerical model of hydraulic resistance by hanging aquaculture facilities is developed and applied to a model basin and a field. A drag stress term formulated by the quadratic law of drag force is introduced Tn the equations of motion for a two-dimensional depth-averaged flow. In the model basin, numerical experiments ave tarried out for the various shape of obstructions, string density and layout of facilities etc.. The flow pattern around the facilities is affected sensitively by the density of string and the layout of facilities. On the other hand, the velocity decay due to the hanging oyster aquaculture facilities is observed in Kamak bay, where the maximum velcocity decay rate is $25\%$ in spring tide. The model is also applied to the field, Kamak bay. The velocity decay rate in the model is comparable with the field measurement data. The velocity decreases around the down-stream area of the facilities, .hut it increases in the other region. The water elevation decreases during the flood and it increases during the ebb.

  • PDF

Studies on the Acoustical Characteristics of Violin Bridges and SDM Simulation (바이올린 브릿지의 음향적 특성 및 SDM 시뮬레이션에 관한 연구)

  • 정우양
    • Journal of the Korea Furniture Society
    • /
    • v.12 no.1
    • /
    • pp.47-55
    • /
    • 2001
  • Violin bridge blank cut from maple wood with good quality has typical pattern of the radial direction in the side edge with minimal dispersion. This experimental study was designed and carried out to examine the effect of the physical and macroscopical characteristics on the compressive creep of violin bridge blank which had been imported from European manufacturer. This research arose from the idea that the maple solid wood with heterogeneous wood density and ray direction in the side edge would have uneven rheological property of violin bridge blank which is supposed to be pressed by the tension of strings. Experimentally, the compressive creep of bridge blank became smaller with the higher density of imported maple wood and showed clear density-dependence for the duration of load under the string tension of 5 kgf. Every bridge blank showed the behavior of primary creep stage(stress stabilization) having logarithmic regression creep curve with high correlation coefficient under the designed stress level. Even though the relationship between compressive creep and ray direction on the side edge of bridge was not so clear contrary to expectation, we could conclude that wood density and ray direction should be the quality decisive factors affecting the acoustical characteristics and performance of the bridge, the core member of violin-family bow instruments.

  • PDF

Linear-Time Search in Suffix Arrays (접미사 배열을 이용한 선형시간 탐색)

  • Sin Jeong SeoP;Kim Dong Kyue;Park Heejin;Park Kunsoo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.5
    • /
    • pp.255-259
    • /
    • 2005
  • To search a pattern P in a text, such index data structures as suffix trees and suffix arrays are widely used in diverse applications of string processing and computational biology. It is well known that searching in suffix trees is faster than suffix ways in the aspect of time complexity, i.e., it takes O(${\mid}P{\mid}$) time to search P on a constant-size alphabet in a suffix tree while it takes O(${\mid}P{\mid}+logn$) time in a suffix way where n is the length of the text. In this paper we present a linear-tim8 search algorithm in suffix arrays for constant-size alphabets. For a gene.al alphabet $\Sigma$, it takes O(${\mid}P{\mid}log{\mid}{\Sigma}{\mid}$) time.

Personalized Service Based on Context Awareness through User Emotional Perception in Mobile Environment (모바일 환경에서의 상황인식 기반 사용자 감성인지를 통한 개인화 서비스)

  • Kwon, Il-Kyoung;Lee, Sang-Yong
    • Journal of Digital Convergence
    • /
    • v.10 no.2
    • /
    • pp.287-292
    • /
    • 2012
  • In this paper, user personalized services through the emotion perception required to support location-based sensing data preprocessing techniques and emotion data preprocessing techniques is studied for user's emotion data building and preprocessing in V-A emotion model. For this purpose the granular context tree and string matching based emotion pattern matching techniques are used. In addition, context-aware and personalized recommendation services technique using probabilistic reasoning is studied for personalized services based on context awareness.

A Study on the Convergence of Optimal Value using Selection Method in Genetic Algorithms (유전자 알고리즘에서 선택 기법을 이용한 해의 수렴 과정에 관한 연구)

  • 김용범;김병재;박명규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.42
    • /
    • pp.171-179
    • /
    • 1997
  • Genetic Algorithms face an inherent conflict between exploitation and exploration. Exploitation refers to taking advantage of information already obtained in the search. Exploration show that a pattern in bits coupled with another pattern elsewhere in the string is more effective. In this paper shows that the selection method has a major impact on the balance between exploitation and exploration. A more heavy-handed approach seeks to exploit the available information. If decisions must be made quickly, especially those in real-time trading environments, then quicker convergence through exploitation may be more desirable. Also this paper we present some theoretical and empirical the selection method in genetic algorithms for a GA-hard problem.

  • PDF