全文获取类型
收费全文 | 19595篇 |
免费 | 3171篇 |
国内免费 | 2507篇 |
学科分类
工业技术 | 25273篇 |
出版年
2024年 | 122篇 |
2023年 | 400篇 |
2022年 | 736篇 |
2021年 | 717篇 |
2020年 | 799篇 |
2019年 | 682篇 |
2018年 | 620篇 |
2017年 | 873篇 |
2016年 | 954篇 |
2015年 | 1088篇 |
2014年 | 1323篇 |
2013年 | 1502篇 |
2012年 | 1579篇 |
2011年 | 1645篇 |
2010年 | 1278篇 |
2009年 | 1325篇 |
2008年 | 1400篇 |
2007年 | 1429篇 |
2006年 | 1194篇 |
2005年 | 1036篇 |
2004年 | 769篇 |
2003年 | 678篇 |
2002年 | 554篇 |
2001年 | 464篇 |
2000年 | 375篇 |
1999年 | 283篇 |
1998年 | 228篇 |
1997年 | 222篇 |
1996年 | 182篇 |
1995年 | 147篇 |
1994年 | 106篇 |
1993年 | 110篇 |
1992年 | 71篇 |
1991年 | 58篇 |
1990年 | 49篇 |
1989年 | 61篇 |
1988年 | 23篇 |
1987年 | 15篇 |
1986年 | 20篇 |
1985年 | 18篇 |
1984年 | 19篇 |
1983年 | 20篇 |
1982年 | 22篇 |
1981年 | 13篇 |
1980年 | 12篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
81.
In this article we propose efficient scan path and BIST schemes for RAMs. Tools for automatic generation of these schemes have been implemented. They reduce the design effort and thus allow the designer to select the more appropriate scheme with respect to various constraints. 相似文献
82.
83.
本文着重分析和讨论了提高轧机工作机座刚度的三种途径: 合理提高零部件刚度、短应力线机座、预应力机座。指出某些错误概念与问题,阐述了如何正确地提高轧机工作座的刚度。 相似文献
84.
The cohesive model is used for the prediction of the crack path during stable crack extension in ductile materials. The problem of crack-path deviation is investigated by means of simulation of crack propagation in a round tensile bar. The respective phenomenon is known as cup-cone fracture. It is shown that the model is able to predict the failure mechanism, which consists of normal fracture in the center and combined normal/shear fracture in the so-called “shear lips” at the specimen’s rim. The damage evolution and crack path predicted by the model are presented. The effect of the normal and shear failure parameters on the crack-deflection point and several aspects of the finite element mesh are discussed. 相似文献
85.
86.
In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering. 相似文献
87.
88.
本详细描述了移动IP的工作过程,并介绍了移动IP的隧道技术和IPSec,最后对移动IP技术中存在几个热点问题进行了讨论。 相似文献
89.
A model of economic dynamics under stable ecological balance conditions is proposed. A methodology of construction of an optimal growth path is constructed for this model. 相似文献
90.
The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879. 相似文献