全文获取类型
收费全文 | 4108篇 |
免费 | 272篇 |
专业分类
公路运输 | 1081篇 |
综合类 | 1430篇 |
水路运输 | 1060篇 |
铁路运输 | 560篇 |
综合运输 | 249篇 |
出版年
2024年 | 21篇 |
2023年 | 62篇 |
2022年 | 133篇 |
2021年 | 214篇 |
2020年 | 222篇 |
2019年 | 120篇 |
2018年 | 105篇 |
2017年 | 150篇 |
2016年 | 139篇 |
2015年 | 210篇 |
2014年 | 371篇 |
2013年 | 278篇 |
2012年 | 361篇 |
2011年 | 392篇 |
2010年 | 247篇 |
2009年 | 238篇 |
2008年 | 208篇 |
2007年 | 260篇 |
2006年 | 221篇 |
2005年 | 133篇 |
2004年 | 70篇 |
2003年 | 48篇 |
2002年 | 30篇 |
2001年 | 42篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 12篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有4380条查询结果,搜索用时 515 毫秒
51.
52.
The rapid growth in air traffic has resulted in increased emission and noise levels in terminal areas, which brings negative environmental impact to surrounding areas. This study aims to optimize terminal area operations by taking into account environmental constraints pertaining to emission and noise. A multi-objective terminal area resource allocation problem is formulated by employing the arrival fix allocation (AFA) problem, while minimizing aircraft holding time, emission, and noise. The NSGA-II algorithm is employed to find the optimal assignment of terminal fixes with given demand input and environmental considerations, by incorporating the continuous descent approach (CDA). A case study of the Shanghai terminal area yields the following results: (1) Compared with existing arrival fix locations and the first-come-first-serve (FCFS) strategy, the AFA reduces emissions by 19.6%, and the areas impacted by noise by 16.4%. AFA and CDA combined reduce the emissions by 28% and noise by 38.1%; (2) Flight delays caused by the imbalance of demand and supply can be reduced by 72% (AFA) and 81% (AFA and CDA) respectively, compared with the FCFS strategy. The study demonstrates the feasibility of the proposed optimization framework to reduce the environmental impact in terminal areas while improving the operational efficiency, as well as its potential to underpin sustainable air traffic management. 相似文献
53.
54.
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. 相似文献
55.
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. 相似文献
56.
Recently connected vehicle (CV) technology has received significant attention thanks to active pilot deployments supported by the US Department of Transportation (USDOT). At signalized intersections, CVs may serve as mobile sensors, providing opportunities of reducing dependencies on conventional vehicle detectors for signal operation. However, most of the existing studies mainly focus on scenarios that penetration rates of CVs reach certain level, e.g., 25%, which may not be feasible in the near future. How to utilize data from a small number of CVs to improve traffic signal operation remains an open question. In this work, we develop an approach to estimate traffic volume, a key input to many signal optimization algorithms, using GPS trajectory data from CV or navigation devices under low market penetration rates. To estimate traffic volumes, we model vehicle arrivals at signalized intersections as a time-dependent Poisson process, which can account for signal coordination. The estimation problem is formulated as a maximum likelihood problem given multiple observed trajectories from CVs approaching to the intersection. An expectation maximization (EM) procedure is derived to solve the estimation problem. Two case studies were conducted to validate our estimation algorithm. One uses the CV data from the Safety Pilot Model Deployment (SPMD) project, in which around 2800 CVs were deployed in the City of Ann Arbor, MI. The other uses vehicle trajectory data from users of a commercial navigation service in China. Mean absolute percentage error (MAPE) of the estimation is found to be 9–12%, based on benchmark data manually collected and data from loop detectors. Considering the existing scale of CV deployments, the proposed approach could be of significant help to traffic management agencies for evaluating and operating traffic signals, paving the way of using CVs for detector-free signal operation in the future. 相似文献
57.
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. 相似文献
58.
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. 相似文献
59.
60.