• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.258-266
• /
• 2010

In this paper, we introduce a novel method to predict next update of blogs. The number of RSS feeds registered on meta-blogs is on the order of several million. Checking for updates is very time consuming and imposes a heavy burden on network resources. Since blog search engine has limited resources, there is a fix number of blogs that it can visit on a day. Nevertheless we need to maximize chances of getting new data, and the proposed method which predicts update probability on blogs could bring better chances for it. Also this work is important to avoid distributed denial-of-service attack for the owners of blogs. Furthermore, for the internet as whole this work is important, too, because our approach could minimize traffic. In this study, we assumed that there is a specific pattern to when a blogger is actively posting, in terms of days of the week and, more specifically, hours of the day. We analyzed 15,119 blogs to determine a blogger's posting preference. This paper proposes a method to predict the update probability based on a blogger's posting history and preferred days of the week. We applied proposed method to 12,115 blogs to check the precision of our predictions. The evaluation shows that the model has a precision of 0.5 for over 93.06% of the blogs examined.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• Journal of Korean Society of Forest Science
• /
• v.85 no.3
• /
• pp.524-531
• /
• 1996

The objective of this study was to determine the important factors affecting the early natural regeneration of Pinus densiflora S. et Z. Seed germination, survival and height growth of the pine seedlings were examined at four experimental plots of P. densiflora forests including forest roadside. Plots I and III were thinned in 1992, plot II was treated with hexazinone in 1993 after seed tree method was applied in 1982 and 1989. Seedlings emerged after thinning and the rate of their emergence depended on forest floor conditions. Seedling survival was related with light conditions, herbaceous vegetation, and degrees of rainfall. More seedlings emerged in forest hauling roads than within the forest because soil scarification due to logging provided better conditions for seed germination and seedling growth. Seed supply was enough, but germination rate was very low in the forest compared with that in the greenhouse because micro-environments such as organic layer and herbaceous plant acted as limiting factors. Weed control was needed for 4 to 5 years until seedlings grew upto about 50cm in height which was similar to that of herbaceous plants. But 10-40% coverage of herbaceous vegetation was needed to protect small seedlings from heavy rain. Forest works such as thinning and logging, over 40% of light were important factors to help the pine regeneration. However, over 70% coverage of herbaceous vegetation, and heavy rain inhibited rather survival and growth of pine seedlings.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.09a
• /
• pp.346-347
• /
• 2010

최근 공간정보의 짧은 갱신주기와 효율적 관리를 위하여 공간정보참조체계에 관한 연구가 필요한 실정으로 본 연구에서는 객체기반연속수치지도식별자 관리를 위한 각 기관별 공간정보참조체계현황을 분석하였고, 이를 기반으로 객체기반연속수치지도식별자의 구조분석과 수명주기에 따른 객체기반연속수치지도식별자의 관리유형을 구분하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1076-1088
• /
• 1997

Data repliciation techniques of distributed database a allocation methods occures to overhead to change together all repkicas for consistency maintenance at updates .In case of data migration horizontal or vertical fragment migration has caused to caused to increase data communication.In this paper we purpose batch proxessing method groups the associated items of table and stores temporary table assciated with file relication and migrations.This method increase the usagility of system buffer in distributed trancsaction processing with a number of data inputs and updates.After all,it improved the perform-ance of distributed transaction system by reducing disk I\O processing time and the cost of data cimmunication among local sites.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.33-43
• /
• 2010

In this paper, we propose a new location acquisition scheme based on RFID that reduces the computation cost of location acquisition and keeps the accuracy of the location. In addition, we propose an incremental location update policy to reduce the location update cost for moving objects. To show the superiority of our proposed scheme, we compare it with the existing researches. It is shown through various experiments that the proposed system reduces the computation cost of location estimation 500 times more than existing researches. Also, the proposed system significantly reduces the cost of location update using the RFID-based update policy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.95-102
• /
• 2009

In 2006, Haddad, Krishnan and Soliman proposed a Cryptographically Generated Address based protocol as a standard for protecting HMIPv6. Though this protocol can provide both the strong message authentication and binding update key negotiation based on the public-key cryptography, it is still vulnerable to several attacks such as denial of service attacks and redirection attacks. This paper improves the problems caused by the protocol. The improved protocol is analyzed in terms of security and performance, and then is shown to be better than the previous one considering the two factors together.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.87-94
• /
• 1996

In order to design an extended relational database management system supporting multilevel security, the standard relational data model is extended and new relational integrity constrains are proposed for the model. The extended relational model and proposed multilevel integrity constraniants maintain database in consistent state and produce a basis that can eliminat eambiguity of entity and relation ship representations bypoly instantiation. The proposed up dates emantics canincreases the efficiency of up date operations by supporting multilevel entry and up dates. The semantics also provides a basis for the implementation of decomposition of extended relations.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.1-10
• /
• 2007

In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.