• The Journal of Information Technology
• /
• v.4 no.1
• /
• pp.125-139
• /
• 2001

EDI(Electronic Data Interchange) works by providing a collection of standard message formats and element dictionary in a simple way for businesses to exchange data via any electronic messaging service. Open-edi is electronic data interchange among autonomous parties using public standards and aiming towards interoperability over time, business sectors, information technology and data types. The number of Internet services using XML/EDI has grown rapidly since it is easily expansible and exchangeable. To use this service, the client does not have to install EDI S/W but only needs internet browser. Consequently, it became much easier and faster to handle the trading process in an office. eBusiness SML (extensible markup language) electronic data interchange. eXedi is the service that realizes B2B of XML/EDI. eXedi can be used easily in small and medium sized companies. Companies in any place can access to eXedi using the existing Internet connection. XML/EDI provides a standard framework to exchange different types of data -- for example, an invoice, healthcare claim, project status -- so that the information be it in a transaction, exchanged via an Application Program Interface (API), web automation, database portal, catalog, a workflow document or message can be searched, decoded, manipulated, and displayed consistently and correctly by first implementing EDI dictionaries and extending our vocabulary via on-line repositories to include our business language, rules and objects.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.25-34
• /
• 2020

Community question and answering service is one of the main sources of information and knowledge in the Web. The quality of information in question and answer documents is determined by the clarity of the question and the relevance of the answers, and the readability of a document is a key factor for evaluating the quality. This study is to measure the quality of documents used in community question and answering service. For this purpose, we compare the frequency of occurrence by vocabulary level used in community documents and measure the readability index of documents by institution of author. To measure the readability index, we used the Dale-Chall formula which is calculated by vocabulary level and sentence length. The results show that the vocabulary used in the answers is more difficult than in the questions and the sentence length is longer. The gap in readability between questions and answers is also found by writing institution. The results of this study can be used as basic data for improving online counseling services.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.121-125
• /
• 2007

This paper proposes automatic generation method of proxy client code to automation of web service selection process through a monitoring agent. The technique of this paper help service consumer to provide source code of proxy client as it bring an attribute value of specific element of WSDL document using template rule. Namely, a XSLT script file provide code frame of dynamic invocation interface model. The automatic code generation technique need to solving starvation status of selection architecture. It is required to creating request HTTP message for every service on the result of search. The created proxy client program code generate dummy message about services. The proposed client code generation method show us a possibility of application in the automatic generation programming domain.

• Journal of Korean Library and Information Science Society
• /
• v.30 no.2
• /
• pp.1-28
• /
• 1999

This study aims to provide some rosie material for the libraries to improve its role for supporting the virtual university by recognizing the changing roles to have to support the distance education which is becoming a growing area in the coming new century due to the necessity of continuing renewal and the retaining of the information related workers. Through the study, a few conclusions were derived. (1) To support the virtual university, the library services should be directed toward the operation of the full access - philosophy and should reflect the information needs of the off-campus students. The librarians should be equipped with the ability to make use of networked resources and to provide the document delivery services together with the ability to develop the web-based user training programs. The department of library and Information Science should educate the future librarian for the purpose of supporting the virtual university. (2) A written and agreed guidelines should be established to specify the philosophy, management, facilities, resources and services to support the virtual university. And it is desirable that in the near future the department and a librarian responsible for the supporting the distance education should be established.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.61-71
• /
• 2004

XML can describe a wide range of data, from regular to irregular and from flat to deeply nested. Thus, XML is rapidly emerging as the do facto standard for the Web document format since XML supports an efficient data exchange and integration. Also, to retrieve the data represented by XML, several XML query languages are proposed. XML query languages such as XPath and XQuery use path expressions to traverse irregularly structured data which comprise B% elements. To evaluate path expressions, various path indexes are proposed. However, traditional path indexes are constructed by utilizing only the XML data structure. Therefore, in this paper, we propose an adaptive path index which utilizes the XML data structure as well as query workloads. To improve the query performance, the adaptive path index proposed by this paper manages the frequently used paths and the structural summary of the XML data using a hash tree and a graph structure. Experimental results show that the adaptive path index improves the query performance typically 2 to 69 times compared with the existing indexes.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.54-62
• /
• 2009

To avoid the redundant investment on the project selection process, it is necessary to check whether the submitted research topics have been proposed or carried out at other institutions before. This is possible through the search engines adopted by the keyword matching algorithm which is based on boolean techniques in national-sized research results database. Even though the accuracy and speed of information retrieval have been improved, they still have fundamental limits caused by keyword matching. This paper examines implemented TFIDF-based algorithm, and shows an experiment in search engine to retrieve and give the order of priority for similar and redundant documents compared with research proposals, In addition to generic TFIDF algorithm, feature weighting and K-Nearest Neighbors classification methods are implemented in this algorithm. The documents are extracted from NDSL(National Digital Science Library) web directory service to test the algorithm.

• Journal of Intelligence and Information Systems
• /
• v.10 no.1
• /
• pp.27-45
• /
• 2004

While on-line shopping is increasing, the "Consumer Protection Law in Electronic Commerce" obliges each internet shopping mall to provide its business information. Although most internet shopping malls provide their business information in the semi-structured format on the bottom of their homepages, the attributes and expression forms of business information are different each other. It makes consumers difficult to identify their business information and lowers public confidence. Hence this study proposes three approaches - HTML-based structure, XML-based structure, and XML data island-based structure - to structuralizing business information for correct expression. The experiment results showed that the business information extraction time by XML data island-based structure is independent of the size of the web document, while the time by HTML-based structure is dependent on the size. By comparing the business information extraction times, we show that XML data island-based structure is more efficient and effective than HTML-based structure.structure.

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.306-319
• /
• 2009

A name is a key feature for distinguishing people, but we often fail to discriminate people because an author may have multiple names or multiple authors may share the same name. Such name ambiguity problems affect the performance of document retrieval, web search and database integration. Especially, in bibliography information, a number of errors may be included since there are different authors with the same name or an author name may be misspelled or represented with an abbreviation. For solving these problems, it is necessary to disambiguate the names inputted into the database. In this paper, we propose a method to solve the name ambiguity by using social networks constructed based on the relations between authors. We evaluated the effectiveness of the proposed system based on DBLP data that offer computer science bibliographic information.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.127-135
• /
• 2004

With the wide-spread use of multimedia technology, the demand for the image processing engineer is increasing in various fields. But there are few engineers who can develop practical applications in the image processing area. To teach practical image processing techniques, we need an integrated education environment which can efficiently present the image processing theory and, at the same time, provide interactive experiments for the theory presented. In this paper, we propose an integrated education environment for the image processing, which is called MTES. It consists of the theory presentation systems and the experiment systems. The theory presentation systems support multimedia data, web document and Microsoft Powerpoint$^{TM}$ file. It is tightly integrated with the experiment systems which are developed based on the integrated image processing algorithm development system, called Hello-Vision.n.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1418-1425
• /
• 2009

This paper proposes a novel FTL (Flash Translation Layer) algorithm based on sector-level mapping to reduce the number of total erase operations in flash memory accesses. The proposed algorithm can reduce the number of erase operations by utilizing the sector-level mapping table when writing data at flash memory. Sector-level mapping technique reduces flash memory access time and extendsthe life time of the flash memory. In the algorithm, wear-leveling is implemented by selecting victim blocks having the minimal number of erase operations, when empty spaces for write are not available. To evaluate the performance of the proposed FTL algorithm, experiments were performed on several applications, such as MP3 players, MPEG players, web browsers and document editors. The proposed algorithm reduces the number of erase operations by 72.4% and 61.9%, when compared with well-known BAST and FAST algorithms, respectively.