首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   17395篇
  免费   1138篇
公路运输   4996篇
综合类   5278篇
水路运输   4807篇
铁路运输   2414篇
综合运输   1038篇
  2024年   67篇
  2023年   133篇
  2022年   449篇
  2021年   555篇
  2020年   684篇
  2019年   496篇
  2018年   463篇
  2017年   561篇
  2016年   562篇
  2015年   831篇
  2014年   1298篇
  2013年   995篇
  2012年   1618篇
  2011年   1586篇
  2010年   1171篇
  2009年   1096篇
  2008年   1050篇
  2007年   1335篇
  2006年   1117篇
  2005年   694篇
  2004年   447篇
  2003年   304篇
  2002年   200篇
  2001年   203篇
  2000年   135篇
  1999年   88篇
  1998年   70篇
  1997年   67篇
  1996年   63篇
  1995年   44篇
  1994年   28篇
  1993年   30篇
  1992年   20篇
  1991年   18篇
  1990年   15篇
  1989年   19篇
  1988年   4篇
  1987年   2篇
  1986年   7篇
  1985年   2篇
  1984年   6篇
排序方式: 共有10000条查询结果,搜索用时 716 毫秒
251.
With trajectory data, a complete microscopic and macroscopic picture of traffic flow operations can be obtained. However, trajectory data are difficult to observe over large spatiotemporal regions—particularly in urban contexts—due to practical, technical and financial constraints. The next best thing is to estimate plausible trajectories from whatever data are available. This paper presents a generic data assimilation framework to reconstruct such plausible trajectories on signalized urban arterials using microscopic traffic flow models and data from loops (individual vehicle passages and thus vehicle counts); traffic control data; and (sparse) travel time measurements from whatever source available. The key problem we address is that loops suffer from miss- and over-counts, which result in unbounded errors in vehicle accumulations, rendering trajectory reconstruction highly problematic. Our framework solves this problem in two ways. First, we correct the systematic error in vehicle accumulation by fusing the counts with sparsely available travel times. Second, the proposed framework uses particle filtering and an innovative hierarchical resampling scheme, which effectively integrates over the remaining error distribution, resulting in plausible trajectories. The proposed data assimilation framework is tested and validated using simulated data. Experiments and an extensive sensitivity analysis show that the proposed method is robust to errors both in the model and in the measurements, and provides good estimations for vehicle accumulation and vehicle trajectories with moderate sensor quality. The framework does not impose restrictions on the type of microscopic models used and can be naturally extended to include and estimate additional trajectory attributes such as destination and path, given data are available for assimilation.  相似文献   
252.
根据两船相对运动的特点,利用两船模相对运动的测量数据,运用基于自回归模型的时间序列分析法,建立了两船相对运动的数学模型,并给出了运动姿态的预报值.通过本方法的研究,可以得到满意的相对运动预报精度,为两船补给波浪、补偿装置的开发打下了理论基础.  相似文献   
253.
随着信息技术和计算机技术迅速发展和普及,传统的计算机基础教学方式面临新的挑战。本文探讨了当前形势下大学计算机基础课程教学模式的改革方向,根据多年的教学实践,探讨了高校计算机基础教学改革模式。  相似文献   
254.
Indoor air quality in subterranean train stations is a concern in many places around the globe. However, due to the specificity of each case, numerous parameters of the problem remain unknown, such as the braking discs particle emission rate, the ventilation rate of the station or the complete particle size distribution of the emitted particles. In this study the problem of modelling PM10 concentration evolution in relation with train traffic is hence addressed with a particle-mass conservation model which parameters are fitted using a genetic algorithm. The parameters of the model allow to reproduce the dynamics and amplitude of four field data sets from the French and Swedish underground contexts and comply with realistic bounds in terms of emissions, deposition and ventilation rate.  相似文献   
255.
The present paper describes how to use coordination between neighbouring intersections in order to improve the performance of urban traffic controllers. Both the local MPC (LMPC) introduced in the companion paper (Hao et al., 2018) and the coordinated MPC (CMPC) introduced in this paper use the urban cell transmission model (UCTM) (Hao et al., 2018) in order to predict the average delay of vehicles in the upstream links of each intersection, for different scenarios of switching times of the traffic lights at that intersection. The feedback controller selects the next switching times of the traffic light corresponding to the shortest predicted average delay. While the local MPC (Hao et al., 2018) only uses local measurements of traffic in the links connected to the intersection in comparing the performance of different scenarios, the CMPC approach improves the accuracy of the performance predictions by allowing a control agent to exchange information about planned switching times with control agents at all neighbouring intersections. Compared to local MPC the offline information on average flow rates from neighbouring intersections is replaced in coordinated MPC by additional online information on when the neighbouring intersections plan to send vehicles to the intersection under control. To achieve good coordination planned switching times should not change too often, hence a cost for changing planned schedules from one decision time to the next decision time is added to the cost function. In order to improve the stability properties of CMPC a prediction of the sum of squared queue sizes is used whenever some downstream queues of an intersection become too long. Only scenarios that decrease this sum of squares of local queues are considered for possible implementation. This stabilization criterion is shown experimentally to further improve the performance of our controller. In particular it leads to a significant reduction of the queues that build up at the edges of the traffic region under control. We compare via simulation the average delay of vehicles travelling on a simple 4 by 4 Manhattan grid, for traffic lights with pre-timed control, traffic lights using the local MPC controller (Hao et al., 2018), and coordinated MPC (with and without the stabilizing condition). These simulations show that the proposed CMPC achieves a significant reduction in delay for different traffic conditions in comparison to these other strategies.  相似文献   
256.
This paper describes a computationally efficient parallel-computing framework for mesoscopic transportation simulation on large-scale networks. By introducing an overall data structure for mesoscopic dynamic transportation simulation, we discuss a set of implementation issues for enabling flexible parallel computing on a multi-core shared memory architecture. First, we embed an event-based simulation logic to implement a simplified kinematic wave model and reduce simulation overhead. Second, we present a space-time-event computing framework to decompose simulation steps to reduce communication overhead in parallel execution and an OpenMP-based space-time-processor implementation method that is used to automate task partition tasks. According to the spatial and temporal attributes, various types of simulation events are mapped to independent logical processes that can concurrently execute their procedures while maintaining good load balance. We propose a synchronous space-parallel simulation strategy to dynamically assign the logical processes to different threads. The proposed method is then applied to simulate large-scale, real-world networks to examine the computational efficiency under different numbers of CPU threads. Numerical experiments demonstrate that the implemented parallel computing algorithm can significantly improve the computational efficiency and it can reach up to a speedup of 10 on a workstation with 32 computing threads.  相似文献   
257.
The turning behavior is one of the most challenging driving maneuvers under non-protected phase at mixed-flow intersections. Currently, one-dimensional simulation models focus on car-following and gap-acceptance behaviors in pre-defined lanes with few lane-changing behaviors, and they cannot model the lateral and longitudinal behaviors simultaneously, which has limitation in representing the realistic turning behavior. This paper proposes a three-layered “plan-decision-action” (PDA) framework to obtain acceleration and angular velocity in the turning process. The plan layer firstly calculates the two-dimensional optimal path and dynamically adjusts the trajectories according to interacting objects. The decision layer then uses the decision tree method to select a suitable behavior in three alternatives: car-following, turning and yielding. Finally, in the action layer, a set of corresponding operational models specify the decided behavior into control parameters. The proposed model is tested by reproducing 210 trajectories of left-turn vehicles at a two-phase mixed-flow intersection in Shanghai. As a result, the simulation reproduces the variation of trajectories, while the coverage rate of the trajectories is 88.8%. Meanwhile, both the travel time and post-encroachment time of simulation and empirical turning vehicles are similar and do not show statistically significant difference.  相似文献   
258.
Deep neural networks (DNNs) have recently demonstrated the capability to predict traffic flow with big data. While existing DNN models can provide better performance than shallow models, it is still an open issue of making full use of spatial-temporal characteristics of the traffic flow to improve their performance. In addition, our understanding of them on traffic data remains limited. This paper proposes a DNN based traffic flow prediction model (DNN-BTF) to improve the prediction accuracy. The DNN-BTF model makes full use of weekly/daily periodicity and spatial-temporal characteristics of traffic flow. Inspired by recent work in machine learning, an attention based model was introduced that automatically learns to determine the importance of past traffic flow. The convolutional neural network was also used to mine the spatial features and the recurrent neural network to mine the temporal features of traffic flow. We also showed through visualization how DNN-BTF model understands traffic flow data and presents a challenge to conventional thinking about neural networks in the transportation field that neural networks is purely a “black-box” model. Data from open-access database PeMS was used to validate the proposed DNN-BTF model on a long-term horizon prediction task. Experimental results demonstrated that our method outperforms the state-of-the-art approaches.  相似文献   
259.
针对高架桥梁结构引起的振动噪声问题,研究TMD控制箱梁结构振动的特性。为了获得精准的箱梁有限元模型,首先以铁路32 m简支箱梁桥为原型,按10:1的几何相似比设计制作简支箱梁缩尺试验模型,应用ANSYS软件建立初始动力有限元模型;对有限元模型模态分析与试验模型模态测试得到的自由模态信息进行误差分析,并采用基于灵敏度分析的模型修正技术对初始动力有限元模型弹性模量和密度进行修正,得到基准有限元模型,误差确认结果显示修正后的有限元模型更精准地反应箱梁的振动特性;进一步利用基准有限元模型,开展TMD控制简支箱梁桥振动的研究,研究结果表明TMD对于抑制桥梁竖向共振有很好的效果。  相似文献   
260.
魏瑶  夏琼  王旭 《铁道建筑》2020,(5):67-71
介绍铁路路基动态变形模量理论计算公式的推导及动态变形模量的测试原理,采用有限元软件模拟动态变形模量的测试过程,分析承载板与土体接触压力、路基动态变形模量的影响因素,并计算动态变形模量的有效测试深度.结果表明:在承载板中心一定范围内,接触压力模拟结果较理论计算值大;土体的动弹性模量对接触压力影响很小,可以忽略;路基动态变形模量测试冲击荷载作用下,土体只发生弹性变形;动态变形模量与土体动弹性模量呈线性关系,路基动态变形模量的模拟结果大于理论计算值;土体的泊松比对动态变形模量影响较小;动态变形模量有效测试深度建议取0.5~0.6 m.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号