A. W.-C. Fu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
A. W.-C. Fu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Di Wang
SAIC Motor Corporation Limited, Shanghai, China
1 shared publication- Duo Zhang
Zhejiang Zhijiang Intelligent Transportation Technology Co., Ltd., Hangzhou 311100, China
1 shared publication F. Zou
School of Information Security Engineering, Shanghai Jiaotong University, China
1 shared publication- He Zhang
Department of Traffic Engineering and the Key Laboratory of Road and Traffic Engineering, Ministry of Education, Tongji University, Shanghai, China
1 shared publication - Huimin Chen
Chemistry and Chemical Engineering Guangdong Laboratory , Shantou 515021, China
1 shared publication - Jian Sun
Tongji University
1 shared publication
Latest Publications
- 31 October 2023
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2678 (4) , 279-294
Parallel-Computing-Based Calibration for Microscopic Traffic Simulation Model
Microscopic traffic simulation is vital to assess the performances of various traffic operation and management schemes. Microscopic traffic simulation is usually not parameter-free, and it relies on independent parameters to predict traffic evolution. Thus, parameter calibration is indispensable to conveying trustworthy simulation results. Heuristic algorithms are widely used for parameter calibration. Its logic is for achieving iterative optimization through continuous trial-and-error simulations. This process is time-consuming and usually takes several hours, making the calibration unable to meet the requirements of speed and efficiency. In recent years, parallel computing technology has been gradually applied in the engineering realm, which makes rapid calibration possible. Following the three steps of parallel framework selection, algorithm bottleneck identification, and subtask load balancing, this paper designs and implements the parallelization of genetic algorithm and particle swarm optimization (PSO) calibration algorithms. Finally, the proposed parallel framework is applied to simulation parameter calibration of a section of a 5 km long highway in Australia, and the effectiveness of parallel computing is evaluated from the two dimensions of reduction in calibration computational time and scalability. The results show that the proposed parallel calibration algorithm can shorten the 5 h calibration process to less than 1 h, reducing the calibration time by 80%. The parallel PSO calibration algorithm has better scalability, and its acceleration effect is better when more processors are used.
- 31 October 2023
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2678 (4) , 279-294
Parallel-Computing-Based Calibration for Microscopic Traffic Simulation Model
Microscopic traffic simulation is vital to assess the performances of various traffic operation and management schemes. Microscopic traffic simulation is usually not parameter-free, and it relies on independent parameters to predict traffic evolution. Thus, parameter calibration is indispensable to conveying trustworthy simulation results. Heuristic algorithms are widely used for parameter calibration. Its logic is for achieving iterative optimization through continuous trial-and-error simulations. This process is time-consuming and usually takes several hours, making the calibration unable to meet the requirements of speed and efficiency. In recent years, parallel computing technology has been gradually applied in the engineering realm, which makes rapid calibration possible. Following the three steps of parallel framework selection, algorithm bottleneck identification, and subtask load balancing, this paper designs and implements the parallelization of genetic algorithm and particle swarm optimization (PSO) calibration algorithms. Finally, the proposed parallel framework is applied to simulation parameter calibration of a section of a 5 km long highway in Australia, and the effectiveness of parallel computing is evaluated from the two dimensions of reduction in calibration computational time and scalability. The results show that the proposed parallel calibration algorithm can shorten the 5 h calibration process to less than 1 h, reducing the calibration time by 80%. The parallel PSO calibration algorithm has better scalability, and its acceleration effect is better when more processors are used.
- Open Access
- 1 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 756-764
On Efficient Content Matching in Distributed Pub/Sub Systems
The efficiency of matching structures is the key issue for content publish/subscribe systems. In this paper, we propose an efficient matching tree structure, named CobasTree, for a distributed environment. Particularly, we model a predicate in each subscription filter as an interval and published content value as a data point. The CobasTree is designed to index all subscription intervals and a matching algorithm is proposed to match the data points to these indexed intervals. Through a set of techniques including selective multicast by bounding intervals, cost model-based interval division, and CobasTree merging, CobasTree can match the published contents against subscription filters with a high efficiency. We call the whole framework including CobasTree and the associated techniques as COBAS. The performance evaluation in simulation environment and PlanetLab environment shows COBAS significantly outperforms two counterparts with low cost and fast forwarding.
- 1 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 756-764
Open AccessOn Efficient Content Matching in Distributed Pub/Sub Systems
The efficiency of matching structures is the key issue for content publish/subscribe systems. In this paper, we propose an efficient matching tree structure, named CobasTree, for a distributed environment. Particularly, we model a predicate in each subscription filter as an interval and published content value as a data point. The CobasTree is designed to index all subscription intervals and a matching algorithm is proposed to match the data points to these indexed intervals. Through a set of techniques including selective multicast by bounding intervals, cost model-based interval division, and CobasTree merging, CobasTree can match the published contents against subscription filters with a high efficiency. We call the whole framework including CobasTree and the associated techniques as COBAS. The performance evaluation in simulation environment and PlanetLab environment shows COBAS significantly outperforms two counterparts with low cost and fast forwarding.