全文获取类型
收费全文 | 4947篇 |
免费 | 854篇 |
国内免费 | 477篇 |
专业分类
化学 | 712篇 |
晶体学 | 25篇 |
力学 | 348篇 |
综合类 | 163篇 |
数学 | 2891篇 |
物理学 | 2139篇 |
出版年
2024年 | 10篇 |
2023年 | 52篇 |
2022年 | 135篇 |
2021年 | 125篇 |
2020年 | 141篇 |
2019年 | 149篇 |
2018年 | 150篇 |
2017年 | 208篇 |
2016年 | 215篇 |
2015年 | 173篇 |
2014年 | 291篇 |
2013年 | 415篇 |
2012年 | 261篇 |
2011年 | 309篇 |
2010年 | 275篇 |
2009年 | 295篇 |
2008年 | 332篇 |
2007年 | 350篇 |
2006年 | 312篇 |
2005年 | 293篇 |
2004年 | 216篇 |
2003年 | 214篇 |
2002年 | 193篇 |
2001年 | 170篇 |
2000年 | 179篇 |
1999年 | 159篇 |
1998年 | 107篇 |
1997年 | 99篇 |
1996年 | 93篇 |
1995年 | 68篇 |
1994年 | 38篇 |
1993年 | 36篇 |
1992年 | 31篇 |
1991年 | 28篇 |
1990年 | 27篇 |
1989年 | 22篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 9篇 |
1981年 | 10篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1936年 | 2篇 |
排序方式: 共有6278条查询结果,搜索用时 16 毫秒
1.
2.
Chi-Kwong Li Ming-Cheng Tsai Ya-Shu Wang Ngai-Ching Wong 《Journal of Mathematical Analysis and Applications》2022,505(2):125522
Let L be an additive map between (real or complex) matrix algebras sending Hermitian idempotent matrices to Hermitian idempotent matrices. We show that there are nonnegative integers with and an unitary matrix U such that We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism. 相似文献
3.
4.
As borders between different entities, lines are an important element of natural images. Indeed, the neurons of the mammalian
visual cortex are tuned to respond best to lines of a given orientation. This preferred orientation varies continuously across
most of the cortex, but also has vortex-like singularities known as pinwheels. In attempting to describe such patterns of
orientation preference, we are led to consider underlying rotation symmetries: Oriented segments in natural images tend to
be collinear; neurons are more likely to be connected if their preferred orientations are aligned to their topographic separation.
These are indications of a reduced symmetry requiring joint rotations of both orientation preference and the underlying topography.
This is verified by direct statistical tests in both natural images and in cortical maps. Using the statistics of natural
scenes we construct filters that are best suited to extracting information from such images, and find qualitative similarities
to mammalian vision.
PACS84.35+i 89.70.+c 87.57.Nk 相似文献
5.
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.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
8.
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. 相似文献
9.
Yan WANG Rong Quan FENG 《数学学报(英文版)》2005,21(4):773-778
A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified. 相似文献
10.
Mats Gyllenberg 《Journal of Differential Equations》2004,205(1):50-76
For time-periodic dissipative and irreducible type-K competitive Kolmogorov systems, it is proved that there is a canonically defined countable family F of unordered, disjoint invariant sets with the property that, for every persistent trajectory whose ω-limit set is not a cycle, there exists a unique trajectory in some element of F such that these two trajectories are asymptotic and the corresponding points in these two trajectories are K-related. 相似文献