全文获取类型
收费全文 | 15552篇 |
免费 | 2157篇 |
国内免费 | 1493篇 |
专业分类
电工技术 | 2037篇 |
技术理论 | 4篇 |
综合类 | 1695篇 |
化学工业 | 553篇 |
金属工艺 | 286篇 |
机械仪表 | 1964篇 |
建筑科学 | 613篇 |
矿业工程 | 383篇 |
能源动力 | 310篇 |
轻工业 | 206篇 |
水利工程 | 302篇 |
石油天然气 | 259篇 |
武器工业 | 150篇 |
无线电 | 2045篇 |
一般工业技术 | 970篇 |
冶金工业 | 382篇 |
原子能技术 | 191篇 |
自动化技术 | 6852篇 |
出版年
2024年 | 54篇 |
2023年 | 158篇 |
2022年 | 316篇 |
2021年 | 434篇 |
2020年 | 425篇 |
2019年 | 347篇 |
2018年 | 381篇 |
2017年 | 495篇 |
2016年 | 618篇 |
2015年 | 752篇 |
2014年 | 1024篇 |
2013年 | 999篇 |
2012年 | 1300篇 |
2011年 | 1277篇 |
2010年 | 938篇 |
2009年 | 948篇 |
2008年 | 976篇 |
2007年 | 1193篇 |
2006年 | 993篇 |
2005年 | 944篇 |
2004年 | 812篇 |
2003年 | 687篇 |
2002年 | 532篇 |
2001年 | 432篇 |
2000年 | 376篇 |
1999年 | 284篇 |
1998年 | 229篇 |
1997年 | 222篇 |
1996年 | 168篇 |
1995年 | 160篇 |
1994年 | 134篇 |
1993年 | 106篇 |
1992年 | 105篇 |
1991年 | 50篇 |
1990年 | 47篇 |
1989年 | 52篇 |
1988年 | 45篇 |
1987年 | 31篇 |
1986年 | 25篇 |
1985年 | 25篇 |
1984年 | 22篇 |
1983年 | 13篇 |
1982年 | 9篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1975年 | 5篇 |
1973年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 218 毫秒
991.
GU Yuantao TANG Kun & CUI Huijuan State Key Laboratory on Microwave Digital Communications Department of Electronics Engineering Tsinghua University Beijing China Correspondence should be addressed to Gu Yuantao 《中国科学F辑(英文版)》2004,(2)
In several branches of adaptive filtering algorithms, the least mean square (LMS) algorithm is widely applied in many areas because of its low computational cost, good numerical stability and other features[1]. However, the contradiction between faster convergence and smaller steady-state mean squared error (MSE) affects its performance considerably. Step-size, as the key to the problem, can but offer only one choice of the two demands. Therefore, many variable step-size algorithms were prop… 相似文献
992.
Gravvanis G. A. Giannoutakis K. M. Bekakos M. P. Efremides O. B. 《The Journal of supercomputing》2004,30(2):77-96
A new class of normalized approximate inverse matrix techniques, based on the concept of sparse normalized approximate factorization procedures are introduced for solving sparse linear systems derived from the finite difference discretization of partial differential equations. Normalized explicit preconditioned conjugate gradient type methods in conjunction with normalized approximate inverse matrix techniques are presented for the efficient solution of sparse linear systems. Theoretical results on the rate of convergence of the normalized explicit preconditioned conjugate gradient scheme and estimates of the required computational work are presented. Application of the new proposed methods on two dimensional initial/boundary value problems is discussed and numerical results are given. The parallel and systolic implementation of the dominant computational part is also investigated. 相似文献
993.
Anthony Savidis 《Software》2004,34(10):977-1009
Smart pointers denote a well‐known technique for collective resource ownership, e.g. sharing dynamic object instances, while usually supporting automatic garbage collection based on reference counting. The original method has been retargeted to serve as a generic defensive programming method for ‘exhaustive tracking’ of erroneous pointer use in C++. Automatic bug tracking is supported in a unified manner both for pointers to heap memory, i.e. free storage, as well as for pointers to stack or global memory, i.e. auto or static storage. Overall, the presented technique (a) offers a simple contract for memory allocation and use; (b) supports type and indirection depth genericity; (c) implements most operators supported for built‐in pointers with embedded bug defense; (d) offers an alternative way of employing a garbage collection facility for memory leak detection; and (e) provides an appropriate collection of utility macros, through which defensive pointers should be used, with an alternative version re‐targeted to normal native pointers. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
994.
This study investigated the performance of parallel optimization by means of a genetic algorithm (GA) for lubrication analysis. An air-bearing design was used as the illustrated example and the parallel computation was conducted in a single system image (SSI) cluster, a system of loosely network-connected desktop computers. The main advantages of using GAs as optimization tools are for multi-objective optimization, and high probability of achieving global optimum in a complex problem. To prevent a premature convergence in the early stage of evolution for multi-objective optimization, the Pareto optimality was used as an effective criterion in offspring selections. Since the execution of the genetic algorithm (GA) in search of optimum is population-based, the computations can be performed in parallel. In the cases of uneven computational loads a simple dynamic load-balancing scheme is proposed for optimizing the parallel efficiency. It is demonstrated that the huge amount of computing demand of the GA for complex multi-objective optimization problems can be effectively dealt with by parallel computing in an SSI cluster. 相似文献
995.
996.
997.
998.
针对电流型逆变器桥臂并联扩容时开关损耗较大的问题,对SiC肖特基二极管和Si快恢复二极管的正反向恢复特性、MOSFET并联均流特性以及容性状态下电流型逆变器工作过程进行了研究。提出了在电流型逆变器中用SiC肖特基二极管代替Si快恢复二极管以实现保持逆变器良好并联均流效果的同时降低逆变器损耗。分别搭建了基于Si快恢复二极管和SiC肖特基二极管的电流型逆变器实验平台以对比验证SiC肖特基二极管在系统扩容应用中实际效果。研究结果表明,在电流型逆变器中使用SiC肖特基二极管可以极大地降低逆变器损耗同时保持逆变器良好的均流效果,提高逆变器效率。 相似文献
999.
1000.