全文获取类型
收费全文 | 16332篇 |
免费 | 552篇 |
国内免费 | 81篇 |
专业分类
化学 | 11647篇 |
晶体学 | 160篇 |
力学 | 459篇 |
数学 | 1828篇 |
物理学 | 2871篇 |
出版年
2023年 | 87篇 |
2022年 | 88篇 |
2021年 | 166篇 |
2020年 | 251篇 |
2019年 | 215篇 |
2018年 | 179篇 |
2017年 | 148篇 |
2016年 | 365篇 |
2015年 | 354篇 |
2014年 | 368篇 |
2013年 | 792篇 |
2012年 | 973篇 |
2011年 | 1165篇 |
2010年 | 591篇 |
2009年 | 407篇 |
2008年 | 906篇 |
2007年 | 967篇 |
2006年 | 1021篇 |
2005年 | 974篇 |
2004年 | 781篇 |
2003年 | 680篇 |
2002年 | 627篇 |
2001年 | 247篇 |
2000年 | 231篇 |
1999年 | 188篇 |
1998年 | 179篇 |
1997年 | 223篇 |
1996年 | 243篇 |
1995年 | 186篇 |
1994年 | 207篇 |
1993年 | 213篇 |
1992年 | 191篇 |
1991年 | 135篇 |
1990年 | 118篇 |
1989年 | 132篇 |
1988年 | 131篇 |
1987年 | 114篇 |
1986年 | 101篇 |
1985年 | 177篇 |
1984年 | 154篇 |
1983年 | 113篇 |
1982年 | 144篇 |
1981年 | 141篇 |
1980年 | 124篇 |
1979年 | 120篇 |
1978年 | 114篇 |
1977年 | 108篇 |
1976年 | 89篇 |
1975年 | 118篇 |
1974年 | 97篇 |
排序方式: 共有10000条查询结果,搜索用时 312 毫秒
51.
52.
53.
We give a small functorial algebraic model for the 2-stage Postnikov section of the K-theory spectrum of a Waldhausen category and use our presentation to describe the multiplicative structure with respect to biexact functors. 相似文献
54.
The authors introduce a new concept of measure-valued solution for the 3-D incompressible Euler equations in order to incorporate the complex phenomena present in limits of approximate solutions of these equations. One application of the concepts developed here is the following important result: a sequence of Leray-Hopf weak solutions of the Navier-Stokes equations converges in the high Reynolds number limit to a measure-valued solution of 3-D Euler defined for all positive times. The authors present several explicit examples of solution sequences for 3-D incompressible Euler with uniformly bounded local kinetic energy which exhibit complex phenomena involving both persistence of oscillations and development of concentrations. An extensions of the concept of Young measure is developed to incorporate these complex phenomena in the measure-valued solutions constructed here.Partially supported by N.S.F. GrantPartially supported by N.S.F. Grant 84-0223 and 86-11110 相似文献
55.
56.
Summary There has been a rapid growth of interest in techniques for site-directed drug design, fuelled by the increasing availability of structural models of proteins of therapeutic importance, and by studies reported in the literature showing that potent chemical leads can be obtained by these techniques. Structure generation programs offer the prospect of discovering highly original lead structures from novel chemical families. Due to the fact that this technique is more-or-less still in its infancy, there are no case studies available that demonstrate the use of structure generation programs for site-directed drug design. Such programs were first proposed in 1986, and became commercially available in early 1992. They have shown their ability to reproduce, or suggest reasonable alternatives for, ligands in well-defined binding sites. This brief review will discuss the recent advances that have been made in the field of site-directed structure generation. 相似文献
57.
58.
59.
Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear
systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic
and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned
problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The
structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers
increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties
of iterative solvers.
Received August 5, 2000 / Published online June 20, 2001 相似文献
60.
Lisa Higham David Kirkpatrick Karl Abrahamson Andrew Adler 《Journal of Algorithms in Cognition, Informatics and Logic》1997,23(2):291-328
Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms. 相似文献