Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jianhua Shao 0002
dblp:18/5047-2
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2012
0000-0001-8461-1471ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Cellular and mobile networks · 54% Internet of things and sensor networks · 23% Wireless networking · 23% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cellular and mobile networks
mobile data offloading |
0.1 | 1 | 2012 | Mobile Data Offloading through Opportunistic Communications and Social Participation · IEEE Trans. Mob. Comput. 2012 |
Wireless networking
mobile social networks |
0.1 | 1 | 2012 | Mobile Data Offloading through Opportunistic Communications and Social Participation · IEEE Trans. Mob. Comput. 2012 |
Internet of things and sensor networks
opportunistic networks |
0.1 | 1 | 2012 | Mobile Data Offloading through Opportunistic Communications and Social Participation · IEEE Trans. Mob. Comput. 2012 |
Cellular and mobile networks › mobile data offloading
opportunistic offloading |
0.1 | 1 | 2012 | Mobile Data Offloading through Opportunistic Communications and Social Participation · IEEE Trans. Mob. Comput. 2012 |
Methods — techniques the papers use, named apart from their topics
trace-driven simulation · 0.1heuristic algorithm · 0.1greedy algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Mobile Data Offloading through Opportunistic Communications and Social Participationabstract3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. As a case study, we investigate the target-set selection problem for information delivery. In particular, we study how to select the target set with only k users, such that we can minimize the mobile data traffic over cellular networks. We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. Our simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload mobile data traffic by up to 73.66 percent for a real-world mobility trace. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we implement a proof-of-concept prototype, called Opp-off, on Nokia N900 smartphones, which utilizes their Bluetooth interface for device/service discovery and content transfer. Bo Han 0001, Pan Hui 0001, Anil Vullikanti, Madhav V. Marathe, Jianhua Shao 0002, Aravind Srinivasan |
IEEE Trans. Mob. Comput. | 5 |
| 2010 | Jive: A Generative, Interactive, Virtual, Evolutionary Music System
Jianhua Shao 0002, James McDermott, Michael O'Neill 0001, Anthony Brabazon |
EvoApplications (2) | 1 |