全文获取类型
收费全文 | 88587篇 |
免费 | 14660篇 |
国内免费 | 10696篇 |
专业分类
电工技术 | 9633篇 |
技术理论 | 7篇 |
综合类 | 11161篇 |
化学工业 | 4104篇 |
金属工艺 | 1815篇 |
机械仪表 | 6105篇 |
建筑科学 | 3956篇 |
矿业工程 | 1662篇 |
能源动力 | 1962篇 |
轻工业 | 2685篇 |
水利工程 | 1573篇 |
石油天然气 | 1536篇 |
武器工业 | 1314篇 |
无线电 | 16176篇 |
一般工业技术 | 6829篇 |
冶金工业 | 1615篇 |
原子能技术 | 346篇 |
自动化技术 | 41464篇 |
出版年
2024年 | 660篇 |
2023年 | 1651篇 |
2022年 | 3121篇 |
2021年 | 3380篇 |
2020年 | 3648篇 |
2019年 | 2976篇 |
2018年 | 2908篇 |
2017年 | 3423篇 |
2016年 | 3856篇 |
2015年 | 4547篇 |
2014年 | 6377篇 |
2013年 | 5925篇 |
2012年 | 7305篇 |
2011年 | 7692篇 |
2010年 | 6127篇 |
2009年 | 6365篇 |
2008年 | 6509篇 |
2007年 | 7123篇 |
2006年 | 5843篇 |
2005年 | 4909篇 |
2004年 | 3981篇 |
2003年 | 3229篇 |
2002年 | 2569篇 |
2001年 | 2033篇 |
2000年 | 1754篇 |
1999年 | 1326篇 |
1998年 | 1010篇 |
1997年 | 799篇 |
1996年 | 611篇 |
1995年 | 446篇 |
1994年 | 393篇 |
1993年 | 289篇 |
1992年 | 267篇 |
1991年 | 146篇 |
1990年 | 180篇 |
1989年 | 138篇 |
1988年 | 90篇 |
1987年 | 37篇 |
1986年 | 39篇 |
1985年 | 38篇 |
1984年 | 28篇 |
1983年 | 27篇 |
1982年 | 27篇 |
1981年 | 16篇 |
1980年 | 25篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1975年 | 10篇 |
1959年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
从实践上论述了UHE电弧炉炼钢的工艺特点,提出UHE电炉的“新三期”的新观点,并作了定量的描述;对正在发展中的UHE电炉工艺与设备提出了策略性的意见. 相似文献
22.
23.
24.
25.
This paper presents an algorithm that permits the search for dependencies among sets of data (univariate or multivariate time-series, or cross-sectional observations). The procedure is modeled after genetic theories and Darwinian concepts, such as natural selection and survival of the fittest. It permits the discovery of equations of the data-generating process in symbolic form. The genetic algorithm that is described here uses parts of equations as building blocks to breed ever better formulas. Apart from furnishing a deeper understanding of the dynamics of a process, the method also permits global predictions and forecasts. The algorithm is successfully tested with artificial and with economic time-series and also with cross-sectional data on the performance and salaries of NBA players during the 94–95 season. 相似文献
26.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
27.
Thomas L. Landers Melinda K. Beavers Malik Sadiq Don E. Stuart 《Computers & Industrial Engineering》1994,27(1-4):245-248
This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families. 相似文献
28.
Dmitri E. Nikonov George I. Bourianoff Paolo A. Gargini 《Journal of Superconductivity and Novel Magnetism》2006,19(6):497-513
Quantum limits of power dissipation in spintronic computing are estimated. A computing element composed of a single electron
in a quantum dot is considered. Dynamics of its spin due to external magnetic field and interaction with adjacent dots are
described via the Bloch equations. Spin relaxation due to magnetic noise from various sources is described as coupling to
a reservoir. Resulting dissipation of energy is calculated and is shown to be much less than the thermal limit, ∼kT per bit,
if the rate of spin relaxation is much slower than the switching rate. Clues on how to engineer an energy efficient spintronic
device are provided. 相似文献
29.
30.