Dingming Wu

Learn More
Understanding the interests and behaviors of Web users serves as the core of many Web usage data mining applications such as personalized search, recommendation, personalization, business decision, advertisement targeting, marketing and customer relationship management. In this paper, an approach of building an adaptive user profile based on memory-model is(More)
Counting and identifying neighboring active nodes are two fundamental operations in wireless sensor networks (WSNs). In this paper, we propose two mechanisms, <i>Power based Counting</i> (Poc) and <i>Power based Identification</i> (Poid), which achieve fast and accurate counting and identification by allowing neighbors to respond simultaneously to a poller.(More)
Flooding is one of the most fundamental functions in wireless sensor networks (WSNs) and has been investigated extensively. Existing flooding schemes in duty-cycle WSNs can be categorized into two categories: synchronous ones and asynchronous ones. In practice asynchronous schemes are preferable since synchronous ones introduce more complexity and overhead(More)
Multicast has long been a performance bottleneck for data centers. Traditional solutions relying on IP multicast suffer from poor congestion control and loss recovery on the data plane, as well as slow and complex group membership and multicast tree management on the control plane. Some recent proposals have employed alternate optical circuit switched paths(More)
We study the problem of supporting simultaneous query in WSNs. For such networks, the network efficiency can be significantly improved if the poller can obtain information via a simultaneous query. Two fundamental cases of such queries are studied in this paper: counting and identifying active neighboring nodes. We propose two mechanisms, Power based(More)
This paper promotes convertible data center network architectures, which can dynamically change the network topology to combine the benefits of multiple architectures. We propose the flat-tree prototype architecture as the first step to realize this concept. Flat-tree can be implemented as a Clos network and later be converted to approximate random graphs(More)
  • 1