首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   573052篇
  免费   6438篇
  国内免费   2031篇
化学   266988篇
晶体学   7227篇
力学   20535篇
综合类   9篇
数学   59344篇
物理学   145931篇
无线电   81487篇
  2020年   3813篇
  2019年   3990篇
  2018年   4534篇
  2017年   4318篇
  2016年   7669篇
  2015年   5636篇
  2014年   8263篇
  2013年   24003篇
  2012年   17577篇
  2011年   21879篇
  2010年   14416篇
  2009年   15236篇
  2008年   21558篇
  2007年   22508篇
  2006年   21511篇
  2005年   20151篇
  2004年   18200篇
  2003年   16368篇
  2002年   16056篇
  2001年   17677篇
  2000年   14288篇
  1999年   11750篇
  1998年   10097篇
  1997年   9908篇
  1996年   9610篇
  1995年   9020篇
  1994年   8712篇
  1993年   8573篇
  1992年   9050篇
  1991年   9042篇
  1990年   8445篇
  1989年   8024篇
  1988年   8109篇
  1987年   6936篇
  1986年   6704篇
  1985年   9125篇
  1984年   9325篇
  1983年   7760篇
  1982年   8318篇
  1981年   8099篇
  1980年   7837篇
  1979年   7836篇
  1978年   8060篇
  1977年   7887篇
  1976年   7921篇
  1975年   7486篇
  1974年   7444篇
  1973年   7789篇
  1972年   4792篇
  1971年   3703篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
992.
993.
An efficient iterative method for solving quasi-static electromagnetic field problems is presented. The electromagnetic field is generated by an inductive applicator and is represented as a superposition of two constituents, viz. a primary field in absence of the tissue configuration and a secondary field generated by the presence of the tissue. Then, for the secondary field a quasi-static approximation is employed. In the quasi-static field equations a relaxation function is introduced, such that the resulting equations can be solved iteratively. For a realistic three-dimensional model of a human hand numerical results are presented.  相似文献   
994.
Reliable priority-based flow-control is essential for real-time applications involving hard-deadlines. However, the use of first-in-first-out (FIFO) queues in such systems introduces priority inversion resulting in unbounded transmission delays. For this reason, a priority transmission queue is critical for multimedia and mission-critical systems. Yet very few priority queue implementations exist. This paper presents the design of a novel VLSI priority packet queue (PPQ), implemented in 1.2 μm CMOS technology. It achieves fast operation by manipulating its contents in terms of packet segments, rather than individual words. Similar to paged memory, this new segmented architecture greatly reduces implementation cost by reusing segments and avoiding storage area fragmentation. By distributing the computationally intensive priority comparison operation over the access time for an entire segment, the PPQ achieves 96% of the speed of a high-speed packet FIFO. The PPQ can either perform priority inheritance or overwrite lower priority packets to minimize the impact of queue overflow. In addition, it is suitable as a general computer network interface buffer, since it robustly handles asynchronous read and write clocks of greatly disparate frequencies. Our initial implementation achieves well over twice the speed of a nonpipelined approach with minimal additional overhead. Furthermore, scaling this design to larger capacities and more priority levels results in an even greater improvement in speed over conventional approaches  相似文献   
995.
996.
997.
998.
The performance of several extended definition TV (EDTV) formats are compared in terms of signal-to-noise ratio (SNR) operation in an analog FM satellite channel. The formats considered are the National Television System Committee (NTSC), extended NTSC (ENTSC), multiplexed analog components (MAC), and extend MAC (EMAC). These formats are compared in terms of SNR above and below the FM threshold. Analytically derived curves which show the luminance and chrominance SNR as a function of horizontal resolution for the above-threshold operation are presented. The effect of group delay on the composite video formats is determined for an actual satellite channel. The below-threshold performances for NTSC and MAC are compared in the luminance channel  相似文献   
999.
Collaborative filtering (CF) involves predicting the preferences of a user for a set of items given partial knowledge of the user's preferences for other items, while leveraging a database of profiles for other users. CF has applications e.g. in predicting Web sites a person will visit and in recommending products. Fundamentally, CF is a pattern recognition task, but a formidable one, often involving a huge feature space, a large data set, and many missing features. Even more daunting is the fact that a CF inference engine must be capable of predicting any (user-selected) items, given any available set of partial knowledge on the user's other preferences. In other words, the model must be designed to solve any of a huge (combinatoric) set of possible inference tasks. CF techniques include memory-based, classification-based, and statistical modelling approaches. Among these, modelling approaches scale best with large data sets and are the most adept at handling missing features. The disadvantage of these methods lies in the statistical assumptions (e.g. feature independence), which may be unjustified. To address this shortcoming we propose a new model-based CF method, based on the maximum entropy principle. For the MS Web application, the new method is demonstrated to outperform a number of CF approaches, including naive Bayes and latent variable (cluster) models, support vector machines (SVMs), and the (Pearson) correlation method.  相似文献   
1000.
Fundamental frequency techniques are used to analyze the series-parallel resonant converter under heavy load conditions, both with a continuous, but distorted parallel capacitor voltage waveform, and with a discontinuous capacitor voltage waveform. The analysis is validated with results from an experimental prototype. The application of the technique to the parallel-loaded L-C resonant converter is also considered.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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