全文获取类型
收费全文 | 2206篇 |
免费 | 61篇 |
专业分类
公路运输 | 1102篇 |
综合类 | 358篇 |
水路运输 | 440篇 |
铁路运输 | 260篇 |
综合运输 | 107篇 |
出版年
2024年 | 23篇 |
2023年 | 64篇 |
2022年 | 60篇 |
2021年 | 66篇 |
2020年 | 49篇 |
2019年 | 47篇 |
2018年 | 18篇 |
2017年 | 30篇 |
2016年 | 27篇 |
2015年 | 46篇 |
2014年 | 101篇 |
2013年 | 114篇 |
2012年 | 120篇 |
2011年 | 121篇 |
2010年 | 124篇 |
2009年 | 137篇 |
2008年 | 130篇 |
2007年 | 124篇 |
2006年 | 106篇 |
2005年 | 83篇 |
2004年 | 70篇 |
2003年 | 119篇 |
2002年 | 92篇 |
2001年 | 61篇 |
2000年 | 65篇 |
1999年 | 58篇 |
1998年 | 51篇 |
1997年 | 24篇 |
1996年 | 17篇 |
1995年 | 24篇 |
1994年 | 32篇 |
1993年 | 13篇 |
1992年 | 15篇 |
1991年 | 12篇 |
1990年 | 8篇 |
1989年 | 13篇 |
1988年 | 3篇 |
排序方式: 共有2267条查询结果,搜索用时 47 毫秒
241.
242.
243.
244.
山区公路水毁,其修复工程并不是按原样修复就能解决问题,提出了7种特殊的修复方法,这些方法都收到了较好的效果。 相似文献
245.
246.
On the basis of analysis of the principle of delay restoration in a disturbed schedule, a heuristic algorithm for rescheduling trains is developed by restoring the total delay of the disturbed schedule. A discrete event topologic model is derived from the original undisturbed train diagram and a back propagation analysis method is used to label the maximum buffer time of each point in the model. In order to analyze the principle of delay restoration, the concept of critical delay is developed from the labeled maximum buffer time. The critical delay is the critical point of successful delay restoration. All the disturbed trains are classified into the strong-delayed trains and the weak-delayed trains by the criterion of the critical delay. Only the latter, in which actual delay is less than its critical delay, can be adjusted to a normal running state during time horizon considered. The heuristic algorithm is used to restore all the disturbed trains according to their critical details. The cores of the algorithm are the iterative repair technique and two repair methods for the two kinds of trains. The algorithm searches iteratively the space of possible conflicts caused by disturbed trains using an earfiest-delay-first heuristics and always attempts to repair the earliest constraint violation. The algorithm adjusts the weak-delayed trains directly back to the normal running state using the buffer time of the original train diagram. For the strong-delayed trains,the algorithm uses an utility function with some weighted attributes to determine the dynamic priority of the trains, and resolves the conflict according to the calculated dynamic priority. In the end, the experimental results show that the algorithm produces "good enough" schedules effectively and efficiently in disturbed situations. 相似文献
247.
248.
AessandroBuonanno 《上海铁道科技》1999,(4):46-48
意大利国铁最近已开始实施一项创新方案,旨在修复、改善由高速、重载引起,已出现不稳定迹象的既有轨道路堤(约1200km)。 相似文献
249.
250.