Zhiming ding

Dr. Zhiming ding


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
3 June 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ZWZhumei Wang
Zhumei Wang
XSXing Su
Xing Su
ZDZhiming ding
Zhiming ding
Accurate traffic flow prediction is becoming increasingly important for transportation planning, control, management, and information services of successful. Numerous existing models focus on short-term traffic forecasts, but effective long-term forecasting of traffic flows have become a challenging issue in recent years. To solve this problem, this paper proposes a deep learning architecture which consisting of two parts: the long short-term memory encoder-decoder structure at the bottom and the calibration layer at the top. In the encoder-decoder model, we propose an hard attention mechanism based on learning similar patterns to enhance neuronal memory and reduce the accumulation of error propagation. To correct some of the missing details, we design a control gate in the calibration layer to learn the predicted data in groups according to different forms. The proposed method is evaluated on real-world datasets and compared with other state-of-the-art methods. It is verified that our model can accurately learn local feature and long-term dependence, and has better accuracy and stability in long-term sequence prediction.

20 April 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
XSXing Su
Xing Su
MZMinjie Zhang
Minjie Zhang
YLYi Liang
Yi Liang
Zhi CaiZhi Cai
Zhi Cai
LGLimin Guo
Limin Guo
ZDZhiming ding
Zhiming ding
Multi-agent technologies have been widely applied to many applications, such as in e-markets, cloud computing, service-oriented environments, etc. In real applications, service-oriented environments are open and dynamic, where loosely coupled agents interact to consume and provide services. How to accurately evaluate the potential performance (i.e., QoS) of service providers on the service requested by a service consumer in such open and dynamic environments is a challenging issue in both theory and practice. In this paper, an innovative approach is proposed to evaluate the QoS of service providers in service-oriented environments. The proposed approach first borrows the reference report mechanism from the certified reputation model, so as to efficiently collect reference reports (i.e., historical performance) of service providers in open and dynamic environments. Then, a tensor-based QoS model is proposed to construct multi-dimensional relationships between QoS evaluation factors and the QoS values of service providers based on the collected reference reports. The QoS evaluation factors include the type of services, the performance of service providers, the subjectivity of service consumers, the time slot of reference reports. Finally, a CANDECOMP/PARAFAC decomposition and gradient descent-based mechanism is used to evaluate the QoS values of service providers through completing the missing entry values in the constructed tensor. The uniform random simulation experiments indicate that the proposed approach can achieve efficient and accurate QoS evaluation in service-oriented environments with only limited collected reference reports, especially when some service providers do not have reference reports.

2 March 2014 in Distributed and Parallel Databases
Verified
Journal Article
Closed access
PDF file
JXJiajie Xu
Jiajie Xu
YGYunjun Gao
Yunjun Gao
CLChengfei Liu
Chengfei Liu
LZLei Zhao
Lei Zhao
ZDZhiming ding
Zhiming ding

Verified
Journal Article
Open access
PDF file
BYBowen Yang
Bowen Yang
JYJin Yan
Jin Yan
Zhi CaiZhi Cai
Zhi Cai
ZDZhiming ding
Zhiming ding
DLDongze Li
Dongze Li
LGLimin Guo
Limin Guo
Emergency path planning technology is one of the research hotspots of intelligent transportation systems. Due to the complexity of urban road networks and congested road conditions, emergency path planning is very difficult. Road congestion caused by urban emergencies directly affects the original road network structure. In this way, the static weight of the original road network is no longer suitable as the basis for path recommendation. To handle the dynamic situational road network, an equidistant grid emergency path planning framework will be designed. A novel situation grid road network model, based on situation information, is proposed and applied to an equidistant grid emergency path planning framework. A situational grid heuristic search will be proposed methodology based on this model, which can be used to detect the vehicles passing around the congestion area grid and the road to the destination in the shortest time. In the path planning methodology, a grid inspired search strategy based on quaternion function is included, which can make the algorithm converge to the target grid quickly. Three graph acceleration algorithms are proposed to improve the search efficiency of path planning algorithm. Finally, this paper will set up three experiments to verify our proposed method.

24 August 2020 in IEEE Access
Verified
Journal Article
Open access
BYBowen Yang
Bowen Yang
ZDZhiming ding
Zhiming ding
LYLei Yuan
Lei Yuan
JYJin Yan
Jin Yan
LGLimin Guo
Limin Guo
Zhi CaiZhi Cai
Zhi Cai
When an emergency occurs in the city, a large area of road congestion usually occurs. Therefore, it is particularly important to provide an effective emergency path planning strategy for vehicles. However, existing emergency path planning methods do not take into account the connectivity characteristics of the road network and commuting capacity. For this purpose, a Grid Map Emergency Path Planning (GMEPP) framework based on a novel model Grid Road Network (GRN) is designed in this paper. First, the road network data is divided into grids under equal spacing bands, and the roads data divided into different grids and use the commuting capacity of each road as the weight of each edge in the grid. Then a Grid PageRank (GPR) algorithm will be introduced, the output value of this methodology is calculated based on the capacity and number of connected edges of all vertices pointed by the external grid in each grid. The higher value of the grid will be recommended to users first when the path is planning. According to the GRN model, an improved Bidirectional Dijkstra will be applied to query the shortest path between two points, which is called Gird Bidirectional Dijkstra (GBD). At last, GMEPP uses Reverse Contraction Hierarchies (RCH) and Multiple Reverse Contraction Hierarchies (MRCH) originality methodologies based on intersection type to speed up the query algorithm GBD. To compare the efficiency of the proposed method, this paper conducted extensive experiments to verify. The results of the test showed that the Gird Bidirectional Dijkstra Multiple Reverse Contraction Hierarchies (GBD-MRCH) is better than other methods in different grid distributions.

29 July 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Zhi CaiZhi Cai
Zhi Cai
TLTong Li
Tong Li
XSXing Su
Xing Su
LGLimin Guo
Limin Guo
ZDZhiming ding
Zhiming ding
With the development of society and economy, the urban rail transit has become one of the important components of urban transportation system, while the construction of the urban rail greatly improves the public transportation environments. Currently, there are many research focus on the passenger flow predictions according to their corresponding historical data, however, it is hard to assist transport models vary such volumes for a new station planning or being constructed. In view of this limitation, we provide a novel method for urban rail station characteristics analysis in intelligent transportation considering city land usages. Initially, point of interest (POIs) are divided by the proposed RC-tree (Colored R-tree)-based algorithm into the bounded areas for each station. Second, the Diversity and Proportion approaches are proposed to extract the top-k POIs from bounded areas based on their semantic and spatial characteristics. Then, classify the stations based on the similarity of the extracted top-k POIs. Moreover, we made a case study on real dataset, including a large volume of Automatic Fare Collection system (AFC) records for the experimental evaluations, and the results show that the proposed method can verify the rationality of land use and provide support for the application of transportation model technology.