全文获取类型
收费全文 | 2795篇 |
免费 | 264篇 |
国内免费 | 176篇 |
专业分类
化学 | 384篇 |
晶体学 | 1篇 |
力学 | 58篇 |
综合类 | 209篇 |
数学 | 1900篇 |
物理学 | 683篇 |
出版年
2024年 | 6篇 |
2023年 | 36篇 |
2022年 | 77篇 |
2021年 | 77篇 |
2020年 | 78篇 |
2019年 | 99篇 |
2018年 | 70篇 |
2017年 | 80篇 |
2016年 | 84篇 |
2015年 | 68篇 |
2014年 | 116篇 |
2013年 | 175篇 |
2012年 | 87篇 |
2011年 | 128篇 |
2010年 | 143篇 |
2009年 | 181篇 |
2008年 | 187篇 |
2007年 | 192篇 |
2006年 | 177篇 |
2005年 | 125篇 |
2004年 | 120篇 |
2003年 | 125篇 |
2002年 | 109篇 |
2001年 | 89篇 |
2000年 | 75篇 |
1999年 | 72篇 |
1998年 | 67篇 |
1997年 | 43篇 |
1996年 | 53篇 |
1995年 | 65篇 |
1994年 | 37篇 |
1993年 | 33篇 |
1992年 | 22篇 |
1991年 | 18篇 |
1990年 | 19篇 |
1989年 | 17篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 13篇 |
1985年 | 10篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有3235条查询结果,搜索用时 250 毫秒
1.
2.
Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date. 相似文献
3.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
4.
It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
5.
一阶形式系统K~*及其完备性 总被引:2,自引:0,他引:2
裴道武 《数学年刊A辑(中文版)》2002,(6)
模糊命题演算的形式系统L*已经在模糊逻辑与模糊推理的结合研究中得到了成功的应用.本文考虑与系统L*相应的一阶逻辑理论,建立了一阶形式系统K*,并证明了这个系统的完备性. 相似文献
6.
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. 相似文献
7.
8.
9.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
10.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献