全文获取类型
收费全文 | 11337篇 |
免费 | 766篇 |
专业分类
公路运输 | 2960篇 |
综合类 | 4094篇 |
水路运输 | 2854篇 |
铁路运输 | 1305篇 |
综合运输 | 890篇 |
出版年
2024年 | 39篇 |
2023年 | 93篇 |
2022年 | 288篇 |
2021年 | 342篇 |
2020年 | 411篇 |
2019年 | 304篇 |
2018年 | 351篇 |
2017年 | 372篇 |
2016年 | 371篇 |
2015年 | 549篇 |
2014年 | 798篇 |
2013年 | 664篇 |
2012年 | 980篇 |
2011年 | 957篇 |
2010年 | 780篇 |
2009年 | 726篇 |
2008年 | 691篇 |
2007年 | 902篇 |
2006年 | 747篇 |
2005年 | 457篇 |
2004年 | 316篇 |
2003年 | 213篇 |
2002年 | 127篇 |
2001年 | 157篇 |
2000年 | 91篇 |
1999年 | 62篇 |
1998年 | 55篇 |
1997年 | 42篇 |
1996年 | 53篇 |
1995年 | 34篇 |
1994年 | 21篇 |
1993年 | 28篇 |
1992年 | 15篇 |
1991年 | 21篇 |
1990年 | 14篇 |
1989年 | 13篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 7篇 |
1985年 | 2篇 |
1984年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
151.
152.
Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach
In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported. 相似文献
153.
根据两船相对运动的特点,利用两船模相对运动的测量数据,运用基于自回归模型的时间序列分析法,建立了两船相对运动的数学模型,并给出了运动姿态的预报值.通过本方法的研究,可以得到满意的相对运动预报精度,为两船补给波浪、补偿装置的开发打下了理论基础. 相似文献
154.
伍庆华 《武汉船舶职业技术学院学报》2012,11(2):147-148
随着信息技术和计算机技术迅速发展和普及,传统的计算机基础教学方式面临新的挑战。本文探讨了当前形势下大学计算机基础课程教学模式的改革方向,根据多年的教学实践,探讨了高校计算机基础教学改革模式。 相似文献
155.
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. 相似文献
156.
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. 相似文献
157.
To curb emissions, containerized shipping lines face the traditional trade-off between cost and emissions (CO2 and SOx) reduction. This paper considers this element in the context of liner service design and proposes a mixed integer linear programming (MILP) model based on a multi-commodity pickup and delivery arc-flow formulation. The objective is to maximize the profit by selecting the ports to be visited, the sequence of port visit, the cargo flows between ports, as well as the number/operating speeds of vessels on each arc of the selected route. The problem also considers that Emission Control Areas (ECAs) exist in the liner network and accounts for the vessel carrying capacity. In addition to using the MILP solver of CPLEX, we develop in the paper a specific genetic algorithm (GA) based heuristic and show that it gives the possibility to reach an optimal solution when solving large size instances. 相似文献
158.
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. 相似文献
159.
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. 相似文献
160.