全文获取类型
收费全文 | 1638篇 |
免费 | 296篇 |
国内免费 | 75篇 |
专业分类
化学 | 157篇 |
晶体学 | 20篇 |
力学 | 189篇 |
综合类 | 56篇 |
数学 | 735篇 |
物理学 | 852篇 |
出版年
2024年 | 3篇 |
2023年 | 21篇 |
2022年 | 59篇 |
2021年 | 54篇 |
2020年 | 45篇 |
2019年 | 53篇 |
2018年 | 44篇 |
2017年 | 80篇 |
2016年 | 81篇 |
2015年 | 64篇 |
2014年 | 127篇 |
2013年 | 98篇 |
2012年 | 74篇 |
2011年 | 102篇 |
2010年 | 92篇 |
2009年 | 116篇 |
2008年 | 125篇 |
2007年 | 119篇 |
2006年 | 94篇 |
2005年 | 90篇 |
2004年 | 69篇 |
2003年 | 59篇 |
2002年 | 44篇 |
2001年 | 49篇 |
2000年 | 40篇 |
1999年 | 26篇 |
1998年 | 29篇 |
1997年 | 23篇 |
1996年 | 24篇 |
1995年 | 20篇 |
1994年 | 10篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 8篇 |
1989年 | 3篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 10篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
排序方式: 共有2009条查询结果,搜索用时 46 毫秒
1.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
2.
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. 相似文献
3.
M. Akbari A. Behzadmehr F. Shahraki 《International Journal of Heat and Fluid Flow》2008,29(2):545-556
Fully developed laminar mixed convection of a nanofluid consists of water and Al2O3 in horizontal and inclined tubes has been studied numerically. Three-dimensional elliptic governing equations have been solved to investigate the flow behaviors over a wide range of the Grashof and Reynolds numbers. Comparisons with previously published experimental and numerical works on mixed convection in a horizontal and inclined tube are performed and good agreements between the results are observed. Effects of nanoparticles concentration and tube inclinations on the hydrodynamics and thermal parameters are presented and discussed. It is shown that the nanoparticles concentration does not have significant effects on the hydrodynamics parameters. Heat transfer coefficient increases by 15% at 4 Vol.% Al2O3. Skin friction coefficient continually increases with the tube inclination, but the heat transfer coefficient reaches a maximum at the inclination angle of 45°. 相似文献
4.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
5.
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 相似文献
6.
全固态多波长飞秒脉冲激光系统 总被引:1,自引:1,他引:0
利用棱镜对引进频谱空间啁啾来补偿飞秒脉冲激光二次谐波产生中的相位失配,提高了倍频效率建立了一套全固态、多波长(1065nm, 532nm,823.1nm, 402nm)飞秒脉冲激光系统自制的Nd:YVO4激光器输出532nm绿光激光,最高平均功率可达5.6W当用2.5W绿光激光泵浦时,从自制的钛宝石激光器及经BBO倍频可分别输出中心波长为823.1nm和402nm,平均功率300mW和73mW,谱宽32.3nm和5.1nm,脉宽22fs和33.3fs、重复率108MHz的近红外和蓝光激光整个系统具有结构紧凑、倍频效率高、运行稳定的特点. 相似文献
7.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
8.
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. 相似文献
9.
A horizontal translation of a function is the focus of this study. We examine the explanations provided by secondary school students and secondary school teachers to a translation of a function, focusing on the example of the parabola y=(x−3)2 and its relationship to y=x2. The participants’ explanations focused on attending to patterns, locating the zero of the function, and the point-wise calculation of function values. The results confirm that the horizontal shift of the parabola is, at least initially, inconsistent with expectations and counterintuitive to most participants. We articulate possible sources of this perceived inconsistency and describe a pedagogical approach aimed at resolving it. 相似文献
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. 相似文献