|
|
|
|
|
Qiuling Tang and Wanfeng Dou
Calculating the least-cost path (LCP) is a fundamental operation in raster-based geographic information systems (GIS). The LCP is applied to raster cost surfaces, in which it determines the most cost-effective path. Increasing the raster resolution resul...
ver más
|
|
|
|
|
|
|
|
|
|
|
Keyju Lee and Junjae Chae
The vehicle routing problem (VRP) attempts to find optimal (minimum length) routes for a set of vehicles visiting a set of locations. Solving a VRP calls for a cost matrix between locations. The size of the matrix grows quadratically with an increasing n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dinh Thi Hong Huyen, Hoang Thi Thanh Ha and Michel Occello
Emergency evacuation is of paramount importance in protecting human lives and property while enhancing the effectiveness and preparedness of organizations and management agencies in responding to emergencies. In this paper, we propose a method for evacua...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tong Zhang, Rui Guo, Haolin Zhang, Hongyu Zhou, Yeyu Cao, Maokun Li, Fan Yang and Shenheng Xu
The change of acoustic velocity in the human thorax reflects the functional status of the respiratory system. Imaging the thorax?s acoustic velocity distribution can be used to monitor the respiratory system. In this paper, the feasibility of imaging the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhangcai Yin, Kuan Huang, Shen Ying, Wei Huang and Ziqiang Kang
Time geography considers that the probability of moving objects distributed in an accessible transportation network is not always uniform, and therefore the probability density function applied to quantitative time geography analysis needs to consider th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiaosong Yu, Jiye Wang, Kaixin Zhang, Jiaqi Lv, Yongli Zhao, Kaiqiang Gao, Xuerang Guo and Jie Zhang
With the development of optical networks technology, broad attention has been paid to flexible grid technology in optical networks due to its ability to carry large-capacity information as well as provide flexible and fine-grained services through on-dem...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang and Yang Zhong
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd?Warsh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Saeed A. Astaneh, Shahram Shah Heydari, Sara Taghavi Motlagh and Alireza Izaddoost
We consider the problem of SDN flow optimization in the presence of a dynamic probabilistic link failures model. We introduce a metric for path risk, which can change dynamically as network conditions and failure probabilities change. As these probabilit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shenghua Xu, Yang Gu, Xiaoyan Li, Cai Chen, Yingyi Hu, Yu Sang and Wenxing Jiang
The internal structure of buildings is becoming increasingly complex. Providing a scientific and reasonable evacuation route for trapped persons in a complex indoor environment is important for reducing casualties and property losses. In emergency and di...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xinning Li, Qun He, Qin Yang, Neng Wang, Hu Wu and Xianhai Yang
In order to obtain the optimal perspectives of the recognition target, this paper combines the motion path of the manipulator arm and camera. A path planning method to find the optimal perspectives based on an A* algorithm is proposed. The quality of per...
ver más
|
|
|
|
|
|