全文获取类型
收费全文 | 525篇 |
免费 | 37篇 |
专业分类
公路运输 | 162篇 |
综合类 | 212篇 |
水路运输 | 89篇 |
铁路运输 | 70篇 |
综合运输 | 29篇 |
出版年
2024年 | 4篇 |
2023年 | 5篇 |
2022年 | 14篇 |
2021年 | 13篇 |
2020年 | 28篇 |
2019年 | 9篇 |
2018年 | 8篇 |
2017年 | 23篇 |
2016年 | 11篇 |
2015年 | 36篇 |
2014年 | 39篇 |
2013年 | 28篇 |
2012年 | 35篇 |
2011年 | 52篇 |
2010年 | 37篇 |
2009年 | 41篇 |
2008年 | 38篇 |
2007年 | 38篇 |
2006年 | 34篇 |
2005年 | 22篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 15篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1991年 | 2篇 |
排序方式: 共有562条查询结果,搜索用时 15 毫秒
51.
52.
53.
54.
列车牵引定时计算是轨道交通列车牵引仿真系统的重要功能模块,对于实现列车按运行图模拟仿真运行具有重要意义。在考虑定时运行的基础上,实现列车运行全过程能耗最小化,则使该研究更具实际价值。在分析列车牵引计算运动学理论基础上,构建基于巡航惰行组合中间过程的列车运行定时节能仿真双层规划模型,分析以巡航速度为能耗控制变量、以惰行点位置为运行时间控制变量的二分法求解模型的可行性及解的存在性,设计基于二分法的列车运行定时节能优化算法。完成定时节能仿真模块的计算机程序编写,并以广州市域快线18号线(规划方案)万顷沙—横沥区段做案例分析。仿真计算列车运行时间与时刻表时间误差满足精度要求,且在能耗上求得最优解,表明模型构建和算法设计有效,且具有计算量少的优点。 相似文献
55.
56.
重点分析了基于硬判决的部分并行干扰消除(PPIC)检测器的残余多址干扰的结构及统计特性,研究了PPIC在定时跟踪误差情况下的性能,并给出了其在定时误差跟踪下的封闭形式的误码表达式。实验表明:采用部分干扰因子可以抑制PIC系统性能恶化,而基于文献[4]给出的部分干扰因子可进一步改善系统性能。 相似文献
57.
Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives. 相似文献
58.
59.
60.