全文获取类型
收费全文 | 599篇 |
免费 | 16篇 |
专业分类
公路运输 | 65篇 |
综合类 | 266篇 |
水路运输 | 127篇 |
铁路运输 | 44篇 |
综合运输 | 113篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 9篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 15篇 |
2017年 | 11篇 |
2016年 | 23篇 |
2015年 | 29篇 |
2014年 | 33篇 |
2013年 | 37篇 |
2012年 | 35篇 |
2011年 | 36篇 |
2010年 | 46篇 |
2009年 | 37篇 |
2008年 | 29篇 |
2007年 | 47篇 |
2006年 | 39篇 |
2005年 | 40篇 |
2004年 | 21篇 |
2003年 | 13篇 |
2002年 | 19篇 |
2001年 | 13篇 |
2000年 | 12篇 |
1999年 | 12篇 |
1998年 | 14篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 1篇 |
1991年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有615条查询结果,搜索用时 31 毫秒
251.
252.
The lack of personalized solutions for managing the demand of joint leisure trips in cities in real time hinders the optimization of transportation system operations. Joint leisure activities can account for up to 60% of trips in cities and unlike fixed trips (i.e., trips to work where the arrival time and the trip destination are predefined), leisure activities offer more optimization flexibility since the activity destination and the arrival times of individuals can vary.To address this problem, a perceived utility model derived from non-traditional data such as smartphones/social media for representing users’ willingness to travel a certain distance for participating in leisure activities at different times of day is presented. Then, a stochastic annealing search method for addressing the exponential complexity optimization problem is introduced. The stochastic annealing method suggests the preferred location of a joint leisure activity and the arrival times of individuals based on the users’ preferences derived from the perceived utility model. Test-case implementations of the approach used 14-month social media data from London and showcased an increase of up to 3 times at individuals’ satisfaction while the computational complexity is reduced to almost linear time serving the real-time implementation requirements. 相似文献
253.
We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
254.
Foresee traffic conditions and demand is a major issue nowadays that is very often approached using simulation tools. The aim of this work is to propose an innovative strategy to tackle such problem, relying on the presentation and analysis of a behavioural dynamic traffic assignment.The proposal relies on the assumption that travellers take routing policies rather than paths, leading us to introduce the possibility for each simulated agent to apply, in real time, a strategy allowing him to possibly re-route his path depending on the perceived local traffic conditions, jam and/or time already spent in his journey.The re-routing process allows the agents to directly react to any change in the road network. For the sake of simplicity, the agents’ strategy is modelled with a simple neural network whose parameters are determined during a preliminary training stage. The inputs of such neural network read the local information about the route network and the output gives the action to undertake: stay on the same path or modify it. As the agents use only local information, the overall network topology does not really matter, thus the strategy is able to cope with large and not previously explored networks.Numerical experiments are performed on various scenarios containing different proportions of trained strategic agents, agents with random strategies and non strategic agents, to test the robustness and adaptability to new environments and varying network conditions. The methodology is also compared against existing approaches and real world data. The outcome of the experiments suggest that this work-in-progress already produces encouraging results in terms of accuracy and computational efficiency. This indicates that the proposed approach has the potential to provide better tools to investigate and forecast drivers’ choice behaviours. Eventually these tools can improve the delivery and efficiency of traffic information to the drivers. 相似文献
255.
Reliable and accurate short-term subway passenger flow prediction is important for passengers, transit operators, and public agencies. Traditional studies focus on regular demand forecasting and have inherent disadvantages in predicting passenger flows under special events scenarios. These special events may have a disruptive impact on public transportation systems, and should thus be given more attention for proactive management and timely information dissemination. This study proposes a novel multiscale radial basis function (MSRBF) network for forecasting the irregular fluctuation of subway passenger flows. This model is simplified using a matching pursuit orthogonal least squares algorithm through the selection of significant model terms to produce a parsimonious MSRBF model. Combined with transit smart card data, this approach not only exhibits superior predictive performance over prevailing computational intelligence methods for non-regular demand forecasting at least 30 min prior, but also leverages network knowledge to enhance prediction capability and pinpoint vulnerable subway stations for crowd control measures. Three empirical studies with special events in Beijing demonstrate that the proposed algorithm can effectively predict the emergence of passenger flow bursts. 相似文献
256.
257.
为了设计出智能的列车悬挂系统,提出了基于神经网络的自适应模糊控制。模糊控制主要是针对系统的非线性;神经网络控制是产生模糊控制的控制规则。通过自适应神经网络的模糊推理系统(ANFIS),把神经网络和模糊控制相结合。神经网络根据采集的数据来进行训练,产生不同的控制规则,使模糊控制器对路面的变化具有自适应能力。仿真结果表明:该方法可在一定程度上减少轨道对列车车身的振动,提高列车在路面行驶的平稳性。 相似文献
258.
提出一种基于小波与神经网络联合分析的雷达辐射源信号分选新方法.该方法首先对接收到的雷达信号进行小波去噪,达到提高信噪比的目的,然后利用小波脊线法准确提取其脉内特征参数,最后基于神经网络实现信号的分选.计算机仿真结果表明,较现有方法,该方法在较低的信噪比情况下,可以更准确地实现雷达辐射源信号的分选. 相似文献
259.
徐晋 《西南交通大学学报》2004,39(5):675-678,698
为实时解决神经网络学习过程中可能遇到的大残量时的收敛问题,将LM算法与Quasi Newton优化算法结合,构建了一种综合学习算法(LM-QuasiNewton算法).仿真算例表明,该算法较好地解决了残量问题,收敛性与稳定性优于其它权值算法.合学习算法.仿真实例表明,该算法较好地解决了残量问题,在收敛性与稳定性方面优于其它权值算法。 相似文献
260.
铅酸蓄电池是常规潜艇水下航行的核心动力,为优化动力系统工作性能,需要建立放电模型.在分析蓄电池放电特点的基础上,提出了建模需要解决的若干问题和神经网络的方法.基于前馈神经网络,模拟了任意放电率下的恒流放电规律.利用插值法、积分和坐标变换等方法,得到了蓄电池恒功率放电模型,解决了端电压、放电电流变化规律、放电起始点和放电率计算等同题.潜艇续航力核算表明所建立的放电模型可行。 相似文献