{gaojun, dqyang, tjwang }@ pku.edu.cn Abstract XML query rewriting in the distributed computing environment receives high attention recently. Different from existing work, we focus on the query rewriting in the cases that there are multiple views at the client side. We design two data structures to manage the multiple XML views. MPTree is constructed from the main path of the XML views to gener...

We report results from an experiment on a repeated sender/receiver game with twenty periods in which one period has higher weight. The sender communicates about the realized state in each period, the receiver takes an action matching his belief about the state, and then learns whether the sender lied. Receivers are matched either with malevolent (human) senders who prefer the agents to take wro...

Publish-subscribe (pub-sub) systems present the state of the art in information dissemination to multiple users.Current XML-based pub-sub systems provide users with considerable flexibility allowing the formulation of complex queries on the content as well as the structure of the streaming messages. Messages that contain one or more matches for a given user profile (query) are forwarded to the ...

Tremendous advancement in technology most of the people are using their cell phone to access internet anywhere and everywhere. So, they need to concentrate on battery power also because of the limited battery power. In this paper, we propose an energy and latency efficient XML dissemination scheme for the wireless devices. We define a new unit structure called G-node for sending XML data in the...

The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It consists of C++ classes and is built on top of the library of efficient data types and algorithms LEDA; an optional add-on to AGD requires ABACUS, a framework for the implementation of branch-and-c...

My friend’s dilemma was a practical question that mathematics could answer, both elegantly and constructively. He and his housemates were moving to a house with rooms of various sizes and features, and were having trouble deciding who should get which room and for what part of the total rent. He asked, “Do you think there’s always a way to partition the rent so that each person will prefer a di...

The popularity of XML results in producing large numbers of XML documents. Therefore, to develop an approach of association rule mining on native XML databases is an important research. The FP-growth based on an FP-tree algorithm performs more efficiently than other methods of association rules mining, but it cannot be applied to native XML databases. Hence, we adaptive an improving FPtree algo...

Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient implementations of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST. We have obtained similar ...

In this paper, we address the problem of efficient processing of XQueries in single-user relational environment where the queries are formulated using a user-friendly GUI. We take a novel and non-traditional approach to improving query performance by prefetching data during the formulation of a query. The latency offered by GUI-based query formulation is utilized to prefetch portions of the que...

The low-energy demonstration accelerator (LEDA) is an operational 6.7-MeV, 100-mA, cw proton accelerator consisting of an injector, radio-frequency quadrupole (RFQ), and all associated integration equipment. Achieving this unprecedented level of performance (670kW of beam power) from an RFQ required a number of design innovations. We highlight a number of those more-significant technical advanc...