全文获取类型
收费全文 | 64217篇 |
免费 | 10129篇 |
国内免费 | 2392篇 |
专业分类
化学 | 63134篇 |
晶体学 | 922篇 |
力学 | 1537篇 |
综合类 | 26篇 |
数学 | 5913篇 |
物理学 | 5206篇 |
出版年
2024年 | 4篇 |
2023年 | 28篇 |
2022年 | 172篇 |
2021年 | 312篇 |
2020年 | 620篇 |
2019年 | 2541篇 |
2018年 | 2471篇 |
2017年 | 2753篇 |
2016年 | 3056篇 |
2015年 | 5342篇 |
2014年 | 5053篇 |
2013年 | 6998篇 |
2012年 | 5571篇 |
2011年 | 5274篇 |
2010年 | 4338篇 |
2009年 | 4212篇 |
2008年 | 4504篇 |
2007年 | 3802篇 |
2006年 | 3538篇 |
2005年 | 3363篇 |
2004年 | 2797篇 |
2003年 | 2497篇 |
2002年 | 3189篇 |
2001年 | 1605篇 |
2000年 | 1422篇 |
1999年 | 617篇 |
1998年 | 72篇 |
1997年 | 51篇 |
1996年 | 63篇 |
1995年 | 56篇 |
1994年 | 70篇 |
1993年 | 61篇 |
1992年 | 48篇 |
1991年 | 28篇 |
1990年 | 26篇 |
1989年 | 19篇 |
1988年 | 21篇 |
1987年 | 16篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 13篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 13篇 |
1980年 | 10篇 |
1979年 | 16篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
12.
Mehdi Dehghan 《Numerical Methods for Partial Differential Equations》2002,18(2):193-202
Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040 相似文献
13.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
14.
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. 相似文献
15.
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. 相似文献
16.
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. 相似文献
17.
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. 相似文献
18.
19.
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 相似文献
20.