• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.111-122
• /
• 2014

Legislation are social norms that give directly or indirectly, huge impact on the social or corporate, personal problems, unlike a normal document. Also, over time it has a feature constantly changing by the laws enactment and amendment, repealed. The amendment statement automatic generated system is used for purpose of proclamation to those. However, existing system is able to generate amendment statement just text body of law how compare and analyze the current legislation and amendment legislation. However, actual legislation to be created attached table of the table form in complex structure besides simple text form as body text. In this paper, we additional implement attached table processing to existing the amendment statement automatic generated system that containing the table does not handle attached table. We were analyse to the amendment statement generated grammar and table structure in attached table of the legislation for processing to attached table. Also proposed a method to compare attached table in the table. So, it is enable the automatic generation with amendment statement which various forms of legislation the documents.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.179-192
• /
• 2007

Based on ontologies, semantic Web services enable the discovery, selection, and composition. OWL-S is a do facto standard ontology for describing semantics of Web services. Due to the difficulty of the OWL-S grammar, the teaming curve for constructing OWL-S description manually can be steep. This paper presents an efficient method for generating OWL-S descriptions from UML diagrams, which are widely used for software design and development. The proposed method is based on UML profiles to generate an OWL-S ontology from sequence or activity diagrams, which represent the behavior of a business process. Specifically, an XMI file extracted from UML diagrams is transformed into an OWL-S description via an XSLT script. Experimental results with a large volume of UML diagrams show that the proposed method deals with the control flow of complex processes and is superior to previous methods.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1076-1087
• /
• 2010

Together with a new advent of embedded processor developed to support specific application area and it evolution, a new research of software development to support the embedded processor and its commercial challenge has been revitalized. Retargetability is typically achieved by providing target machine information, ADL, as input. The ADLs are used to specify processor and memory architectures and generate software toolkit including compiler, simulator, assembler, profiler, and debugger. The EXPRESSION ADL follows a mixed level approach-it can capture both the structure and behavior supporting a natural specification of the programmable architectures consisting of processor cores, coprocessors, and memories. And it was originally designed to capture processor/memory architectures and generate software toolkit to enable compiler-in-the-loop exploration of SoC architecture. In this paper, we designed the class-based ADL based on the EXPRESSION ADL to promote the write-ability, extensibility and verified the validation of grammar. For this works, we defined 6 core classes and generated the EXPRESSION's compiler and simulator through the MIPS R4000 description.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.44-57
• /
• 2001

In order to synthesize grammatically correct Korean voices, we have to refer to the 'Standard Pronunciation Rules(SPR)' stated in the 'Standard Grammar of Korean Language.' Therefore, the rules that is used for a Korean-voice-synthesis system to find Korean voices corresponding to a given Korean sentence must completely reflect the SPR and must be sound. However, in the field of computer science they have just used the SPR without proving the completeness and soundness of their rules. In this paper, we construct a Petri net model for each rule of SPR, integrate all the Petri net models to build one big Petri net completely representing SPR, and analyse the Petri net to prove the consistency of it. Then, we transfer the Petri net model into a look-up table for Korean voice. Using this table, we can avoid the drawbacks of existing approaches such as going through several stages or repetitively applying a converting process.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.321-327
• /
• 2000

Geographical Information System (GIS) is composed of hardware, software, data, and methods. Among the components, data is considered to be the most important factor in GIS. In this paper, we describes HVF, the most recent technology pioneered by GIS researchers. HVF is a format for efficient usage of spatial object in order to express, save and transform in Internet GIS. Fist, we describe the definition of HVF syntax, then the implementation of Header Section Generation Module and Main Section Generation Module through the API. Second, we develop a spatial object converter for HVF to transform figures into data structures, which are compatible among different GIS applications. For this purpose, we design and implement three units of modules, which are File Manipulation, HVF Import and HVF Export Module. Since the issues of network traffic and Hangul processing in Internet GIS are important, we expecially consider development of HVF in terms of spatial data size.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.845-850
• /
• 2010

Incremental parsing has been developed to reuse the parse result of the original string during the parsing of a new string. The previous incremental LL(1) parsing methods precomputed the reusable point information before parsing and used it during parsing. This paper proposes an efficient reusable point computation by factoring the common part of the computation. The common symbol storing method and the distance storing method were previously suggested to find the reusable point, and by combining the methods, this paper gives the storing method of the distance to common symbols. Based on it, an efficient incremental LL(1) parser is constructed.

• 한국정보교육학회:학술대회논문집
• /
• 2011.01a
• /
• pp.15-22
• /
• 2011

Most of the robot programming curriculums consists mainly of understanding robot programming language and learning a simple grammatical sentences rather than logical problem solving process, these curriculums impose a burden on childrens' learning. Storytelling offers opportunities for continuation of childrens' positive learning motivation to practice symbolic manipulations, hold multiple abstract concepts in their heads, and create meaning between these ideas. In this paper, to overcome the difficulty of robot programming curriculum in elementary school and find teaching method which derives the childrens' motivation, we used storytelling in study of our robot programming curriculum.

• Annual Conference on Human and Language Technology
• /
• 1996.10a
• /
• pp.464-468
• /
• 1996

본 논문에서는 한국어 의존관계 파서의 정확성 및 효율성을 높이기 위해 구구조 내의 지역적 수식 특성을 반영할 수 있는 지역 의존관계의 사용을 제안한다. 의존문법은 자유어순 언어를 잘 설명할 수 있는 장점이 있지만, 전체 문장구조에 관한 의존제약이 너무 미약하기 때문에 단순히 어절간 구문 의존 제약만으로는 원하지 않는 분석 결과가 너무 많이 생성된다. 그러나 자유어순 언어라 하더라도 지역적인 구구조에는 일정한 어순 제약이 존재한다. 명사구, 용언구 등과 같은 구구조를 분석해 보면 수식어의 지배소는 반드시 그 구 안에 있다. 이러한 구조 정보에 기반을 둔 지역 의존관계 규칙을 이용하면 하나의 의존소에 대해서 지배소로 사용될 수 있는 어절의 범위를 제한하여, 원하지 않는 분석 결과를 줄일 수 있다. 한국어는 기본 문장 구조가 그대로 사용되기보다는 하나 이상의 수의 요소들이 첨가되어 보다 긴 문장 구조로 사용되는 경우가 많기 때문에, 본 논문에서 제안한 방법은 시스템 전체의 성능 및 효율을 크게 향상시킬 수 있다. 실험에서는 파싱의 첫 번째 단계에서 지역 의존관계 규칙을 사용하였을 경우 사용하지 않았을 때에 비해서 의존관계의 수가 평균 69% 정도로 줄어들었다.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.313-322
• /
• 2005

In order to access digital items in a server via ubiquitous devices, the digital items should be adapted according to the system environment, device characteristics and user preferences. In ubiquitous environment, those device-dependent adaptation requirements are not statically determined and not predictable. Therefore an application specific adaptation mechanism can not be applied to a general digital item adaptation engine. In this paper, we propose an application independent digital item adaptation architecture which has a set of minimal transcoders, transcoding path generator for a required adaptation requirement, and adaptation scheduler. And a CFG based method of finding a sequence of multiple unit transcoders called a transcoding path Is described in detail followed by experimental results.