• Title/Summary/Keyword: 문자열비교

Search Result 100, Processing Time 0.026 seconds

A Similarity Computation Algorithm Based on the Pitch and Rhythm of Music Melody (선율의 음높이와 리듬 정보를 이용한 음악의 유사도 계산 알고리즘)

  • Mo, Jong-Sik;Kim, So-Young;Ku, Kyong-I;Han, Chang-Ho;Kim, Yoo-Sung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3762-3774
    • /
    • 2000
  • The advances of computer hardware and information processing technologies raise the needs of multimedia information retrieval systems. Up to date. multimedia information systems have been developed for text information and image information. Nowadays. the multimedia information systems for video and audio information. especially for musical information have been grown up more and more. In recent music information retrieval systems. not only the information retrieval based on meta-information such like composer and title but also the content-based information retrieval is supported. The content-based information retrieval in music information retrieval systems utilize the similarity value between the user query and the music information stored in music database. In tbis paper. hence. we developed a similarity computation algorithm in which the pitches and lengths of each corresponding pair of notes are used as the fundamental factors for similarity computation between musical information. We also make an experiment of the proposed algorithm to validate its appropriateness. From the experimental results. the proposed similarity computation algorithm is shown to be able to correctly check whether two music files are analogous to each other or not based on melodies.

  • PDF

Design and Implementation of Advanced Web Log Preprocess Algorithm for Rule based Web IDS (룰 기반 웹 IDS 시스템을 위한 효율적인 웹 로그 전처리 기법 설계 및 구현)

  • Lee, Hyung-Woo
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.23-34
    • /
    • 2008
  • The number of web service user is increasing steadily as web-based service is offered in various form. But, web service has a vulnerability such as SQL Injection, Parameter Injection and DoS attack. Therefore, it is required for us to develop Web IDS system and additionally to offer Rule-base intrusion detection/response mechanism against those attacks. However, existing Web IDS system didn't correspond properly on recent web attack mechanism because they didn't including suitable pre-processing procedure on huge web log data. Therfore, we propose an efficient web log pre-processing mechanism for enhancing rule based detection and improving the performance of web IDS base attack response system. Proposed algorithm provides both a field unit parsing and a duplicated string elimination procedure on web log data. And it is also possible for us to construct improved web IDS system.

  • PDF

Korean Unknown-noun Recognition using Strings Following Nouns in Words (명사후문자열을 이용한 미등록어 인식)

  • Park, Ki-Tak;Seo, Young-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.4
    • /
    • pp.576-584
    • /
    • 2017
  • Unknown nouns which are not in a dictionary make problems not only morphological analysis but also almost all natural language processing area. This paper describes a recognition method for Korean unknown nouns using strings following nouns such as postposition, suffix and postposition, suffix and eomi, etc. We collect and sort words including nouns from documents and divide a word including unknown noun into two parts, candidate noun and string following the noun, by finding same prefix morphemes from more than two unknown words. We use information of strings following nouns extracted from Sejong corpus and decide unknown noun finally. We obtain 99.64% precision and 99.46% recall for unknown nouns occurred more than two forms in news of two portal sites.

Hangul Encoding Standard based on Unicode (유니코드의 한글 인코딩 표준안)

  • Ahn, Dae-Hyuk;Park, Young-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.12
    • /
    • pp.1083-1092
    • /
    • 2007
  • In Unicode, two types of Hangul encoding schemes are currently in use, namely, the "precomposed modern Hangul syllables" model and the "conjoining Hangul characters" model. The current Unicode Hangul conjoining rules allow a precomposed Hangul syllable to be a member of a syllable which includes conjoining Hangul characters; this has resulted in a number of different Hangul encoding implementations. This unfortunate problem stems from an incomplete understanding of the Hangul writing system when the normalization and encoding schemes were originally designed. In particular, the extended use of old Hangul was not taken into consideration. As a result, there are different ways to represent Hangul syllables, and this cause problem in the processing of Hangul text, for instance in searching, comparison and sorting functions. In this paper, we discuss the problems with the normalization of current Hangul encodings, and suggest a single efficient rule to correctly process the Hangul encoding in Unicode.

Control Flow Reconstruction from Virtualization-Obfuscated Binaries (가상화를 이용하여 난독화된 바이너리의 제어 흐름 재건)

  • Hwang, Joonhyung;Han, Taisook
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.44-53
    • /
    • 2015
  • Control flow information is useful in the analysis and comparison of programs. Virtualization-obfuscation hides control structures of the original program by transforming machine instructions into bytecode. Direct examination of the resulting binary reveals only the structure of the interpreter. Recovery of the original instructions requires knowledge of the virtual machine architecture, which is randomly generated and hidden. In this paper, we propose a method to reconstruct original control flow using only traces generated from the obfuscated binary. We consider traces as strings and find an automaton that represents the strings. State transitions in the automaton correspond to the control transfers in the original program. We have shown the effectiveness of our method with commercial obfuscators.

Efficient Evaluation of Path Expressions Using Connectivity of Nodes (노드의 연결성을 이용한 패스 표현의 효과적인 처리)

  • Lee, Tae-Gyeong
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.337-344
    • /
    • 2002
  • Recently, there has been a lot of research on graph-type data because it can model seamless the application domains such as GIS, network, WWW, multimedia presentations etc., and domain in which the data sequence is important. In this paper, an efficient code system, called node code system, is proposed to evaluate paths of DAG in a multimedia presentation graph. The node code system assigns a unique binary string to each node of a graph. The comparison of node codes of two nodes tells the connectivity between the nodes without actual traversal of a graph. The method using the property of the node code system allows us to construct the paths between two nodes more efficiently than the method using conventional graph traversals. The algorithms to construct paths using the node code system are provided.

A Study on High-Speed Extraction of Bar Code Region for Parcel Automatic Identification (소포 자동식별을 위한 바코드 관심영역 고속 추출에 관한 연구)

  • Park, Moon-Sung;Kim, Jin-Suk;Kim, Hye-Kyu;Jung, Hoe-Kyung
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.915-924
    • /
    • 2002
  • Conventional Systems for parcel sorting consist of two sequences as loading the parcel into conveyor belt system and post-code input. Using bar code information, the parcels to be recorded and managed are recognized. This paper describes a 32 $\times$ 32 sized mini-block inspection to extract bar code Region of Interest (ROI) from the line Charged Coupled Device (CCD) camera capturing image of moving parcel at 2m/sec speed. Firstly, the Min-Max distribution of the mini-block has been applied to discard the background of parcel and region of conveying belts from the image. Secondly, the diagonal inspection has been used for the extraction of letters and bar code region. Five horizontal line scanning detects the number of edges and sizes and ROI has been acquired from the detection. The wrong detected area has been deleted by the comparison of group size from labeling processes. To correct excluded bar code region in mini-block processes and for analysis of bar code information, the extracted ROI 8 boundary points and decline distribution have been used with central axis line adjustment. The ROI extraction and central axis creation have become enable within 60~80msec, and the accuracy has been accomplished over 99.44 percentage.

Research on Malicious code hidden website detection method through WhiteList-based Malicious code Behavior Analysis (WhiteList 기반의 악성코드 행위분석을 통한 악성코드 은닉 웹사이트 탐지 방안 연구)

  • Ha, Jung-Woo;Kim, Huy-Kang;Lim, Jong-In
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.4
    • /
    • pp.61-75
    • /
    • 2011
  • Recently, there is significant increasing of massive attacks, which try to infect PCs that visit websites containing pre-implanted malicious code. When visiting the websites, these hidden malicious codes can gain monetary profit or can send various cyber attacks such as BOTNET for DDoS attacks, personal information theft and, etc. Also, this kind of malicious activities is continuously increasing, and their evasion techniques become professional and intellectual. So far, the current signature-based detection to detect websites, which contain malicious codes has a limitation to prevent internet users from being exposed to malicious codes. Since, it is impossible to detect with only blacklist when an attacker changes the string in the malicious codes proactively. In this paper, we propose a novel approach that can detect unknown malicious code, which is not well detected by a signature-based detection. Our method can detect new malicious codes even though the codes' signatures are not in the pattern database of Anti-Virus program. Moreover, our method can overcome various obfuscation techniques such as the frequent change of the included redirection URL in the malicious codes. Finally, we confirm that our proposed system shows better detection performance rather than MC-Finder, which adopts pattern matching, Google's crawling based malware site detection, and McAfee.

The Effects of the Relative Legibility of Optotypes on Corrected Visual Acuity (시표의 유형에 따른 상대가독성이 교정시력에 미치는 영향)

  • Ha, Na-Ri;Choi, Jang-Ho;Kim, Hyun Jung
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.20 no.2
    • /
    • pp.177-186
    • /
    • 2015
  • Purpose: The Purpose of this study is to investigate if the relative legibility of optotypes affects the corrected visual acuity in visual acuity test. Methods: After measuring the relative legibility of 'Landolt ring target', 'arabic number target', 'alphabet target' by showing as a single-letter-target in 24 subjects without specific ocular diseases and ocular surgery experience, the relative legibility of 0.8, 1.0, 1.25 row of vision according to type of target in 7 types of chart were compared. After then we compared by measuring the corrected visual acuity according to type of target by using binocular MPMVA test (#7A) in 60 myopic subjects. Results: In 3 types of target the worst relative legibility target was 'Landolt ring target' with legible distance of $98.97{\pm}4.57cm$ and the best relative legibility target was 'alphabet target' with legible distance of $108.42{\pm}3.46cm$. There was no difference of the relative legibility according to type of chart or visual acuity level in the row of vision if other conditions are the same. In 1.0 and 1.25 row of vision the difference of relative legibility according to type of target was shown the statistically significant difference between 'Landolt ring target' and 'alphabet target' as $-0.07{\pm}0.06$ (p=0.02) and $-0.06{\pm}0.06$ (p=0.04) respectively. In myopia the difference of corrected visual acuity according to type of target was statistically significant difference between 'Landolt ring target' and 'arabic number target' as $-0.04{\pm}0.02$ (p=0.02) and it was especially remarkable in the low myopia. Conclusions: Measuring visual acuity with different optotypes could cause the errors in best vision measurement value because there was difference of the relative legibility according to type of target even though visual acuity level is same in the row of vision.

Exploring the Temporal Relationship Between Traffic Information Web/Mobile Application Access and Actual Traffic Volume on Expressways (웹/모바일-어플리케이션 접속 지표와 TCS 교통량의 상관관계 연구)

  • RYU, Ingon;LEE, Jaeyoung;CHOI, Keechoo;KIM, Junghwa;AHN, Soonwook
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.1
    • /
    • pp.1-14
    • /
    • 2016
  • In the recent years, the internet has become accessible without limitation of time and location to anyone with smartphones. It resulted in more convenient travel information access both on the pre-trip and en-route phase. The main objective of this study is to conduct a stationary test for traffic information web/mobile application access indexes from TCS (Toll Collection System); and analyzing the relationship between the web/mobile application access indexes and actual traffic volume on expressways, in order to analyze searching behavior of expressway related travel information. The key findings of this study are as follows: first, the results of ADF-test and PP-test confirm that the web/mobile application access indexes by time periods satisfy stationary conditions even without log or differential transformation. Second, the Pearson correlation test showed that there is a strong and positive correlation between the web/mobile application access indexes and expressway entry and exit traffic volume. In contrast, truck entry traffic volume from TCS has no significant correlation with the web/mobile application access indexes. Third, the time gap relationship between time-series variables (i.e., concurrent, leading and lagging) was analyzed by cross-correlation tests. The results indicated that the mobile application access leads web access, and the number of mobile application execution is concurrent with all web access indexes. Lastly, there was no web/mobile application access indexes leading expressway entry traffic volumes on expressways, and the highest correlation was observed between webpage view/visitor/new visitor/repeat visitor/application execution counts and expressway entry volume with a lag of one hour. It is expected that specific individual travel behavior can be predicted such as route conversion time and ratio if the data are subdivided by time periods and areas and utilizing traffic information users' location.