全文获取类型
收费全文 | 35445篇 |
免费 | 3552篇 |
国内免费 | 2054篇 |
专业分类
电工技术 | 2597篇 |
技术理论 | 1篇 |
综合类 | 4286篇 |
化学工业 | 4303篇 |
金属工艺 | 1234篇 |
机械仪表 | 1619篇 |
建筑科学 | 8408篇 |
矿业工程 | 2993篇 |
能源动力 | 999篇 |
轻工业 | 1683篇 |
水利工程 | 1877篇 |
石油天然气 | 1753篇 |
武器工业 | 283篇 |
无线电 | 2041篇 |
一般工业技术 | 2202篇 |
冶金工业 | 1609篇 |
原子能技术 | 226篇 |
自动化技术 | 2937篇 |
出版年
2024年 | 119篇 |
2023年 | 359篇 |
2022年 | 707篇 |
2021年 | 862篇 |
2020年 | 913篇 |
2019年 | 767篇 |
2018年 | 790篇 |
2017年 | 959篇 |
2016年 | 1109篇 |
2015年 | 1217篇 |
2014年 | 2094篇 |
2013年 | 1829篇 |
2012年 | 2446篇 |
2011年 | 2671篇 |
2010年 | 2152篇 |
2009年 | 2327篇 |
2008年 | 2099篇 |
2007年 | 2583篇 |
2006年 | 2349篇 |
2005年 | 2174篇 |
2004年 | 1806篇 |
2003年 | 1562篇 |
2002年 | 1295篇 |
2001年 | 1081篇 |
2000年 | 923篇 |
1999年 | 774篇 |
1998年 | 554篇 |
1997年 | 504篇 |
1996年 | 400篇 |
1995年 | 375篇 |
1994年 | 300篇 |
1993年 | 203篇 |
1992年 | 161篇 |
1991年 | 132篇 |
1990年 | 90篇 |
1989年 | 79篇 |
1988年 | 58篇 |
1987年 | 61篇 |
1986年 | 26篇 |
1985年 | 15篇 |
1984年 | 26篇 |
1983年 | 19篇 |
1982年 | 9篇 |
1981年 | 10篇 |
1980年 | 14篇 |
1979年 | 21篇 |
1977年 | 3篇 |
1975年 | 3篇 |
1959年 | 3篇 |
1951年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
The Normalized Least Mean Square (NLMS) algorithm with a filtered-x structure (FxNLMS) is a widely used adaptive algorithm for Active Noise Control (ANC) due to its simplicity and ease of implementation. One of the major drawbacks is its slow convergence. A modified filtered-x structure (MFxNLMS) can be used to moderately improve the speed of convergence, but it does not offer a huge improvement. A greater increase in the speed of convergence can be obtained by using the MFxNLMS algorithm with orthogonal correction factors (M-OCF), but the usage of orthogonal correction factors also increases the computational complexity and limits the usage of the M-OCF in massive real-time applications. However, Graphics Processing Units (GPUs) are well known for their potential for highly parallel data processing. Therefore, GPUs seem to be a suitable platform to ameliorate this computational drawback. In this paper, we propose to derive the M-OCF algorithm to a partitioned block-based version in the frequency domain (FPM-OCF) for multichannel ANC systems in order to better exploit the parallel capabilities of the GPUs. The results show improvements in the convergence rate of the FPM-OCF algorithm in comparison to other NLMS-type algorithms and the usefulness of GPU devices for developing versatile, scalable, and low-cost multichannel ANC systems. 相似文献
92.
93.
94.
Nonlinear model predictive control with relevance vector regression and particle swarm optimization 总被引:1,自引:0,他引:1
In this paper, a nonlinear model predictive control strategy which utilizes a probabilistic sparse kernel learning technique called relevance vector regression (RVR) and particle swarm optimization with controllable random exploration velocity (PSO-CREV) is applied to a catalytic continuous stirred tank reactor (CSTR) process. An accurate reliable nonlinear model is first identified by RVR with a radial basis function (RBF) kernel and then the optimization of control sequence is speeded up by PSO-CREV. Additional stochastic behavior in PSO-CREV is omitted for faster convergence of nonlinear optimization. An improved system performance is guaranteed by an accurate sparse predictive model and an efficient and fast optimization algorithm. To compare the performance, model predictive control (MPC) using a deterministic sparse kernel learning technique called Least squares support vector machines (LS-SVM) regression is done on a CSTR. Relevance vector regression shows improved tracking performance with very less computation time which is much essential for real time control. 相似文献
95.
96.
97.
小型网络—校园网是学校内部之间,校内和校外之间做好沟通的关键。我们要通过利用校园内现有的条件,根据现有的情况,设计一个比较合理的校园网络;从而初步掌握局域网的设计技术和技巧,培养开发网络应用的独立工作能力。 相似文献
98.
99.
100.
This paper resolves the problem of predicting as well as the best expert up to an additive term of the order o(n), where n is the length of a sequence of letters from a finite alphabet. We call the games that permit this weakly mixable and give a geometrical characterisation of the class of weakly mixable games. Weak mixability turns out to be equivalent to convexity of the finite part of the set of superpredictions. For bounded games we introduce the Weak Aggregating Algorithm that allows us to obtain additive terms of the form . 相似文献