全文获取类型
收费全文 | 2591篇 |
免费 | 322篇 |
国内免费 | 129篇 |
专业分类
化学 | 376篇 |
晶体学 | 18篇 |
力学 | 167篇 |
综合类 | 58篇 |
数学 | 1402篇 |
物理学 | 1021篇 |
出版年
2024年 | 3篇 |
2023年 | 37篇 |
2022年 | 74篇 |
2021年 | 64篇 |
2020年 | 55篇 |
2019年 | 69篇 |
2018年 | 72篇 |
2017年 | 101篇 |
2016年 | 113篇 |
2015年 | 81篇 |
2014年 | 183篇 |
2013年 | 188篇 |
2012年 | 105篇 |
2011年 | 182篇 |
2010年 | 139篇 |
2009年 | 189篇 |
2008年 | 179篇 |
2007年 | 189篇 |
2006年 | 148篇 |
2005年 | 145篇 |
2004年 | 103篇 |
2003年 | 91篇 |
2002年 | 69篇 |
2001年 | 69篇 |
2000年 | 55篇 |
1999年 | 58篇 |
1998年 | 46篇 |
1997年 | 35篇 |
1996年 | 45篇 |
1995年 | 30篇 |
1994年 | 21篇 |
1993年 | 18篇 |
1992年 | 13篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 14篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有3042条查询结果,搜索用时 31 毫秒
1.
2.
G. Dattoli 《Journal of Mathematical Analysis and Applications》2002,269(2):716-725
Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here. 相似文献
3.
Heikki Hyyr 《Journal of Discrete Algorithms》2005,3(2-4):215-229
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms. 相似文献
4.
Constructive Approximation - Let E = [–1, α] \cup [β, 1], –1 &;lt; α &;lt; β &;lt; 1, and let (pn) be orthogonal on E with respect to the weight function... 相似文献
5.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
6.
For a graph G and a positive integer m, G(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m2 edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G(2) does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G(2) does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003 相似文献
7.
混合位级正交试验设计的极差分析方法 总被引:3,自引:0,他引:3
本文指出,在混合位级的正交试验设计中,以往的极差分析方法存在着不足。本文给出了极差的修正方法,并用大量实例做了数值验证,说明这个修正确实很有效 相似文献
8.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献
9.
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. 相似文献
10.
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. 相似文献