Shuo Liu

Shuo Liu

Auto-generated profile, based on publicly available information

Shuo Liu

Department of Electrical and Computer Engineering, National University of Singapore, Singapore 119077

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2017 in Energy and Buildings
Verified
Journal Article
Closed access
ZXZhanbo Xu
Zhanbo Xu
SLShuo Liu
Shuo Liu
GHGuoqiang Hu
Guoqiang Hu
CSCostas J. Spanos
Costas J. Spanos

1 September 2018 in Building and Environment
Verified
Journal Article
Open access
SLShuo Liu
Shuo Liu
ALAleksandra Lipczyńska
Aleksandra Lipczyńska
SSStefano Schiavon
Stefano Schiavon
EAEdward Arens
Edward Arens

1 March 2017 in Building and Environment
Verified
Journal Article
Closed access
SLShuo Liu
Shuo Liu
LYLe Yin
Le Yin
WHWeng Khuen Ho
Weng Khuen Ho
KLKeck Voon Ling
Keck Voon Ling
SSStefano Schiavon
Stefano Schiavon

19 April 2018 in Science and Technology for the Built Environment
Verified
Journal Article
Closed access
SLShuo Liu
Shuo Liu
LYLe Yin
Le Yin
SSStefano Schiavon
Stefano Schiavon
WHWeng Khuen Ho
Weng Khuen Ho
KLKeck Voon Ling
Keck Voon Ling
Personally controlled air movement can maintain or enhance thermal comfort in warm environments and reduce energy consumption. Unlike controlling a personal fan, using a system of fans for multiple occupants is difficult as it is hard to find an appropriate fan speed setting that maximizes occupants' satisfaction. Since limited work has been carried out on this issue, in this paper, a novel cooperative control approach for a system of fans is proposed to provide optimized air movement for multiple occupants. This is the first time that a system of fans is controlled cooperatively in the research of built environment. The proposed approach predicts airflow in a cost-effective manner by calibrating the fans in the real environment. The operation of the fans is optimized by minimizing the worst-case deviation between the actual air speed and the desired air speed, which can be determined based on either the PMV – SET model or the occupants' feedback. This minimax-error problem is formulated as an equivalent linear programming problem which can be solved using standard methods. The proposed approach was tested in two different indoor scenarios respectively by 1) measuring air speed directly in a business conference room and 2) involving human subject surveys in a university classroom. In the first experiment, the measured air speeds after optimization are closer to the target values at all tested temperature levels (26°C, 27.5°C, and 29°C) indicating improved thermal comfort. In the second experiment, only 62% of the occupants (totally 34) are satisfied with slightly increased room temperature (around 26.5°C) before optimization, while this number increased to 94% after optimization.

1 February 2021 in Virtual Reality & Intelligent Hardware
Verified
Journal Article
Open access
MSMeishu Song
Meishu Song
AMAdria Mallol-Ragolta
Adria Mallol-Ragolta
EPEmilia Parada-Cabaleiro
Emilia Parada-Cabaleiro
ZYZijiang Yang
Zijiang Yang
SLShuo Liu
Shuo Liu
BSBjörn W. Schuller
Björn W. Schuller

17 April 2024
Verified
Conference Paper
Open access
BZBohan Zhao
Bohan Zhao
WXWei Xu
Wei Xu
SLShuo Liu
Shuo Liu
YTYang Tian
Yang Tian
QWQiaoling Wang
Qiaoling Wang
WWWenfei Wu
Wenfei Wu
In-Network Aggregation (INA) offloads the gradient aggregation in distributed training (DT) onto programmable switches, where the switch memory could be allocated to jobs in either synchronous or statistical multiplexing mode. Statistical INA has advantages in switch memory utilization, control-plane simplicity, and management safety, but it faces the problem of cross-layer resource efficiency in job placement. This paper presents a job placement system NetPack for clusters with statistical INA, which aims to maximize the utilization of both computation and network resources. NetPack periodically batches and places jobs into the cluster. When placing a job, NetPack runs a steady state estimation algorithm to acquire the available resources in the cluster, heuristically values each server according to its available resources (GPU and bandwidth), and runs a dynamic programming algorithm to efficiently search for servers with the highest value for the job. Our prototype of NetPack and the experiments demonstrate that NetPack outperforms prior job placement methods by 45% in terms of average job completion time on production traces.