Bole Shi's research while affiliated with Fudan University and other places

Publications (6)

Conference Paper
Data broadcast is an efficient way to disseminate information to large numbers of users in wireless environments. The Square Root Rule (SRR) is the theoretical basis for the single channel broadcast scheduling. In this paper, we extend the SRR and propose the Multi-channel Square Root Rule (MSRR) for scheduling variable-length data with skewed acce...
Conference Paper
As an important metric for wireless ad hoc networks, network lifetime has received great attentions in recent years. Existing lifetime-aware algorithms have an implicit assumption that nodes are cooperative and truthful, and they cannot work properly when the network contains selfish nodes. To make these algorithms achieve their design objectives e...
Article
Full-text available
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the re...
Conference Paper
Collaborative filtering is the most successful recommender system technology to date. It has been shown to produce high quality recommendations, but the performance degrades with the number of customers and products. In this paper, according to the feature of the rating data, we present a new similarity function Hsim(), and a signature table-based...
Conference Paper
Full-text available
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications such as wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the resp...
Article
In order to express the user interpretation, which is a set of user-specified GD-constraints in terms of a directed graph, the definition of directed graph in graph theory is extended according to the characters of the user interpretation and the requirements of the problem, and the node in this directed graph may be either an ordinary node or a di...

Citations

... The server pushes data objects according to access similarity of outstanding requests or other scheduling criteria [9]. This model inherits the notions of transaction database and broadcast disks [7,22] and strikes a tradeoff between increasing request aggregation and reducing the MAT at the risk of system overload [16,23]. In the hybrid model, the server can perform hot/cold data classification and push/pull bandwidth partition. ...
... Many studies have been done to investigate data placement techniques to reduce access time [32][33][34]. These studies generally assume that each user query requires one data item only. ...