全文获取类型
收费全文 | 395篇 |
免费 | 6篇 |
专业分类
公路运输 | 61篇 |
综合类 | 77篇 |
水路运输 | 67篇 |
铁路运输 | 104篇 |
综合运输 | 92篇 |
出版年
2024年 | 1篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 22篇 |
2019年 | 5篇 |
2018年 | 15篇 |
2017年 | 16篇 |
2016年 | 16篇 |
2015年 | 24篇 |
2014年 | 29篇 |
2013年 | 24篇 |
2012年 | 30篇 |
2011年 | 25篇 |
2010年 | 11篇 |
2009年 | 16篇 |
2008年 | 13篇 |
2007年 | 42篇 |
2006年 | 25篇 |
2005年 | 20篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 11篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 2篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1992年 | 2篇 |
排序方式: 共有401条查询结果,搜索用时 15 毫秒
1.
滑模摊铺机施工混凝土路面工艺原理及设备选型 总被引:1,自引:0,他引:1
傅智 《筑路机械与施工机械化》1997,14(2):25-30
从滑模摊铺水泥混凝土路面施工应用的角度,以不配备布料机,单台滑模摊铺机施工时的工艺理论及机构设计上,对如何适应和满足中国高等级公路水泥混凝土路面施工的需要,提出了滑模摊铺机施工工艺原理以及各施工单位在选择滑模摊铺机械时应该注意的工艺技术细节和随机附件的选配要求。 相似文献
2.
3.
编组站进路调度优化算法 总被引:1,自引:0,他引:1
分析编组站作业进路选排问题的本质,以各任务的延误时间加权值总和最小为最优目标,以任务的前后工序选择路径为动态约束,建立编组站作业进路调度数学模型,采用遗传算法求解。编码采用定长染色体,长度为任务的工序数,每个工序采用2段制,编码中的顺序唯一地确定了每工序对指定进路占用的起讫时间和指标递推,设计基于优先规则的编码算法步骤。为保证解的可行性,将编码合法化,对工序进行拓扑排序。递推计算工序开始时间和结束时间,进而计算编码的目标值,并将其转化为适应值。采用轮盘赌与最优性相结合的方法进行选择,设计基于位置成组移位的杂交算子和随机交换的变异算子。以某编组站为例进行模拟计算,结果证明该算法满足编组站进路调度工作的要求。 相似文献
4.
魏文海 《铁道标准设计通讯》2018,(2):17-23
为系统分析出铁路专用线选线时各种控制要素,尝试探寻铁路专用线选线的独特规律,通过对铁路专用线选线功能及作用的分析,系统阐述铁路专用线选线时"路内"、"路外"各种控制要素和关键优缺点,同时理论与实践相结合,以华能铜川电厂铁路专用线工程为实例,对铁路专用线选线时涉及的运输通道、技术标准、接轨方案等进行多角度比选分析,使推荐的线路方案满足各方需求,工程合理可行。铁路专用线选线与国铁干线选线相比,既有着相同的特点也有着独特的考虑因素,为铁路专用线选线提供系统、全面、科学的控制因素及比选方法。 相似文献
5.
6.
7.
Bus fuel economy is deeply influenced by the driving cycles, which vary for different route conditions. Buses optimized for a standard driving cycle are not necessarily suitable for actual driving conditions, and, therefore, it is critical to predict the driving cycles based on the route conditions. To conveniently predict representative driving cycles of special bus routes, this paper proposed a prediction model based on bus route features, which supports bus optimization. The relations between 27 inter-station characteristics and bus fuel economy were analyzed. According to the analysis, five inter-station route characteristics were abstracted to represent the bus route features, and four inter-station driving characteristics were abstracted to represent the driving cycle features between bus stations. Inter-station driving characteristic equations were established based on the multiple linear regression, reflecting the linear relationships between the five inter-station route characteristics and the four inter-station driving characteristics. Using kinematic segment classification, a basic driving cycle database was established, including 4704 different transmission matrices. Based on the inter-station driving characteristic equations and the basic driving cycle database, the driving cycle prediction model was developed, generating drive cycles by the iterative Markov chain for the assigned bus lines. The model was finally validated by more than 2 years of acquired data. The experimental results show that the predicted driving cycle is consistent with the historical average velocity profile, and the prediction similarity is 78.69%. The proposed model can be an effective way for the driving cycle prediction of bus routes. 相似文献
8.
基于遗传算法和ABAQUS参数化有限元仿真技术,对传统的BP-GA优化方法进行改进,并采用改进的BP-GA方法对浮式生产储油卸油装置(FPSO)舷侧结构的耐撞性能进行优化,以验证其可行性和准确性。结果表明,与传统的BP神经网络相比,经遗传算法优化的BP神经网络具有更高的预测精度和更强的泛化能力;改进的BP-GA优化方法可在结构减重的基础上进一步提高结构的耐撞性能,能较好地适用于复杂的FPSO舷侧结构耐撞性优化设计。采用的优化方法具有通用性,可为抗爆性能的优化设计提供参考。 相似文献
9.
The integration of internet and mobile phones has opened the door to a new wave of utilizing private vehicles as probes not only for performance evaluation but for traffic control as well, gradually replacing the role of traffic surveillance systems as the dominant source of traffic data. To prepare for such a paradigm shift, one needs to overcome some key institutional barriers, in particular, the privacy issue. A Highway Voting System (HVS) is proposed to address this issue in which drivers provide link- and/or path-based vehicle data to the traffic management system in the form of “votes” in order to receive favorable service from traffic control. The proposed HVS offers a platform that links data from individual vehicles directly with traffic control. In the system, traffic control responds to voting vehicles in a way similar to the current system responding to prioritized vehicles and providing the requested services accordingly. We show in the paper that the proposed “voting” system can effectively resolve the privacy issue which often hampers traffic engineers from getting detailed data from drivers. Strategies to entice drivers into “voting” so as to increase the market penetration level under all traffic conditions are discussed. Though the focus of the paper is on addressing the institutional issues associated with data acquisition from individual vehicles, other research topics associated with the proposed system are identified. Two examples are given to demonstrate the impact of the proposed system on algorithm development and traffic control. 相似文献
10.
This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency. 相似文献