全文获取类型
收费全文 | 716篇 |
免费 | 261篇 |
国内免费 | 6篇 |
专业分类
化学 | 15篇 |
力学 | 50篇 |
综合类 | 38篇 |
数学 | 444篇 |
物理学 | 436篇 |
出版年
2023年 | 9篇 |
2022年 | 11篇 |
2021年 | 19篇 |
2020年 | 18篇 |
2019年 | 15篇 |
2018年 | 16篇 |
2017年 | 25篇 |
2016年 | 29篇 |
2015年 | 21篇 |
2014年 | 59篇 |
2013年 | 67篇 |
2012年 | 55篇 |
2011年 | 63篇 |
2010年 | 51篇 |
2009年 | 80篇 |
2008年 | 59篇 |
2007年 | 56篇 |
2006年 | 50篇 |
2005年 | 38篇 |
2004年 | 26篇 |
2003年 | 31篇 |
2002年 | 34篇 |
2001年 | 18篇 |
2000年 | 18篇 |
1999年 | 12篇 |
1998年 | 18篇 |
1997年 | 16篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 14篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1979年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有983条查询结果,搜索用时 15 毫秒
1.
学校的合理规划布局是实现教育资源优化配置、提高办学效益和推动教育均衡发展的重要途径。已有许多学者研究了学校的布局问题,但基本上都忽略了交通网络条件以及不确定因素对学校布局的影响。本研究将在前人研究基础上,重点考虑交通网络对乡村中小学选址的影响,并假设旅行时间具有不确定性,从而以最小化学生旅行成本、学校建设、道路修建和道路升级成本为目标,构建不确定条件下的设施区位设计模型。在算法求解方面提出混合模拟退火算法,用于确定新建学校的最佳位置,以及新道路的修建和原有道路的升级情况。最后,将提出的模型和算法应用到实际案例中。 相似文献
2.
3.
Zhong-Yu Li 《中国物理 B》2022,31(4):40502-040502
Accurate prediction of road traffic flow is a significant part in the intelligent transportation systems. Accurate prediction can alleviate traffic congestion, and reduce environmental pollution. For the management department, it can make effective use of road resources. For individuals, it can help people plan their own travel paths, avoid congestion, and save time. Owing to complex factors on the road, such as damage to the detector and disturbances from environment, the measured traffic volume can contain noise. Reducing the influence of noise on traffic flow prediction is a piece of very important work. Therefore, in this paper we propose a combination algorithm of denoising and BILSTM to effectively improve the performance of traffic flow prediction. At the same time, three denoising algorithms are compared to find the best combination mode. In this paper, the wavelet (WL) denoising scheme, the empirical mode decomposition (EMD) denoising scheme, and the ensemble empirical mode decomposition (EEMD) denoising scheme are all introduced to suppress outliers in traffic flow data. In addition, we combine the denoising schemes with bidirectional long short-term memory (BILSTM) network to predict the traffic flow. The data in this paper are cited from performance measurement system (PeMS). We choose three kinds of road data (mainline, off ramp, on ramp) to predict traffic flow. The results for mainline show that data denoising can improve prediction accuracy. Moreover, prediction accuracy of BILSTM+EEMD scheme is the highest in the three methods (BILSTM+WL, BILSTM+EMD, BILSTM+EEMD). The results for off ramp and on ramp show the same performance as the results for mainline. It is indicated that this model is suitable for different road sections and long-term prediction. 相似文献
4.
随着我国城市化进程不断加快,城市交通供需矛盾日益突出,交通拥堵问题愈发严重,我国各地纷纷实行各种政策措施来缓解交通拥堵。本文以北京市为例,针对城市交通拥堵的现象,从系统的角度出发,运用系统动力学与灰色Verhulst预测相结合的方法(SD-VF),建立城市交通治堵模型,并采用Vensim软件对模型进行动态仿真分析,从经济、社会、环境等方面探究政策措施对城市环境生态承载力、道路生态承载力等的影响。研究结果表明,限行限号政策虽然在一定程度上提高道路生态承载力,但也可能引发“悖论”效应;修路政策并没有根本上解决城市交通拥堵问题,仅仅是把拥堵状况向后推迟;而相对于单一政策,将发展公共交通与限行政策相结合可以有效缓解交通拥堵,改善空气质量,提升环境承载力,是更加科学合理的政策措施。 相似文献
5.
针对当前路网脆弱性研究中缺乏对真实交通状况考量的问题,在复杂网络理论的基础上,结合交通流量信息,提出了基于加权流量介数中心性的路网脆弱性分析方法。首先计算路网拓扑抽象图中各节点的最短路径介数中心性,然后使用流量数据对相应区域最短路径介数中心性加权,综合得到最终的脆弱性指标结果。以无锡市为例,对其实际交通路网脆弱性进行了计算,结果表明,该方法能综合反映静态全局路网结构与动态局部通行信息和现实交通情景下的路网脆弱性。 相似文献
6.
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks 下载免费PDF全文
A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions. 相似文献
7.
One of the most common environmental impacts of road transportation is the traffic noise. Linked to this, Start/Stop is a technology which has demonstrated to save fuel by powering off the engine when the vehicle is stopped, such as in front of a traffic light, and restarting the engine instantly when the driver pushes back the pedal brake to proceed. The technology helps also to reduce the CO2 emission, playing a key role in a way to accomplish stringent emission norms for vehicle manufacturer. However, we are not sure whether it reduces the noise emission and how much? Thus, the main aim of this work is to assess the engine noise emissions of a vehicle incorporating a Start/Stop system in urban traffic, and compare it with those radiated by the mean traffic stream. Experimental results demonstrate that there are no contributions of the Start/Stop system to reduce meaningfully the engine noise in urban traffic. 相似文献
8.
Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs. 相似文献
9.
供应链网络的运输过程是碳排放的主要来源之一,道路拥堵、配送距离和车辆载重等因素会影响碳排放量,本文研究考虑拥堵路况下碳排放的选址-配送集成优化问题。根据车辆行驶状态定义道路拥堵情况,以不同时段下拥堵概率和预期拥堵距离作为路况决定因素,构建碳排放量和经济成本都最小的两目标模型。设计改进的非支配排序遗传算法(NSGA-II)求解模型获得Pareto解集。以环境问题较重的北京和天津为中心构建供应链网络作为算例,验证了模型和算法的有效性和可行性。实验结果给出了不同偏好下供应链网络的构建方案,并对不同时段下决定路况的拥堵概率和预期拥堵距离以及车辆载重进行灵敏度分析。实验结果表明,相对于高速公路,城市道路不同时段对碳排放量影响更敏感。 相似文献
10.
《Operations Research Letters》2022,50(6):699-706
A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assignment constraints which force non-uniform sampling. While intuition suggests that non-uniform sampling adversely impacts performance, this was only supported through simulations, and rigorous statements have remained elusive. Building on product-form distributions for redundancy systems, we prove the stochastic dominance of uniform sampling for a four-server system as well as arbitrary-size systems in light traffic. 相似文献