• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.203-211
• /
• 2008

Due to the advent of presumer and digital production of moving picture, a lot of UCC has been generated by editing the previous moving pictures in various way. It causes a lot of problems on copyright, duplication, and content. In reorganizing the contents, it is necessary to increase productivity and reusability by managing production pipeline systematically through the standardization of moving picture content. For this purpose, we try to develop the moving picture content management system that can manage all kinds of information on the production pipeline, based on SCORM of e-learning by considering production, publication and re-editing. Using the meta-data of content object, user and producer can easily search and reuse the contents. Hence, they can choose the contents object according to their preference and reproduce their own creative UCC by reorganizing and packaging the selected objects. The management of copyright by the unit of scene would solve the problem of copyright. The sequencing technique of SCORM as an interactive storytelling method makes it possible to produce individual contents by user's preference.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1021-1030
• /
• 2004

When any data-centric XML documents are stored and managed in RDBMS, schema extracting from XML Schema is an imminent problem. Furthermore, when they are stored in partitioned way on created table, lots of null values will be produced and/or be increased cost for join, so we need a solution to solve these problems. This paper proposes a Schema Hybrid Inlining technique to generate relational schema of XML documents. The suggested technique creates a relational schema based on the XML Schema graph. Also, the technique expands the legacy Inlining method by manual and heuristic processing table generation method of cardinality and in-degree. Then, an ancestor node, terminal node, and creating a new table on the derived relation in this technique. DTD-dependent storage method uses partitioned storing and relation path element information reformed structured-searching method to reduce joining operation cost that is a weak point of it.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1231-1242
• /
• 1997

This paper deals with an IP mukticast protocol in support of host mobility. Most of the previous multicast schemes have utilized an underlying logical strucuture of network topology,in order to provide a certain degree of order and predictability.On the other hand,mobility implies that a host location relaative to the rest of the net-work changes with time;the physical connectivity of the entire network is thus modified as move.In this case.some multicast datagrams nay not delivered properly,or may delivered twice or more,to a mobile host because the destinations will keep moving whlist datagrams are dekivered with different time delay.This paper first describes the relation between host mobility and multicast, by exploring the possible interactions,and presents a multicast scheme in support of Internet host mobility.A revised scheme is then proposed to adapt the multicast semantic and to optimize the communication overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.795-805
• /
• 2012

This paper proposes an algorithm and a hardware architecture for a broadcast communication which has the worst bottleneck among multiprocessor using distributed memory architectures. In conventional system, The pipelined broadcast algorithm is an algorithm which takes advantage of maximum bandwidth of communication bus. But unnecessary synchronization process are repeated, because the pipelined broadcast sends the data divided into many parts. In this paper, the MPI unit for pipeline chain algorithm based on circuit switching removing the redundancy of synchronization process was designed, the proposed architecture was evaluated by modeling it with systemC. Consequently, the performance of the proposed architecture was highly improved for broadcast communication up to 3.3 times that of systems using conventional pipelined broadcast algorithm, it can almost take advantage of the maximum bandwidth of transmission bus. Then, it was implemented with VerilogHDL, synthesized with TSMC 0.18um library and implemented into a chip. The area of synthesis results occupied 4,700 gates(2 input NAND gate) and utilization of total area is 2.4%. The proposed architecture achieves improvement in total performance of MPSoC occupying relatively small area.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.149-158
• /
• 2012

As service-oriented software is considered as one of solutions to fulfill the users' needs in internet service environment, it has been increased the demands of reliable service development by the composition of internet services. However a critical issue in the service development approach is to satisfy the performance requirement as well as the functional correctness for the developing services, because impatient user multiply clicks the request-button of service without a short waiting. This paper proposes a framework to examine the performance of composite service. Our testing framework provides the data of service response time to service developer by measuring the service execution time. We develope an Aspect-based timer service, and weave the service with existing services to measure the execution time. Additionally, we perform some experiments to confirm the usefulness of performance test for composite service. This framework can support to develop a good performance service by substitution of the dragging service with another new service that will be a component of composite service.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.623-632
• /
• 2007

GML is a markup language presented as exchange standard for geographic information by the OGC(Open GIS Consortium). In spatial network databases, researches for supporting GML(Geographic Markup Language) can be divided into the parsing, the storing and the retrieval of GML documents. Among them, the study on the storage of GML documents is essential for their efficient retrieval. However there is little research on the storing of GML documents whereas there have been a lot of researches on the storing of n documents. Because the storage schema designed for XML documents are not appropriate for geographic information, we, in this paper, propose three storage schema for efficiently storing GML documents including geographic information in order to solve the problem that the XML storage schema store duplicate data and need to search many tables for obtaining elements. In addition, we design and implement a low-level storage manager which can store GML documents using the proposed GML storage schema.

• Annual Conference on Human and Language Technology
• /
• 2012.10a
• /
• pp.23-28
• /
• 2012

번역을 지원하는 도구로 자동 번역 시스템을 효율적으로 활용하기 위해 중요한 것은 자동 번역에 적합하도록 원문을 작성하거나 이미 작성된 원문에 대한 전처리 작업을 하는 것이다. 본 연구의 궁극적인 목표는 제품 설명서 작성자가 통제언어 체커를 통해 통제언어 규칙들을 적용하여 원문을 작성하도록 하는 것이다. 본 논문은 그 중간 단계로써 제품 설명서에 나타나는 문제 사항이 번역 품질에 어떠한 영향을 미치는지 밝혀내는 것을 목적으로 한다. 연구 대상은 제품 설명서에서 자동 번역의 성능을 저해시키는 요소 중 중의적 명사 수식 구문이다. 이러한 명사 수식 구문들은 분석 단계에서 구조적인 모호성을 초래하여 한국어 분석의 정확도를 떨어뜨리기 때문에 결과적으로 번역 품질을 악화시킬 수 있다. 이를 검증하기 위해 우선 제품 설명서 데이터를 분석하여 자동 번역 결과에 부정적인 영향을 미치는 명사 수식 구문을 다음과 같이 4가지로 유형화 하였다. (유형 1) 관형격 명사구 + 명사 병렬 접속, (유형 2) 동사의 관형형이 수식하는 명사구 + 명사 병렬 접속, (유형 3) 관형격 조사 '의' 중복, (유형 4) 병렬 접속어를 잘못 쓴 경우, 각각의 유형에 대해서 한국어 분석 단계에서 발생할 수 있는 문제에 대해 설명하였으며, 문제 사항에 대해 통제언어 규칙을 제시하였다. 통제언어 규칙에 따라 중의적 명사 수식 구문을 수정한 결과, 한국어 원문의 번역결과보다 한국어 수정문의 번역결과가 작성자의 의도를 더 잘 나타낸다는 것을 확인할 수 있었다.

• The Journal of Korean Association of Computer Education
• /
• v.16 no.5
• /
• pp.39-47
• /
• 2013

In the case of a weak self-control youth, young students easily tend to fall into addiction by using the Internet as a sensation seeking and an alternative to escape the reality. Until now, internet addiction self-diagnosis techniques such as Internet addiction scale have been developed and used to solve this kind of internet addiction issue. However, traditional methods do not assess the correlation of addiction and the effects of the environment systematically because they are simply composed of redundant addiction scale criteria and questionnaire forms of the diagnostic methods. Thus, in this paper, we propose a new internet addiction self-diagnosis technique based on Formal Concept Analysis (FCA) and implement a self-diagnosis system in order to make a systematic internet addiction self-diagnosis system. In addition, we analyze the correlation of the measured data based on different perspectives such as home environment, family relationships, peer relationships, school life, and so on.

• Geophysics and Geophysical Exploration
• /
• v.6 no.1
• /
• pp.1-6
• /
• 2003

As a consequence of geophysical surveys for large-scale constructions and ground investigations, huge amount of geophysical data are collected. However, due to the lack of the systematic management of such data, most of them are used temporarily and kept in dead storage, which in turn leads the abuse of social properties. To propose the solution of this kind of problem, geophysical data are kept in database using geographical information system (GIS). The introduction of GIS in geophysical data management allows the efficiency in data management and user-friendliness in data access. This data management system is especially appropriate for the many geological companies and the government organizations in systematic data management and sharing so that the time ,md financial expenses are greatly reduced. This system even provides the basic data services for the efficient development and conservation of the surface and underground spaces.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.388-398
• /
• 2002

Video representation through representative frames (key frames) has been addressed frequently as an efficient way of preserving the whole temporal information of sequence with a considerably smaller amount of data. Such compact video representation is suitable for the purpose of video browsing in limited storage or transmission bandwidth environments. In a case like this, the controllability of the total key frame number (i.e. key frame rate) depending on the storage or bandwidth capacity is an important requirement of a key frame selection method. In this paper, we present a sequential key frame selection method when the number of key frames is given as a constraint. It first selects the desired number of initial key frames and determines non-overlapping initial time intervals that are represented by each key frame. Then, it adjusts the positions of key frames and time intervals by iteration, which minimizes the distortion. Experimental result demonstrates the improved performance of our algorithm over the existing approaches.