全文获取类型
收费全文 | 15759篇 |
免费 | 1378篇 |
国内免费 | 1299篇 |
专业分类
化学 | 4903篇 |
晶体学 | 121篇 |
力学 | 1184篇 |
综合类 | 256篇 |
数学 | 8136篇 |
物理学 | 3836篇 |
出版年
2024年 | 21篇 |
2023年 | 124篇 |
2022年 | 247篇 |
2021年 | 314篇 |
2020年 | 431篇 |
2019年 | 396篇 |
2018年 | 396篇 |
2017年 | 428篇 |
2016年 | 506篇 |
2015年 | 408篇 |
2014年 | 682篇 |
2013年 | 1109篇 |
2012年 | 642篇 |
2011年 | 752篇 |
2010年 | 706篇 |
2009年 | 865篇 |
2008年 | 1002篇 |
2007年 | 1079篇 |
2006年 | 883篇 |
2005年 | 777篇 |
2004年 | 666篇 |
2003年 | 697篇 |
2002年 | 702篇 |
2001年 | 554篇 |
2000年 | 479篇 |
1999年 | 431篇 |
1998年 | 440篇 |
1997年 | 330篇 |
1996年 | 347篇 |
1995年 | 282篇 |
1994年 | 238篇 |
1993年 | 201篇 |
1992年 | 165篇 |
1991年 | 140篇 |
1990年 | 104篇 |
1989年 | 88篇 |
1988年 | 94篇 |
1987年 | 76篇 |
1986年 | 72篇 |
1985年 | 90篇 |
1984年 | 68篇 |
1983年 | 40篇 |
1982年 | 74篇 |
1981年 | 64篇 |
1980年 | 36篇 |
1979年 | 50篇 |
1978年 | 37篇 |
1977年 | 31篇 |
1976年 | 31篇 |
1973年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
92.
93.
Gd2O3:Eu纳米晶的制备及其光谱性质研究 总被引:5,自引:2,他引:3
以EDTA为络合剂,聚乙二醇为有机分散剂,用络合溶胶—凝胶法制备出Gd2O3:Eu纳米晶。用XRD,SEM,X—射线能量色散谱仪(EDS),荧光分光光度计等分析手段对Gd2O3:Eu的纳米晶结构、形貌、组分的均匀性以及发光特性进行了研究。结果表明:EDTA—M凝胶仅在800℃焙烧即可得到颗粒细小、组分均匀、纯立方相的Gd2O3:Eu纳米晶,颗粒基本呈球形,粒径为30nm左右。对样品的激发光谱、发射光谱测定表明:Gd2O3:Eu纳米晶在269nm光激发下发红光,发射光谱谱峰在611nm,与体材料基本相同;激发光谱中电荷迁移带(CTB)明显红移,从体材料的255nm移至269nm,移动了约14nm;猝灭浓度从体材料的6%提高到8%。 相似文献
94.
设{Xni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论. 相似文献
95.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
96.
Shui Cao ZHENG Huo Nan LIN Di He HU 《数学学报(英文版)》2005,21(5):1137-1148
In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф(r) = r^N-d/α (log log l/r)d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general (N, d, α) strictly stable processes. 相似文献
97.
In this paper, we study the linearization of the Cauchy problem and the mixed problem for the system of Grad--Hermite moments in nonequilibrium thermodynamics in the neighborhood of the equilibrium state. Stability conditions for solutions of the Cauchy problem are proved as a generalization of the classical Hermite--Biller theorem on stable polynomials. For the mixed problem, we prove an analog of the Vishik--Lyusternik theorem on small singular perturbations of general elliptic problems. The last observation allows us to introduce the Shapiro--Lopatinskii condition, which implies the well-posedness of the mixed problem. 相似文献
98.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献
99.
Manuel Ritoré Cé sar Rosales 《Transactions of the American Mathematical Society》2004,356(11):4601-4622
We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of the cone coincides with the one of the half-space. This allows us to give some criteria ensuring existence of isoperimetric regions: for instance, local convexity of the cone at some boundary point.
We also characterize which are the stable regions in a convex cone, i.e., second order minima of perimeter under a volume constraint. From this it follows that the isoperimetric regions in a convex cone are the euclidean balls centered at the vertex intersected with the cone.
100.
We present a general risk model where the aggregate claims, as well as the premium function, evolve by jumps. This is achieved by incorporating a Lévy process into the model. This seeks to account for the discrete nature of claims and asset prices. We give several explicit examples of Lévy processes that can be used to drive a risk model. This allows us to incorporate aggregate claims and premium fluctuations in the same process. We discuss important features of such processes and their relevance to risk modeling. We also extend classical results on ruin probabilities to this model. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献