全文获取类型
收费全文 | 11938篇 |
免费 | 1214篇 |
国内免费 | 432篇 |
专业分类
化学 | 5477篇 |
晶体学 | 27篇 |
力学 | 1113篇 |
综合类 | 34篇 |
数学 | 4917篇 |
物理学 | 2016篇 |
出版年
2023年 | 154篇 |
2022年 | 193篇 |
2021年 | 253篇 |
2020年 | 430篇 |
2019年 | 310篇 |
2018年 | 277篇 |
2017年 | 260篇 |
2016年 | 472篇 |
2015年 | 476篇 |
2014年 | 593篇 |
2013年 | 975篇 |
2012年 | 666篇 |
2011年 | 680篇 |
2010年 | 459篇 |
2009年 | 749篇 |
2008年 | 685篇 |
2007年 | 731篇 |
2006年 | 614篇 |
2005年 | 473篇 |
2004年 | 455篇 |
2003年 | 429篇 |
2002年 | 359篇 |
2001年 | 350篇 |
2000年 | 327篇 |
1999年 | 274篇 |
1998年 | 284篇 |
1997年 | 222篇 |
1996年 | 225篇 |
1995年 | 158篇 |
1994年 | 119篇 |
1993年 | 117篇 |
1992年 | 83篇 |
1991年 | 75篇 |
1990年 | 63篇 |
1989年 | 52篇 |
1988年 | 52篇 |
1987年 | 40篇 |
1986年 | 52篇 |
1985年 | 33篇 |
1984年 | 47篇 |
1983年 | 16篇 |
1982年 | 29篇 |
1981年 | 29篇 |
1980年 | 21篇 |
1979年 | 25篇 |
1978年 | 41篇 |
1977年 | 41篇 |
1976年 | 40篇 |
1975年 | 15篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
851.
In this paper, we develop an algorithmic method for the evaluation of the steady state probability vector of a special class of finite state Markov chains. For the class of Markov chains considered here, it is assumed that the matrix associated with the set of linear equations for the steady state probabilities possess a special structure, such that it can be rearranged and decomposed as a sum of two matrices, one lower triangular with nonzero diagonal elements, and the other an upper triangular matrix with only very few nonzero columns. Almost all Markov chain models of queueing systems with finite source and/or finite capacity and first-come-first-served or head of the line nonpreemptive priority service discipline belongs to this special class. 相似文献
852.
S. K. Zavriev 《Journal of Optimization Theory and Applications》1996,91(1):185-214
The steepest-descent technique dealing with the perturbed values of the objective function and its gradients and with nonexact line searches is considered. Attention is given to the case where the perturbations do not decrease on the algorithm trajectories; the aim is to investigate how perturbations at every iteration of the algorithm perturb its original attractor set.Based on the Liapunov direct method for attraction analysis of discrete-time processes, a sharp estimation of the attractor set generated by a perturbed steepest-descent technique with respect to the perturbation magnitudes is obtained. Some global optimization properties of finite-difference analogues of the gradient method are discovered. These properties are not inherent in methods which use exact gradients.The author is grateful to the referees for many useful suggestions. 相似文献
853.
854.
Dganit Amitai Amir Averbuch Moshe Israeli Samuel Itzikowitz 《Numerical Algorithms》1996,12(1):159-192
In achieving significant speed-up on parallel machines, a major obstacle is the overhead associated with synchronizing the concurrent processes. This paper presents high-orderparallel asynchronous schemes, which are schemes that are specifically designed to minimize the associated synchronization overhead of a parallel machine in solving parabolic PDEs. They are asynchronous in the sense that each processor is allowed to advance at its own speed. Thus, these schemes are suitable for single (or multi) user shared memory or (message passing) MIMD multiprocessors. Our approach is demonstrated for the solution of the multidimensional heat equation, of which we present a spatial second-order Parametric Asynchronous Finite-Difference (PAFD) scheme. The well-known synchronous schemes are obtained as its special cases. This is a generalization and expansion of the results in [5] and [7]. The consistency, stability and convergence of this scheme are investigated in detail. Numerical tests show that although PAFD provides the desired order of accuracy, its efficiency is inadequate when performed on each grid point.In an alternative approach that uses domain decomposition, the problem domain is divided among the processors. Each processor computes its subdomain mostly independently, while the PAFD scheme provides the solutions at the subdomains' boundaries. We use high-order finite-difference implicit scheme within each subdomain and determine the values at subdomains' boundaries by the PAFD scheme. Moreover, in order to allow larger time-step, we use remote neighbors' values rather than those of the immediate neighbors. Numerical tests show that this approach provides high efficiency and in the case which uses remote neighbors' values an almost linear speedup is achieved. Schemes similar to the PAFD can be developed for other types of equations [3].This research was supported by the fund for promotion of research at the Technion. 相似文献
855.
This paper presents a new composition law for Runge-Kutta methods when applied to index-2 differential-algebraic systems. Applications of this result to the study of the order of composite methods and of symmetric methods are given. 相似文献
856.
857.
An algorithm is presented for the design of optimal detection filters in radar and communications systems, subject to inequality constraints on the maximum output sidelobe levels. This problem was reduced in an earlier paper (Ref. 1) to an unconstrained one in the dual space of regular Borel measures, with a nondifferentiable cost functional. Here, the dual problem is solved via steepest descent, using the directional Gateaux differential. The algorithm is shown to be convergent, and numerical results are presented.This research was supported by the Australian Research Grants Committee. 相似文献
858.
M. J. Todd 《Journal of Optimization Theory and Applications》1976,20(4):397-416
Lemke's algorithm for the linear complementarity problem fails when a desired pivot is not blocked. A projective transformation overcomes this difficulty. The transformation is performed computationally by adjoining a new row to a schema of the problem and pivoting on the element in this row and the unit constant column. Two new algorithms result; some conditions for their success are discussed.This research was partially supported by National Science Foundation, Grant GK-42092. 相似文献
859.
The diagrammatic perturbation technique for the kinetic theory of classical reacting systems with diffusion is developed. It is further applied to investigation of recombination-type reactions in media of one, two, and three dimensions. The effective rates of this reaction are calculated, covering the whole range from the slow to the fast (diffusion-controlled) regimes. 相似文献
860.
S. T. Glad 《Journal of Optimization Theory and Applications》1979,28(2):135-156
The convergence properties of different updating methods for the multipliers in augmented Lagrangians are considered. It is assumed that the updating of the multipliers takes place after each line search of a quasi-Newton method. Two of the updating methods are shown to be linearly convergent locally, while a third method has superlinear convergence locally. Modifications of the algorithms to ensure global convergence are considered. The results of a computational comparison with other methods are presented.This work was supported by the Swedish Institute of Applied Mathematics. 相似文献