• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.334-336
• /
• 2001

표절을 쉽게 알아내기 위해, 프로그램 유사성 검사기(CloneChecker)를 만들었다. CloneChecker는 프로그램을 요약해서, 유사성을 계산하고, 비슷한 그룹들로 묶어 낸다. CloneChecker는 두 프로그램의 모든 부 구문트리(abstract syntax sub-tree)들을 서로 비교하므로 구문의 사소한 변화에 민감하지 않으며, 그럼에도 해쉬 함수를 이용하여 빠르게 수행된다. CloneChecker는 실제 강의에서 사용되었으며, C, Java, Scheme, nML로 짜여진 프로그램들에 대해 동작한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.2 no.1
• /
• pp.59-77
• /
• 1992

본 논문은 컴퓨터 시스템의 보호 및 데이타 통신의 암호등과 관계가 있는 논리 프로그래밍에 대한 것이다. 본 논문에서 우리는 병력 논리프로그래밍 시스템에 대한 개선된 conteol strategy를 제안하였으며, 이에대한 형식적인 syntax와 semantics등을 정의하였다. 병렬 논리프로그램에 대한 병력성등을 분류하여, 이들이 어떻게 활용되는지 설명하였다. 또한 병렬 논리프로그램의 유도과정과 계산방식이 같은 alternating Turing machine이란 병렬 계산모형을 제안하여, 논리프로그램의 복잡도의 분석과 제안된 idea에 대한 타당성을 ATM을 이용하여 하였다.

• Journal of the Korean Society for information Management
• /
• v.18 no.1
• /
• pp.7-22
• /
• 2001

The DO1 is an opaque string or dumb number - nothing at all can inferred from the number. However some identifies can include some intelligence in the number itself, which will tell the user subject and meaningful information about the entity that is being identified. Therefore whether the DO1 suffix should be 'dumb' or 'meaningful' is a major issue in DO1 syntax structuring. Although the choice of DO1 Suffix is entirely optional, many DO1 registrants have been used existing IS0 standards such as SICI, ISBN, ISMN, etc. for identification of information resources. It is also important to consider that intelligence in a system of identifiers may be carried out by means of the DO1 structure. It was suggested that there should be an explicit part of the DO1 syntax which declares the meaningful information of the digital objects.

• The Journal of the Korea Contents Association
• /
• v.11 no.9
• /
• pp.515-523
• /
• 2011

It is important to manage large amount of information from various information providers for supporting recent information services such as providing global research trends, detecting emerging signal and listing leading researchers. For integrated management, definition of integrated metadata schema, data transformation and schema matching are needed. It is first necessary to analyze existing various metadata for defining integrated metadata schema. In this paper, we have analyzed several metadata of scientific journal papers by classifying semantics, content rules and syntax, and looked around considerations to make integrated schema or transform metadata. We have known that XML is used as a syntax for supporting convenience and various usage condition, and hierarchy element names and common elements in semantics are needed. We also have looked at elements having various content rules and related standards. We hope that this study will be used as basic research material of metadata integrated management, data transform and schema matching for interoperability.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.382-386
• /
• 2004

Recently, with the machine learning trend, most of the machine translation systems on over the world use two syntax tree sets of two relevant languages to learn syntactic tree transfer rules. However, for the English-Vietnamese language pair, this approach is impossible because until now we have not had a Vietnamese syntactic tree set which is correspondent to English one. Building of a very large correspondent Vietnamese syntactic tree set (thousands of trees) requires so much work and take the investment of specialists in linguistics. To take advantage from our available English-Vietnamese Corpus (EVC) which was tagged in word alignment, we choose the SITG (Stochastic Inversion Transduction Grammar) model to construct English- Vietnamese syntactic tree sets automatically. This model is used to parse two languages at the same time and then carry out the syntactic tree transfer. This English-Vietnamese bilingual syntactic tree set is the basic training data to carry out transferring automatically from English syntactic trees to Vietnamese ones by machine learning models. We tested the syntax analysis by comparing over 10,000 sentences in the amount of 500,000 sentences of our English-Vietnamese bilingual corpus and first stage got encouraging result $(analyzed\;about\;80\%)[5].$ We have made use the TBL algorithm (Transformation Based Learning) to carry out automatic transformations from English syntactic trees to Vietnamese ones based on that parallel syntactic tree transfer set[6].

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.9
• /
• pp.425-432
• /
• 2016

As the importance of information audit is getting bigger, the public corporations invest many expenses at information system audit to build a high quality system. For this purpose, there are much research to proceed an audit effectively. In database audit works, it could audit utilizing a variety of monitoring tools. However, when auditing SQLs which might be affected to database performance, there are several limits related to SQL audit functionality. For this reason, most existing monitoring tools process based on meta information, it is difficult to proceed SQL audit works if there is no meta data or inaccuracy. Also, it can't detect problems by analysis of SQL's syntax structure. In this paper, we design and implement the SQL Inspector using ANTLR which is applied by syntax analysis technique. The overall conclusion is that the implemented SQL Inspector can work effectively much more than eye-checked way. Finally, The SQL inspector which we proposed can apply much more audit rules by compared with other monitoring tools. We expect the higher stability of information system to apply SQL Inspector from development phase to the operation phase.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.21-26
• /
• 2006

The semantic web is an emerging paradigm in the information retrieval and Web-based system. This paper deals with a Web change detection system which employs the semantic web and ontology. While existing Web change detection systems detect the syntactic change, the proposed system focuses on the detection of the semantic change. The system detects the change only when the web has semantic change. To achieve this, the system employs the domain-specific ontology (e.g., computer science professional person information in the paper). The Web pages regarding before and after change are converted according to the ontology. Then the comparison is performed. The experimental result shows the semantic-based change detection is more useful than the syntax-based change detection.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.242-248
• /
• 2014

With the rapidly growing amount of information represented in RDF format, efficient querying of RDF graph has become a fundamental challenge. SPARQL is one of the most widely used query languages for retrieving information from RDF dataset. SPARQL is not only simple in its syntax but also powerful in representation of graph pattern queries. However, users need to make a lot of efforts to understand the ontology schema of a dataset in order to compose a relevant SPARQL query. In this paper, we propose a graph query formulation and processing scheme based on ontology schema information which can be obtained by summarizing RDF graph. In the context of the proposed querying scheme, a user can interactively formulate the graph queries on the graphic user interface without making efforts to understand the ontology schema and even without learning SPARQL syntax. The graph query formulated by a user is transformed into a set of class paths, which are stored in a relational database and used as the constraint for search space reduction when the relational database executes the graph search operation. By executing the LUBM query 2, 8, and 9 over LUBM (10,0), it is shown that the proposed querying scheme returns the complete result set.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.151-164
• /
• 2000

The Visual Object Query Language (VOQL) recently proposed for object databases has been successful in visualizing path expressions and set-related conditions, and providing formal semantics. However, VOQL has several problems. Due to unrealistic assumptions, only set-related conditions can be represented in VOQL. Due to the lack of explicit language construct for the notion of variables, queries are often awkard and less intuitive. In this paper, we propose VOQL*, which extends VOQL to remove these drawbacks. We introduce the notion of visual variables and refine the syntax and semantics of VOQL based on visual variables. We carefully design the language constructs of VOQL* to reflect the syntax of OOPC, so that the constructs such as visual variables, visual elements, VOQL* simple terms, VOQL* structured terms, VOQL* basic formulas, VOQL* formulas, and VOQL* query expressions are hierarchically and inductively constructed as those of OOPC. Most important, we formally define the semantics of each language construct of VOQL* by induction using OOPC. Because of the well-defined syntax and semantics, queries in VOQL* are clear, concise, and intuitive. We also provide an effective procedure to translate queries in VOQL* into those in OOPC. We believe that VOQL* is the first visual query language with the well-defined syntax reflecting the syntactic structure of logic and semantics formally defined by induction.

• Journal of Internet Computing and Services
• /
• v.6 no.1
• /
• pp.51-64
• /
• 2005

In this paper, we introduce a system for evaluating similarity of C program source code using method which compares syntax-trees each others. This method supposes two characteristic features as against other systems. It is not sensitive for program style such as indentation, white space, and comments, and changing order of control structure like sentences, code block, procedures, and so on. Another is that it can detect a syntax-error cause of using paring technique, We introduce algorithms for similarity evaluation method and grouping method that reduces the number of comparison, In the examination section, we show a test result of program similarity evaluation and its reduced iteration by grouping algorithm.