首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1426214篇
  免费   24950篇
  国内免费   6931篇
电工技术   33975篇
综合类   6338篇
化学工业   268384篇
金属工艺   63186篇
机械仪表   40034篇
建筑科学   44219篇
矿业工程   11225篇
能源动力   50353篇
轻工业   101218篇
水利工程   14180篇
石油天然气   37302篇
武器工业   128篇
无线电   195082篇
一般工业技术   270463篇
冶金工业   122457篇
原子能技术   33777篇
自动化技术   165774篇
  2021年   15778篇
  2020年   11919篇
  2019年   14718篇
  2018年   14249篇
  2017年   13479篇
  2016年   20648篇
  2015年   17407篇
  2014年   28884篇
  2013年   87945篇
  2012年   33450篇
  2011年   44526篇
  2010年   40918篇
  2009年   49952篇
  2008年   41837篇
  2007年   38431篇
  2006年   42777篇
  2005年   37012篇
  2004年   39614篇
  2003年   39697篇
  2002年   39097篇
  2001年   35404篇
  2000年   34173篇
  1999年   32527篇
  1998年   31622篇
  1997年   31327篇
  1996年   30302篇
  1995年   27784篇
  1994年   26397篇
  1993年   26275篇
  1992年   25396篇
  1991年   22348篇
  1990年   22784篇
  1989年   21866篇
  1988年   20270篇
  1987年   18697篇
  1986年   17950篇
  1985年   21311篇
  1984年   21850篇
  1983年   19831篇
  1982年   18958篇
  1981年   19026篇
  1980年   17596篇
  1979年   18186篇
  1978年   17456篇
  1977年   16666篇
  1976年   16696篇
  1975年   15777篇
  1974年   15312篇
  1973年   15378篇
  1972年   12858篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
The perfectly matched layer for use with the finite-difference time-domain method is adapted to our transmission-line matrix simulation as what we call a heaviside absorbing layer (HAL). It is shown that the reflection coefficient for the wave incident on a HAL is less than that of the wave incident on a matched-load termination at all angles of incidence. Furthermore, the dispersion relation of a transmission-line matrix mesh of a symmetrical condensed node with both electric and magnetic loss stubs is derived. It provides guidance on how to choose the losses of HAL and other simulation parameters properly  相似文献   
972.
Space diversity reception and forward-error correction coding are powerful techniques to combat multipath fading encountered in mobile radio communications. In this paper, we analyze the performance of a discrete-time switched diversity system using trellis-coded modulation multiple phase-shift keying (TCM-MPSK) on slow, nonselective correlated Nakagami (1960) fading channels. Analytical upper bounds using the transfer function bounding technique are obtained and illustrated by several numerical examples. A simple integral expression for calculating the exact pairwise error probability is presented. The use of optimum adaptive and fixed switching thresholds is considered. Monte Carlo simulation results, which are more indicative of the exact system performance, are also given  相似文献   
973.
A new method based on a two-wire line has been developed for noncontact diagnostics of a low-temperature plasma and its fluxes in channels with complex profiles. This method provides good spatial and time resolution. Pis’ma Zh. Tekh. Fiz. 23, 1–7 (July 26, 1997)  相似文献   
974.
We explore techniques for the measurement of local mean signal strength at 900 MHz and 2 GHz. In particular, we characterize the impact of transmitter and receiver antenna rotation on the estimated local mean. Then, we explore the collection of high resolution data while moving along a linear trajectory and using linear averaging techniques to estimate the local mean. With this information, the best measurement techniques can be chosen depending on the required speed versus accuracy tradeoff. Finally, we use a ray tracing propagation model to evaluate different methods of calculating the local mean signal strength for indoor environments  相似文献   
975.
Abstract— A Fourier series approach is proposed to calculate stress intensity factors using weight functions for semi-elliptical surface cracks in flat plates subjected to two-dimensional stress distributions. The weight functions were derived from reference stress intensity factors obtained by three-dimensional finite element analyses. The close form weight functions derived are suitable for the calculation of stress intensity factors for semi-elliptical surface cracks in flat plates under two-dimensional stress distributions with the crack aspect ratio in the range of 0.1 ≤ a/c ≤ 1 and relative depth in the range of 0 ≤ a/t ≤ 0.8. Solutions were verified using several two-dimensional non-linear stress distributions; the maximum difference being 6%.  相似文献   
976.
Bony avulsion fractures of the posterior cruciate ligament of the tibia have commonly been treated by open reduction and internal fixation using the posterior approach. However, this approach, using the prone position, makes it difficult to investigate and treat other combined injuries of the knee joint. We report a case of posterior cruciate ligament avulsion of the tibia that was arthroscopically reduced and firmly fixed with two cannulated screws. The posterior sag was absent after the operation and the result was excellent. By arthroscopy, we got rigid fixation of the avulsed fragment for early rehabilitation, and detection of a concomitant injury was also possible.  相似文献   
977.
A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.  相似文献   
978.
979.
An automatic tuning algorithm for decentralized PID control in multiple-input multiple-output (MIMO) plants is presented. This algorithm generalizes the authors' recent auto-tuner for two-input two-output systems to any number of inputs and outputs. The algorithm consists of two stages. In the first, the desired critical point, which consists of the critical gains of all the loops and a critical frequency, is identified. The auto-tuner identifies the desired critical point with almost no a priori information about the process. During the identification phase all controllers are replaced by relays, thus generating limit cycles with the same period in all loops. It is shown that each limit cycle corresponds to a single critical point of the process. By varying the relays parameters different points can be determined. The auto-tuner contains a procedure which converges rapidly to the desired critical point while maintaining the amplitudes of the process variables as well as of the manipulated variables within prespecified ranges. In the second stage, the data of the desired critical point is used to tune the PID controllers by the Ziegler-Nichols rules or their modifications. This paper focuses on the first stage. The steady-state process gains, which are required for the appropriate choice of the desired critical point, are determined by the auto-tuner in closed-loop fashion simultaneously with the identification of the critical point. The identification of the process gains is achieved at no extra plant time. Based upon a large number of simulated cases, the proposed auto-tuner seems to be efficient and robust. The paper discusses the underlying principles of the auto-tuner and its properties and capabilities are demonstrated via examples.  相似文献   
980.
Reviews the book, Constructing the subject: Historical origins of psychological research by Kurt Danziger (1990). Kurt Danziger's Constructing the Subject: Historical Origins of Psychological Research is a book of singular importance because it provides such a penetrating analysis, and does so in a manner that is cause for considerable reflection. In brief, Danziger provides a history lesson that not only situates the names and the projects of experimental psychology in the first part of this century, but also aims to clarify the project of knowledge generation both past and present. Indeed, shades of Quine, Kuhn, and Hesse permeate this book in a way that demands psychologists examine their own investigative practices and logics of justification. Through Wundt, through Galton, through Ebbinghaus and others, Danziger illuminates the development of experimental psychology along with the historical and philosophical vicissitudes that have given rise to numerous psychological knowledge claims. If it is true that we must understand our history in order to understand our present, then Danziger's book should be required reading in all research laboratories. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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