全文获取类型
收费全文 | 9806篇 |
免费 | 980篇 |
国内免费 | 697篇 |
专业分类
化学 | 1555篇 |
晶体学 | 22篇 |
力学 | 1052篇 |
综合类 | 158篇 |
数学 | 6527篇 |
物理学 | 2169篇 |
出版年
2024年 | 21篇 |
2023年 | 62篇 |
2022年 | 131篇 |
2021年 | 163篇 |
2020年 | 174篇 |
2019年 | 207篇 |
2018年 | 213篇 |
2017年 | 279篇 |
2016年 | 329篇 |
2015年 | 227篇 |
2014年 | 414篇 |
2013年 | 721篇 |
2012年 | 498篇 |
2011年 | 469篇 |
2010年 | 445篇 |
2009年 | 525篇 |
2008年 | 579篇 |
2007年 | 609篇 |
2006年 | 571篇 |
2005年 | 528篇 |
2004年 | 459篇 |
2003年 | 395篇 |
2002年 | 426篇 |
2001年 | 395篇 |
2000年 | 345篇 |
1999年 | 342篇 |
1998年 | 279篇 |
1997年 | 245篇 |
1996年 | 205篇 |
1995年 | 177篇 |
1994年 | 144篇 |
1993年 | 121篇 |
1992年 | 113篇 |
1991年 | 94篇 |
1990年 | 70篇 |
1989年 | 59篇 |
1988年 | 43篇 |
1987年 | 48篇 |
1986年 | 49篇 |
1985年 | 55篇 |
1984年 | 59篇 |
1983年 | 18篇 |
1982年 | 46篇 |
1981年 | 22篇 |
1980年 | 20篇 |
1979年 | 24篇 |
1978年 | 11篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
基于CPLD工作模式可调的线阵CCD驱动电路设计 总被引:3,自引:1,他引:3
针对传统驱动电路一旦做出修改,则需对硬件或程序进行改变的缺点,以型号为TCD1707D的线阵CCD为例,介绍了一种工作模式可调的驱动方法.该方法是利用复杂可编程逻辑器件和控制外端结合,通过分别设置内外触发来实现的.在外触发模式下,利用外触发脉冲,可由用户控制CCD的曝光和信号输出时间;内触发时,可以调节CCD的积分时间和驱动频率.为提高信号输出质量,针对EMC问题给出了线阵CCD的外围驱动电路.实验结果表明,该方法调试方便、电路结构简单、集成度较高、输出信号可靠稳定、受干扰小,可配合多种用户需要,对高速精确测量及线阵推扫模式具有一定参考价值. 相似文献
22.
本文提出了一种数值求解大型稀疏线性方程组Ax=b的具有三个参数的迭代法,我们称之为ATOR法,并且指出,熟知的Jacobi法、Gauss-Seidel法,SOR法,AOR法和TOR法为其特例.同时,我们对具有某些性质的系数矩阵A——Hermite正定矩阵、H-矩阵、L-矩阵和对角占优矩阵,讨论了ATOR法的收敛性以及给出了迭代矩阵谱半径的表达式和上界估计。 相似文献
23.
Approximation algorithms for scheduling unrelated parallel machines 总被引:10,自引:0,他引:10
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep
ij
. The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224. 相似文献
24.
We use the topological tool of Nielsen fixed-point theory to study the controllability of perturbed linear control processes whose control space can be reduced to a finite-dimensional one. These methods produce a lower bound on the number of controls that achieve a given target. We concentrate particularly on the case where the perturbation has sublinear growth, and we exhibit examples of multiple controls of various types that are detected by the Nielsen theory method.This research was partly supported by the Research Grant Teoria del Controllo dei Sistemi Dinamici, Ministero della Pubblica Istruzione, Roma, Italy. 相似文献
25.
Heleno Bolfarine 《Annals of the Institute of Statistical Mathematics》1990,42(3):435-444
In this paper, Bayesian linear prediction of the total of a finite population is considered in situations where the observation error variance is parameter dependent. Connections with least squares prediction (Royall (1976, J. Amer. Statist. Assoc., 71, 657–664)) in mixed linear models (Theil (1971, Principles of Econometrics, Wiley, New York)), are established. Extensions to the case of dynamic (state dependent) superpopulation models are also proposed. 相似文献
26.
On the convergence of cross decomposition 总被引:2,自引:0,他引:2
Kaj Holmberg 《Mathematical Programming》1990,47(1-3):269-296
Cross decomposition is a recent method for mixed integer programming problems, exploiting simultaneously both the primal and the dual structure of the problem, thus combining the advantages of Dantzig—Wolfe decomposition and Benders decomposition. Finite convergence of the algorithm equipped with some simple convergence tests has been proved. Stronger convergence tests have been proposed, but not shown to yield finite convergence.In this paper cross decomposition is generalized and applied to linear programming problems, mixed integer programming problems and nonlinear programming problems (with and without linear parts). Using the stronger convergence tests finite exact convergence is shown in the first cases. Unbounded cases are discussed and also included in the convergence tests. The behaviour of the algorithm when parts of the constraint matrix are zero is also discussed. The cross decomposition procedure is generalized (by using generalized Benders decomposition) in order to enable the solution of nonlinear programming problems. 相似文献
27.
Mathematical Notes - 相似文献
28.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
29.
We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method. 相似文献
30.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献