全文获取类型
收费全文 | 377999篇 |
免费 | 4258篇 |
国内免费 | 1193篇 |
专业分类
电工技术 | 7190篇 |
综合类 | 266篇 |
化学工业 | 52983篇 |
金属工艺 | 14673篇 |
机械仪表 | 10922篇 |
建筑科学 | 8459篇 |
矿业工程 | 1941篇 |
能源动力 | 9347篇 |
轻工业 | 29590篇 |
水利工程 | 3765篇 |
石油天然气 | 6413篇 |
武器工业 | 14篇 |
无线电 | 47502篇 |
一般工业技术 | 73329篇 |
冶金工业 | 79558篇 |
原子能技术 | 8049篇 |
自动化技术 | 29449篇 |
出版年
2021年 | 2746篇 |
2019年 | 2745篇 |
2018年 | 4477篇 |
2017年 | 4527篇 |
2016年 | 4720篇 |
2015年 | 3152篇 |
2014年 | 5423篇 |
2013年 | 16156篇 |
2012年 | 8940篇 |
2011年 | 12436篇 |
2010年 | 9991篇 |
2009年 | 11454篇 |
2008年 | 11884篇 |
2007年 | 12070篇 |
2006年 | 10578篇 |
2005年 | 9914篇 |
2004年 | 9682篇 |
2003年 | 9433篇 |
2002年 | 8950篇 |
2001年 | 9445篇 |
2000年 | 8906篇 |
1999年 | 9637篇 |
1998年 | 25762篇 |
1997年 | 17601篇 |
1996年 | 13673篇 |
1995年 | 9997篇 |
1994年 | 8885篇 |
1993年 | 8659篇 |
1992年 | 6239篇 |
1991年 | 5958篇 |
1990年 | 5766篇 |
1989年 | 5669篇 |
1988年 | 5299篇 |
1987年 | 4402篇 |
1986年 | 4369篇 |
1985年 | 5057篇 |
1984年 | 4593篇 |
1983年 | 4221篇 |
1982年 | 3820篇 |
1981年 | 4061篇 |
1980年 | 3653篇 |
1979年 | 3621篇 |
1978年 | 3612篇 |
1977年 | 4198篇 |
1976年 | 5696篇 |
1975年 | 3111篇 |
1974年 | 2984篇 |
1973年 | 2940篇 |
1972年 | 2454篇 |
1971年 | 2176篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
32.
33.
34.
35.
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. 相似文献
36.
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. 相似文献
37.
38.
39.
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. 相似文献
40.
Sethuraman B.A. Rajan B.S. Shashidhar V. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(10):2596-2616
We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented. 相似文献