全文获取类型
收费全文 | 1159篇 |
免费 | 30篇 |
专业分类
公路运输 | 220篇 |
综合类 | 318篇 |
水路运输 | 215篇 |
铁路运输 | 298篇 |
综合运输 | 138篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 25篇 |
2020年 | 35篇 |
2019年 | 12篇 |
2018年 | 18篇 |
2017年 | 24篇 |
2016年 | 31篇 |
2015年 | 48篇 |
2014年 | 90篇 |
2013年 | 51篇 |
2012年 | 81篇 |
2011年 | 91篇 |
2010年 | 67篇 |
2009年 | 69篇 |
2008年 | 70篇 |
2007年 | 128篇 |
2006年 | 110篇 |
2005年 | 83篇 |
2004年 | 35篇 |
2003年 | 20篇 |
2002年 | 18篇 |
2001年 | 20篇 |
2000年 | 11篇 |
1999年 | 15篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 2篇 |
排序方式: 共有1189条查询结果,搜索用时 538 毫秒
951.
基于神经网络的水下机器人运动预测控制方法 总被引:2,自引:1,他引:1
将神经网络和模糊理论应用于水下机器人运动规划和控制中,提出了能实现模拟控制规则的基于强化学习的自学习和自调整的规划算法,设计了水下机器人实时运动规划器结构以及规划器操作过程,提出了基于预测模糊控制进行水下机器人运动控制的方法。在计算机仿真状态下,实现了对水下机器人这一复杂非线性系统的预测控制,仿真实验结果验证了本文所提的方法的有效性。 相似文献
952.
准确的短时交通流预测是交通控制和交通诱导的依据. 提出一种基于改进灰狼算法(TGWO)优化BP 神经网络的短时交通流预测模型(TGWO-BP),有效提高短时交通流预测精度. 针对标准灰狼算法(GWO)收敛速度慢,容易陷入局部极值的问题,提出一种自适应递减的收敛因子,使灰狼算法区分全局搜索和局部搜索;改进灰狼个体的位置更新公式,引入惯性权重,调节惯性权重大小使灰狼算法具有跳出局部极值的能力;对比分析TGWO-BP、GWOBP 、PSO-BP、BP这4 种短时交通流预测模型,结果显示,TGWO-BP的短时交通流预测模型误差为10.03%,达到较好的预测精度. 相似文献
953.
船舶自动识别系统(Automatic Identify System,AIS)数据可以实时体现船舶当前时刻的具体动态,采用传统BP(Back Propagation)神经网络模型的船舶轨迹分析预测方法,在计算中直接将航艏向数据纳入模型,没有考虑船舶航艏向在零度附近变动时带来的实际方向变动幅度与数据变化幅度存在较大偏差问... 相似文献
954.
955.
956.
ABSTRACTThis paper reviews the activity-travel behaviour literature that employs Machine Learning (ML) techniques for empirical analysis and modelling. Machine Learning algorithms, which attempt to build intelligence utilizing the availability of large amounts of data, have emerged as powerful tools in the fields of pattern recognition and big data analysis. These techniques have been applied in activity-travel behaviour studies since the early ’90s when Artificial Neural Networks (ANN) were employed to model mode choice decisions. AMOS, an activity-based modelling system developed in the mid-’90s, has ANN at its core to model and predict individual responses to travel demand management measures. In the dawn of 2000, ALBATROSS, a comprehensive activity-based travel demand modelling system, was proposed by Arentze and Timmermans using Decision Trees. Since then researchers have been exploring ML techniques like Support Vector Machines (SVM), Decision Trees (DT), Neural Networks (NN), Bayes Classifiers, and more recently, Ensemble Learners to model and predict activity-travel behaviour. A large number of publications over the years and an upward trend in the number of published articles over time indicate that Machine Learning is a promising tool for activity-travel behaviour analysis and prediction. This article, first of its kind in the literature, reviews these studies and explores the trends in activity-travel behaviour research that apply ML techniques. The review finds that mode choice decisions have received wide attention in the literature on ML applications. It was observed that most of the studies identify the lack of interpretability as a serious shortcoming in ML techniques. However, very few studies have attempted to improve the interpretability of the models. Further, some studies report the importance of feature engineering in ML-based studies, but very few studies adopt feature engineering before model development. Spatiotemporal transferability of models is another issue that has received minimal attention in the literature. In the end, the paper discusses possible directions for future research in the area of activity-travel behaviour modelling using ML techniques. 相似文献
957.
故障位置点定位是实现轨道维护及保养的前提,利用接触网立柱标识牌实现定位是一种常用的轨道定位方法,但常规的识别方法存在识别率低且速度慢的缺点。针对该问题,提出一种基于图像处理和双神经网络的接触网立柱标识牌识别算法。首先利用Hough变换提取出接触网支柱区域,减小识别区域,其次通过形态学方法实现标识牌的定位与裁剪,再采用水平投影方法对字符进行分割,最后对字符中的字母和数字分别进行特征提取,利用两路并行的反向传播神经网络进行识别。通过实验验证了该算法的有效性,结果表明:该方法精度可达98.3%,相较于传统识别方法速度提高了17%。因此该识别算法能够实现轨道故障位置的快速精确定位,可用于轨道智能巡检系统。 相似文献
958.
Previous route choice studies treated uncertainties as randomness; however, it is argued that other uncertainties exist beyond random effects. As a general modeling framework for route choice under uncertainties, this paper presents a model of route choice that incorporates hyperpath and network generalized extreme-value-based link choice models. Accounting for the travel time uncertainty, numerical studies of specified models within the proposed framework are conducted. The modeling framework may be helpful in various research contexts dealing with both randomness and other non-probabilistic uncertainties that cannot be exactly perceived. 相似文献
959.
This study addresses the problem of scheduling a fleet of taxis that are appointed to solely service customers with advance reservations. In contrast to previous studies that have dealt with the planning and operations of a taxi fleet with only electric vehicles (EVs), we consider that most taxi companies may have to operate with fleets comprised of both gasoline vehicles (GVs) and plug-in EVs during the transition from GV to (complete) EV taxi fleets. This paper presents an innovative multi-layer taxi-flow time-space network which effectively describes the movements of the taxis in the dimensions of space and time. An optimization model is then developed based on the time-space network to determine an optimal schedule for the taxi fleet. The objective is to minimize the total operating cost of the fleet, with a set of operating constraints for the EVs and GVs included in the model. Given that the model is formulated as an integer multi-commodity network flow problem, which is characterized as NP-hard, we propose two simple but effective decomposition-based heuristics to efficiently solve the problem with practical sizes. Test instances generated based on the data provided by a Taiwan taxi company are solved to evaluate the solution algorithms. The results show that the gaps between the objective values of the heuristic solutions and those of the optimal solutions are less than 3%, and the heuristics require much less time to obtain the good quality solutions. As a result, it is shown that the model, coupled with the algorithms, can be an effective planning tool to assist the company in routing and scheduling its fleet to service reservation customers. 相似文献
960.