• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.21 no.4
• /
• pp.1-10
• /
• 2018

Use of de-icing salts results in accumulation of high concentrations of ions on roadside soils and tree. The purpose of this study isto determine translocation of seasonal impact of exchangeable cations originating from de-icing salt on roadside surface soil-plant influenced by the intensity of foliar damage (NY = 0-25%, SY = 26-50%, CY = 51-75%) of trees. This paper investigated the concentration of four exchangeable cations ($K^+$, $Ca^{2+}$, $Na^+$, and $Mg^{2+}$) on the roadside surface soil. The tree (Ginko biloba) samples were collected from the Konkuk and Judeok intersections in Chung-ju city. The sequential extraction procedure was applied to 120 soil samples of the soilsurface and 30 tree samples. Four cation exchange ions were determined by ICP-OES. The content of four exchangeable cations present on roadside soil was found to be the lowest in NY but highest in CY from tree pits in the order of NY < SY < CY. Especially, the results were apparent during spring time compared to other seasons. Soil collected from tree pits had the highest concentration of $Ca^{2+}$ possibly due to a higher volume of traffic on those streetsresulting in splashing of more calcium chloride ($CaCl_2$). The analysis of three exchangeable cations ($K^+$, $Mg^{2+}$, and $Na^+$) in the tree leaves revealed higher levels than roadside surface soil when foliar damage ratio increased in the order of NY < SY < CY in summer. In addition, a strong positive linear relationship was observed between the concentration of exchangeable cations in soil and trees. It is hypothesized that the results of this study can be a valuable baseline for managing de-icing salt on roadside soil and trees, in order to mitigate the salt stress that can damage the roadside soil and trees.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.75-82
• /
• 2015

Major corporations and portals have implemented a link server that connects Content Management Systems (CMS) to the physical address of content in a database (DB) to support efficient content use in web-based environments. In particular, a link server automatically connects the physical address of content in a DB to the content URL shown through a web browser screen, and re-connects the URL and the physical address when either is modified. In recent years, the number of users of digital content over the web has increased significantly because of the advent of the Big Data environment, which has also increased the number of link validity checks that should be performed in a CMS and a link server. If the link validity check is performed through an existing URL-based sequential method instead of petabyte or even etabyte environments, the identification rate of dead links decreases because of the degradation of validity check performance; moreover, frequent link checks add a large amount of workload to the DB. Hence, this study is aimed at providing a link server that can recognize URL link deletion or addition through analysis on the B-tree-based Information Identifier count per interval based on a large amount of URLs in order to resolve the existing problems. Through this study, the dead link check that is faster and adds lower loads than the existing method can be performed.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.915-920
• /
• 2005

In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.49-63
• /
• 2009

The performance of spatio-temporal moving pattern mining depends on how to analyze and process the huge set of spatio-temporal data due to the nature of it. The several method was presented in order to solve the problems in which existing spatio-temporal moving pattern mining methods[1-10] have, such as increasing execution time and required memory size during the pattern mining, but they did not solve properly yet. Thus, we proposed the STMP/MST method[11] as a preceding research in order to extract effectively sequential and/or periodical frequent occurrence moving patterns from the huge set of spatio-temporal moving data. The proposed method reduces patterns mining execution time, using the moving sequence tree based on hash tree. And also, to minimize the required memory space, it generalizes detailed historical data including spatio-temporal attributes into the real world scopes of space and time by using spatio-temporal concept hierarchy. In this paper, in order to verify the effectiveness of the STMP/MST method, we compared and analyzed performance with existing spatio-temporal moving pattern mining methods based on the quantity of mining data and minimum support factor.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.392-401
• /
• 2001

Nowadays, the amount of image data increase explosively. To manage the large amount of image data efficiently, high-dimensional index structures are necessary. However, as my knowledge none of existing DBMSs supports high-dimensional index structures as access methods of DBMSs. In this paper, we design and implement CIR-Tree as a access method for retrieving image data effectively on the MiDAS-III that is the storage subsystem of the BADA-III. The implemented CIR-Tree manager shows much better retrieval performance than sequential search in performance evaluation.

• Survey Research
• /
• v.4 no.2
• /
• pp.1-21
• /
• 2003

We proposed imputation strategies for marital status in the Population and Housing Census 2000 in Korea to illustrate the effective missing value imputation methods for social survey. The marital status which have relatively high non-response rates in the Census are considered to develope the effective missing value imputation procedures. The Classification and Regression Tree(CART)is employed to construct the imputation cells for hot-deck imputation, as well as to predict the missing value by model-based approach. We compare to imputation methods which include the CART model-based imputation and the sequential hot-deck imputation based on CART. Also we check whether different modeling for each region provides the more improved results. The results suggest that the proposed hot-deck imputation based on CART is very efficient and strongly recommendable. And the results show that different modeling for each region is not necessary.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.835-843
• /
• 2023

Given the structure of XML data, path and tree pattern matching algorithms play an important role in XML query processing. To facilitate decisions or relationships between nodes, nodes in an XML tree are typically labeled in a way that can quickly establish an ancestor-descendant on relationship between two nodes. However, these techniques have the disadvantage of re-labeling existing nodes or recalculating certain values if insertion occurs due to sequential updates. Therefore, in current labeling techniques, the cost of updating labels is very high. In this paper, we propose a new labeling technique called Fast XML encoding, which supports the update of order-sensitive XML documents without re-labeling or recalculation. It also controls the length of the label by reusing deleted labels at the same location in the XML tree. The proposed reuse algorithm can reduce the length of the label when all deleted labels are inserted in the same location. The proposed technique in the experimental results can efficiently handle order-sensitive queries and updates.

• The Journal of Internal Korean Medicine
• /
• v.32 no.1
• /
• pp.129-135
• /
• 2011

This report documents a case in which the administration of an herbal product, an extract of the lacquer tree, Rhus verniciflua Stokes, as sequential and concurrent treatment with chemotherapy was associated with a long term survival and good quality of life in a patient with metastatic non-small cell lung cancer(NSCLC). A 51-year-old Korean female was referred to the $M{\cdot}{\mu}$ Integrative Cancer Center, East-West Neo Medical centrer, Kyung Hee University for stage IV, metastatic NSCLC. She was treated with aRVS alone for 19 months and then received 1st line paclitaxel/carboplatin combined with aRVS, 2nd line gefitinib, and 3rd line pemetrexed. The number of cycles of pemetrexed administered was seventeen. aRVS was restarted as the 13th pemetrexed was administered. Pemetrexed with aRVS is currently ongoing. This patient has been alive for 41 months, and has been keeping a good performance status so far. We suggest aRVS as sequential and concurrent treatment with chemotherapy is an effective alternative treatment strategy.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.