全文获取类型
收费全文 | 329篇 |
免费 | 42篇 |
专业分类
公路运输 | 107篇 |
综合类 | 140篇 |
水路运输 | 83篇 |
铁路运输 | 14篇 |
综合运输 | 27篇 |
出版年
2024年 | 2篇 |
2023年 | 10篇 |
2022年 | 29篇 |
2021年 | 35篇 |
2020年 | 20篇 |
2019年 | 17篇 |
2018年 | 13篇 |
2017年 | 14篇 |
2016年 | 12篇 |
2015年 | 14篇 |
2014年 | 21篇 |
2013年 | 13篇 |
2012年 | 21篇 |
2011年 | 31篇 |
2010年 | 16篇 |
2009年 | 18篇 |
2008年 | 14篇 |
2007年 | 18篇 |
2006年 | 18篇 |
2005年 | 13篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1997年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有371条查询结果,搜索用时 203 毫秒
91.
There are many problems in transportation which involve reconstructing the associations between different entities. For example, data points related to a vehicle from different sensors could be matched to reconstruct the trajectories of vehicles. Or, in population synthesis for microsimulation, lists of persons, dwellings, and vehicles could be generated individually from source data and then matched into synthetic households. There are numerous other examples. The unifying theme is a desire to construct realistic unit-level associations from aggregate or anonymized data. The problem demands a method that is behaviorally consistent and operationally efficient to handle large datasets. We adapt concepts from graph theory to formulate this class of problems as a k-partite graph. This approach is generic and can incorporate expectations of behavior in the form of edge weights. A Dijkstra algorithm based solution is proposed for a subset of k-partite graphs which permits a direct comparison with pair-wise matching and applied to a case study of bicycle tracklets. We then propose an iterative improvement algorithm as a generic method and apply it to a complete k-partite graph in a population synthesis case study. The first case study shows that the k-partite algorithm outperforms the previously used pair-wise matching algorithms. The second case study demonstrates the generality of the proposed algorithm to all k-partite graphs and shows that the generic method is fast and scalable to large problems. As a whole, this paper aims to show that k-partite methods are behaviorally consistent, efficient, and potentially applicable to a wide variety of transportation data association problems. 相似文献
92.
93.
为改善电动自行车带来的交通安全问题,研究逆行风险行为与其影响因素间的相关关系。基于长沙市芙蓉区共享电动自行车GPS轨迹数据,实现逆行行为的精准识别,采用机器学习CatBoost模型与SHAP可解释机器学习框架,从道路条件、交通状态、土地利用性质等方面开展逆行行为影响要素挖掘及作用解析。研究结果表明:CatBoost模型能够有效预测路段逆行频次并提取逆行行为的重要影响因素,主要包括出行时段、公共交通设施、土地利用性质、道路条件及交通状态等;从出行时段来看,工作日、早晚高峰时段更容易发生逆行;从公共交通设施与土地利用性质来看,道路周围公交站地铁站出口数量及餐饮、公司、购物等设施数量与逆行频次呈现非线性影响关系,在一定范围内设施数量与逆行行为存在正影响作用;从道路条件来看,过街通道间距在50~400 m时不易发生逆行,在非机动车道无物理隔离设施或过街通道间距在400~600 m时容易发生逆行,间距大于600 m时作用不稳定;从路段机非分隔形式来看,护栏分隔的逆行概率较低,绿化带分隔的逆行概率较高;从交通状态来看,当骑行速度、加速度较低或较高时与逆行行为负相关,当骑行速度在6~16 km·h-1及加速度在0.3~1.0 m·s-2时与逆行行为正相关。研究成果可为共享电动自行车风险骑行行为辨识、非机动车交通安全管理提供有效的技术支持。 相似文献
94.
介绍了基于美国ASA(Applied Science Associates,Inc.)公司的用于预测海水或淡水中溢油的轨迹和归宿的软件OILMAP建立的“中国舟山港溢油模拟信息系统”的组成、功能和特点,并用实例说明了其使用方法。 相似文献
95.
SBS改性沥青的相容性研究 总被引:1,自引:0,他引:1
对不同类型、不同牌号的SBS和不同的基质沥青按照相同的加工工艺制备SBS改性沥青,通过技术指标试验来分析SBS类型、牌号和基质沥青对SBS改性沥青性能的影响,结果表明:星型SBS的改性效果并不一定优于线型SBS,但嵌段比为30/70SBS的改性效果优于嵌段比为40/60SBS的;与同一类型SBS改性剂相容性越好的基质沥青,其改性效果越好;组分比R>3的基质沥青与SBS有较好的相容性.将合理剂量的增容剂Z和稳定剂W掺加到SBS改性兰炼沥青中,可显著改善其相容性,同时能提高其路用性能,使其达到规范要求. 相似文献
96.
内河船舶避碰路径优化研究 总被引:1,自引:1,他引:1
内河船舶碰撞事故导致重大生命及财产损失,已经引起人们的高度关注.提出一种内河船舶自动避碰路径优化的研究方法,建立了内河船舶操纵运动数学模型,将遗传算法运用到内河船舶避碰路径选优中,提出内河船舶避碰路径优化准则,并构建一种考虑内河航道中运动船舶及障碍物的适应度函数.优化结果表明了本方法的可行性。 相似文献
97.
公路路政管理难度系数综合评价模型 总被引:2,自引:0,他引:2
在分析影响公路路政管理难度的各种因素的基础上,提出了一种基于模糊理论、层次分析法和群决策理论的新模型.该模型以模糊理论为基础对路政管理信息进行标准化处理.用层次分析法构造了评价指标体系.用群体一致性算法检验专家评估提出的意见,并最终获得权重.用归一化的专家权重、专家个人效用函数的权重以及标准化后的指标,计算群效用函数,即可确定公路路政管理难度系数. 相似文献
98.
为了解决随机采样算法受感知环境不确定性影响下的弱鲁棒性以及弱可靠性问题,采用一种基于激光空间势场的渐优随机采样算法框架来设计符合无人驾驶需要的规划算法。针对感知环境的不确定性,首先基于势场原理与激光障碍物点云构建一个融入了斥力场的规划空间,解决激光障碍物提取中的过分割等问题。其次,利用规划空间来处理随机采样算法中的采样策略、最优母节点选取策略、修剪策略以及最终路径选择策略。再次,在算法中加入了Anytime策略来提高优化解的利用率,使得算法的计算效率满足无人驾驶实时性的要求。同时,为了保证无人驾驶中规划路径的鲁棒性与可靠性,创建了一个综合5重因素的代价函数来选择最优路径,并根据不同的无人驾驶场景来调整相对应的参数;最后在城市测试道路上进行了实地测试。结果表明:设计的算法框架能够适应最高时速40 km·h-1的城区驾驶环境,并能完成跟驰、换道、融入以及静动态障碍物的避障决策。在与SST算法的对比试验中,所提出的算法在各个试验中的轨迹、方向盘转角以及速度的平滑性都优于SST算法,其轨迹与障碍物的距离也优于SST算法。 相似文献
99.
Vehicle trajectories with high spatial and temporal resolution are known as the most ideal source of data for developing innovative microscopic traffic models. Aside from the method applied for collecting the vehicle trajectories, such data are more or less error-infected. The ever-increasing noise amplitude during the process of deriving the data (such as speed and acceleration) required for developing models, might change or even hide the structure of data and lead to useful information being overlooked. This highlights the importance of presenting the efficient methods which are adequate to remove noise and enhance the quality of vehicle trajectory data. Accordingly, in this paper a simple two-step technique based on wavelet analysis has been recommended for filtering errors and reconstructing trajectory data. Primarily, by using wavelet transform a special treatment was employed to identify and modify the outliers. Next, the noise in trajectory data was eliminated by applying the wavelet-based filter. The results of applying the proposed method to the synthetic noise-infected trajectory and the NGSIM dataset reveal how appropriate its performance is compared with other methodologies in terms of quantitative criteria. 相似文献
100.
《Vehicle System Dynamics: International Journal of Vehicle Mechanics and Mobility》2012,50(8):945-965
This paper presents a design method for designing the robust-stable and quadratic-finite-horizon-optimal controllers of uncertain active suspension systems. The method integrates a robust stabilisability condition, the orthogonal functions approach (OFA) and the hybrid Taguchi-genetic algorithm (HTGA). Using the integrative computational method, a robust-stable and quadratic-finite-horizon-optimal controller with low-trajectory sensitivity can be obtained such that (i) the active suspension system with elemental parametric uncertainties is stabilised and (ii) a quadratic-finite-horizon-integral performance index including a quadratic trajectory sensitivity term for the nominal active suspension system is minimised. The robust stabilisability condition is proposed in terms of linear matrix inequalities (LMIs). Based on the OFA, an algebraic algorithm only involving the algebraic computation is derived for solving the nominal active suspension feedback dynamic equations. By using the OFA and the LMI-based robust stabilisability condition, the dynamic optimisation problem for the robust-stable and quadratic-finite-horizon-optimal controller design of the linear uncertain active suspension system is transformed into a static-constrained-optimisation problem represented by the algebraic equations with constraint of LMI-based robust stabilisability condition; thus greatly simplifies the design problem. Then, for the static-constrained-optimisation problem, the HTGA is employed to find the robust-stable and quadratic-finite-horizon-optimal controllers of the linear uncertain active suspension systems. A design example is given to demonstrate the applicability of the proposed integrative computational approach. 相似文献