全文获取类型
收费全文 | 2454篇 |
免费 | 439篇 |
国内免费 | 19篇 |
专业分类
化学 | 24篇 |
力学 | 97篇 |
综合类 | 45篇 |
数学 | 469篇 |
物理学 | 524篇 |
无线电 | 1753篇 |
出版年
2024年 | 1篇 |
2023年 | 29篇 |
2022年 | 45篇 |
2021年 | 59篇 |
2020年 | 84篇 |
2019年 | 40篇 |
2018年 | 55篇 |
2017年 | 89篇 |
2016年 | 92篇 |
2015年 | 89篇 |
2014年 | 184篇 |
2013年 | 171篇 |
2012年 | 195篇 |
2011年 | 188篇 |
2010年 | 140篇 |
2009年 | 157篇 |
2008年 | 162篇 |
2007年 | 151篇 |
2006年 | 137篇 |
2005年 | 125篇 |
2004年 | 108篇 |
2003年 | 108篇 |
2002年 | 93篇 |
2001年 | 85篇 |
2000年 | 58篇 |
1999年 | 40篇 |
1998年 | 36篇 |
1997年 | 47篇 |
1996年 | 24篇 |
1995年 | 18篇 |
1994年 | 24篇 |
1993年 | 14篇 |
1992年 | 14篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有2912条查询结果,搜索用时 0 毫秒
41.
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. 相似文献
42.
43.
44.
基于确定性抽样数据分组序列的位置、方向、分组长度和连续性、有序性等流统计特征和典型的分组长度统计签名,并结合带数据分组位置、方向约束和半流关联动作的提升型DPI,提出了一种基于假设检验的加密流量应用识别统计决策模型,包括分组长度统计签名决策模型和DFI决策模型,并给出了相应的分组长度统计签名匹配算法以及基于DPI和DFI混合方法的加密流量应用识别算法。实验结果表明,该方法能够成功捕获加密应用在流坐标空间中独特的统计流量行为,并同时具有极高的加密识别精确率、召回率、总体准确率和极低的加密识别误报率、总体误报率。 相似文献
45.
46.
伴随着我国的经济发展,航空运输业也随之逐渐发展起来,各地的飞行量上升迅速,由于我国对于空中管制方面的尚未完善,所以在航空交流运输飞行与空中管制方面,产生了跟不上航空发展速度的矛盾。为改善现有状况,需要在航空运输飞行与管制的指挥之间找到合适的协调方式。 相似文献
47.
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. 相似文献
48.
Ming‐Feng Chang Chi‐Hua Chen Yi‐Bing Lin Chung‐Yung Chia 《Wireless Communications and Mobile Computing》2015,15(5):879-888
The control signals of cellular networks have been used to infer the traffic conditions of the road network. In particular, consecutive handover events are being used to estimate the traffic speed. During traffic congestion, consecutive handover events may be rare because vehicles move slowly, and thus very few or no speed reports would be generated from the congested area.However, the traffic speed report rate during traffic congestion has not been investigated in the literature. In this paper, we present an analytic model to estimate the speed report rate from cellular network signaling in steady traffic conditions, that is, the traffic speed and flow are assumed constant. Real field trial data were used to validate our analytic model. In addition, computer simulations were conducted to study how speed reports are generated in dynamic traffic conditions when traffic speed and flow change rapidly. Our study indicates that in a typical cell of length 1.5 km with a typical expected call holding time of 1 min, no speed report was generated from a congested three‐lane highway. Our study demonstrates that the lack of speed reports from consecutive handover events during rush hours indicates severe traffic congestion, and new methods that can estimate traffic speed from cellular network data during severe traffic congestion need to be developed. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
49.
文章根据互联网视听节目监测从业人员的工作内容,提出上网行为审计系统的设计并加以实现,系统满足加强互联网信息安全的需求,同时规范上网行为、提高工作效率。系统通过用户准入、上网行为记录、流量控制、终端管理等技术手段,部署了一套完整的上网行为审计系统。本系统旨在解决互联网视听节目监测从业人员访问互联网所衍生的信息安全隐患、工作效率低等问题。 相似文献
50.
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. 相似文献