• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.232-235
• /
• 2015

Defect data contains experiential knowledge about specific work conditions. And the number of projects performed by a company is too limited for an individual to experience the various defects under the current complex construction environment. Therefore, in order to manage and prevent a reoccurrence of defects, a proper data feedback mechanism is required. However, most defect data are stored in unstructured ways, resulting in the fundamental problem of data utilization. In this paper, a new framework is proposed by using linked data technologies to improve defect data utilization. The target of this framework is to convert defect data to the ontology-based linked data format for sharing defect data from different data sources. To demonstrate it, some technical solutions are implemented by using real cases. The proposed approach can reduce data search time and improve the accuracy of search results as well. Moreover, the proposed approach can be applied to other domains that need to refer to external sources such as safety, specification, product, and regulation.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.23 no.2
• /
• pp.5-25
• /
• 2012

The purpose of this study is to develop linked data of authority data in national archives of Korea as a cornerstone for linked data cloud of Korea. The study analyzed data structure of authority data as well as a retrieval system. It finally developed linked data based on RDF/OWL, Dublin Core, and SKOS. The study also employed TopBraid ComposerTM as a tool for ontology construction. The visualization of the tool provides users with flexible search and browsing between data as well as access of detail authority data. It complements the search of a current system in terms of flexible linking between records and authority data. The study also suggests future work to publish linked data of archival data set itself and make rich relationships among data in museums, libraries, and other archives.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.222-229
• /
• 2016

Linked Data is a powerful technology for storing and publishing the structures of data. It is helpful for web applications because of its usefulness through semantic query data. However, using Linked Data is not easy for ordinary users who lack knowledge about the structure of data or the query syntax of Linked Data. For that problem, we propose a translator component that is used for translating RESTful/JSON request messages into SPARQL commands based on ontology - a metadata that describes the structure of data. Clients do not need to worry about the structure of stored data or SPARQL, a kind of query language used for querying linked data that not many people know, when they insert a new instance or query for all instances of any specific class with those complex structure data. In addition, the translator component has the search function that can find a set of data from multiple classes based on finding the shortest paths between the target classes - the original set that user provide, and target classes- the users want to get. This translator component will be applied for any dynamic ontological structure as well as automatically generate a SPARQL command based on users' request message.

• Journal of the Korean Society for information Management
• /
• v.37 no.2
• /
• pp.145-169
• /
• 2020

The purpose of this study is to find the cause and solution of the situation where library LOD does not spread after the introduction of library LOD. Research methods include literature research, case studies, and expert interviews. The improvement plan presented in this study is that first, the library needs to avoid the redundancy of the LOD construction target and build the only and specialized data. Second, libraries need to develop LOD services that reflect user needs and implement convenient LOD interfaces. Third, libraries need to establish identification system of data and build a authority file. Fourth, libraries need to recognize the necessity of data opening and linking to librarians and users, and provide opportunities for education and publicity. Fifth, it is necessary to use LOD for integrated search and to establish an integrated platform for search of library LOD. Sixth, libraries need to strengthen cooperation for LOD issuance and utilization, and form a working-level consultative body. Seventh, the government should pursue strong policies with a continuous commitment to LOD promotion and need to continue to provide budget support.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.5
• /
• pp.1-12
• /
• 2019

Unlike existing Open APIs, Linked Data are made as a huge intelligent base to perform high-level SPARQL queries, and it is possible to create efficiently a new content by mashuping different information from various datasets. This paper implements a responsive web application for location-based semantic search. We mashup DBpedia, a kind of Linked Data, and GoogleMap API provided by Google, and provide a semantic browser function to confirm detail information regarding retrieved objects. Our system can be used in various access environments such as PC and mobile by applying responsive web design idea. The system implemented in this paper compares functional specifications with existing systems with similar functions. The comparison results show the superiority of our system in various aspects such as using semantic, linked-based browser, and mashup function.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.4
• /
• pp.60-70
• /
• 2006

National atlas map for provide various information is one part of National territorial Statatics Survey but National atlas map in 2004 year don't have stability and ability. National territorial Statatics Survey in 2005 years have octuple data compare with data in 2004 years but have only one map. One map is going to provide with stability and ability. We don't use DBMS, But We make a similarly struct in file based program. We programmed system of dynamic-linked data with spatial data. To dynamic-linked system, we make search engine to based index struct and make combobox search system. spatial data only have index codes(year, national terrial indicator, area). If spatial data request specfied data, search engine search index code and provide DB data. New system is middle step of using DBMS. We redraw map for display real Korea area (with dokdo). New map is shape and similar Korea map.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.11a
• /
• pp.479-484
• /
• 2004

It is the present situation that the relevant data with the compensation and payment is filed and managed in the form of document or Excell. In case of the large volume dam construction, the management of the data about the sinking areas is conducted inefficiently in view of time management and economy through using the administrative manpower and data formating manpower. There is also problem about where and how to keep the data owing to the enormous data. As a result of the raised questions, through constructing the system which is linked with the location information and property information which is relevant to the compensation to increase the applying value of the information about the compensation and apply document management system to the geographic information system, the management system through computerizing for searching the uncompensated areas in appropriate areas and compensation information in the compensated areas is projected. Through constructing geographic information system, it is expected to create various information effects, using the function of the necessary area search for the boundary survey, actual condition survey, uncompensated area search, and re-compensated area search.

• The Journal of Bigdata
• /
• v.4 no.2
• /
• pp.195-205
• /
• 2019

Linked Open Data (LOD) is rated as the best of any kind of data disclosure, and allows you to search related data by linking them in a standard format across the Internet. There is an increasing number of cases in which relevant data are constructed in the LOD form in the global environment, but in the domestic healthcare sector, the disclosure of data in the form of LOD is still at the beginning stage. In this paper, we introduce a case of LOD platform construction that provides services by linking domestic and international related data by LOD method, based on the data of Korean medical research paper data and health care big data linkage platform. Linking all data from each DB into an LOD requires a lot of time and effort, and is basically an infrastructure task that government or public institutions should be in charge of rather than the private sector. In this study, ten domestic and foreign LOD sites were linked with only a portion of each DB, enabling users to link data from various domestic and foreign organizations in a convenient manner.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1328-1342
• /
• 2013

Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.111-115
• /
• 1998

The Internet today is teemed with not only text data but also other media such as sound, still and moving images in a variety of formats. Unlike text, however, that can be retrieved easily with the help of numerous search engines, there has been few way to access data of other media unless the exact location or the URL is known. Multimedia data in the WWW are contained in or linked via anchors in the hyper-documents. They can most reliably be retrieved by analyzing the binary data content, which is far from being practical yet by the current state of the art. Instead we present another technique of searching based on textual descriptions which are found at or around the multimedia objects. The textual description used in this research includes file name (URL), anchor text and its context, alternative descriptions found in ALT HTML tage. These are actually the clues assumedly relevant to the contents. Although not without a possibility of missing or misinterpreting images and sounds, the description-based search is highly practical in terms of computation. The prototype search engine will soon be deployed to the public service through the prestige search engine, InfoDetective, in Korea.