全文获取类型
收费全文 | 31189篇 |
免费 | 3870篇 |
国内免费 | 903篇 |
专业分类
化学 | 1997篇 |
晶体学 | 43篇 |
力学 | 2001篇 |
综合类 | 433篇 |
数学 | 11455篇 |
物理学 | 4112篇 |
无线电 | 15921篇 |
出版年
2024年 | 122篇 |
2023年 | 438篇 |
2022年 | 808篇 |
2021年 | 929篇 |
2020年 | 847篇 |
2019年 | 770篇 |
2018年 | 778篇 |
2017年 | 1102篇 |
2016年 | 1330篇 |
2015年 | 1279篇 |
2014年 | 2131篇 |
2013年 | 2044篇 |
2012年 | 2213篇 |
2011年 | 2178篇 |
2010年 | 1585篇 |
2009年 | 1821篇 |
2008年 | 1976篇 |
2007年 | 2058篇 |
2006年 | 1722篇 |
2005年 | 1446篇 |
2004年 | 1167篇 |
2003年 | 1060篇 |
2002年 | 910篇 |
2001年 | 767篇 |
2000年 | 698篇 |
1999年 | 518篇 |
1998年 | 512篇 |
1997年 | 438篇 |
1996年 | 359篇 |
1995年 | 307篇 |
1994年 | 236篇 |
1993年 | 233篇 |
1992年 | 197篇 |
1991年 | 130篇 |
1990年 | 128篇 |
1989年 | 94篇 |
1988年 | 87篇 |
1987年 | 61篇 |
1986年 | 68篇 |
1985年 | 86篇 |
1984年 | 78篇 |
1983年 | 25篇 |
1982年 | 39篇 |
1981年 | 24篇 |
1980年 | 22篇 |
1979年 | 36篇 |
1978年 | 21篇 |
1977年 | 34篇 |
1976年 | 20篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
基于DOCSIS标准的增强型基线保密性接口(BPI+)采用56bit DES加密分组数据,采用二密钥三重DES加密通信量加密密钥。这种多重加密技术的应用为HFC网络的数据传输提供了相当于或更好于专线级的网络安全与加密性能。 相似文献
52.
本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法,该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法,能够较快的收敛到最佳的功率点。同时,易于用硬件和软件实现。 相似文献
53.
L. Aggoun 《Mathematical and Computer Modelling》2002,36(11-13)
In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model. 相似文献
54.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
55.
56.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
57.
58.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
59.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
60.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献