全文获取类型
收费全文 | 64095篇 |
免费 | 12355篇 |
国内免费 | 2473篇 |
专业分类
化学 | 63985篇 |
晶体学 | 875篇 |
力学 | 1792篇 |
综合类 | 59篇 |
数学 | 6179篇 |
物理学 | 6033篇 |
出版年
2024年 | 6篇 |
2023年 | 52篇 |
2022年 | 168篇 |
2021年 | 381篇 |
2020年 | 885篇 |
2019年 | 2592篇 |
2018年 | 2433篇 |
2017年 | 2873篇 |
2016年 | 3268篇 |
2015年 | 5510篇 |
2014年 | 5264篇 |
2013年 | 7178篇 |
2012年 | 5838篇 |
2011年 | 5441篇 |
2010年 | 4434篇 |
2009年 | 4244篇 |
2008年 | 4577篇 |
2007年 | 3868篇 |
2006年 | 3614篇 |
2005年 | 3414篇 |
2004年 | 2824篇 |
2003年 | 2556篇 |
2002年 | 3149篇 |
2001年 | 1627篇 |
2000年 | 1466篇 |
1999年 | 648篇 |
1998年 | 112篇 |
1997年 | 87篇 |
1996年 | 93篇 |
1995年 | 63篇 |
1994年 | 37篇 |
1993年 | 37篇 |
1992年 | 29篇 |
1991年 | 24篇 |
1990年 | 20篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1987年 | 14篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1971年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
92.
平行机半在线排序问题研究(Ⅰ) 总被引:15,自引:1,他引:14
对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类,以及第一类半在线模型的近似算法的设计及其竞争比分析。 相似文献
93.
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. 相似文献
94.
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. 相似文献
95.
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. 相似文献
96.
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. 相似文献
97.
98.
99.
L. Brian Lawrence 《Transactions of the American Mathematical Society》2005,357(7):2535-2556
Working in ZFC, we give an example as indicated in the title.
100.
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 相似文献