全文获取类型
收费全文 | 19288篇 |
免费 | 385篇 |
国内免费 | 187篇 |
专业分类
化学 | 970篇 |
晶体学 | 26篇 |
力学 | 217篇 |
综合类 | 28篇 |
数学 | 17445篇 |
物理学 | 1174篇 |
出版年
2023年 | 42篇 |
2022年 | 65篇 |
2021年 | 65篇 |
2020年 | 99篇 |
2019年 | 426篇 |
2018年 | 454篇 |
2017年 | 298篇 |
2016年 | 220篇 |
2015年 | 204篇 |
2014年 | 435篇 |
2013年 | 1245篇 |
2012年 | 602篇 |
2011年 | 864篇 |
2010年 | 758篇 |
2009年 | 1490篇 |
2008年 | 1503篇 |
2007年 | 1431篇 |
2006年 | 934篇 |
2005年 | 651篇 |
2004年 | 628篇 |
2003年 | 594篇 |
2002年 | 697篇 |
2001年 | 737篇 |
2000年 | 689篇 |
1999年 | 821篇 |
1998年 | 709篇 |
1997年 | 451篇 |
1996年 | 379篇 |
1995年 | 390篇 |
1994年 | 355篇 |
1993年 | 230篇 |
1992年 | 171篇 |
1991年 | 130篇 |
1990年 | 118篇 |
1989年 | 104篇 |
1988年 | 77篇 |
1987年 | 70篇 |
1986年 | 72篇 |
1985年 | 102篇 |
1984年 | 73篇 |
1983年 | 58篇 |
1982年 | 74篇 |
1981年 | 65篇 |
1980年 | 63篇 |
1979年 | 47篇 |
1978年 | 49篇 |
1977年 | 39篇 |
1976年 | 45篇 |
1975年 | 12篇 |
1974年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Brendan D. McKay 《Combinatorica》1990,10(4):367-377
LetRT(n), ED(n) andEOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, onn vertices. Then, asn,, for any>0. The last two families of graphs are also enumerated by their numbers of edges. The proofs use the saddle point method applied to appropriaten-dimensional integrals. 相似文献
52.
Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme. 相似文献
53.
Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL
2 fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL
2 which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH
, analytic, approximation toG relative to theL
norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF 相似文献
54.
Summary LetP be a finite set of three or more noncollinear points in the plane. A line which contains two or more points ofP is called aconnecting line (determined byP), and we call a connecting lineordinary if it contains precisely two points ofP. Almost a century ago, Sylvester posed the disarmingly simple question:Must every set P determine at least one ordinary line? No solution was offered at that time and the problem seemed to have been forgotten. Forty years later it was independently rediscovered by Erdös, and solved by Gallai. In 1943 Erdös proposed the problem in the American Mathematical Monthly, still unaware that it had been asked fifty years earlier, and the following year Gallai's solution appeared in print. Since then there has appeared a substantial literature on the problem and its generalizations.In this survey we review, in the first two sections, Sylvester's problem and its generalization to higher dimension. Then we gather results about the connecting lines, that is, the lines containing two or more of the points. Following this we look at the generalization to finite collections of sets of points. Finally, the points will be colored and the search will be for monochromatic connecting lines. 相似文献
55.
Christoph Börgers 《Numerische Mathematik》1990,57(1):435-451
Summary We study direct and iterative domain imbedding methods for the Stokes equations on certain non-rectangular domains in two space dimensions. We analyze a continuous analog of numerical domain imbedding for bounded, smooth domains, and give an example of a simple numerical algorithm suggested by the continuous analysis. This algorithms is applicable for simply connected domains which can be covered by rectangular grids, with uniformly spaced grid lines in at least one coordinate direction. We also discuss a related FFT-based fast solver for Stokes problems with physical boundary conditions on rectangles, and present some numerical results. 相似文献
56.
We consider a class of discrete-time Markov control processes with Borel state and action spaces, and d i.i.d. disturbances with unknown distribution . Under mild semi-continuity and compactness conditions, and assuming that is absolutely continuous with respect to Lebesgue measure, we establish the existence of adaptive control policies which are (1) optimal for the average-reward criterion, and (2) asymptotically optimal in the discounted case. Our results are obtained by taking advantage of some well-known facts in the theory of density estimation. This approach allows us to avoid restrictive conditions on the state space and/or on the system's transition law imposed in recent works, and on the other hand, it clearly shows the way to other applications of nonparametric (density) estimation to adaptive control.Research partially supported by The Third World Academy of Sciences under Research Grant No. MP 898-152. 相似文献
57.
John Todd 《Numerische Mathematik》1990,57(1):737-746
Theorem.Let the sequences {e
i
(n)
},i=1, 2, 3,n=0, 1, 2, ...be defined by
where the e
(0)
s satisfy
and where all square roots are taken positive. Then
where the convergence is quadratic and monotone and where
The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding. 相似文献
58.
E. Mieloszyk 《Periodica Mathematica Hungarica》1990,21(1):43-53
Applying Bittner's operational calculus we present a method to give approximate solutions of linear partial differential equations of first order
相似文献
59.
J. C. E. Dekker 《Archive for Mathematical Logic》1990,29(4):231-236
In his note [5] Hausner states a simple combinatorial principle, namely:
|
设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |