全文获取类型
收费全文 | 10397篇 |
免费 | 947篇 |
国内免费 | 722篇 |
专业分类
化学 | 556篇 |
晶体学 | 46篇 |
力学 | 482篇 |
综合类 | 108篇 |
数学 | 1660篇 |
物理学 | 1926篇 |
综合类 | 7288篇 |
出版年
2024年 | 39篇 |
2023年 | 107篇 |
2022年 | 178篇 |
2021年 | 195篇 |
2020年 | 174篇 |
2019年 | 179篇 |
2018年 | 234篇 |
2017年 | 301篇 |
2016年 | 312篇 |
2015年 | 327篇 |
2014年 | 538篇 |
2013年 | 459篇 |
2012年 | 562篇 |
2011年 | 608篇 |
2010年 | 496篇 |
2009年 | 618篇 |
2008年 | 697篇 |
2007年 | 851篇 |
2006年 | 716篇 |
2005年 | 625篇 |
2004年 | 518篇 |
2003年 | 453篇 |
2002年 | 385篇 |
2001年 | 365篇 |
2000年 | 306篇 |
1999年 | 243篇 |
1998年 | 213篇 |
1997年 | 220篇 |
1996年 | 194篇 |
1995年 | 153篇 |
1994年 | 138篇 |
1993年 | 117篇 |
1992年 | 100篇 |
1991年 | 74篇 |
1990年 | 82篇 |
1989年 | 64篇 |
1988年 | 77篇 |
1987年 | 40篇 |
1986年 | 17篇 |
1985年 | 16篇 |
1984年 | 20篇 |
1983年 | 9篇 |
1982年 | 4篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 4篇 |
1974年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
文章用特征线法给出一类仓库货物储存模型解的递推表达式,并证明其光滑性从而得到了经典解的存在唯一性。 相似文献
22.
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog2n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m3logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found. 相似文献
23.
We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m2+loglogσ)logσ) in the best case and O((m2+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force. 相似文献
24.
The influence of the parameter of amplitude-phase coupling for nonlinear amplification on the phase-frequency characteristics of an injection laser in the regime of pumping current modulation has been investigated theoretically. The parameter is defined as the coefficient of proportionality between changes in the real and imaginary parts of the refractive index during variation of the density of photons in the cavity. The substantial dependence of the coefficient of phase modulation on the parameter of the amplitude-phase coupling for nonlinear amplification at small modulation frequencies is shown. A technique to determine the indicated parameter based on the frequency dependence of the ratio between the coefficients of phase and amplitude modulation is suggested. 相似文献
25.
Howard Jacobowitz Gerardo Mendoza 《Transactions of the American Mathematical Society》2003,355(10):4201-4222
We study embeddings of complex vector bundles, especially line bundles, in the complexification of the tangent bundle of a manifold. The aim is to understand implications of properties of interest in partial differential equations.
26.
Bi12TiO20纳米粉体的制备及其光吸收特性研究 总被引:3,自引:0,他引:3
以钛酸四丁酯和硝酸铋为原料 ,利用化学溶液分解法制备了Bi12 TiO2 0 纳米多晶粉体 .采用XRD和TEM对其结构和形貌进行了表征 .结合热重 差热 (TG DTA)分析 ,探讨了Bi12 TiO2 0 晶相的形成机理 .通过UV Vis漫反射谱的测定 ,研究了Bi12 TiO2 0 纳米晶粉体的光吸收特性 .结果显示 ,从组成为化学计量比的前驱液中可以很容易制得纯Bi12 TiO2 0 纳米晶粉体 ,该Bi12 TiO2 0 纳米晶粉体呈现了在很宽的波长范围内 (5 6 0~ 385nm )对光的吸收的特性 . 相似文献
27.
YunFei Liu ShengCai Shi ShengLin Yu 《International Journal of Infrared and Millimeter Waves》2003,24(12):2069-2077
When electromagnetic waves propagate through a wire grid, there will be some evanescent space harmonics generated around the wire grid. In this paper, we mainly investigate their effects on the transmission characteristics of a Gaussian beam by cylindrical wire grids. The results are compared with those without taking account of evanescent space-harmonics. 相似文献
28.
29.
Kosniowski-Stong公式是近年来带对合协边领域的一个较重要的结果,它来源于Atiyah与Singer在指标定理方面的工作。此公式现有2种证明方法,其中属于带对合协边理论的是一种验算性质的证明。现利用带对合协边理论基本定理直接导出了此公式,由此可看出这2个重要结果是紧密相连的。 相似文献
30.
Semyon Alesker 《Geometric And Functional Analysis》2007,17(4):1321-1341
This is a non-technical survey of a recent theory of valuations on manifolds constructed in [A10], [A11], [AF] and [A12],
and actually a guide to this series of articles. We also review some recent related results obtained by a number of people.
Received: February 2006, Revision: June 2006, Accepted: June 2006 相似文献