Liuhang Zhang

dblp:61/10484 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1

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.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 78% Data mining · 22%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 77% Distributed systems · 12% GPUs and heterogeneous computing · 12%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
context-aware recommendation
0.212013
T-Finder: A Recommender System for Finding Passengers and Vacant Taxis · IEEE Trans. Knowl. Data Eng. 2013
Recommender systems
point-of-interest recommendation
0.212013
T-Finder: A Recommender System for Finding Passengers and Vacant Taxis · IEEE Trans. Knowl. Data Eng. 2013
Cloud and datacenter computing › datacenter architecture
datacenter server architecture
0.212013
Cost effective data center servers · HPCA 2013
Cloud and datacenter computing
resource disaggregation
0.212013
Cost effective data center servers · HPCA 2013
Data mining › spatiotemporal data mining › trajectory data mining
GPS trajectory mining
0.112011
Where to find my next passenger · UbiComp 2011
Distributed systems › distributed communication
remote memory access
0.012013
Cost effective data center servers · HPCA 2013

Methods — techniques the papers use, named apart from their topics

trace-driven benchmarking · 0.2prototype evaluation · 0.2probabilistic model · 0.2GPS trajectory mining · 0.2probabilistic modeling · 0.1mobility pattern learning · 0.1
YearPublicationVenuePosition
2013 Cost effective data center servers
abstract
The exploding growth of digitalized information has led to the rapid growth of data centers, both in numbers and in size. Cluster has been the dominating system architecture used in most data centers. However, the increasingly diversified data center applications have requirements beyond what the cluster architecture can deliver. For instance, clouding computing requires flexible sharing of all data center resources. Big data applications often need large memory capacity. A few applications can use GPGPU effectively. Existing system might be extended to a certain degree to meet those needs. Those extensions however would often be prohibitively expensive. The paper presents our attempt to design a system using commodity products that can meet the varying needs of many emerging data center applications in a cost-effective way. Our attempt is to create a system by connecting multiple nodes through a PCIe switch and then extend the software stack to support resource sharing among these nodes. In particular, a node can directly use the memory, NIC, and GPGPU of other nodes through the PCIe switch with no or little involvement from other nodes. We build a prototype as our evaluation platform. Our evaluation results indicate that those resources can be shared effectively in many cases. For using remote memory as block device, our prototype system has 5 times bandwidth, 11 times IOPS and 1/12 latency compared with the system connected by 10GigE in average for Orion benchmark; Using remote GPGPU via PCIe switch achieves average 60 times speedup than the case without GPGPU, and the performance loss is also acceptable (its average execution time is 1/3 of local GPGPU) for micro-benchmarks from GPU computing SDK; And using remote NIC via PCIe switch achieves average 95% bandwidth and 1.4 times latency of local NIC in httperf testing. While our prototype system offers multiple benefits, it is not perfect and has a lot room for further optimization and extension. We hope the outcome presented in this paper will encourage more researchers to join us in designing highly efficient and cost-effective servers.
Rui Hou 0001, Tao Jiang 0010, Liuhang Zhang, Jianbo Dong, Xiongli Gu
HPCA3
2013 T-Finder: A Recommender System for Finding Passengers and Vacant Taxis
abstract
This paper presents a recommender system for both taxi drivers and people expecting to take a taxi, using the knowledge of 1) passengers' mobility patterns and 2) taxi drivers' picking-up/dropping-off behaviors learned from the GPS trajectories of taxicabs. First, this recommender system provides taxi drivers with some locations and the routes to these locations, toward which they are more likely to pick up passengers quickly (during the routes or in these locations) and maximize the profit of the next trip. Second, it recommends people with some locations (within a walking distance) where they can easily find vacant taxis. In our method, we learn the above-mentioned knowledge (represented by probabilities) from GPS trajectories of taxis. Then, we feed the knowledge into a probabilistic model that estimates the profit of the candidate locations for a particular driver based on where and when the driver requests the recommendation. We build our system using historical trajectories generated by over 12,000 taxis during 110 days and validate the system with extensive evaluations including in-the-field user studies.
Nicholas Jing Yuan, Yu Zheng 0004, Liuhang Zhang, Xing Xie 0001
IEEE Trans. Knowl. Data Eng.3
2011 Where to find my next passenger
abstract
We present a recommender for taxi drivers and people expecting to take a taxi, using the knowledge of 1) passengers' mobility patterns and 2) taxi drivers' pick-up behaviors learned from the GPS trajectories of taxicabs. First, this recommender provides taxi drivers with some locations and the routes to these locations, towards which they are more likely to pick up passengers quickly (during the routes or at these locations) and maximize the profit. Second, it recommends people with some locations (within a walking distance) where they can easily find vacant taxis. In our method, we learn the above knowledge (represented by probabilities) from GPS trajectories of taxis. Then, we feed the knowledge into a probabilistic model which estimates the profit of the candidate locations for a particular driver based on where and when the driver requests for the recommendation. We validate our recommender using historical trajectories generated by over 12,000 taxis during 110 days.
Nicholas Jing Yuan, Yu Zheng 0004, Liuhang Zhang, Xing Xie 0001, Guangzhong Sun
UbiComp3