全文获取类型
收费全文 | 72830篇 |
免费 | 13445篇 |
国内免费 | 9779篇 |
学科分类
工业技术 | 96054篇 |
出版年
2024年 | 586篇 |
2023年 | 1334篇 |
2022年 | 2492篇 |
2021年 | 2710篇 |
2020年 | 3023篇 |
2019年 | 2539篇 |
2018年 | 2518篇 |
2017年 | 3005篇 |
2016年 | 3435篇 |
2015年 | 4080篇 |
2014年 | 5270篇 |
2013年 | 5138篇 |
2012年 | 6307篇 |
2011年 | 6579篇 |
2010年 | 5329篇 |
2009年 | 5492篇 |
2008年 | 5846篇 |
2007年 | 6232篇 |
2006年 | 4881篇 |
2005年 | 4039篇 |
2004年 | 3223篇 |
2003年 | 2551篇 |
2002年 | 1915篇 |
2001年 | 1519篇 |
2000年 | 1281篇 |
1999年 | 967篇 |
1998年 | 787篇 |
1997年 | 628篇 |
1996年 | 490篇 |
1995年 | 345篇 |
1994年 | 296篇 |
1993年 | 228篇 |
1992年 | 214篇 |
1991年 | 112篇 |
1990年 | 138篇 |
1989年 | 100篇 |
1988年 | 71篇 |
1987年 | 28篇 |
1986年 | 40篇 |
1985年 | 39篇 |
1984年 | 26篇 |
1983年 | 32篇 |
1982年 | 38篇 |
1981年 | 23篇 |
1980年 | 31篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 12篇 |
1975年 | 16篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
一种PN码自适应捕获门限的改进算法 总被引:1,自引:0,他引:1
文献[1]提出了一种用于直扩系统的PN码自适应门限算法。但该文献也指出,此算法对门限总数十分敏感。当门限总数设置不当时,系统的平均捕获时间将显著增加。这限制了该算法在实际中的应用。本文就此提出了改进,给出了算法及电路框图。仿真结果表明,与原方案相比,改进算法改善了对门限总数的敏感性,降低了PN码平均捕获时间。 相似文献
102.
Two experiments examined the disruption of feature-based selection in triple-conjunction search at multiple target transfers. In Experiment 1, after 10 training sessions, a new target possessing previous distractor features was introduced. This produced disruption in RT and fixation number, but no disruption in feature-based selection. Specifically, there was a tendency to fixate objects sharing the target's contrast polarity and shape and this did not change even upon transfer to the new target. In Experiment 2, 30 training sessions were provided with three target transfers. At the first transfer, the results replicated Experiment 1. Subsequent transfers did not produce disruption on any measure. These findings are discussed in terms of strength theory, Guided Search, rule-based approaches to perceptual learning, and the area activation model. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
103.
104.
Xianpeng Wang Lixin Tang 《The International Journal of Advanced Manufacturing Technology》2008,36(5-6):431-441
This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer
programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using
this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable
of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain
near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure
of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic
has been developed and tested on instances collected from practical production data. The experimental results show that the
proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional
serial method. 相似文献
105.
D.E. Kvasov D. Menniti A. Pinnarelli Y.D. Sergeyev N. Sorrentino 《Electric Power Systems Research》2008
In this paper, the problem of global tuning of fuzzy power-system stabilizers (FPSSs) present in a multi-machine power system in order to damp the power system oscillations is considered. In particular, it is formulated as a problem of global minimization of a multiextremal black-box function over a multidimensional hyperinterval. A global optimization technique, recently proposed, is used for solving the stated problem: the search hyperinterval is partitioned into smaller hyperintervals and the objective function is evaluated only at two vertices corresponding to the main diagonal of the generated hyperintervals, thus avoiding unnecessary ponderous simulations. Then, the performances of this technique are numerically compared with ones of a genetic algorithm (GA). 相似文献
106.
107.
Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity. Nevertheless, the existing algorithms are mainly focused on binary images. We propose here a new fast method for computing the Legendre moments, which is not only suitable for binary images but also for grey level images. We first establish a recurrence formula of one-dimensional (1D) Legendre moments by using the recursive property of Legendre polynomials. As a result, the 1D Legendre moments of order p, Lp=Lp(0), can be expressed as a linear combination of Lp-1(1) and Lp-2(0). Based on this relationship, the 1D Legendre moments Lp(0) can thus be obtained from the arrays of L1(a) and L0(a), where a is an integer number less than p. To further decrease the computation complexity, an algorithm, in which no multiplication is required, is used to compute these quantities. The method is then extended to the calculation of the two-dimensional Legendre moments Lpq. We show that the proposed method is more efficient than the direct method. 相似文献
108.
本文应用d'Alembert-Lagrange原理,对由基座、(n-1)个柔性连杆及端部负载组成,相互用柱铰连接的柔性链式多体系统进行建模;对在空间技术中,具有一刚杆,两柔杆加上刚性负载所组成的三维机械臂系统,采用Gear算法进行数值仿真。仿真结果比较符合实际,从而在柔性多体系统的数学模型为刚性常微分方程的情况下,为解决其数值仿真问题,特别是三维问题的数值仿真取得了进展。 相似文献
109.
直接斜率波前复原算法的控制效果分析 总被引:7,自引:0,他引:7
建立自适应光学系统功率谱抑制函数的概念,分析了采用直接斜率波前复原算法的自适应当光学系统的控制效果,理论分析与61单元自适应光学系统上的实验结果表明,直接斜率波前复原算法将导致控制效果下降。 相似文献
110.