首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   902818篇
  免费   10575篇
  国内免费   2273篇
电工技术   16619篇
综合类   818篇
化学工业   138604篇
金属工艺   37488篇
机械仪表   29174篇
建筑科学   22081篇
矿业工程   5287篇
能源动力   22678篇
轻工业   75728篇
水利工程   9801篇
石油天然气   16822篇
武器工业   52篇
无线电   102376篇
一般工业技术   179683篇
冶金工业   157318篇
原子能技术   18777篇
自动化技术   82360篇
  2021年   7314篇
  2019年   6989篇
  2018年   15881篇
  2017年   16208篇
  2016年   15195篇
  2015年   8735篇
  2014年   14247篇
  2013年   40379篇
  2012年   23921篇
  2011年   35215篇
  2010年   28706篇
  2009年   31037篇
  2008年   32116篇
  2007年   33055篇
  2006年   25217篇
  2005年   24601篇
  2004年   23139篇
  2003年   22511篇
  2002年   21262篇
  2001年   20600篇
  2000年   19518篇
  1999年   19718篇
  1998年   45585篇
  1997年   33207篇
  1996年   25990篇
  1995年   20164篇
  1994年   18135篇
  1993年   17641篇
  1992年   13525篇
  1991年   12968篇
  1990年   12727篇
  1989年   12301篇
  1988年   11815篇
  1987年   10411篇
  1986年   10170篇
  1985年   11941篇
  1984年   11025篇
  1983年   10087篇
  1982年   9259篇
  1981年   9298篇
  1980年   8883篇
  1979年   8930篇
  1978年   8627篇
  1977年   9824篇
  1976年   12700篇
  1975年   7578篇
  1974年   7248篇
  1973年   7208篇
  1972年   6116篇
  1971年   5599篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
92.
This paper considers several aspects of the sequential prediction problem for unbounded, nonstationary processes under pth power loss /spl lscr//sub p/(u,v)=|u-v|/sup p/, 1相似文献   
93.
Self-organized public-key management for mobile ad hoc networks   总被引:6,自引:0,他引:6  
In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.  相似文献   
94.
95.
A series of small–capacity units has recently been constructed in regions of oil field development and crude oil and gas condensate production to satisfy the requirements for such petroleum products as naphtha, diesel fuel, kerosene, and boiler fuel and to reduce costs for delivery of these products. There are almost no data in the technical literature, particularly in periodicals, on the construction and operation of small–capacity units. We attempt to generalize the experience of Orgeneftekhimzavody Trust in this area. We hope that this experience will be useful to specialists in the development and management of small–capacity plants.  相似文献   
96.
The interference issues related to ultrawideband (UWB) radio pose tight restrictions on the maximum data rate of UWB radio telecommunication systems. A possible solution is to reduce the required signal to interference ratio (SIR) that gives satisfactory performance to the UWB system. In this letter, we propose coded M-ary UWB radio communication systems. Two classes of convolutional codes, namely, low-rate superorthogonal codes and high-rate punctured codes are considered for this purpose. Simulation results on the bit error rate of the proposed system indicates that the system is capable to work in lower SIR's and therefore supports higher data transmission rates in a real interference environment compared to the previously proposed UWB communication systems.  相似文献   
97.
Reducible rank codes and their applications to cryptography   总被引:2,自引:0,他引:2  
We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.  相似文献   
98.
This paper presents a method to obtain an electric model for transformers and inductors, including both frequency and geometry effects in the windings, which can be linked with existing core models. One-dimensional distributions for magnetic and electric fields are assumed, and from Maxwell's equations an equivalent electric circuit is easily obtained. This equivalent circuit has been included in analog simulators (Spice, AnalogWorkBench, Saber ...), and comparisons between measured and simulated results are shown, both in time domain and in AC sweep, which verify the model accuracy. The model described in this paper allows designers to deal with key issues in the design of high-frequency magnetic components (copper losses, leakage inductance, skin and proximity effects) by using analog simulators, which are usually more familiar to them than finite-element analysis tools.  相似文献   
99.
Many issues in signal processing involve the inverses of Toeplitz matrices. One widely used technique is to replace Toeplitz matrices with their associated circulant matrices, based on the well-known fact that Toeplitz matrices asymptotically converge to their associated circulant matrices in the weak sense. This often leads to considerable simplification. However, it is well known that such a weak convergence cannot be strengthened into strong convergence. It is this fact that severely limits the usefulness of the close relation between Toeplitz matrices and circulant matrices. Observing that communication receiver design often needs to seek optimality in regard to a data sequence transmitted within finite duration, we define the finite-term strong convergence regarding two families of matrices. We present a condition under which the inverses of a Toeplitz matrix converges in the strong sense to a circulant matrix for finite-term quadratic forms. This builds a critical link in the application of the convergence theorems for the inverses of Toeplitz matrices since the weak convergence generally finds its usefulness in issues associated with minimum mean squared error and the finite-term strong convergence is useful in issues associated with the maximum-likelihood or maximum a posteriori principles.  相似文献   
100.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号