全文获取类型
收费全文 | 3901篇 |
免费 | 236篇 |
专业分类
公路运输 | 1006篇 |
综合类 | 1358篇 |
水路运输 | 993篇 |
铁路运输 | 557篇 |
综合运输 | 223篇 |
出版年
2024年 | 16篇 |
2023年 | 55篇 |
2022年 | 106篇 |
2021年 | 185篇 |
2020年 | 208篇 |
2019年 | 106篇 |
2018年 | 93篇 |
2017年 | 137篇 |
2016年 | 129篇 |
2015年 | 201篇 |
2014年 | 356篇 |
2013年 | 274篇 |
2012年 | 345篇 |
2011年 | 370篇 |
2010年 | 239篇 |
2009年 | 224篇 |
2008年 | 206篇 |
2007年 | 256篇 |
2006年 | 214篇 |
2005年 | 130篇 |
2004年 | 68篇 |
2003年 | 46篇 |
2002年 | 29篇 |
2001年 | 40篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 9篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有4137条查询结果,搜索用时 669 毫秒
71.
为解决传统车队离散模型基于概率分布假设和现有交通流预测时间粒度过大不能应用于自适应信号配时优化等问题.在车队离散模型的建模思路上,先分析了下游交叉口车辆到达与上游交叉口车辆离去之间的关系,基于此构建了基于神经网络的小时间粒度交通流预测模型.该模型以上游交叉口离去流量分布为输入,下游交叉口到达流量分布为输出,时间粒度为5 s.最后,通过实际调查数据标定模型参数并应用模型预测下游交叉口到达流量.结果表明,与Robertson模型相比,本文模型预测结果能够更好地反映交通流的变化特征,平均预测误差减少了8.3%.成果可用于信号配时优化. 相似文献
72.
It is well recognized that the left-turning movement reduces the intersection capacity significantly, because exclusive left turn phases are needed to discharge left turn vehicles only. This paper proposes the concept of Left-Hand Traffic (LHT) arterial, on where vehicles follow left-hand traffic rules as in England and India. The unconventional intersection where a LHT arterial intersects with a Right-Hand Traffic (RHT) arterial is named as symmetric intersection. It is only need three basic signal phases to separate all conflicts at symmetric intersection, while it at least need four signal phases at a conventional intersection. So, compared with the conventional intersection, the symmetric intersection can provide longer green time for the left-turning and the through movement, which can increase the capacity significantly. Through-movement waiting areas (TWAs) can be set at the symmetric intersection effectively, which can increase the capacity and short the cycle length furthermore. And the symmetric intersection is Channelized to improve the safety of TWAs. The Binary-Mixed-Integer-Linear-Programming (BMILP) model is employed to formulate the capacity maximization problem and signal cycle length minimization problem of the symmetric intersection. The BMILP model can be solved by standard branch-and-bound algorithms efficiently and outputs the lane allocation, signal timing decisions, and other decisions. Experiments analysis shows that the symmetric intersection with TWAs can increase the capacity and short the signal cycle length. 相似文献
73.
74.
根据重力相似准则,采用比尺为1∶100的整体模型,进行某宽浅河道低水头水电枢纽口门区的通航安全性研究。采用ADV三维流速测量系统进行流速测量;采用标准矩形量水堰控制模型流量;采用差动式尾门调节模型水位。由于河道地形及枢纽布置的原因,上游口门区流速过大,下游口门区形成大范围回流。通过扩大河道过流面积,移除下游河道中心连续小岛,增加闸孔等措施,减小下泄水流流速,改善河道整体水流状态;通过加长导航墙,改变导航墙透水面积,优化口门区域地形等措施极大地改善了船闸上下游引航道及口门区通航水流条件,确保过闸船舶的安全。 相似文献
75.
以跨径为30 m的城市轨道交通槽形梁为研究对象,采用精细化有限元方法研究槽形梁设计几何参数梁高、道床板厚度及角隅斜率对其力学性能的影响。分析结果表明:槽形梁主梁截面刚度随梁高的增加而增加,在给定跨径30 m的情况下存在最佳梁高1.8 m;道床板厚度与横向跨度有关,横向跨度为4 m时,适宜的道床板厚度是0.26 m;角隅斜率对槽形梁的影响主要表现在结合处的力学性能,推荐使用1:(2.5~3.0)。 相似文献
76.
In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm. 相似文献
77.
78.
79.
Two-dimensional multi-objective optimizations have been used for decades for the problems in traffic engineering although only few times so far in the optimization of signal timings. While the other engineering and science disciplines have utilized visualization of 3-dimensional Pareto fronts in the optimization studies, we have not seen many of those concepts applied to traffic signal optimization problems. To bridge the gap in the existing knowledge this study presents a methodology where 3-dimensional Pareto Fronts of signal timings, which are expressed through mobility, (surrogate) safety, and environmental factors, are optimized by use of an evolutionary algorithm. The study uses a segment of 5 signalized intersections in West Valley City, Utah, to test signal timings which provide a balance between mobility, safety and environment. In addition, a set of previous developed signal timing scenarios, including some of the Connected Vehicle technologies such as GLOSA, were conducted to evaluate the quality of the 3-dimensional Pareto front solutions. The results show success of 3-dimensinal Pareto fronts moving towards optimality. The resulting signal timing plans do not show large differences between themselves but all improve on the signal timings from the field, significantly. The commonly used optimization of standard single-objective functions shows robust solutions. The new set of Connected Vehicle technologies also shows promising benefits, especially in the area of reducing inter-vehicular friction. The resulting timing plans from two optimization sets (constrained and unconstrained) show that environmental and safe signal timings coincide but somewhat contradict mobility. Further research is needed to apply similar concepts on a variety of networks and traffic conditions before generalizing findings. 相似文献
80.