• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.443-447
• /
• 2002

As major industries become information-centered, business transactions and information-sharing processes are being computerized and automated, which ultimately re-defines electronic commercial transactions in a broader context. Business documents are the basic tools for corporate transactions. The use of business documents in electronic commercial transactions has increased markedly and this sphere is rapidly being extended to include information sharing between companies. XML(extensible Markup Language) was selected as the focus for this thesis. XML ran help to make a complicated and data-rich document easy to share. The thesis proposes a business XML document editing system, comprised of a style document editor for business XML document structure, business documentation, and business document presentation, along with a business document transformation system which makes a transformation possible regardless of platform or using various corporate document standards.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.650-661
• /
• 2005

As the Internet is growing, the use of XML which is a standard of semi-structured document is increasing. Therefore, there are on going works about integration and retrieval of XML documents. However, the basis of efficient integration and retrieval of documents is to cluster XML documents with similar structure. The conventional XML clustering approaches use the hierarchical clustering algorithm that produces the demanded number of clusters through repeated merge, but it have some problems that it is difficult to compute the similarity between XML documents and it costs much time to compare similarity repeatedly. In order to address this problem, we use clustering algorithm for transactional data that is scale for large size of data. In this paper we use common structures from XML documents that don't have DTD or schema. In order to use common structures of XML document, we extract representative structures by decomposing the structure from a tree model expressing the XML document, and we perform clustering with the extracted structure. Besides, we show efficiency of proposed method by comparing and analyzing with the previous method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.368-380
• /
• 2005

File systems for flash memory that is widely used as a storage device for mobile devices should provide not only high-performance data reads and writes but also a guarantee on the data integrity even on a power failure. In this paper, we explain the design and implementation of a file system for flash memory that considers flash memory's physical characteristics and the data layout in the file system to give an optimized write performance. This file system guarantees the reliability against various system failures including a power failure by using the transaction concept in write processing. In addition, the file system minimizes the memory usage by using a simple static mapping. In the paper, we also describe the implementation of the file system and compare its performance with other existing flash memory ille systems.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.548-548
• /
• 2015

과거 1990년대에 인터넷 이용이 전 세계로 확산되면서 World Wide Web를 이용하여 다양한 웹 서비스 기술의 구현 및 유통은 현재에도 개발되고 있다. 일반적으로 오늘날의 서비스는 XML 및 인터넷을 통하여 웹 서비스로 구현한 응용프로그램간의 연동을 가능하게 하는 기반기술이다. 이는 단순 객체 접근 프로토콜(SOAP), 웹 서비스 기술 언어(WSDL), 전역 비즈니스 레지스트리(UDDI) 등의 표준 기술을 사용하여 네트워크에 연결된 다른 컴퓨터 간의 분산 컴퓨팅을 지원하는 소프트웨어 및 기술이다. 이러한 웹 서비스의 발전으로 웹 서비스의 성능이 웹 서비스 제공자의 성패를 좌우하게 되고, 제공하고 있는 웹 서비스에 대한 검증이 필요하게 되었다. 웹 서비스에 대한 검증은 미국 Bloor NA(Bloor Research-North America)에서 웹 서비스 아키텍처의 단점을 발표하여 서비스의 품질과 신뢰성 및 개선점에 대하여 제시되어 활발한 연구가 진행 중에 있다. 그러나 사용자 관점에서 웹 서비스의 성능을 측정하고, 단순한 서비스 제공자의 서비스 검증 목적만이 아닌 서비스 제공자의 성능을 서비스 사용자에게 제공하는 검증 방법에 관한 연구가 많지 않은 실정이다. 하천공간정보에 대하여 웹 서비스 방식 중 통신 프로토콜인 HTTP 등을 이용한 인터넷상의 메시지 교환을 가능하게 하는 통신 프로토콜인 SOAP 및 WWW와 같은 분산 하이퍼미디어 시스템을 위한 소프트웨어 아키텍처의 한 형식인 REST(Representational State Transfer)를 실행하여 이에 따른 검증 프로세스를 수립하였다. 하천공간정보 웹 서비스에 대한 테스트 시나리오는 응답시간, 임계성능, 이용가능성, 신뢰성 및 접근성에 대하여 검증하며 하나 이상의 웹 서비스들 간의 호환성 표준의 준수 여부와 상호 운용 가능 여부를 테스트 하는 상호운용성 테스트, 신뢰성 메시징 및 분산 환경에서의 트랜잭션 처리 성능을 검증하는 웹 서비스 프로세스 품질 테스트를 실시하는 방안을 도출하고자 한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.85-91
• /
• 2019

In this paper, we propose a new logging and recovery scheme that is suited for the high-performance transaction processing system base on flash memory storage. The proposed scheme is designed by considering flash's I/O characteristic of asymmetric costs between page update/read operations. That is, we substitute the costly update operation with writing and real-time usage of snapshot log, which is for the page-level physical redo. From this, we can avoid costly rewriting of a dirty page when it is evicted form a buffering pool. while supporting efficient revery procedure. The proposed scheme would be not lucrative in the case of HDD-based system. However, the proposed scheme offers the performance advance sush as a reduced number of updates and the fast system recovery time, in the case of flash storage such as SSD (solid state drive). Because the proposed scheme can easily be applied to existing systems by saving our snapshot records and ordinary log records together, our scheme can be used for improving the performance of upcoming SSD-based database systems through a tiny modification to existing REDO algorithms.

• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.57-65
• /
• 2019

Creative works such as webtoon and web novel are part of property rights. However, illegal copies of them are distributed on the internet easily, which raises social issues in today's society. In order to tackle these problems, this paper proposes and presents a blockchain based copyright management system that ensures forgery prevention, robust security features, improving trading performance, cost-effective, and enhanced visibility. The system allows a user to register creative works formally just the same as before registration and also to register simple creative ideas just anytime. In the latter case, if an idea or a thought flashes across through somebody's mind, he or she can register it to the system immediately without formal registration process and afterward, can utilize a way to prove its originality through the system. Regarding large size images and video files of creative works, the system reduces data size and storage volume sharply to be processed by network entities by storing original creative works separately and including only the hash result of creative works to the transactions.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.2
• /
• pp.45-52
• /
• 2021

In this paper, we propose a method of generating theme, background amd signal music usage monitoring information based on a blockchain, in which the music usage informations are recorded by the monitoring tool using feature-based filtering of monitoring organizations. Theme, background and signal music are music inserted into the broadcasting contents of broadcaster. Since they are recognized as created contents just like normal music, there are lyricists and composers who have the right for those music and all copyright holders of them have to receive the corresponding copyright fees, once the music was used in the broadcast. However, there are problems with inaccurate monitoring results for music usage, due to the omission of usage details and non-transparent settlement method. In order to solve these problems, If the information generation method proposed in this paper, accurate music usage history can be created, the details are stored in the blockchain without changes or omissions, and transparent settlement and distribution are possible by smart contract, avoiding the current non-transparent settlement method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.1060-1070
• /
• 2022

With the development of information technology, the size of the system has become larger and diversified, and the existing role-based access control has faced limitations. Blockchain technology is being used in various fields by presenting new solutions to existing security vulnerabilities. This paper suggests efficient role-based access control in a blockchain where the required gas and processing time vary depending on the access frequency and capacity of the storage. The proposed method redefines the role of reusable units, introduces a hierarchical structure that can efficiently reflect dynamic states to enhance efficiency and scalability, and includes user-centered authentication functions to enable cryptocurrency linkage. The proposed model was theoretically verified using Markov chain, implemented in Ethereum private network, and compared experiments on representative functions were conducted to verify the time and gas efficiency required for user addition and transaction registration. Based on this in the future, structural expansion and experiments are required in consideration of exception situations.

• The Journal of Society for e-Business Studies
• /
• v.21 no.2
• /
• pp.47-59
• /
• 2016

Parcel service is to deliver goods from one place to the designated destination requested according to user request. Parcel operations such as sorting, distributing, etc. or the managed information are heterogeneous by the companies. Additionally, it is impossible to support interoperability between companies with unformatted data of manual processing. Most parcel package boxes attached to paper typed waybill is attached is delivered to consignee. So, security problems such as personal information leaking are occurred, or extra processing time and logistics costs are needed due to wrong or the damaged information. Business environment of parcel service is rapidly changed as introducing unmanned delivery or the advanced technology such as Internet of Things. User want to know the accurate status or steps from parcel service request to delivery. To provide these requirements, the unified and integrated waybill information for reliable transportation of parcel service is needed. This information will provide to pickup or delivery carrier, warehouse or terminal, and parcel service user per pickup, transport, and delivery stage of parcel delivery service. Therefore, this paper defines the simplified and unified information model for parcel service waybill by analyzing information systems used for logistics unit processes that is occurred to parcel service, and manual work processes, and developing the relevant information of work flows occurred between business processes or transactions with the collected or processed information by from parcel service's stages. It is possible to share these standard model between business entities, and replacing paper typed waybill will improve national life safety as preventing security threats by paper typed waybill. As a result, it will promote the public interest from the stakeholder's perspective.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.97-111
• /
• 2008

Commercial data mining tools basically support binary attributes only in mining association rules, that is, they can mine binary association rules only. In general, however. transaction databases contain not only binary attributes but also quantitative attributes. Thus, in this paper we propose a systematic approach to mine quantitative association rules---association rules which contain quantitative attributes---using commercial mining tools. To achieve this goal, we first propose an overall working framework that mines quantitative association rules based on commercial mining tools. The proposed framework consists of two steps: 1) a pre-processing step which converts quantitative attributes into binary attributes and 2) a post-processing step which reconverts binary association rules into quantitative association rules. As the pre-processing step, we present the concept of domain partition, and based on the domain partition, we formally redefine the previous bipartition and multi-partition techniques, which are mean-based or median-based techniques for bipartition, and are equi-width or equi-depth techniques for multi-partition. These previous partition techniques, however, have the problem of not considering distribution characteristics of attribute values. To solve this problem, in this paper we propose an intuitive partition technique, named standard deviation minimization. In our standard deviation minimization, adjacent attributes are included in the same partition if the change of their standard deviations is small, but they are divided into different partitions if the change is large. We also propose the post-processing step that integrates binary association rules and reconverts them into the corresponding quantitative rules. Through extensive experiments, we argue that our framework works correctly, and we show that our standard deviation minimization is superior to other partition techniques. According to these results, we believe that our framework is practically applicable for naive users to mine quantitative association rules using commercial data mining tools.