• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.3
• /
• pp.31-37
• /
• 2008

MPEG 4 Part 20 LASeR (ISO/IEC 14496 20) is a specification designed to deliver rich media services in a mobile environment. The specification is an emerging standard that can replace the MPEG 4 BIFS specification designed to deliver PC based heavyweight media contents. The specification describes the representation of scene information in a resource constrained mobile environment. Unlike the BIFS standard designed to deliver heavyweight rich media, the LASeR specification has a restricted description that conforms to the SVG Tiny 1.2 specification. Also, the specification has an advantage of allowing for the efficient conversion of one graphics format to another. In this paper, we present the design and the implementation of a LASeR authoring system that allows for fast and efficient creation of interactive rich media contents in a mobile environment. The Gill interface of the authoring system presented in this paper allows users, who do not have prior knowledge of the scene description language, to conveniently create contents and store the produced scenes using the internal list data structure. The system allows users to navigate scene objects internally stored and to create LASeR XML files in the structured XML format.

• IE interfaces
• /
• v.13 no.2
• /
• pp.258-265
• /
• 2000

EDI(Electronic Data Interchange) allows the exchange of business information and computer-processable data in a standard, structured format electronically between organizational entities. EDI handles the restructuring of a business document into the standard format so that it can be transmitted from one computer to another. This paper identifies features and technologies of web browsed electronic document exchange system as follows 1) the fundamental technologies that consists of the EDI technologies, the Internet/Web technologies, the security/authentication techniques, and the XML implementation technologies. 2) the functions that consists of the document standards, transfer technology of the document, encryption and authentication 3) the implemented Web-EDI systems that consists of document generation module, encryption and authentication module, transfer module, acknowledgement module, administration module. In this paper, the Web-based EDI system implemented from the researched technologies will be installed on the EDI servers owned by corporate customers and enable the exchange of documents between each installed companies.

• Language and Information
• /
• v.6 no.2
• /
• pp.33-55
• /
• 2002

This research aims at transforming the definition tort of an English-English-Korean Dictionary (EEKD) which is encoded in EST files for the purpose of publishing into a structured format for Lexical Data Base (LDB). The construction of LDB is very time-consuming and expensive work. In order to save time and efforts in building new lexical information, the present study tries to extract useful linguistic information from an existing printed dictionary. In this paper, the process of extraction and structuring of lexical information from a printed dictionary (EEKD) as a lexical resource is described. The extracted information is represented in XML format, which can be transformed into another representation for different application requirements.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.14
• /
• pp.5545-5550
• /
• 2014

Background: Human biological materials from cancer patients are linked directly with public health issues in medical science research as foundational resources so securing "human biological material" is truly important in bio-industry. However, because South Korea's national R and D project lacks a proper managing system for establishing a national standard for the outputs of certain processes, high-value added human biological material produced by the national R and D project could be lost or neglected. As a result, it is necessary to develop a managing process, which can be started by establishing operating guidelines to handle the output of human biological materials. Materials and Methods: The current law and regulations related to submitting research outcome resources was reviewed, and the process of data 'acquisition' and data 'distribution' from the point of view of big data and health 2.0 was examined in order to arrive at a method for switching paradigms to better utilize human biological materials. Results: For the deposit of biological research resources, the original process was modified and a standard process with relative forms was developed. With deposit forms, research information, researchers, and deposit type are submitted. The checklist's 26 items are provided for publishing. This is a checklist of items that should be addressed in deposit reports. Lastly, XML-based deposit procedure forms were designed and developed to collect data in a structured form, to help researchers distribute their data in an electronic way. Conclusions: Through guidelines included with the plan for profit sharing between depositor and user it is possible to manage the material effectively and safely, so high-quality human biological material can be supplied and utilized by researchers from universities, industry and institutes. Furthermore, this will improve national competitiveness by leading to development in the national bio-science industry.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

• Journal of Internet Computing and Services
• /
• v.25 no.2
• /
• pp.101-111
• /
• 2024

In this paper, we propose a concpetual architecture and its implementation approach for contextualizing unstructured CCTV-video frame data into structured XML-video textual data by using the deep-learning neural network models and frameworks. Conclusively, through the conceptual architecture and the implementation approach proposed in this paper, we can eventually realize and implement the so-called sharable working and experiencing knowledge management platforms to be adopted to smart factories in various industries.

• Journal of Intelligence and Information Systems
• /
• v.8 no.1
• /
• pp.141-157
• /
• 2002

extensible Markup Language (XML) is a new markup language for data exchange on the Internet. In this paper, we propose a language extensible Rule Markup Language (XRML) which is an extension of XML. The implicit rules embedded in the Web pages should be identifiable, interchangeable with structured rule format, and finally accessible by various applications. It is possible to realize by using XRML. In this light, Web based Knowledge Management Systems (KMS) can be integrated with rule-based expert systems. To meet this end, we propose the six design criteria: Expressional Completeness, Relevance Linkability, Polymorphous Consistency, Applicative Universality, Knowledge Integrability and Interoperability. Furthermore, we propose three components such as RIML (Rule Identification Markup Language), RSML (Rule Structure Markup Language) and RTML (Rule Triggering Markup Language), and the Document Type Definition DTD). We have designed the XRML version 0.5 as illustrated above, and developed its prototype named Form/XRML which is an automated form processing for disbursement of the research fund in the Korea Advanced Institute of Science and Technology (KAISI). Since XRML allows both human and software agent to use the rules, there is huge application potential. We expect that XRML can contribute to the progress of Semantic Web platforms making knowledge management and e-commerce more intelligent. Since there are many emerging research groups and vendors who investigate this issue, it will not take long to see XRML commercial products. Matured XRML applications may change the way of designing information and knowledge systems in the near future.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.382-394
• /
• 2010

Cross-domain event information sharing is a topic of great interest in the area of event based network management. In this work we use data sets which represent actual attacks in the operational Internet. We analyze the data sets to understand the dynamics of the attacks and then go onto show the effectiveness of sharing incident related information to contain these attacks. We describe universal data acquisition system for event based management (UniDAS), a novel system for secure and automated cross-domain event information sharing. The system uses a generic, structured data format based on a standardized incident object description and exchange format (IODEF). IODEF is an XML-based extensible data format for security incident information exchange. We propose a simple and effective security model for IODEF and apply it to the secure and automated generic event information sharing system UniDAS. We present the system we have developed and evaluate its effectiveness.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.60-62
• /
• 1999

SGML이나 XML과 같은 마크업 언어를 사용하여 생성된 구조적 문서에 대한 검색 시스템은 문서의 임의의 부분에 대한 검색을 지원한다. 문서의 구조에 바탕을 둔 다양한 유형의 사용자 질의를 처리하기 위해서는 색인에 필요한 메모리량이 커지게 된다. 색인에 필요한 메모리양을 줄이기 위해, 색인된 노드의 ID에서 찾고자 하는 노드의 ID를 계산할 수 있어야 한다. 그러나 이 경우 각 노드에 ID가 고정되기 때문에 문서의 갱신이 발생할 때 많은 부분이 수정되어야 하기 때문에 갱신에 필요한 오버헤드가 커지게 된다. 본 논문에서는 전체문서인스턴스트리 구조를 제안하고, 이를 기반으로 하여 노드의 ID를 구성함으로서, 색인과 검색의 효율성을 유지하면서 자료의 추가나 삭제등의 갱신이 발생할 때, 갱신의 파장을 최소화시킬 수 있는 색인구조와 질의처리 알고리즘을 제시한다.