首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   299309篇
  免费   2365篇
  国内免费   684篇
化学   142279篇
晶体学   4207篇
力学   11938篇
综合类   9篇
数学   29544篇
物理学   82874篇
无线电   31507篇
  2019年   2516篇
  2018年   3391篇
  2017年   3352篇
  2016年   4821篇
  2015年   2802篇
  2014年   4651篇
  2013年   11290篇
  2012年   8489篇
  2011年   10428篇
  2010年   7628篇
  2009年   7807篇
  2008年   10510篇
  2007年   11009篇
  2006年   10248篇
  2005年   9439篇
  2004年   8752篇
  2003年   7957篇
  2002年   7891篇
  2001年   8488篇
  2000年   6852篇
  1999年   5418篇
  1998年   4949篇
  1997年   4910篇
  1996年   4526篇
  1995年   4249篇
  1994年   4347篇
  1993年   4032篇
  1992年   4448篇
  1991年   4516篇
  1990年   4379篇
  1989年   4159篇
  1988年   4185篇
  1987年   3821篇
  1986年   3616篇
  1985年   4700篇
  1984年   4986篇
  1983年   4170篇
  1982年   4270篇
  1981年   4201篇
  1980年   4144篇
  1979年   4082篇
  1978年   4392篇
  1977年   4310篇
  1976年   4373篇
  1975年   4015篇
  1974年   4093篇
  1973年   4245篇
  1972年   3010篇
  1971年   2501篇
  1970年   2307篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Pattern classification is frequently performed using the k-nn algorithm or a neural network. The choice of parameters for the former is often difficult and the amount of data which has to be stored in the classifier can be high. Neural network classifiers can overcome some of these problems but learning is often unreliable and slow. An alternative which combines some of the best features of the k-nn and neural network classifier is described by the authors. The classifier is called a packed hyper-ellipsoid classifier  相似文献   
92.
A novel vector algorithm for Reed-Muller (RM) expansions is proposed which can save as many as a factor of 2n-1 memory elements compared with previous matrix algorithms  相似文献   
93.
An OFDM scheme with a half complexity   总被引:2,自引:0,他引:2  
The paper deals with an OFDM (orthogonal frequency division multiplexing) system based on filter-bank architecture. The known implementation uses a DFT (discrete Fourier transform) processor and a polyphase network (PPN). Even if it is based on complex components, in the final step it operates the real part extraction of the incoming signal. This leads to redundant operations in the DFT processor and in the PPN. Specifically, for the transmission of N complex symbol sequences at a given rate ½F, an N-point DFT processor and an N-branch PPN, both working at the rate F, are required. This implementation can be improved with a complexity reduction by a factor of two. In fact, in the paper an architecture is presented based on an N-point DFT processor and N-branch PPN at the rate F, for the transmission of 2N (in place of N) complex symbol sequences at the rate ½F  相似文献   
94.
Insulin secretion rate (ISR) is not directly measurable in man but it can be reconstructed from C-peptide (CP) concentration measurements by solving an input estimation problem by deconvolution. The major difficulties posed by the estimation of ISR after a glucose stimulus, e.g., during an intravenous glucose tolerance test (IVGTT), are the ill-conditioning of the problem, the nonstationary pattern of the secretion rate, and the nonuniform/infrequent sampling schedule. In this work, a nonparametric method based on the classic Phillips-Tikhonov regularization approach is presented. The problem of nonuniform/infrequent sampling is addressed by a novel formulation of the regularization method which allows the estimation of quasi time-continuous input profiles. The input estimation problem is stated into a Bayesian context, where the a priori known nonstationary characteristics of ISR after the glucose stimulus are described by a stochastic model. Deconvolution is tackled by linear minimum variance estimation, thus allowing the derivation of new statistically based regularization criteria. Finally, a Monte-Carlo strategy is implemented to assess the uncertainty of the estimated ISR arising from CP measurement error and impulse response parameters uncertainty  相似文献   
95.
Arithmetic coding for data compression   总被引:17,自引:0,他引:17  
Arithmetic coding provides an effective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding works and describe an efficient implementation that uses table lookup as a first alternative to arithmetic operations. The reduced-precision arithmetic has a provably negligible effect on the amount of compression achieved. We can speed up the implementation further by use of parallel processing. We discuss the role of probability models and how they provide probability information to the arithmetic coder. We conclude with perspectives on the comparative advantages and disadvantages of arithmetic coding  相似文献   
96.
97.
98.
99.
Silver nitrate-acetonitrile and π iodine-benzene complexes in thermotropic liquid crystals have been studied by 1H, 2H, and 13C NMR spectroscopy and by optical microscopy. Evidence for at least two silver complexes in each liquid crystal is presented.  相似文献   
100.
This paper describes a fully integrated digital-spread spectrum transceiver chip fabricated through MOSIS in 1.2 μm CMOS. It includes a baseband spread spectrum transmitter and a coherent intermediate frequency (IF) receiver consisting of a Costas loop, an acquisition loop for the pseudo-noise (PN) sequence, and a clock recovery loop with a 406.4 MHz onchip numerically controlled oscillator (NCO). The transceiver is capable of operating at a maximum IF sampling rate of 50.8 MS/s and a maximum chip rate of 12.7 R Mchips/s (Mcps) with selectable data rates of 100, 200, 400, and 800 kbps. At the maximum operating speed of 50.8 R MS/s, it dissipates 1.1 W. In an additive white Gaussian noise channel the IF receiver achieves a receiver output SNR within 1 dB of theory and can acquire code with a wide range of input SNR from -17 dB to over 30 dB. The transceiver chip has been interfaced to an RF up/down converter to demonstrate a wireless voice/data/video link operating in the 902-928 MHz band  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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