全文获取类型
收费全文 | 13069篇 |
免费 | 237篇 |
国内免费 | 10篇 |
专业分类
化学 | 48篇 |
力学 | 119篇 |
综合类 | 1篇 |
数学 | 12656篇 |
物理学 | 458篇 |
无线电 | 34篇 |
出版年
2022年 | 23篇 |
2021年 | 14篇 |
2020年 | 27篇 |
2019年 | 257篇 |
2018年 | 305篇 |
2017年 | 137篇 |
2016年 | 116篇 |
2015年 | 122篇 |
2014年 | 300篇 |
2013年 | 799篇 |
2012年 | 348篇 |
2011年 | 807篇 |
2010年 | 638篇 |
2009年 | 820篇 |
2008年 | 975篇 |
2007年 | 986篇 |
2006年 | 681篇 |
2005年 | 496篇 |
2004年 | 394篇 |
2003年 | 307篇 |
2002年 | 232篇 |
2001年 | 211篇 |
2000年 | 218篇 |
1999年 | 327篇 |
1998年 | 292篇 |
1997年 | 236篇 |
1996年 | 298篇 |
1995年 | 301篇 |
1994年 | 289篇 |
1993年 | 254篇 |
1992年 | 235篇 |
1991年 | 169篇 |
1990年 | 145篇 |
1989年 | 159篇 |
1988年 | 98篇 |
1987年 | 115篇 |
1986年 | 103篇 |
1985年 | 165篇 |
1984年 | 157篇 |
1983年 | 86篇 |
1982年 | 144篇 |
1981年 | 138篇 |
1980年 | 84篇 |
1979年 | 60篇 |
1978年 | 87篇 |
1977年 | 63篇 |
1976年 | 47篇 |
1975年 | 15篇 |
1974年 | 11篇 |
1973年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
We define the Sheffer group of all Sheffer-type polynomials and prove the isomorphism between the Sheffer group and the Riordan group. An equivalence of the Riordan array pair and generalized Stirling number pair is also presented. Finally, we discuss a higher dimensional extension of Riordan array pairs. 相似文献
92.
Hubert de Fraysseix 《Discrete Applied Mathematics》2007,155(9):1079-1095
Using a general resolution of barycentric systems we give a generalization of Tutte's theorem on convex drawing of planar graphs. We deduce a characterization of the edge coverings into pairwise non-crossing paths which are stretchable: such a system is stretchable if and only if each subsystem of at least two paths has at least three free vertices (vertices of the outer face of the induced subgraph which are internal to none of the paths of the subsystem). We also deduce that a contact system of pseudo-segments is stretchable if and only if it is extendible. 相似文献
93.
J. -P. Kauthen 《Numerische Mathematik》1989,56(5):409-424
Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties. 相似文献
94.
Piotr Niemiec 《Topology and its Applications》2006,153(18):3373-3382
Equicontinuous semigroups of transformations of a compact Hausdorff space and their sets of all invariant (Borel, regular and probabilistic) measures are studied. Conditions equivalent to the existence of at least one invariant measure are given. The (algebraic and topological) structure of the set of invariant measures is researched. 相似文献
95.
In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem. 相似文献
96.
We describe a procedure for determining a few of the largest singular values of a large sparse matrix. The method by Golub and Kent which uses the method of modified moments for estimating the eigenvalues of operators used in iterative methods for the solution of linear systems of equations is appropriately modified in order to generate a sequence of bidiagonal matrices whose singular values approximate those of the original sparse matrix. A simple Lanczos recursion is proposed for determining the corresponding left and right singular vectors. The potential asynchronous computation of the bidiagonal matrices using modified moments with the iterations of an adapted Chebyshev semi-iterative (CSI) method is an attractive feature for parallel computers. Comparisons in efficiency and accuracy with an appropriate Lanczos algorithm (with selective re-orthogonalization) are presented on large sparse (rectangular) matrices arising from applications such as information retrieval and seismic reflection tomography. This procedure is essentially motivated by the theory of moments and Gauss quadrature.This author's work was supported by the National Science Foundation under grants NSF CCR-8717492 and CCR-910000N (NCSA), the U.S. Department of Energy under grant DOE DE-FG02-85ER25001, and the Air Force Office of Scientific Research under grant AFOSR-90-0044 while at the University of Illinois at Urbana-Champaign Center for Supercomputing Research and Development.This author's work was supported by the U.S. Army Research Office under grant DAAL03-90-G-0105, and the National Science Foundation under grant NSF DCR-8412314. 相似文献
97.
A posteriori error estimators for the Stokes equations 总被引:5,自引:0,他引:5
Summary We present two a posteriori error estimators for the mini-element discretization of the Stokes equations. One is based on a suitable evaluation of the residual of the finite element solution. The other one is based on the solution of suitable local Stokes problems involving the residual of the finite element solution. Both estimators are globally upper and locally lower bounds for the error of the finite element discretization. Numerical examples show their efficiency both in estimating the error and in controlling an automatic, self-adaptive mesh-refinement process. The methods presented here can easily be generalized to the Navier-Stokes equations and to other discretization schemes.This work was accomplished at the Universität Heidelberg with the support of the Deutsche Forschungsgemeinschaft 相似文献
98.
This paper is based on the M. Sc. thesis written by the third author under the supervision of the first two authors. It was submitted to the University of Baghdad in 1986. 相似文献
99.
Mathias Lederer 《Annals of Combinatorics》2006,10(3):389-394
From Kostant’s multiplicity formula for general linear groups, one can derive a formula for the Kostka numbers. In this note
we give a combinatorial proof of this formula.
Received January 7, 2005 相似文献
100.
Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois. 相似文献