全文获取类型
收费全文 | 3479篇 |
免费 | 384篇 |
国内免费 | 397篇 |
专业分类
化学 | 663篇 |
晶体学 | 5篇 |
力学 | 189篇 |
综合类 | 104篇 |
数学 | 2493篇 |
物理学 | 806篇 |
出版年
2024年 | 7篇 |
2023年 | 27篇 |
2022年 | 55篇 |
2021年 | 70篇 |
2020年 | 69篇 |
2019年 | 87篇 |
2018年 | 92篇 |
2017年 | 96篇 |
2016年 | 105篇 |
2015年 | 81篇 |
2014年 | 128篇 |
2013年 | 292篇 |
2012年 | 140篇 |
2011年 | 155篇 |
2010年 | 162篇 |
2009年 | 169篇 |
2008年 | 225篇 |
2007年 | 233篇 |
2006年 | 203篇 |
2005年 | 187篇 |
2004年 | 157篇 |
2003年 | 164篇 |
2002年 | 490篇 |
2001年 | 140篇 |
2000年 | 127篇 |
1999年 | 130篇 |
1998年 | 75篇 |
1997年 | 73篇 |
1996年 | 71篇 |
1995年 | 48篇 |
1994年 | 28篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 21篇 |
1990年 | 14篇 |
1989年 | 13篇 |
1988年 | 5篇 |
1987年 | 9篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1971年 | 12篇 |
1970年 | 8篇 |
1936年 | 2篇 |
排序方式: 共有4260条查询结果,搜索用时 15 毫秒
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.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
4.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
5.
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 相似文献
6.
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.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
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. 相似文献