全文获取类型
收费全文 | 197713篇 |
免费 | 2256篇 |
国内免费 | 632篇 |
专业分类
电工技术 | 4065篇 |
综合类 | 134篇 |
化学工业 | 26702篇 |
金属工艺 | 7508篇 |
机械仪表 | 5462篇 |
建筑科学 | 4039篇 |
矿业工程 | 747篇 |
能源动力 | 4658篇 |
轻工业 | 14384篇 |
水利工程 | 1695篇 |
石油天然气 | 2842篇 |
武器工业 | 7篇 |
无线电 | 27291篇 |
一般工业技术 | 37401篇 |
冶金工业 | 45383篇 |
原子能技术 | 3560篇 |
自动化技术 | 14723篇 |
出版年
2021年 | 1244篇 |
2019年 | 1282篇 |
2018年 | 2124篇 |
2017年 | 2106篇 |
2016年 | 2171篇 |
2015年 | 1491篇 |
2014年 | 2618篇 |
2013年 | 7953篇 |
2012年 | 4463篇 |
2011年 | 6112篇 |
2010年 | 4933篇 |
2009年 | 5775篇 |
2008年 | 6147篇 |
2007年 | 6197篇 |
2006年 | 5639篇 |
2005年 | 5307篇 |
2004年 | 5252篇 |
2003年 | 5093篇 |
2002年 | 4899篇 |
2001年 | 5305篇 |
2000年 | 4918篇 |
1999年 | 5435篇 |
1998年 | 15621篇 |
1997年 | 10313篇 |
1996年 | 7931篇 |
1995年 | 5784篇 |
1994年 | 5013篇 |
1993年 | 5021篇 |
1992年 | 3387篇 |
1991年 | 3260篇 |
1990年 | 3217篇 |
1989年 | 3040篇 |
1988年 | 2784篇 |
1987年 | 2235篇 |
1986年 | 2302篇 |
1985年 | 2606篇 |
1984年 | 2312篇 |
1983年 | 2063篇 |
1982年 | 1901篇 |
1981年 | 2044篇 |
1980年 | 1790篇 |
1979年 | 1659篇 |
1978年 | 1657篇 |
1977年 | 2022篇 |
1976年 | 2702篇 |
1975年 | 1424篇 |
1974年 | 1369篇 |
1973年 | 1316篇 |
1972年 | 1124篇 |
1971年 | 956篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
62.
63.
H. Sakata A. Katagiri M. Yokoi T. Kato H. Morimoto 《Journal of Low Temperature Physics》2003,131(3-4):275-279
We have measured the tunneling spectra in Bi2Sr2CaCu2O8 with a scanning tunneling microscope(STM) at various tip-sample distances by changing the tunneling conductance in a controlled manner. When the tunneling conductance is increased from 1×10–9 to 1×10–5 S, the spectra do not show changes in particular. However, the gap value decreases steeply and the asymmetric back ground density of states turns inverted V-shaped one above 6×10–4 S. The changes in the tunneling spectra at the high tunneling conductances are explained by the enhancement of the local carrier density induced by the pressure that the STM tip applied to the sample. 相似文献
64.
65.
The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment. 相似文献
66.
Open Shortest Path First (OSPF) traffic engineering (TE) is intended to bring long-awaited traffic management capabilities into IP networks, which still rely on today's prevailing routing protocols: OSPF or IS-IS. In OSPF, traffic is forwarded along, and split equally between, equal cost shortest paths. In this letter, we formulate the basic requirements placed on a practical TE architecture built on top of OSPF and present a theoretical framework meeting these requirements of practicality. The main contribution of our work comes from the recognition that coupled with an instance of the maximum throughput problem there exists a related inverse shortest-path problem yielding optimal OSPF link weights. 相似文献
67.
68.
69.
Rankin D.M. Gulliver T.A. Taylor D.P. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(9):2230-2235
This article investigates the asymptotic performance of single parity-check (SPC) product codes (PCs) from a decoding point of view. Specifically, the probability of bit error is bounded before and after the decoding of each dimension, similar to the analysis of "iterated codes" by Elias (1954). It is shown that the asymptotic probability of bit error can be driven to zero as the number of dimensions, and hence the block length, increases at signal-to-noise ratios (SNRs) within 2 dB of capacity over the additive white Gaussian noise (AWGN) channel. 相似文献
70.
M. J. O’Sullivan C. G. Walker M. L. O’Sullivan T. D. Thompson A. B. Philpott 《Telecommunication Systems》2006,33(4):353-376
The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems.
In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a
street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide
distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in
protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each
section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective)
covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints
and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along
each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe
an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed
by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined
(less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions
grow, DP gives significantly better solution times than IP. 相似文献