全文获取类型
收费全文 | 32640篇 |
免费 | 1181篇 |
国内免费 | 1294篇 |
专业分类
化学 | 9587篇 |
晶体学 | 201篇 |
力学 | 496篇 |
综合类 | 65篇 |
数学 | 20528篇 |
物理学 | 4238篇 |
出版年
2023年 | 369篇 |
2022年 | 253篇 |
2021年 | 299篇 |
2020年 | 456篇 |
2019年 | 751篇 |
2018年 | 718篇 |
2017年 | 496篇 |
2016年 | 548篇 |
2015年 | 658篇 |
2014年 | 1004篇 |
2013年 | 1932篇 |
2012年 | 1205篇 |
2011年 | 2205篇 |
2010年 | 1712篇 |
2009年 | 2260篇 |
2008年 | 2481篇 |
2007年 | 2312篇 |
2006年 | 1741篇 |
2005年 | 1330篇 |
2004年 | 1170篇 |
2003年 | 1055篇 |
2002年 | 1229篇 |
2001年 | 702篇 |
2000年 | 689篇 |
1999年 | 778篇 |
1998年 | 655篇 |
1997年 | 512篇 |
1996年 | 596篇 |
1995年 | 599篇 |
1994年 | 560篇 |
1993年 | 467篇 |
1992年 | 398篇 |
1991年 | 304篇 |
1990年 | 256篇 |
1989年 | 273篇 |
1988年 | 179篇 |
1987年 | 196篇 |
1986年 | 160篇 |
1985年 | 244篇 |
1984年 | 210篇 |
1983年 | 121篇 |
1982年 | 192篇 |
1981年 | 186篇 |
1980年 | 125篇 |
1979年 | 95篇 |
1978年 | 119篇 |
1977年 | 102篇 |
1976年 | 73篇 |
1975年 | 24篇 |
1971年 | 23篇 |
排序方式: 共有10000条查询结果,搜索用时 812 毫秒
991.
William Kerby 《Aequationes Mathematicae》1991,41(1):187-191
Summary Nearfields of rank 2 over their kernel which are not Dickson nearfields have recently been constructed by H. Zassenhaus. Here it is shown that KT-nearfields of rank 2 over their kernels and of characteristic 2 are necessarily Dickson nearfields which are coupled to quadratic field extensions and their Dickson group is isomorphic to 2. Using results of Gröger one obtains all KT-nearfields of rank 2 over the field of rational numbers. 相似文献
992.
Summary The paper deals with the behaviour of the so-called algorithms with respect to interval filling sequences A connection is established between the uniquely representable points and the continuity points of the algorithms; also strong continuity properties on monotonic algorithms are proved. Finally the results are applied to additive functions. The theorems extend some former results by the authors, by I. Kátai and by A. Járai.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth 相似文献
993.
We investigate the convergence of sequences of Padé approximants for power series
相似文献
994.
Summary This paper is devoted to the numerical analysis of a bidimensional two-phase Stefan problem. We approximate the enthalpy formulation byC
0 piecewise linear finite elements in space combined with a semi-implicit scheme in time. Under some restrictions related to the finite element mesh and to the timestep, we prove positivity, stability and convergence results. Various numerial tests are presented and discussed in order to show the accuracy of our scheme.This work is supported by the Fonds National Suisse pour la Recherche Scientifique. 相似文献
995.
Summary We consider the two-dimensional Helmholtz equation u+u=0 inD with the boundary conditionsu=0 on D. D is the Swiss Cross — a region consisting of five unit squares. A method based on the concept of Coherence is utilized to determine an approximation for the first eigenvalue=
1 more accurate than calculated by classical difference methods. The numerical result is used to illustrate isoperimetric upper and lower bounds for
1, and to test some conjectures on its relations with torsional rigidity.Dedicated to the memory of Professor Lathar Collatz 相似文献
996.
Summary We describe an algorithm for (bivariate) cardinal interpolation which can be applied to translates of basis functions which include box splines or radial basis functions. The algorithm is based on a representation of the Fourier transform of the fundamental interpolant, hence Fast Fourier Transform methods are available. In numerical tests the 4-directional box spline (transformed to the characteristical submodule of 2), the thin plate spline, and the multiquadric case give comparably equal and good results. 相似文献
997.
An(a, b)-n-fan means a union ofn internally disjoint paths. Menger's theorem states that a graphG has an(a, b)-n-fan if and only ifG isn-connected betweena andb. We show thatG contains edge-disjoint(a, b)-n-fans if and only if for anyk withk0min{n–1, |V(G)|–2} and for any subsetX ofV(G)-{a, b} with cardinalityk, G-X is (n-k)-edge-connected betweena andb. 相似文献
998.
Letf(n) be the smallest integer such that every tournament of orderf(n) contains every oriented tree of ordern. Sumner has just conjectures thatf(n)=2n–2, and F. K. Chung has shown thatf(n)(1+o(1))nlog2
n. Here we show thatf(n)12n andf(n)(4+o(1))n. 相似文献
999.
K. Mørken 《Constructive Approximation》1991,7(1):195-208
In this paper it is shown how the algebraic product of two spline functions, each represented in terms of B-splines, can again be represented as a linear combination of suitable B-splines. As a corollary to this result we obtain an explicit representation of a given B-spline function in terms of B-splines of some arbitrary higher degree. This generalizes some known results for raising the degree by one. Recurrence relations for both products and degree raising are established that may be useful for computation.Communicated by Larry L. Schumaker. 相似文献
1000.
Péter Hajnal 《Combinatorica》1991,11(2):131-143
We improve King's (n
5/4) lower bound on the randomized decision tree complexity of monotone graph properties to (n
4/3). The proof follows Yao's approach and improves it in a different direction from King's. At the heart of the proof are a duality argument combined with a new packing lemma for bipartite graphs.The paper was written while the author was a graduate student at the University of Chicago and was completed at M.I.T. The work was supported in part by NSF under GRANT number NSF 5-27561, the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discret Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648. 相似文献
|