全文获取类型
收费全文 | 126篇 |
免费 | 0篇 |
专业分类
化学 | 36篇 |
力学 | 7篇 |
数学 | 24篇 |
物理学 | 59篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2013年 | 4篇 |
2012年 | 1篇 |
2011年 | 5篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 1篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 7篇 |
1989年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 4篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1938年 | 2篇 |
排序方式: 共有126条查询结果,搜索用时 15 毫秒
31.
32.
Su S Acquilano DE Arumugasamy J Beeler AB Eastwood EL Giguere JR Lan P Lei X Min GK Yeager AR Zhou Y Panek JS Snyder JK Schaus SE Porco JA 《Organic letters》2005,7(13):2751-2754
[reaction: see text] The synthesis of a complex hybrid oxime library is reported utilizing convergent ligation of alkoxyamine and carbonyl monomers via "chemical domain shuffling". Initial biological screening of the library against human small cell lung carcinoma (A549) cells led to the identification of a novel hybrid dimer in contrast to the corresponding monomeric compounds which were found to be inactive. 相似文献
33.
34.
Following an earlier study [3], we consider the Einstein–Weyl equations on a fixed (complex) background metric as an equation for a 1-form and its first few derivatives. If the background is flat then we conclude that the only solutions are conformal rescalings of constant curvature metrics. If the background is a homogeneous 3-geometry in Bianchi class A (i.e., with unimodular isometry group), we find necessary and sufficient conditions on the 3-geometry for solutions of the Einstein–Weyl equations to exist. The solutions we find are complexifications of known ones. In particular, we find that the general left-invariant metric on S3 and the metric 'Sol' admit no local solutions of the Einstein–Weyl equations. 相似文献
35.
The method fast inverse using nested dissection (FIND) was proposed to calculate the diagonal entries of the inverse of a large sparse symmetric matrix. In this paper, we show how the FIND algorithm can be generalized to calculate off‐diagonal entries of the inverse that correspond to ‘short’ geometric distances within the computational mesh of the original matrix. The idea is to extend the downward pass in FIND that eliminates all nodes outside of each node cluster. In our advanced downwards pass, it eliminates all nodes outside of each ‘node cluster pair’ from a subset of all node cluster pairs. The complexity depends on how far (i,j) is from the main diagonal. In the extension of the algorithm, all entries of the inverse that correspond to vertex pairs that are geometrically closer than a predefined length limit l will be calculated. More precisely, let α be the total number of nodes in a two‐dimensional square mesh. We will show that our algorithm can compute O(α3 ∕ 2 + 2ε) entries of the inverse in O(α3 ∕ 2 + 2ε) time where l = O(α1 ∕ 4 + ε) and 0 ≤ ε ≤1 ∕ 4. Numerical examples are given to illustrate the efficiency of the proposed method. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
36.
37.
38.
39.
40.