首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   361篇
  免费   13篇
  国内免费   2篇
化学   164篇
晶体学   2篇
力学   4篇
数学   105篇
物理学   101篇
  2023年   2篇
  2022年   3篇
  2021年   6篇
  2020年   6篇
  2019年   6篇
  2018年   3篇
  2017年   10篇
  2016年   9篇
  2015年   15篇
  2014年   14篇
  2013年   20篇
  2012年   22篇
  2011年   24篇
  2010年   14篇
  2009年   16篇
  2008年   28篇
  2007年   22篇
  2006年   27篇
  2005年   10篇
  2004年   21篇
  2003年   7篇
  2002年   9篇
  2001年   4篇
  2000年   3篇
  1999年   2篇
  1998年   1篇
  1997年   4篇
  1996年   6篇
  1995年   1篇
  1994年   6篇
  1993年   1篇
  1992年   1篇
  1991年   8篇
  1990年   1篇
  1988年   1篇
  1987年   4篇
  1984年   4篇
  1983年   2篇
  1982年   1篇
  1981年   1篇
  1980年   5篇
  1979年   2篇
  1978年   4篇
  1977年   6篇
  1975年   3篇
  1974年   3篇
  1973年   4篇
  1972年   1篇
  1970年   2篇
  1966年   1篇
排序方式: 共有376条查询结果,搜索用时 15 毫秒
131.
Excitation functions, angular distributions and differential ranges were measured for the 26Mg(18O, 16O)28Mg reaction at 18O beam energies of 20–45 MeV. Excitation functions only were measured for the reactions 14C(18O, 19O)13C, 14C(18O, 16O)16C, 14C(18O, 20O)12C, 14C(18O, 15N)17N and 18O(18O, 19O)17O, 18O(18O, 16O)20O, 18O(18O, 15N)21F at 18O beam energies of 13–41 MeV. We have identified these as direct reactions in which a single neutron, a two-neutron cluster, a deuteron and a triton are transferred between projectile and target.

The cross sections for two-neutron transfer reactions were found to be relatively high and those for the 18O+18O and the 14C+18O reactions were higher than the ones of single-neutron transfers over most of the energy range.

Attempts were made to apply the theory of Buttle and Goldfarb for single-neutron transfer to the case of two-neutron transfer in the 26Mg(18O, 16O)28Mg reaction below the Coulomb barrier. It is shown that for those reactions for which the assumptions, implicit in the model, are valid, good agreement is obtained with experiment. We also tried to apply the diffraction model of Dar and Kozlovsky to the calculation of the angular distribution of these reactions. A good fit to the experimental results could be obtained if quite different sets of parameters were used in the calculations for the two bombarding energies.  相似文献   

132.
Removing a black hole conic singularity by means of Kruskal representation is equivalent to imposing extensibility on the Kasner–Fronsdal local isometric embedding of the corresponding black hole geometry. Allowing for globally non-trivial embeddings, living in Kaluza–Klein-like M 5 × S 1 (rather than in standard Minkowski M 6 ) and parametrized by some wave number k, extensibility can be achieved for apparently forbidden frequencies in the range 1 (k) 2 (k). As k 0, 1, 2 (0) H (e.g., H = 1/4M in the Schwarzschild case) such that the Hawking–Gibbons limit is fully recovered. The various Kruskal sheets are then viewed as slices of the Kaluza–Klein background. Euclidean k discreteness, dictated by imaginary time periodicity, is correlated with flux quantization of the underlying embedding gauge field.  相似文献   
133.
134.
We study the Glauber dynamics for the random cluster (FK) model on the torus with parameters (p,q), for q ∈ (1,4] and p the critical point pc. The dynamics is believed to undergo a critical slowdown, with its continuous‐time mixing time transitioning from for ppc to a power‐law in n at p = pc. This was verified at ppc by Blanca and Sinclair, whereas at the critical p = pc, with the exception of the special integer points q = 2,3,4 (where the model corresponds to the Ising/Potts models) the best‐known upper bound on mixing was exponential in n. Here we prove an upper bound of at p = pc for all q ∈ (1,4], where a key ingredient is bounding the number of nested long‐range crossings at criticality.  相似文献   
135.
For which values of k does a uniformly chosen 3‐regular graph G on n vertices typically contain n/k vertex‐disjoint k ‐cycles (a k ‐cycle factor)? To date, this has been answered for k = n and for k ? log n ; the former, the Hamiltonicity problem, was finally answered in the affirmative by Robinson and Wormald in 1992, while the answer in the latter case is negative since with high probability (w.h.p.) most vertices do not lie on k ‐cycles. A major role in our study of this problem is played by renewal processes without replacement, where one wishes to estimate the probability that in a uniform permutation of a given set of positive integers, the partial sums hit a designated target integer. Using sharp tail estimates for these renewal processes, which may be of independent interest, we settle the cycle factor problem completely: the “threshold” for a k ‐cycle factor in G as above is κ 0 log2 n with . To be precise, G contains a k ‐cycle factor w.h.p. if and w.h.p. does not contain one if . Thus, for most values of n the threshold concentrates on the single integer K 0(n ). As a byproduct, we confirm the “comb conjecture,” an old problem concerning the embedding of certain spanning trees in the random graph (n,p ).© 2015 Wiley Periodicals, Inc.  相似文献   
136.
Oligo-S,S-dioxothienylenevinylenes have been prepared by transferring oxygen atoms to the sulfur atoms using the HOF ⋅ CH3CN complex. Their photophysical properties are presented in comparison with their thiophenevinylene congeners. Together with their vibrational properties and molecular force fields, this study allows for the interpretation of the alteration of aromaticity and inter-ring exocyclic π-conjugation in this series.  相似文献   
137.
138.
139.
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7nO(1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5nO(1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.  相似文献   
140.
A new technique of investigation of labile metabolic pathways using immobilization of the pathway in sol-gel derived silicate matrices was demonstrated. The biosynthetic pathway of itaconic acid in Aspergillus terreus is believed to proceed through decarboxylation of cis-aconitate catalyzed by an unstable enzyme aconitate decarboxylase, E.C. 4.1.1.6. Stabilization of this pathway in sol-gel derived silicate matrix enabled the elucidation of the correct sequence of biosynthetic steps. The decarboxylation of cis-aconitate does not lead directly to itaconate, but rather to citraconate. The latter is then isomerized to itaconate by a previously unknown enzyme.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号