• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.6
• /
• pp.1347-1359
• /
• 2017

SQLite database is a file-based DBMS(Database Management System) that provides transactions, and it is loaded on smartphone because it is appropriate for lightweight platform. AS the usage of smartphone increased, SQLite-related crimes can occur. In this paper, we proposed a new concealing method for SQLite db file and a detection method against it. As a result of concealing experiments, it is possible to intentionally conceal 70bytes in the DB file header and conceal original data by inserting artificial pages. But it can be detected by parsing 70bytes based on SQLite structure or using the number of record and index. After that, we proposed detection algorithm for concealed data.

• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.652-667
• /
• 2007

With the wide spread of XML data in various fields, the interest in developing convenient user interfaces for inputting XML data is increasing. Previous works on the automated generation of user interfaces have given insufficient supports for various user environments and inconvenient editing tools for complex documents. In this paper, we presents an approach to generate XForms based user interfaces from XML schemas, for inputting XML data. The proposed method consists of three steps: parsing XML schemas, generating XForms codes, and embedding it into host language documents. Specifically, to generate XFonns codes, the rules for generating XForms codes, which support complex types and map simple types to appropriate input controls, are proposed. Experimental results with various kind of schemas show that the proposed method can generate XForms interfaces successfully.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.65-71
• /
• 2009

Natural language processing is necessary in order to efficiently perform filtering tremendous information produced in information retrieval of world wide web. This paper suggested an algorithm for meaning of numerals in the text. The algorithm for meaning of numerals utilized context-free grammars with the chart parsing technique, interpreted affixes connected with the numerals and was designed to disambiguate their meanings systematically supported by the n-gram based words. And the algorithm was designed to use POS (part-of-speech) taggers, to automatically recognize restriction conditions of trigram words, and to gradually disambiguate the meaning of the numerals. This research performed experiment for the suggested system of the numeral interpretation. The result showed that the frequency-proportional method recognized the numerals with 86.3% accuracy and the condition-proportional method with 82.8% accuracy.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.367-378
• /
• 2015

This study was directed at the design of a hybrid algorithm for competition relation extraction. Previous works on relation extraction have relied on various lexical and deep parsing indicators and mostly utilize only the machine learning method. We present a new algorithm integrating machine learning with various filtering methods. Some simple but useful features for competition relation extraction are also introduced, and an optimum feature set is proposed. The goal of this paper was to increase the precision of competition relation extraction by combining supervised learning with various filtering methods. Filtering methods were employed for classifying compete relation occurrence, using distance restriction for the filtering of feature pairs, and classifying whether or not the candidate entity pair is spam. For evaluation, a test set consisting of 2,565 sentences was examined. The proposed method was compared with the rule-based method and general relation extraction method. As a result, the rule-based method achieved positive precision of 0.812 and accuracy of 0.568, while the general relation extraction method achieved 0.612 and 0.563, respectively. The proposed system obtained positive precision of 0.922 and accuracy of 0.713. These results demonstrate that the developed method is effective for competition relation extraction.

• Journal of KIISE:Software and Applications
• /
• v.35 no.1
• /
• pp.50-58
• /
• 2008

Most of Korean sentences are complex sentences which consisted of main clause and embedded clause. These complex sentences have more than one predicate and this causes various syntactic ambiguities in syntactic analysis. These ambiguities are caused by phrase attachment problems which are occurred by the modifying scope of embedded clause. To resolve it, we decide the scope of embedded clause in the sentence and consider this clause as a unit of syntactic category. In this paper, we use sentence patterns information(SPI) and syntactic properties of Korean to decide a scope of embedded clause. First, we split the complex sentence into embedded clause and main clause by the method that embedded clause must have maximal arguments. This work is done by the SPI of the predicate in the embedded clause. And then, the role of this embedded clause is converted into a noun phrases or adverbial phrases in the main clause by the properties of Korean syntax. By this method, the structure of complex sentence is exchanged into a clause. And some phrases attachment problem, which is mainly caused by the modifying scope, is resolved easily. In this paper, we call this method clausal segmentation for embedded clause. By empirical results of parsing 1000 sentences, we found that our method decreases 88.32% of syntactic ambiguities compared to the method that doesn't use SPI and split the sentence with basic clauses.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.78-87
• /
• 2002

A macroblock(MB) in MPEG coded domain can have zero, one, or two motion vectors depending on its frame type and prediction direction (forward-, backward-, or hi-directionally). In this paper, we propose a method that converts these motion vectors on MPEG coded domain as a uniform set, independent of the frame type and the direction of prediction, and directly utilizes these re-analyzed motion vectors for understanding video contents. Also, using this frame-type-independent motion vector, we propose novel methods for detecting and tracking moving objects with frame-based detection accuracy on the compressed domain. These algorithms are performed directly from the MPEG bitstreams after VLC decoding with little time consumption. Experimental results show validity and outstanding performance of our methods.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.551-554
• /
• 2006

Research Institutes of Government has produced various information about research, seminar, recent research trend, and so on. This information flows into project management organization and institute management organization. It is necessary to connect information systems of these organizations and institutes. The existing systems connect with self-defined protocol between the organizations and the institutes or HTML parsing method. but, these methods have many drawback for expanding and changing problem. This paper designs and implements science and technology information connection system using RSS.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.4
• /
• pp.46-51
• /
• 2012

Injection pressure, an important factor in filling process, should be minimized to enhance injection molding quality. Injection pressure can be controlled by valve gate open timing. In this work, we decided the valve gate open timing to minimize the injection pressure. To solve this design problem, we integrated MAPS-3D (Mold Analysis and Plastic Solution-3Dimension), a commercial injection molding CAE tool, to PIAnO (Process Integration, Automation and Optimization), a commercial PIDO (Process Integration, and Design Optimization) tool using the file parsing method. In order to reduce computational cost, we performed an approximate optimization using meta-models that replaced expensive computer simulations. At first, we carried out DOE (Design of Experiments) using OLHD (Optimal Latin Hypercube Design) available in PIAnO. Then, we built Kriging models using the simulation results at the sampling points. Finally, we used micro GA (Genetic Algorithm) available in PIAnO. Using the proposed design approach, the injection pressure has been reduced by 13.7% compared to the initial one. This design result clearly shows the validity of the proposed design approach.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.426-429
• /
• 2007

CrossRef operates a cross-publisher citation linking system based on the DOI(R) global identifier. The number of organization building a reference citations linking structure through CrossRef is increasing. This paper concentrates on developing a Citation Matcher Solution to effectively build the reference linking structure. Citation Matcher automatically builds and processes the reference citation and identifier mapping which used to be handled manually. After the copy & paste of the reference citation, analyzation is processed to parse the journal title, author name, volume, issue, and start pages from the free style text. CrossRef, PubMed, and YesKISTI's identifiers are collected by through a standardized method. Renovation of the building process for domestic scholastic resources' reference linking and matching will be made possible by using a Citation Matcher. The connection between resources and seamless access for the electronic full-text will enhance the usability.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.268-277
• /
• 2003

A document type definition(DTD) which defines tags for a document is a XML document grammar that defines syntactic structure of a document. An XML document keeps the rules and must be parsed to check validation. To parse XML document, the deterministic parsing method of programming language is irrelevant because it does not satisfy the definition of deterministic content model in element declaration. In this paper, we consider editing of a valid XML document in syntax-directed editing environment, and we suggest the internal storage representations of syntax in DTD and theirs algorithms. The consequence is that a syntactic structure of textual DTD is transformed into graph and table structures. The table structure of DTD is interpreted the context free grammar which has attribute values and is used in syntax-directed editor for XML. We called this the XML abstract grammar and showed generated results and examples.