全文获取类型
收费全文 | 811篇 |
免费 | 14篇 |
国内免费 | 3篇 |
专业分类
化学 | 516篇 |
晶体学 | 3篇 |
力学 | 9篇 |
数学 | 114篇 |
物理学 | 186篇 |
出版年
2020年 | 7篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 11篇 |
2013年 | 27篇 |
2012年 | 27篇 |
2011年 | 27篇 |
2010年 | 23篇 |
2009年 | 17篇 |
2008年 | 50篇 |
2007年 | 37篇 |
2006年 | 40篇 |
2005年 | 18篇 |
2004年 | 33篇 |
2003年 | 27篇 |
2002年 | 21篇 |
2001年 | 26篇 |
2000年 | 20篇 |
1999年 | 18篇 |
1998年 | 8篇 |
1997年 | 16篇 |
1996年 | 19篇 |
1995年 | 13篇 |
1994年 | 21篇 |
1993年 | 15篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 14篇 |
1989年 | 18篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 10篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1978年 | 7篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 11篇 |
1974年 | 13篇 |
1973年 | 14篇 |
1972年 | 11篇 |
1971年 | 11篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1934年 | 5篇 |
排序方式: 共有828条查询结果,搜索用时 15 毫秒
1.
A protocol to correct for intra‐ and interspecific variation in tail hair growth to align isotope signatures of segmentally cut tail hair to a common time line 下载免费PDF全文
2.
William J. Reed 《Natural Resource Modeling》1989,3(4):463-480
It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given. 相似文献
3.
4.
5.
CV Tomy D Pal SS Banerjee S Ramakrishnan AK Grover S Bhattacharya MJ Higgins G Balakrishnan McK Paul 《Pramana》2002,58(5-6):925-935
The weakly pinned single crystals of the hexagonal 2H-NbSe2 compound have emerged as prototypes for determining and characterizing the phase boundaries of the possible order-disorder
transformations in the vortex matter. We present here a status report based on the ac and dc magnetization measurements of
the peak effect phenomenon in three crystals of 2H-NbSe2, in which the critical current densities vary over two orders of magnitude. We sketch the generic vortex phase diagram of
a weakly pinned superconductor, which also utilizes theoretical proposals. We also establish the connection between the metastability
effects and pinning. 相似文献
6.
We see that the entropy method yields strong concentration results for general self‐bounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006 相似文献
7.
8.
The numerical aperture of step index planar waveguides in SIMOX structures is 3.16. Analysis suggests that some of the higher-order modes that are supported by the waveguide will be reflected at the output face, due to total internal reflection. This situation therefore suggests that the propagation losses of such waveguide structures may be lower than those measured by conventional methods. 相似文献
9.
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width 总被引:2,自引:0,他引:2
Gruia C
linescu Cristina G. Fernandes Bruce Reed 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):333-359
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut. 相似文献
10.
We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636n ≤ D(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc. 相似文献