Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.112
Ruixin Chen, Na Lin, Jin Su, Yanjun Shi
Human-computer interaction system is the medium for human and computer. The rationality and intelligence of its design directly affect the work efficiency and execution ability of relevant practitioners. Traditional human-computer interaction evaluation usually adopts expert evaluation method. This method is difficult to evaluate objectively because of people’s subjective cognitive differences. Therefore, this paper proposes an intelligent evaluation method for complex human-computer interaction system based on BP neural network model. First, the known evaluation indicators are classified and organized, and five key evaluation indicators are optimized according to importance and relevance. Then the index is quantified into the evaluation function according to the fuzzy analytic hierarchy process. Finally, the data obtained by the simulation test is used as the training set and test set of the BP neural network, and then the evaluation model of the humancomputer interaction system is obtained.
{"title":"BP Neural Network-based Model for Evaluating User Interfaces of Human-computer Interaction System","authors":"Ruixin Chen, Na Lin, Jin Su, Yanjun Shi","doi":"10.2991/ICMEIT-19.2019.112","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.112","url":null,"abstract":"Human-computer interaction system is the medium for human and computer. The rationality and intelligence of its design directly affect the work efficiency and execution ability of relevant practitioners. Traditional human-computer interaction evaluation usually adopts expert evaluation method. This method is difficult to evaluate objectively because of people’s subjective cognitive differences. Therefore, this paper proposes an intelligent evaluation method for complex human-computer interaction system based on BP neural network model. First, the known evaluation indicators are classified and organized, and five key evaluation indicators are optimized according to importance and relevance. Then the index is quantified into the evaluation function according to the fuzzy analytic hierarchy process. Finally, the data obtained by the simulation test is used as the training set and test set of the BP neural network, and then the evaluation model of the humancomputer interaction system is obtained.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126287768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.20
Jie Ling, Junyi Xu
Location services bring convenience to people's lives, but also easily lead to the disclosure of personal privacy information. Many location privacy protection methods are based on trusted anonymous servers, but in real life, the anonymous servers are not trusted. This paper proposes a decentralized location privacy protection method of offset grid for untrusted anonymous servers. The method divides the location area into grids, and the user calculates the offset grid area according to the periodically updated grid information and sends the offset grid area to the anonymous server. The anonymous server selects K-1 distributed grid coordinates according to the history of other user's query, the anonymous grid points set satisfies the multi-diversity. The method in this paper has lower time overhead while protecting user privacy information, and the location distribution of anonymous location sets is more decentralized. Experiments were carried out on the simulated data set. The experimental results verify the effectiveness of the method.
{"title":"Decentralized Location Privacy Protection Method of Offset Grid","authors":"Jie Ling, Junyi Xu","doi":"10.2991/ICMEIT-19.2019.20","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.20","url":null,"abstract":"Location services bring convenience to people's lives, but also easily lead to the disclosure of personal privacy information. Many location privacy protection methods are based on trusted anonymous servers, but in real life, the anonymous servers are not trusted. This paper proposes a decentralized location privacy protection method of offset grid for untrusted anonymous servers. The method divides the location area into grids, and the user calculates the offset grid area according to the periodically updated grid information and sends the offset grid area to the anonymous server. The anonymous server selects K-1 distributed grid coordinates according to the history of other user's query, the anonymous grid points set satisfies the multi-diversity. The method in this paper has lower time overhead while protecting user privacy information, and the location distribution of anonymous location sets is more decentralized. Experiments were carried out on the simulated data set. The experimental results verify the effectiveness of the method.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114529399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.74
Ming Li, R. Hu, Hong Xu, Huimin Zhao, Xueri Li
Aiming at the problems of asymmetric information and long delay time and excessive use of network traffic and inaccurate recommendation in the traditional medical information recommendation algorithm, the improved adaptive scheduling algorithm and intelligent optimization recommendation algorithm are combined, it can completely solve the problems of time, traffic occupancy, stability and accuracy of medical information push. In this paper, an improved adaptive scheduling algorithm is proposed to solve the problems of time occupancy, traffic flow and connection stability of medical information recommendation. The proposed intelligent optimization recommendation algorithm solves the accuracy problem of medical information recommendation. Experimental results show that the proposed algorithm has the advantages of short delay time, low flow occupation, stable connection and high accuracy of push.
{"title":"Research on Intelligent Scheduling Optimization Selection Algorithm for Medical Information","authors":"Ming Li, R. Hu, Hong Xu, Huimin Zhao, Xueri Li","doi":"10.2991/ICMEIT-19.2019.74","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.74","url":null,"abstract":"Aiming at the problems of asymmetric information and long delay time and excessive use of network traffic and inaccurate recommendation in the traditional medical information recommendation algorithm, the improved adaptive scheduling algorithm and intelligent optimization recommendation algorithm are combined, it can completely solve the problems of time, traffic occupancy, stability and accuracy of medical information push. In this paper, an improved adaptive scheduling algorithm is proposed to solve the problems of time occupancy, traffic flow and connection stability of medical information recommendation. The proposed intelligent optimization recommendation algorithm solves the accuracy problem of medical information recommendation. Experimental results show that the proposed algorithm has the advantages of short delay time, low flow occupation, stable connection and high accuracy of push.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126162905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.62
Jianfeng Liao, J. You, Qun Zhang
In the era of big data, university library information management services must be based on actual conditions, using high-quality data to improve big data management. However, high-quality big data is useful data that needs to be filtered and classified. Big data cleansing is an effective way to improve data quality. To this end, the paper proposes to integrate the data resources of efficient libraries, analyze the source and type of useless data, and design a hierarchical management model of data. The model includes management operation level, data cleaning and filtering level, data integration level and big data. At the resource utilization level, after attempting to filter invalid data through data cleaning, the complexity of big data decision analysis is reduced, library big data integration is promoted, big data decision-making is realized, and the possibility of library big data integration and sharing is improved.
{"title":"Research on Library Big Data Cleaning System based on Big Data Decision Analysis Needs","authors":"Jianfeng Liao, J. You, Qun Zhang","doi":"10.2991/ICMEIT-19.2019.62","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.62","url":null,"abstract":"In the era of big data, university library information management services must be based on actual conditions, using high-quality data to improve big data management. However, high-quality big data is useful data that needs to be filtered and classified. Big data cleansing is an effective way to improve data quality. To this end, the paper proposes to integrate the data resources of efficient libraries, analyze the source and type of useless data, and design a hierarchical management model of data. The model includes management operation level, data cleaning and filtering level, data integration level and big data. At the resource utilization level, after attempting to filter invalid data through data cleaning, the complexity of big data decision analysis is reduced, library big data integration is promoted, big data decision-making is realized, and the possibility of library big data integration and sharing is improved.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126808734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.110
X. Deng, Xiaomeng Wang
. The contagion models of disease-spread which predict the epidemics grow with time goes by have been widely researched in social networks. The discrete-time simulation method, Monte Carlo Simulation where time is discretized into uniform steps and transition rates between states are replaced by transition probabilities, are mostly applied when simulating the models. In this paper, we propose a continuous-time approach, the Gillespie algorithm, which can be used for fast simulation of stochastic processes, is event-driven rather than using equally-spaced time steps. We show how the method can be adapted to the epidemic models, mainly in the susceptible-infected model and susceptible-infected-susceptible model, and confirm the accuracy of the method with numerical simulations. Based on the accuracy of the method, we make some changes in epidemic models to make the models more applicable.
{"title":"The Application of Gillespie Algorithm in Spreading","authors":"X. Deng, Xiaomeng Wang","doi":"10.2991/ICMEIT-19.2019.110","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.110","url":null,"abstract":". The contagion models of disease-spread which predict the epidemics grow with time goes by have been widely researched in social networks. The discrete-time simulation method, Monte Carlo Simulation where time is discretized into uniform steps and transition rates between states are replaced by transition probabilities, are mostly applied when simulating the models. In this paper, we propose a continuous-time approach, the Gillespie algorithm, which can be used for fast simulation of stochastic processes, is event-driven rather than using equally-spaced time steps. We show how the method can be adapted to the epidemic models, mainly in the susceptible-infected model and susceptible-infected-susceptible model, and confirm the accuracy of the method with numerical simulations. Based on the accuracy of the method, we make some changes in epidemic models to make the models more applicable.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127509838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.109
Wenjun Ji
Co-simulation technology plays a vital role in computer software engineering design and development. How to improve resource allocation and workflow coupling computational efficiency in complex simulation is a key point in software engineering management. Scientific workflow technology is the means of support to solve the above problems. This method can simplify the complicated operation process of software product developers' collection, calculation and analysis of large-scale scientific data, realize product process customization, deployment and execution, and effectively improve the problem-solving efficiency. Based on this, the thesis uses the scientific workflow concept to implement collaborative simulation calculation in computer software engineering to improve software design efficiency.
{"title":"Research on Computer Software Engineering based on Scientific Workflow","authors":"Wenjun Ji","doi":"10.2991/ICMEIT-19.2019.109","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.109","url":null,"abstract":"Co-simulation technology plays a vital role in computer software engineering design and development. How to improve resource allocation and workflow coupling computational efficiency in complex simulation is a key point in software engineering management. Scientific workflow technology is the means of support to solve the above problems. This method can simplify the complicated operation process of software product developers' collection, calculation and analysis of large-scale scientific data, realize product process customization, deployment and execution, and effectively improve the problem-solving efficiency. Based on this, the thesis uses the scientific workflow concept to implement collaborative simulation calculation in computer software engineering to improve software design efficiency.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130125520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.43
Bo Wang, Yan Zhou, Yufeng Bi, Qiangqiang Jing, Qiangmin Zhang, Jie Song
Abstract. Natural risks of expressway remain an important part of its operation risks. However, due to the variety, universality, locality and suddenness of natural risks, the prediction of expressway natural risks is difficult to forecast and control. In this paper, the expressway natural risk loss prediction model is established by the combining method of Chaos theory and Neural network according to the accident percentage data of rainy weather in recent 20 years in Shandong province. The use of this combining method can solve the problem of uncertain risk factors in expressway operation risks and can provide for decision-making reference and data support for expressway management and operation departments.
{"title":"Prediction Model of Expressway Natural Risk Loss","authors":"Bo Wang, Yan Zhou, Yufeng Bi, Qiangqiang Jing, Qiangmin Zhang, Jie Song","doi":"10.2991/ICMEIT-19.2019.43","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.43","url":null,"abstract":"Abstract. Natural risks of expressway remain an important part of its operation risks. However, due to the variety, universality, locality and suddenness of natural risks, the prediction of expressway natural risks is difficult to forecast and control. In this paper, the expressway natural risk loss prediction model is established by the combining method of Chaos theory and Neural network according to the accident percentage data of rainy weather in recent 20 years in Shandong province. The use of this combining method can solve the problem of uncertain risk factors in expressway operation risks and can provide for decision-making reference and data support for expressway management and operation departments.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127653994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.98
Zhangqian Zhu, Xiaomeng Wang, Shi Qiu
Rank aggregation is the process of aggregating multiple base rankers into a single but more comprehensive ranker, which plays an important role in many domains such as recommender system, meta-search, database, genomics, etc. Works related to the comparison of rank aggregation methods all don’t have a suitable and general data generation mechanism to produce data with various characteristics and lack a more reasonable and effective algorithm evaluation performance index. Therefore, this paper presents a general data generation mechanism based on Mallows model to produce synthetic controllable datasets, uses generalized Kendall rank correlation coefficient and rank-biased overlap to evaluate and compare the performance of two kinds of methods under different settings. Besides, we also consider the comparison between indices and the impact of data characteristics on the algorithms. This paper may be helpful to researchers and decision-makers from multiple domains.
{"title":"Comparing Rank Aggregation Methods based on Mallows Model","authors":"Zhangqian Zhu, Xiaomeng Wang, Shi Qiu","doi":"10.2991/ICMEIT-19.2019.98","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.98","url":null,"abstract":"Rank aggregation is the process of aggregating multiple base rankers into a single but more comprehensive ranker, which plays an important role in many domains such as recommender system, meta-search, database, genomics, etc. Works related to the comparison of rank aggregation methods all don’t have a suitable and general data generation mechanism to produce data with various characteristics and lack a more reasonable and effective algorithm evaluation performance index. Therefore, this paper presents a general data generation mechanism based on Mallows model to produce synthetic controllable datasets, uses generalized Kendall rank correlation coefficient and rank-biased overlap to evaluate and compare the performance of two kinds of methods under different settings. Besides, we also consider the comparison between indices and the impact of data characteristics on the algorithms. This paper may be helpful to researchers and decision-makers from multiple domains.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116800629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.77
Zehua Zhang, Jiahao Ye, Shuoya Cheng
In recent years, the number of motor vehicles in China has grown rapidly, and the contradiction between supply and demand of vehicles and roads has become more apparent. The problem of urban traffic congestion has become increasingly prominent, and the mechanism of congestion resolution has emerged. At present, there are still many shortcomings in China's traffic congestion control system. The phenomenon of urban road congestion is still widespread. The existing traffic control system cannot meet the complicated traffic network and cannot alleviate the deterioration of traffic conditions. This paper proposes a multi-agent traffic control system, which aims to control the green-signal and red-signal ratio of traffic flow at multiple adjacent intersections in the traffic network, thereby improving the driving ability of the traffic flow. This paper starts from the traffic control network and uses a single agent as the unit. Through multi-agent technology, the information between multiple agents at each intersection can be circulated, and each agent can quickly respond and automatically adapt to changes in traffic information. A genetic algorithm is used to establish a distributed urban traffic control system that can be continuously optimized. It is hoped that through the research in this paper, the problem of urban road traffic congestion deterioration can be effectively solved, thereby improving the vehicle traffic capacity and the efficiency of social activities.
{"title":"Research on Traffic Congestion Resolution Mechanism based on Genetic Algorithm and Multi-Agent","authors":"Zehua Zhang, Jiahao Ye, Shuoya Cheng","doi":"10.2991/ICMEIT-19.2019.77","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.77","url":null,"abstract":"In recent years, the number of motor vehicles in China has grown rapidly, and the contradiction between supply and demand of vehicles and roads has become more apparent. The problem of urban traffic congestion has become increasingly prominent, and the mechanism of congestion resolution has emerged. At present, there are still many shortcomings in China's traffic congestion control system. The phenomenon of urban road congestion is still widespread. The existing traffic control system cannot meet the complicated traffic network and cannot alleviate the deterioration of traffic conditions. This paper proposes a multi-agent traffic control system, which aims to control the green-signal and red-signal ratio of traffic flow at multiple adjacent intersections in the traffic network, thereby improving the driving ability of the traffic flow. This paper starts from the traffic control network and uses a single agent as the unit. Through multi-agent technology, the information between multiple agents at each intersection can be circulated, and each agent can quickly respond and automatically adapt to changes in traffic information. A genetic algorithm is used to establish a distributed urban traffic control system that can be continuously optimized. It is hoped that through the research in this paper, the problem of urban road traffic congestion deterioration can be effectively solved, thereby improving the vehicle traffic capacity and the efficiency of social activities.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114449585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.2991/ICMEIT-19.2019.128
M. Su, Xiaojun Deng
In recent years, high-speed rail transport and air transport have developed rapidly at home and abroad, and the competition between railway transport and air transport is becoming increasingly fierce, but there is also room for cooperation. Overseas Heathrow Airport, Skip Airport, Charles de Gaulle Airport, Frankfurt Airport before and after the provision of air rail transport services, which have an impact on the domestic airport cities. This paper makes a comparative analysis of the air-to-rail intermodal transport in the main airport cities at home and abroad, and obtains the following conclusions: saving the transfer time, shortening the distance between the air rail hubs, and vigorously developing the air rail transport by goods. Introduction of private capital investment in the construction of air-rail combined transport facilities and other five aspects of enlightenment.
{"title":"The Experience of Air-Rail Transport in Airports at Home and Abroad and Its Enlightenment to Guangzhou","authors":"M. Su, Xiaojun Deng","doi":"10.2991/ICMEIT-19.2019.128","DOIUrl":"https://doi.org/10.2991/ICMEIT-19.2019.128","url":null,"abstract":"In recent years, high-speed rail transport and air transport have developed rapidly at home and abroad, and the competition between railway transport and air transport is becoming increasingly fierce, but there is also room for cooperation. Overseas Heathrow Airport, Skip Airport, Charles de Gaulle Airport, Frankfurt Airport before and after the provision of air rail transport services, which have an impact on the domestic airport cities. This paper makes a comparative analysis of the air-to-rail intermodal transport in the main airport cities at home and abroad, and obtains the following conclusions: saving the transfer time, shortening the distance between the air rail hubs, and vigorously developing the air rail transport by goods. Introduction of private capital investment in the construction of air-rail combined transport facilities and other five aspects of enlightenment.","PeriodicalId":223458,"journal":{"name":"Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121512841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：