• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.391-399
• /
• 2008

RSS is the XML-based format for the syndication of web contents, and users aggregate RSS feeds with RSS feed aggregators. In order to effectively aggregate RSS feeds, an RSS aggregation policy is necessary. In this paper, we first propose an aggregation policy to minimize the number of postings being missed within an aggregation. Second, we analyze and compare our aggregation policy with existing aggregation policies. Our analysis reveals that our aggregation policy can reduce approximately 23% of the aggregation missing in comparison with the other aggregation policies while it increases only 6% of the aggregation delay.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.463-475
• /
• 2006

In applications such as a traffic management system, analysis using a spatial hierarchy of a spatial data warehouse and a simple aggregation is required. Over the past few years, several studies have been made on solution using a spatial index. Many studies have focused on using extended R-tree. But, because it just provides either the current aggregation or the total aggregation, decision support of traffic policy required historical analysis can not be provided. This paper proposes hybrid index based on extended aR-tree for the spatio-temporal aggregation. The proposed method supports a spatial hierarchy and the current aggregation by the R-tree. The sorted hash table using the time structure of the extended aR-tree provides a temporal hierarchy and a historical aggregation. Therefore, the proposed method supports an efficient decision support with spatio-temporal analysis and is Possible currently traffic analysis and determination of a traffic policy with historical analysis.

• The Journal of Society for e-Business Studies
• /
• v.14 no.2
• /
• pp.41-56
• /
• 2009

The purpose of this paper is to present a statistical model that can predict the rapid shift of users' attention by analyzing the lifecycle patterns of news in a social news aggregation service. Internet news service sites have a distinct characteristic in a sense that users' attention change very quickly in a short period of time. In this research, we propose a regression model for each news category which can model the decay pattern of users' attention and the content promotion policy of a social news aggregator is proven to be a major source of the rapid growth in the popularity of news. The proposed model is expected to be useful for evaluation of the social news aggregation service provider's content promotion policy that attempts to maximize users' attention as well as the diversity of news contents.

• Journal of Korean Society of Forest Science
• /
• v.110 no.1
• /
• pp.106-115
• /
• 2021

The aim of the study was to analyze the spatial characteristics of the main producing areas of nontimber forest products. We analyzed the spatial aggregations of the main producing area and their changes using the Moran's I index. We found that 45% of nontimber forest products were significanty spatially clustered. Additionally, in five major products, we observed that the main producing area has expanded and the degree of aggregation has also strengthened over the last ten years. The results of this study can be effectively used for forest policies, such as determining the location and size of the distribution centers of specific forest products.

• Transportation Technology and Policy
• /
• v.8 no.5
• /
• pp.41-46
• /
• 2011

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.531-536
• /
• 2006

Recently, many of researchers have been studied in data processing oriented middleware for wireless sensor networks with the rapid advances on sensor and wireless communication technologies. In a wireless sensor network, a middleware should handle the data loss problem at an intermediate sensor node caused by instantaneous data burstness to support efficient processing and fast delivering of the sensing data. To handle this problem, a simple data discarding or data compressing policy for reducing the total amount of data to be transferred is typically used. But, data discarding policy decreases the correctness of a collected data, in other hand, data compressing policy requires additional processing overhead with the high complexity of the given algorithm. In this paper, it proposes a data-average method for enhancing the efficiency of data aggregation and correctness where the sensed data should be delivered only with the limited computing power and energy resource. With the proposed method, unnecessary data transfer of the overlapped data is eliminated and data correctness is enhanced by using the proposed averaging scheme when an instantaneous data burstness is occurred. Finally, with the TOSSTM simulation results on TinyBB, we show that the correctness of the transferred data is enhanced.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.43-52
• /
• 2011

In this paper, we propose the architecture of the policy-based emergency bio data transmission for the smart healthcare service. the medical staff can quickly and accurately monitor the emergency bio data of the remote patient through the proposed architecture. The proposed system consists of three parts: IEEE 11073-based agents and managers performing the aggregation function and transmission function of the bio data; the emergency management server performing the converting function between IEEE 11073 and HL7 and auto-diagnosis function of the policy-based; HL7 medical system based on HL7. Finally, by implementing the proposed system, we shows that the aggregation of the bio data and management of the emergency bio data in the smart healthcare service are possible.

• Journal of Periodontal and Implant Science
• /
• v.45 no.1
• /
• pp.2-7
• /
• 2015

A fundamental problem in analyzing complex multilevel-structured periodontal data is the violation of independency among the observations, which is an assumption in traditional statistical models (e.g., analysis of variance and ordinary least squares regression). In many cases, aggregation (i.e., mean or sum scores) has been employed to overcome this problem. However, the aggregation approach still exhibits certain limitations, such as a loss of power and detailed information, no cross-level relationship analysis, and the potential for creating an ecological fallacy. In order to handle multilevel-structured data appropriately, mixed effects models have been introduced and employed in dental research using periodontal data. The use of mixed effects models might account for the potential bias due to the violation of the independency assumption as well as provide accurate estimates.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.26-31
• /
• 2004

In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4717-4737
• /
• 2017

Today, smart grids, smart homes, smart water networks, and intelligent transportation, are infrastructure systems that connect our world more than we ever thought possible and are associated with a single concept, the Internet of Things (IoT). The number of devices connected to the IoT and hence the number of traffic flow increases continuously, as well as the emergence of new applications. Although cutting-edge hardware technology can be employed to achieve a fast implementation to handle this huge data streams, there will always be a limit on size of traffic supported by a given architecture. However, recent cloud-based big data technologies fortunately offer an ideal environment to handle this issue. Moreover, the ever-increasing high volume of traffic created on demand presents great challenges for flow management. As a solution, flow aggregation decreases the number of flows needed to be processed by the network. The previous works in the literature prove that most of aggregation strategies designed for smart grids aim at optimizing system operation performance. They consider a common identifier to aggregate traffic on each device, having its independent static aggregation policy. In this paper, we propose a dynamic approach to aggregate flows based on traffic characteristics and device preferences. Our algorithm runs on a big data platform to provide an end-to-end network visibility of flows, which performs high-speed and high-volume computations to identify the clusters of similar flows and aggregate massive number of mice flows into a few meta-flows. Compared with existing solutions, our approach dynamically aggregates large number of such small flows into fewer flows, based on traffic characteristics and access node preferences. Using this approach, we alleviate the problem of processing a large amount of micro flows, and also significantly improve the accuracy of meeting the access node QoS demands. We conducted experiments, using a dataset of up to 100,000 flows, and studied the performance of our algorithm analytically. The experimental results are presented to show the promising effectiveness and scalability of our proposed approach.