全文获取类型
收费全文 | 67718篇 |
免费 | 11718篇 |
国内免费 | 3242篇 |
专业分类
化学 | 66426篇 |
晶体学 | 1023篇 |
力学 | 1568篇 |
综合类 | 44篇 |
数学 | 8234篇 |
物理学 | 5383篇 |
出版年
2024年 | 18篇 |
2023年 | 117篇 |
2022年 | 186篇 |
2021年 | 378篇 |
2020年 | 796篇 |
2019年 | 2595篇 |
2018年 | 2438篇 |
2017年 | 2858篇 |
2016年 | 3153篇 |
2015年 | 5461篇 |
2014年 | 5235篇 |
2013年 | 7450篇 |
2012年 | 5883篇 |
2011年 | 5454篇 |
2010年 | 4552篇 |
2009年 | 4414篇 |
2008年 | 4829篇 |
2007年 | 4073篇 |
2006年 | 3724篇 |
2005年 | 3577篇 |
2004年 | 3019篇 |
2003年 | 2727篇 |
2002年 | 3372篇 |
2001年 | 1766篇 |
2000年 | 1623篇 |
1999年 | 827篇 |
1998年 | 292篇 |
1997年 | 224篇 |
1996年 | 203篇 |
1995年 | 173篇 |
1994年 | 169篇 |
1993年 | 132篇 |
1992年 | 133篇 |
1991年 | 92篇 |
1990年 | 83篇 |
1989年 | 95篇 |
1988年 | 70篇 |
1987年 | 48篇 |
1986年 | 48篇 |
1985年 | 53篇 |
1984年 | 49篇 |
1983年 | 33篇 |
1982年 | 37篇 |
1981年 | 34篇 |
1980年 | 38篇 |
1979年 | 32篇 |
1978年 | 21篇 |
1977年 | 14篇 |
1973年 | 16篇 |
1971年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
A. Khrennikov 《Annalen der Physik》2003,12(10):575-585
We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations. 相似文献
92.
We investigate the dynamics of the Λ system driven by two resonant laser fields in presence of dissipation for coupling strengths where the rotating‐wave approximation starts to break down. This regime is characterised by Rabi frequencies being approximately equal or smaller than the field frequencies. A systematic procedure to obtain an expansion for the solution of the Bloch evolution equations of the system is presented. The lowest contribution results to be the well‐known rotating‐wave approximation. The method is based on a semi‐classical treatment of the problem, and its predictions are interpreted fully quantum mechanically. The theory is illustrated by a detailed study of the disappearance of coherent population trapping as the intensities of the fields increase. 相似文献
93.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
94.
Jeannette H. C. Woerner 《商业与工业应用随机模型》2005,21(1):27-44
In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
95.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
96.
97.
A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005 相似文献
98.
In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of 3g−3 disjoint essential disks. These are characterized by a combinatorial criterion which is a slight strengthening of Casson-Gordon's rectangle condition. This is in contrast to fact that in general there can exist infinitely many such systems of disks which satisfy just the Casson-Gordon rectangle condition. 相似文献
99.
100.
Substructuring preconditioners for saddle-point problems arising from Maxwell's equations in three dimensions 总被引:1,自引:0,他引:1
This paper is concerned with the saddle-point problems arising from edge element discretizations of Maxwell's equations in a general three dimensional nonconvex polyhedral domain. A new augmented technique is first introduced to transform the problems into equivalent augmented saddle-point systems so that they can be solved by some existing preconditioned iterative methods. Then some substructuring preconditioners are proposed, with very simple coarse solvers, for the augmented saddle-point systems. With the preconditioners, the condition numbers of the preconditioned systems are nearly optimal; namely, they grow only as the logarithm of the ratio between the subdomain diameter and the finite element mesh size.