2454682
Mining Association Rules from Structural Deltas of Historical XML Documents
Previous work on XML association rule mining focuses on mining from the data existing in XML documents at a certain time point. However, due to the dynamic nature of online information, an XML document typically evolves over time. Knowledge obtained from mining the evolvement of an XML document would be useful in a wide range of applications, such as XML indexing, XML clustering. In this paper, we propose to mine a novel type of association rules from a sequence of changes to XML structure, which we call XML Structural Delta Association Rule (XSD-AR). We formulate the problem of XSD-AR mining by considering both the frequency and the degree of changes to XML structure. An algorithm, which is derived from the FP-growth, and its optimizing strategy are developed for the problem. Preliminary experiment results show that our algorithm is efficient and scalable at discovering a complete set of XSD-ARs.
13928372
VRules: an effective association-based classifier for videos
Video classification is an important step towards multimedia understanding. Most state-of-the-art approaches which apply HMM to capture the temporal information of videos have the limitation by assuming that the current state of a video depends only on the immediate previous state. Nevertheless, this assumption may not hold for videos of various categories. In this paper, we present an effective video classifier which employs the association rule mining technique to discover the actual dependence relationship between video states. The discriminatory state transition patterns mined from different video categories are then used to perform classification. Besides capturing the association between states in the time space, we also capture the association between low-level features in spatial dimension to further distinguish the semantics of videos. Experimental results show that the performance of our association rule based classifier is quite promising.
18283115
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some particular patterns. In this paper, we focus on the sequence of changes to the structures of an XML document to find out which subtrees in the XML structure frequently change together, which we call Frequently Changing Subtree Patterns (FCSP). In order to keep the discovered patterns more concise, we further define the problem of mining maximal FCSPs. An algorithm derived from the FP-growth is developed to mine the set of maximal FCSPs. Experiment results show that our algorithm is substantially faster than the naive algorithm and it scales well with respect to the size of the XML structure.
4775385
A fine-grained replacement strategy for XML query cache
Caching popular queries and reusing results of previously computed queries is one important query optimization technique, especially in modern distributed environments such as the WWW. Based on the recent proliferation of XML data and the emergence of the XQuery language, we are thus developing a query- based caching system for XQuery queries, called ACE-XQ. ACE-XQ applies innovative query containment and rewriting strategies to answer incoming user queries based on the cached XQueries, whenever possible, instead of accessing remote XML data sources.To manage the space of the cache, a straightforward application of traditional replacement strategies would correspond to removing a complete cached query and its derived XML document as a whole when space needs to be freed. This coarse granularity however does not match well with the typical access pattern of web searches where new queries often partially overlap with cached queries.In this paper, we propose a novel replacement strategy appropriate for such query-based XML caching systems. In particular, we collect user access statistics at the granularity of the XML path structure instead of the complete XML query regions. We then apply a more fine-grained replacement strategy that purges XML fragments off a cached region instead of the whole XML document and accordingly adjusts the query descriptor. This may better capture the user access patterns since more frequently used XML document fragments are likely to remain in the cache while other less beneficial parts are purged. This approach has been implemented in our ACE-XQ System. Preliminary experiment results illustrate the performance improvement achievable by our fine-grained replacement strategy over the one which replaces a whole XML view at a time when the cache size is relatively large.
4792658
Active Page Generation via Customizing XML for Data Beans in E-Commerce Applications
In this paper, we analyze enabling technologies for typical e-business applications in terms of their multi-tier system architecture and their Model-Control-View (MCV) programming model. Based on observed limitations of the JSP (Java Server Page) technique commonly adopted for dynamic page generation (the view logic), we instead propose an alternative solution approach, namely, a generic schema mapping strategy to generate XML documents and DTDs from enterprise data beans. First, we describe in detail the XML generation process for the content composition logic. We also outline the XSL processing for the transformation logic. The separation of these two logics results in a generic solution to the bean viewing problem. In particular, it improves the bean reusability via its XML representative compared to the rigid strategy of hard-coding logics into JSP. Our proposed XML mapping solution represents a potentially valuable addition to future versions of the enterprise data beans specification. The trade-off between performance and flexibility of these alternative solutions is discussed. Lastly, we survey the state-of-art research results and emerging stardards related to this XML model mapping approach.
2930338
Testing for interconnect crosstalk defects using on-chip embedded processor cores
Crosstalk effects degrade the integrity of signals traveling on long interconnects and must be addressed during production testing. External testing for crosstalk is expensive due to the need for high-speed testers. Built-in self-test, while eliminating the need for a high-speed tester, may lead to excessive test overhead as well as overly aggressive testing. To address this problem, we propose a new software-based self-test methodology for system-on-chip (SoC) devices based on embedded processors. It enables an on-chip embedded processor core to test for crosstalk in system-level interconnects by executing a self-test program in the normal operational mode of the SoC. We have demonstrated the feasibility of this method by applying it to test the interconnects of a processor-memory system. The defect coverage was evaluated using a system-level crosstalk defect simulation method.
7815226
Peak Load Forecasting Using the Self-organizing Map
This paper aims to study the short-term load forecasting of electricity by using an extended self-organizing map. We first adopt a traditional Kohonen self-organizing map (SOM) to learn time-series load data with weather information as parameters. Then, in order to improve the accuracy of the prediction, an extension of SOM algorithm based on error-correction learning rule is used, and the estimation of the peak load is achieved by averaging the output of all the neurons. Finally, as an implementation example, data of electricity demand from New York Independent System Operator (ISO) are used to verify the effectiveness of the learning and prediction for the proposed methods.
17619661
Your way your missions: from location-based to route-based pervasive gaming
In this paper, we describe the design and implementation of a route-based pervasive game named Your Way Your Missions (YWYM). Since the game obtains the planned routes of players and returns missions in the routes, players can play the game in a casual way, without changing their routes to respond to picked up missions. A self-reporting method is proposed to obtain the planned routes of players, and a corresponding route defining tool is developed upon Google Maps. Two approaches to realize route-based mission adaptation with spatial databases are presented.