全文获取类型
收费全文 | 3080篇 |
免费 | 47篇 |
国内免费 | 34篇 |
专业分类
化学 | 1760篇 |
晶体学 | 60篇 |
力学 | 67篇 |
数学 | 686篇 |
物理学 | 588篇 |
出版年
2022年 | 49篇 |
2021年 | 64篇 |
2020年 | 30篇 |
2019年 | 35篇 |
2018年 | 39篇 |
2017年 | 57篇 |
2016年 | 79篇 |
2015年 | 76篇 |
2014年 | 87篇 |
2013年 | 211篇 |
2012年 | 136篇 |
2011年 | 179篇 |
2010年 | 116篇 |
2009年 | 126篇 |
2008年 | 171篇 |
2007年 | 160篇 |
2006年 | 149篇 |
2005年 | 125篇 |
2004年 | 142篇 |
2003年 | 101篇 |
2002年 | 107篇 |
2001年 | 53篇 |
2000年 | 43篇 |
1999年 | 42篇 |
1998年 | 40篇 |
1997年 | 51篇 |
1996年 | 57篇 |
1995年 | 32篇 |
1994年 | 34篇 |
1993年 | 41篇 |
1992年 | 27篇 |
1991年 | 33篇 |
1990年 | 33篇 |
1989年 | 31篇 |
1988年 | 21篇 |
1987年 | 26篇 |
1986年 | 18篇 |
1985年 | 30篇 |
1984年 | 41篇 |
1983年 | 24篇 |
1982年 | 24篇 |
1981年 | 30篇 |
1980年 | 23篇 |
1979年 | 21篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 12篇 |
1975年 | 12篇 |
1974年 | 10篇 |
1972年 | 11篇 |
排序方式: 共有3161条查询结果,搜索用时 15 毫秒
1.
Gürbüzbalaban Mert Ruszczyński Andrzej Zhu Landi 《Journal of Optimization Theory and Applications》2022,194(3):1014-1041
Journal of Optimization Theory and Applications - We consider a distributionally robust formulation of stochastic optimization problems arising in statistical learning, where robustness is with... 相似文献
2.
Based on computer simulations, Kauffman (Physica D, 10, 145-156, 1984) made several generalizations about a random Boolean cellular automaton which he invented as a model of cellular metabolism. Here we give the first rigorous proofs of two of Kauffman's generalizations: a large fraction of vertices stabilize quickly, consequently the length of cycles in the automaton's behavior is small compared to that of a random mapping with the same number of states; and reversal of the states of a large fraction of the vertices does not affect the cycle to which the automaton moves. 相似文献
3.
Tomasz Luczak 《Random Structures and Algorithms》1991,2(4):421-439
Let G(n, M) be a graph chosen at random from the family of all labelled graphs with n vertices and M(n) = 0.5n + s(n) edges, where s3(n)n?2→∞ but s(n) = o(n). We find the limit distribution of the length of shortest cycle contained in the largest component of G(n, M), as well as of the longest cycle outside it. We also describe the block structure of G(n, M) and derive from this result the limit probability that G(n, M) contains a cycle with a diagonal. Finally, we show that the probability tending to 1 as n-→∞ the length of the longest cycle in G(n, M) is of the order s2(n)/n. 相似文献
4.
Anna Dbiska‐Nagrska Andrzej Just Zdzisaw Stempie 《Mathematical Methods in the Applied Sciences》2004,27(2):221-230
This paper presents the Galerkin approximation of the optimization problem of a system governed by non‐linear second‐order evolution equation where a non‐linear operator depends on derivative of the state of the system. The control is acting on a non‐linear equation. After giving some results on the existence of optimal control we shall prove the existence of the weak and strong condensation points of a set of solutions of the approximate optimization problems. Each of these points is a solution of the initial optimization problem. Finally we shall give a simple example using the obtained results. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
5.
An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.
6.
Andrzej Dabrowski Erich Robens Peter Klobes Klaus Meyer Przemyslaw Podkocielny 《Particle & Particle Systems Characterization》2003,20(5):311-322
Since a comprehensive survey published in 1999 [1] much work was done in standardizing measuring methods to characterize the surface geometry of dispersed and/or porous solids and to certify reference materials. The present paper is an extension of a short communication [2]. It gives a survey on existing standards and reports on new drafts and proposals. 相似文献
7.
Rafał Bocian Thorsten Holm Andrzej Skowroński 《Central European Journal of Mathematics》2004,2(1):67-75
Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation
type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation
dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have
representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically
closed fields having simply connected Galois coverings. 相似文献
8.
9.
10.