全文获取类型
收费全文 | 3298篇 |
免费 | 248篇 |
国内免费 | 189篇 |
专业分类
化学 | 414篇 |
晶体学 | 9篇 |
力学 | 146篇 |
综合类 | 59篇 |
数学 | 2305篇 |
物理学 | 802篇 |
出版年
2024年 | 6篇 |
2023年 | 57篇 |
2022年 | 61篇 |
2021年 | 78篇 |
2020年 | 84篇 |
2019年 | 103篇 |
2018年 | 91篇 |
2017年 | 104篇 |
2016年 | 116篇 |
2015年 | 86篇 |
2014年 | 206篇 |
2013年 | 301篇 |
2012年 | 151篇 |
2011年 | 188篇 |
2010年 | 177篇 |
2009年 | 240篇 |
2008年 | 213篇 |
2007年 | 209篇 |
2006年 | 155篇 |
2005年 | 141篇 |
2004年 | 121篇 |
2003年 | 106篇 |
2002年 | 105篇 |
2001年 | 81篇 |
2000年 | 91篇 |
1999年 | 84篇 |
1998年 | 86篇 |
1997年 | 53篇 |
1996年 | 45篇 |
1995年 | 29篇 |
1994年 | 26篇 |
1993年 | 21篇 |
1992年 | 11篇 |
1991年 | 21篇 |
1990年 | 12篇 |
1989年 | 5篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 14篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1978年 | 2篇 |
1974年 | 1篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有3735条查询结果,搜索用时 15 毫秒
1.
2.
《Discrete Mathematics》2019,342(2):339-343
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. Let be a connected planar graph with girth and maximum degree . We show that either is isomorphic to a subgraph of a very special -regular graph with girth , or has a strong edge-coloring using at most colors. 相似文献
3.
WANG Zhong HONG Haitao XIAO Hai SUN Changku MENG Yan YE Shenghua 《Chinese Journal of Lasers》1997,6(5):435-440
1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe… 相似文献
4.
Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained. 相似文献
5.
We give necessary and sufficient conditions for an operator on a separable Hilbert space to satisfy the hypercyclicity criterion.
This paper is a part of the second author’s Doctoral thesis, written at Shiraz University under the direction of the first
author. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
On Best Approximations from RS-sets in Complex Banach Spaces 总被引:2,自引:0,他引:2
ChongLI 《数学学报(英文版)》2005,21(1):31-38
The concept of an RS-set in a complex Banach space is introduced and the problem of best approximation from an RS-set in a complex space is investigated. Results consisting of characterizations, uniqueness and strong uniqueness are established, 相似文献
9.
本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力.利用该算法在对模型的参数进行重估计时.涉及到复杂的目标函数的梯度运算.击运用矩阵运算使得梯度运算变得简单明了,因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明. 相似文献
10.
用于强磁场的快响应真空规的研制进展 总被引:2,自引:2,他引:0
研制了能在强磁场、强干扰环境下工作的快响应真空电离规(快规),用于对HL 2A装置偏滤器室和等离子体附近的中性粒子密度和通量进行原位测量。介绍了快规的结构、工作原理、设计要点以及实验结果。在无磁场的情况下,快规对气体压强的测量范围为6.4×10-6~0.15Pa,在1×10-5~0.15Pa范围内,快规收集极离子流与发射电子流之比与气压保持良好线性关系;在0 15T的磁场下,快规的规管常数未发生显著变化,在规管对称轴与磁力线的夹角小于15o时,规管常数的变化小于10%。 相似文献