• Journal of the Korean Association of Geographic Information Studies
• /
• v.3 no.3
• /
• pp.69-76
• /
• 2000

This study deals with development GIS application using web-based CAD, this application serves to user, designer, manager that more convenient and various functions. Development to this application, collect attribute data from fieldwork and geographic data from cadastral map and aerial survey map and then development to user interface using HTML, JavaScript, ASP, Whip ActiveX control. This application's characters are as follows ; First, system designer designed that anyone who have basic knowledge about web and CAD can develop this application. A system structure simplification by 2-Tier. Geographic information use DWF(drawing web format) file and attribute information use DBMS in consideration of extension. Second, system manager can service independently GIS in Web need not high priced GIS engine, so more economical. Third, internet user get service GIS information and function that search of information, zoom in/out, pan, print etc., if you need more functions, add function without difficultly. Developed application as above, not only save volume but fast of speed as use vector data exclude character and image data. Also, this application can used by means of commercial and travel information service but also various GIS service of public institution and private in web.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.79-89
• /
• 2013

Recently, the need for outsourcing sensitive data has grown due to the wide spreading of cost-effective and flexible cloud service. However, there is a fundamental concern in using such service since users have to trust external servers. Therefore, searchable encryption can be a very valuable tool to meet the security requirements of data outsourcing. However, most of work on searchable encryption focus only on privacy preserving search function and relatively lacks research on encryption mechanism used to actually encrypt data. Without a suitable latter mechanism, searchable encryption cannot be deployed in real world cloud services. In this paper, we analyze previously used and possible data encryption mechanisms for multi-user searchable encryption system and discuss their pros and cons. Our results show that readily available tools such as broadcast encryption, attribute-based encryption, and proxy re-encryption do not provide suitable solutions. The main problem with existing tools is that they may require separate fully trusted servers and the difficulty in preventing collusion attacks between outsiders and semi-trusted servers.

• Asia Marketing Journal
• /
• v.10 no.2
• /
• pp.125-151
• /
• 2008

Both companies and consumers are highly interested in on-line customer reviews which enable consumers to share their experience and knowledge about products. In this study, after classifying real reviews into context units and deriving categories, we analyzed differences between categories based on channel(manufacturers' homepage/ shopping mall), product attribute(search/experience) and price(high/low). The method to derive categories is based on roughly adopting constructs of ACSI model and elaborate and repetitive classification of real reviews. We set up the classification category with 3 levels. Level 1 consists of product and service, level 2 consists of function, design, price, purchase motive, suggestion/user-tip and recommendation/repurchase in product and AS/up-grade and delivery/others in service and level 3 is composed of details of level 2 of category. We could find remarkable differences between channels in all 8 items of level 2 of category. As the number of context units in homepage is more than in shopping mall, we found reviews in homepage is more concrete. Moreover, overall satisfaction in review was higher at homepage's. Also, in product attribute dimension, we found different patterns of reviews in design, purchase motive, suggestion/user-tip, recommendation/repurchase, AS/up-grade and delivery/others and no difference in overall customer's satisfaction. In price dimension, we found differences between high and low price in design, price and AS/up-grade and no difference in overall customer's satisfaction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.661-674
• /
• 2000

The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss theexperiences obtained in developing the index manager of the Tachyon, a next-generation MMDBMS. The indexmanager is an essential sub-component of the DBMS used to speed up the retrieval of objects from a largevolume of a database in response to a certain search condition. Previous research efforts on indexing proposed various index structures. However, they hardly dealt with the practical issues occured in implementating an index manager on a target DBMS. In this paper, we touch these issues and present our experiences in developing the index manager on the Tachyon as solutions. The main issues touched are (1) compact representation of an indexentry, (2) support of variable-length keys, (3) support of multiple-attribute keys, (4) support of duplicated keys,(5) definition of external APls, (6) concurrency control, and (7) backup and recovery. We believe that ourcontribution would help MMDBMS developers highly reduce their trial-and-errors.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.96-100
• /
• 2004

In the ship building industry various problems of erection is counterfeited due to formation of bottle necks in the block erection flow pattern This kind of problems cause accumulated problems in real-time erection right on the floor, When such a problem is approached, a support data of the entire erection sequence should be available, Here planning is done by reasoning about the future events in order to verify the existence of a reasonable series of actions to accomplish a goal. This technique helps in achieving benefits like handling search complications, in resolving goal conflicts and anticipation of bottleneck formation well in advance to take necessary countermeasures and boosts the decision support system, The data is being evaluated and an anticipatory function is to be developed This function is quite relevant in day to day planning operation. The system updates database with rearrangement of off-critical blocks in the erection sequence diagram, As a result of such a system, planners can foresee months ahead and can effectively make decisions regarding the control of loads on the man, machine and work flow pattern, culminating to an efficient load management. Such a foreseeing concept helps us in eliminating backtracking related adjustment which is less efficient compared to the look-ahead concept. An attempt is made to develop a computer program to update the database of block arrangement pattern based on heuristic formulation.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.59-66
• /
• 2008

GeoSensor network means sensor network infra and related software of specific form monitoring a variety of circumstances over geospatial. And these GeoSensor network is implemented by mixing data stream with spatial attribute, spatial relation. But, until a recent date sensor network system has been concentrated on a store and search method of sensor data stream except for a spatial information. In this paper, we propose a definition of spatial data stream and its join strategy model at GeoSensor network, which combine data stream with spatial data. Spatial data stream s defining in this paper are dynamic spatial data stream of a moving object type and static spatial data stream of a fixed type. Dynamic spatial data stream is data stream transmitted by moving sensor as GPS, while static spatial data stream is generated by joining a data stream of general sensor and a relation with location values of these sensors. This paper propose joins of dynamic spatial data stream and static spatial data stream, and cost models estimating join cost. Finally, we show verification of proposed cost models and performance by join strategy.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.361-366
• /
• 2001

As growing the number of Webs, the total amount of accessible information has been greater than ever. To storage and retrieve the vast information on the Webs effectively, many researchers have been made utilizing XML (extensible Markup Language). In this paper, we propose an effective method of representation and retrieval mechanism for the structured retrieval of the XML documents : (1) the fixed sized LETID (Leveled Element Type ID) that contains the information of elements such as parent node, sibling nodes, and identical sibling nodes, and the hierachical information of current node, and (2) content index, structure index, attribute index model, and the information retrieval algorithm for the structured information retrieval. With our methods, we can effectively represent the structured information of XML documents, and can directly access the specific elements by simple operations to process various queries.

• 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.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.228-235
• /
• 2008

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 Society on Water Environment
• /
• v.32 no.6
• /
• pp.511-519
• /
• 2016

National Institute of Environmental Research (NIER) has developed the Korean Reach File (KRF) for scientific and systematic analysis of variables related to water quality, pollutant sources and aquatic ecosystems in consideration of steam reach networks. The KRF provides a new framework for data production, storage, management and analysis for water related variables in relation to spatial characteristics, connections, and topologies of stream reaches. However, the current version of KRF (ver.2) has limited applicability because its nodes include not only the stream points based on topological characteristics but also those based on water quality monitoring stations, which may undermine its generality. In this study, a new version of KRF (ver.3) was designed and established to overcome the weak point of version 2. The version 3 is a generalization of the old KRF graphic data and it integrates the attribute data while separating it from the graphic data to minimize additional work that is needed for data association and search. We tested the KRF (ver.3) on actual cases and convenience and adaptability for each application was verified. Further research should focus on developing a database link model and real-world applications that are targeted to process event data.