首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   275247篇
  免费   5846篇
  国内免费   1793篇
电工技术   5724篇
技术理论   5篇
综合类   1192篇
化学工业   44939篇
金属工艺   11473篇
机械仪表   8124篇
建筑科学   7347篇
矿业工程   1769篇
能源动力   5861篇
轻工业   27881篇
水利工程   3010篇
石油天然气   5966篇
武器工业   243篇
无线电   28758篇
一般工业技术   53510篇
冶金工业   47737篇
原子能技术   5757篇
自动化技术   23590篇
  2021年   2816篇
  2020年   1969篇
  2019年   2393篇
  2018年   3983篇
  2017年   3953篇
  2016年   4338篇
  2015年   3358篇
  2014年   5255篇
  2013年   12682篇
  2012年   8481篇
  2011年   11135篇
  2010年   8951篇
  2009年   9415篇
  2008年   10318篇
  2007年   10406篇
  2006年   9002篇
  2005年   7840篇
  2004年   7022篇
  2003年   6586篇
  2002年   6594篇
  2001年   6628篇
  2000年   6172篇
  1999年   6077篇
  1998年   13068篇
  1997年   9741篇
  1996年   7442篇
  1995年   5690篇
  1994年   5203篇
  1993年   5056篇
  1992年   4046篇
  1991年   3791篇
  1990年   3870篇
  1989年   3784篇
  1988年   3553篇
  1987年   3046篇
  1986年   3065篇
  1985年   3529篇
  1984年   3438篇
  1983年   3134篇
  1982年   2769篇
  1981年   2981篇
  1980年   2711篇
  1979年   2892篇
  1978年   2797篇
  1977年   2900篇
  1976年   3753篇
  1975年   2518篇
  1974年   2339篇
  1973年   2367篇
  1972年   2001篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
A Biologically-Parameterized Feather Model   总被引:1,自引:0,他引:1  
Feathers, unlike other cutaneous appendages such as hair, fur, or scales have a definite structure. Variation in feather structure creates a wide range of resulting appearances. Collectively, feather structure determines the appearance of the feather coat, which can largely affect the resulting look of a feathered object (bird). In this paper we define the structure of individual feathers using a parameterization based on biological structure and substructures of actual feathers. We show that our parameterization can generate a large variety of feathers at multiple levels of detail and provide an initial step to semi‐automatically generating a wide range of feather coats. his is achieved by specifying an intuitive interpolation between different structures and ages of feathers.  相似文献   
992.
Market segmentation has commonly applied cluster analysis. This study intends to make the comparison of conventional two-stage method with proposed two-stage method through the simulated data. The proposed two-stage method is the combination of self-organizing feature maps and K-means method. The simulation results show that the proposed scheme is better than the conventional two-stage method based on the rate of misclassification.  相似文献   
993.
The intraneural ganglion of the peroneal nerve is a rare lesion. The differential diagnosis includes lesions of the knee especially the tendinopathia of the knee flexors. Clinical examination, electrophysiological investigations, ultrasound imaging and magnetic resonance tomography will establish the diagnosis. We report a case in which an artificial puncture of the ganglion caused a temporary peroneal palsy. Surgical procedure led to complete restoration of the nerve function.  相似文献   
994.
It is often desirable to increase the capacity and the covered distance in lightwave TV systems. For doing so, the conventional CATV channel set-usually placed within the 50 to 550 MHz frequency range-may be up-shifted, by means of a subcarrier, to a low microwave frequency range, typically located at 2 GHz. Next, this shifted spectrum directly modulates a laser diode, in the analog AM mode. It is shown that this up-shift procedure may dislodge a number of nonlinear distortion components from the useful TV band. Consequently, the system effective optical modulation index may be increased, allowing for an expansion in the channel capacity or covered distance. This enlarged capacity or distance may compensate for the modest price increase concerning the up-shift equipment. All the performance evaluations presented here were carried out with a rigorous numerical model, and assuming the lightwave systems used the economical AM-VSB format  相似文献   
995.
Digital dancing     
Naugle  L. 《Multimedia, IEEE》1998,5(4):8-12
The author considers how a dance community has evolved in cyberspace. The emergence of the World Wide Web has led to an upsurge of creative exploration by dance artists as they discover, in ever-increasing numbers, this new technology's potential. The pervasiveness of information and communications technologies has produced new levels of thought, new concepts, and new types of human interaction. The author discusses the Cassandra Project performance which uses a videoconferencing system over the Internet. Computer networks connecting performers in real time with other performers and audiences at remote sites allow for text, dance and music to serve as improvisational material during the performance  相似文献   
996.
Al2O3-supported 12 wt% V2O5 catalysts were prepared by physically grinding both the oxides (solid–solid wetting) and by wet impregnation techniques. The physical mixtures (PM) were treated under two different conditions – calcination in the presence of dry oxygen and wet oxygen. The catalysts were characterized by x-ray diffraction, scanning electron microscopy, electron spin resonance and oxygen and carbon dioxide chemisorptions. Vanadia dispersion of the physical mixture calcined in the presence of wet oxygen was found to be very similar to that of the V2O5/Al2O3 catalyst prepared by the standard impregnation method. Methanol partial oxidation activities of these catalysts were also comparable. This revised version was published online in November 2006 with corrections to the Cover Date.  相似文献   
997.
The bit error rate (BER) analysis of a direct-sequence code-division multiple-access (DS-CDMA) cellular system over a Rayleigh-fading channel often results in complicated expressions even though the Gaussian approximation is applied. A combined probability density function (pdf) approach for the forward link and a mean-method technique for the reverse link are proposed to significantly reduce the computational complexity. The simplified BER expressions are derived and yield accurate results  相似文献   
998.
999.
Buffer analysis has traditionally relied heavily on the use of traffic models with short range (exponentially decaying) autocorrelation, e.g. Poisson and Markov modulated Poisson processes. Recent literature has suggested the presence of traffic with slowly (hyperbolically) decaying autocorrelation functions; these sources collectively and individually seem to be exhibiting the phenomenon of long range dependence (LRD). Furthermore, it has been claimed that this sort of traffic may exhibit behaviour, when buffered, that is advantageous in that a smaller buffer may be required than would be the case with non-LRD traffic. This phenomenon has been named the crossover effect, and the authors quantify its relevance to ATM networking, using simulation studies of a homogenous mix of chaotic sources. These show that there is a crossover effect, but the key finding is that this effect is much nearer to a buffer length of zero than was predicted by previous theoretical studies, actually occurring at a value so low that it has no practical significance  相似文献   
1000.
In this paper, we study the complexity of deciding readiness and failure equivalences for finite state processes and recursively defined processes specified by normed context-free grammars (CFGs) in Greibach normal form (GNF). The results are as follows: (1) Readiness and failure equivalences for processes specified by normed GNF CFGs are both undecidable. For this class of processes, the regularity problem with respect to failure or readiness equivalence is also undecidable. Moreover, all these undecidability results hold even for locally unary processes. In the unary case, these problems become decidable. In fact, they are Πp2-complete, We also show that with respect to bisimulation equivalence, the regularity for processes specified by normed GNF CFGs is NL-complete. (2) Readiness and failure equivalences for finite state processes are PSPACE-complete. This holds even for locally unary finite state processes. These two equivalences are co-NP-complete for unary finite state processes. Further, for acyclic finite state processes, readiness and failure equivalences are co-NP-complete and they are NL-complete in the unary case. (3) For finite tree processes, we show that finite trace, readiness, and failure equivalences are all L-complete. Further, the results remain true for the unary case. Our results provide a complete characterization of the computational complexity of deciding readiness and failure equivalences for several important classes of processes.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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