• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.735-738
• /
• 2000

인터넷과 데이터 통신의 발달에 따른 관련 기술의 발전과 대중화로 인하여 다양해진 정보를 손쉽게 구할 수 있게 되었고, 현재 통신산업의 환경 또한 급격히 변화하고 있다. 그러나, 과거의 정적인 텍스트 위주의 고정된 내용을 표현하는 웹 페이지 저작으로는 멀티미디어에 대한 급격히 증대되는 사용자의 요구를 수용할 수 없게 되었다. 이에 따라 1998년도에 시간에 기반을 둔 멀티미디어 데이터의 통합 및 동기화를 위한 효과적인 프리젠테이션 (Presentation)을 기술할 수 있는 SMIL(Synchronized Multimedia Integration Language)이 W3C(World Wide Web Consortium)의 Synchronized Multimedia Working Group (WG)에 의해 제안되었다. SMIL은 XML(eXended Markup Language)에 기반한 선언적 마크업 (Markup) 언어이며 텍스트 편집기 둥으로 쉽게 저작할 수 있으나, SMIL 또한 태그(Tag)기반 언어이므로 태그의 사용법을 숙지하여야만 효과적인 멀티미디어 프리젠테이션 제작이 가능하다. 이러한 난점을 극복하기 위해 본 논문에서는 Java를 기반으로 한 사용자 편의적인 SMIL 전용 저작도구의 설계, 구현 및 향후 개발 방향을 제시하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.22-22
• /
• 2001

정보량이 많은 고화질의 동영상을 실시간으로 전송하기 위하여 압축 알고리즘을 필수적으로 사용하고 있으며, 시간적 중복성을 제거하는 동영상의 압축방법은 움직임 추정 알고리즘을 사용한다. 본 연구에서 설계하고자 하는 움직임 추정기는 블록정합 알고리즘이며, MPEG 부호기에서 사용되는 DCT 연산 결과인 DC 값을 이용하여 화면의 밝기를 판단한다. 움직임 추정기는 휘도 신호 8비트 모두를 사용하지 않고, 화면 밝기에 따른 비트 플레인(bit plane)에서 3비트만 선택하는 비교선택기를 이용한다. 본 연구에서 제안한 비교 선택기는 I-Picture만을 계산한다. I-Picture에 의해 계산된 선택 비트는 I, P와 B Picture의 움직임 추정 연산에 사용함으로서 움직임 추정기의 크기를 줄일 수 있는 구조를 제안하였다. 제안된 움직임 추정기의 고찰을 위하여 실험에 사용된 표준 동영상의 해상도는 352×288이며, DCT 연산의 처리 블록은 8×8이며, 탐색 영역은 23×23이다. 제안된 알고리즘은 C언어로 모델링하였으며, 기존 완전탐색방법과 PSNR을 비교한 결과 사람의 시각으로 거의 구별할 수 없는 작은 차이(0～0.83dB)가 나타남을 알 수 있었다. 본 연구에서 제안한 움직임 추정기의 하드웨어 크기는 기존 구조Ⅰ보다 38.3%, 기존 구조Ⅱ보다 30.7% 줄일 수 있었고, 메모리 크기는 기존 구조Ⅰ,Ⅱ보다 31.3% 줄일 수 있었다.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.355-364
• /
• 2002

Recently, WWW(World Wide Web) has become a source of a large amount of information, and is now recognized not only as an information-sharing tool, but also as an information repository. Currently, the majority of documents on the web were created using HTML(Hypertext Markup Language). Although HTML is simple and easy to learn, its inherent lack of describing document structure makes it difficult to retrieve information effectively. One possible solution would be to convert such HTML documents into XML (extensible Markup Language) documents. This is a standard markup language for exchanging data on the web. It can describe a document structure freely by defining its own DTD (Document Type Definition). This makes it possible to integrate, store, and retrieve data on the web efficiently In this paper, we will propose a converter that automatically converts HTML documents with similar pattern into XML documents by analyzing the document structure and recognizing its path information.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.4
• /
• pp.79-86
• /
• 2016

About 75% of software security incidents are caused by software vulnerability. In addition, the after-market repairing cost of the software is higher by more than 30 times than that in the design stage. In this background, the secure coding has been proposed as one of the ways to solve this kind of maintenance problems. Various institutions have addressed the weakness patterns of the standard software. A new Korean programming language Saesark has been proposed to resolve the security weakness on the language level. However, the previous study on Saesark can not resolve the security weakness caused by the API. This paper proposes a way to resolve the security weakness due to the API. It adopts a static analyzer inspecting dangerous methods. It classifies the dangerous methods of the API into two groups: the methods of using tainted data and those accepting in-flowing tainted data. It analyses the security weakness in four steps: searching for the dangerous methods, configuring a call graph, navigating a path between the method for in-flowing tainted data and that uses tainted data on the call graph, and reporting the security weakness detected. To measure the effectiveness of this method, two experiments have been performed on the new version of Saesark adopting the static analysis. The first experiment is the comparison of it with the previous version of Saesark according to the Java Secure Coding Guide. The second experiment is the comparison of the improved Saesark with FindBugs, a Java program vulnerability analysis tool. According to the result, the improved Saesark is 15% more safe than the previous version of Saesark and the F-measure of it 68%, which shows the improvement of 9% point compared to 59%, that of FindBugs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.5
• /
• pp.451-457
• /
• 2005

In spite of the development of computers, the present state that a lot of electronic documents are overflowing makes it more difficult for us to get appropriate information. Therefore, it's more important to focus on getting meaningful information than processing the data quickly In this context, Semantic Web enables an intelligent processing by adding semantic metadata on yow web documents. Also, as the Semantic Web grows, the knowledge resources as well as web resources are getting more and more importance. In this paper, we propose an OWL storage system aiming at an intelligent Processing by adding semantic metadata on your web documents, plus a system aiming at an OWL-QL Query Processing.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.110-112
• /
• 2011

GPU의 병렬성과 연산능력을 일반적인 공학적 문제 해결에 적용하는 GPGPU 컴퓨팅에 대한 연구가 최근 활발히 진행되고 있다. 비디오 압축과정에는 많은 양의 화소 데이터에 동일하게 반복되는 연산을 수행하는 알고리즘이 많이 적용되므로 GPGPU를 통한 고속 병렬 계산의 응용 분야로 매우 적합하다. H.264/AVC는 비디오를 압축하는 가장 최신의 국제표준으로 여러 제품군과 서비스에 대한 적용되어 시장에서 널리 사용되고 있다. 본 논문에서는 GPGPU의 응용 분야로 주목 받고 있는 비디오 압축 분야에 대한 적용으로 H.264/AVC의 화면내 예측 모드 결정과정에 GPGPU 병렬 프로그래밍을 적용하여 예측 모드 결정 속도를 향상하는 방법을 제안한다. GPU상에서의 데이터 병렬처리를 위해 CUDA C언어를 사용하였으며, CPU상에서의 연산은 C언어를 사용하여 구현되었다. GPU상에서 프레임 전체에 대한 화면내 예측 모드를 병렬적으로 결정함으로써 이에 소요되는 시간을 줄여 줄 수 있었다. 실험결과 GPU상에서 병렬적으로 예측 모드를 결정할 때 Full-HD급 영상에서 약 2.8배 정도의 속도 향상을 확인할 수 있었다. 향후 GPGPU 병렬 프로그래밍을 화면 내 예측뿐만 아니라 반복되는 연산을 수행하는 다른 알고리즘에도 적용하여 부호화기의 계산 부담을 덜어준다면 고속 실시간 비디오 압축 부호기 개발이 더욱 용이해 질것으로 기대된다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.4
• /
• pp.206-211
• /
• 2005

We describe the design for a correlator and an access code generator in bluetooth system. These are used for a connection setting, a packet decision and a clock synchronization between Bluetooth units. The correlator consists of two blocks; carry save adder based on Wallace tree and threshold-value decision block. It determines on an useful packet and clock-synchronization for input signal of 1.0Mbps through the sliding-window correlating. The access-code generator also consists of two blocks; BCH(Bose-Chadhuri-Hocquenghem) cyclic encoder and control block. It generates the access-codes according to four steps' generation process based on Bluetooth standard. In order to solve synchronization problem, we make use of any memory as a pseudo random sequence. The proposed correlator and access-code generator were coded with VHDL. An FPGA Implementation of these modules and the simulation results are proved by Xilinx chip. The critical delay and correlative margin based on synthesis show the 4.689ns and the allowable correlation-error up to 7-bit.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.1-8
• /
• 2002

XML has been proposed as an international standard for organizing and exchanging a great diversity of the Web data. It is important to retrieve components of stored XML documents that are needed by a wide variety of applications. In this paper, we suggest a method to store XML documents and to retrieve an XML data. In other words, we suggest the method of retrieving XML data is using XML -QL. So we need to mapping XML-QL to SQL translator on top of an RDBMS. The contributions of this paper include, besides the detailed design and implementation of the translator, demonstration of feasibility of such a translator, and a comprehensive classification of XML queries and their mappings to SQL relational queries.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.77-88
• /
• 2008

Having observed the restriction of the current Web technology, the semantic Web has been developed, and it now has grown up with the core help of the W3C to a level where it recommends the OWL Web ontology language. Besides, in order to deduce the information out of OWL data, several inference systems have been developed such as Jena, Jess, and JTP. Unfortunately, however, quite few systems can effectively handle recently developed OWL data, and further, due to the limitation of file-based operation, the current inference systems cannot meet the requirements for handing huge OWL data. An efficient method for storing and searching ontology data is essential for ensuring stable information inference processes. In this study, firstly, we proposed a model based on the database management system to transform and store OWL data and to enable deduction process from the database. Secondly, we designed and implemented an effective OWL storing system based on our model. Finally, we compare our system with the previous inference systems through experimental performance analysis.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.148-155
• /
• 2002

Multithreaded models improve the efficiency of parallel systems by combining inner parallelism, asynchronous data availability and the locality of von Neumann model. This model executes thread code which is generated by compiler and of which quality is given by the method of generation. But multithreaded models have the demerit that execution model is restricted to a specific platform. On the contrary, Java has the platform independency, so if we can translate from threads code to Java bytecode, we can use the advantages of multithreaded models in many platforms. Java executes Java bytecode which is intermediate language format for Java virtual machine. Java bytecode plays a role of an intermediate language in translator and Java virtual machine work as back-end in translator. But, Java bytecode which is translated from multithreaded models have the demerit that it is not secure. This paper, multhithread code whose feature of platform independent can execute in java virtual machine. We design and implement translator which translate from thread code of multithreaded code to Java bytecode and which check secure problems from Java bytecode.