全文获取类型
收费全文 | 943篇 |
免费 | 73篇 |
国内免费 | 109篇 |
专业分类
化学 | 38篇 |
晶体学 | 2篇 |
力学 | 50篇 |
综合类 | 30篇 |
数学 | 845篇 |
物理学 | 160篇 |
出版年
2024年 | 8篇 |
2023年 | 12篇 |
2022年 | 19篇 |
2021年 | 23篇 |
2020年 | 30篇 |
2019年 | 36篇 |
2018年 | 32篇 |
2017年 | 36篇 |
2016年 | 30篇 |
2015年 | 24篇 |
2014年 | 36篇 |
2013年 | 71篇 |
2012年 | 43篇 |
2011年 | 61篇 |
2010年 | 60篇 |
2009年 | 63篇 |
2008年 | 77篇 |
2007年 | 55篇 |
2006年 | 71篇 |
2005年 | 43篇 |
2004年 | 33篇 |
2003年 | 37篇 |
2002年 | 44篇 |
2001年 | 22篇 |
2000年 | 27篇 |
1999年 | 21篇 |
1998年 | 24篇 |
1997年 | 19篇 |
1996年 | 12篇 |
1995年 | 15篇 |
1994年 | 8篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 8篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 4篇 |
1959年 | 1篇 |
排序方式: 共有1125条查询结果,搜索用时 93 毫秒
61.
Elvan Ceyhan 《Discrete Mathematics》2008,308(23):5376-5393
For two or more classes of points in Rd with d≥1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from one or all of the other classes. The CCCDs were introduced by Priebe et al. [C.E. Priebe, J.G. DeVinney, D.J. Marchette, On the distribution of the domination number of random class catch cover digraphs. Statistics and Probability Letters 55 (2001) 239-246] who investigated the case of two classes, X and Y. They calculated the exact (i.e., finite sample) distribution of the domination number of the CCCDs based on X points relative to Y points both of which were uniformly distributed on a bounded interval. We investigate the distribution of the domination number of the CCCDs based on data from non-uniform X points on an interval with end points from Y. Then we extend these calculations for multiple Y points on bounded intervals. 相似文献
62.
63.
Jan Stevens 《Mathematische Nachrichten》2009,282(8):1195-1215
We give explicit examples of Gorenstein surface singularities with integral homology sphere link, which are not complete intersections. Their existence was shown by Luengo–Velasco, Melle–Hernández and Némethi, thereby providing counterexamples to the universal abelian covering conjecture of Neumann and Wahl (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
64.
徐新萍 《数学的实践与认识》2009,39(10)
设G是一个图,G的部分平方图G*满足V(G*)=V(G),E(G*)=E(G)∪{uv:uv■E(G),且J(u,v)≠■},这里J(u,v)={w∈N(u)∩N(v):N(w)■N[u]∪N[v]}.利用插点方法,证明了如下结果:设G是k-连通图(k2),b是整数,0min {k,(2b-1+k)/2}(n(Y)-1),则G是哈密尔顿图.同时给出图是1-哈密尔顿的和哈密尔顿连通的相关结果. 相似文献
65.
In this paper, we define a P-twisted affine Lie algebra, and construct its realizations by twisted vertex operators. 相似文献
66.
Minimum weight edge covering problem, known as a classic problem in graph theory, is employed in many scientific and engineering applications. In the applications, the weight may denote cost, time, or opponent’s payoff, which can be vague in practice. This paper considers the edge covering problem under fuzzy environment, and formulates three models which are expected minimum weight edge cover model, α-minimum weight edge cover model, and the most minimum weight edge cover model. As an extension for the models, we respectively introduce the crisp equivalent of each model in the case that the weights are independent trapezoidal fuzzy variables. Due to the complexity of the problem, a hybrid intelligent algorithm is employed to solve the models, which can deal with the problem with any type of fuzzy weights. At last, some numerical experiments are given to show the application of the models and the robustness of the algorithm. 相似文献
67.
Miroslav Chlebík 《Discrete Applied Mathematics》2008,156(3):292-312
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG’03), Lecture notes in computer science, vol. 2880, 2003, pp. 1-12, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62-69]. We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so-called strong crown reductions, suitable for finding (or counting) all minimum vertex covers, or finding a minimum vertex cover under some additional constraints. It is described how crown decompositions and strong crown decompositions suitable for such problems can be computed in polynomial time. For weighted König-Egerváry graphs (G,w) we observe that the set of vertices belonging to all minimum vertex covers, and the set of vertices belonging to no minimum vertex covers, can be efficiently computed.Further, for some specific classes of graphs, simple algorithms for the MIN-VC problem with a constant approximation factor r<2 are provided. On the other hand, we conclude that for the regular graphs, or for the Hamiltonian connected graphs, the problem is as hard to approximate as for general graphs.It is demonstrated how the results about strong crown reductions can be used to achieve a linear size problem kernel for some related vertex cover problems. 相似文献
68.
给出了罗尔微分中值定理的三种新的证明方法,其中第二种很简便的方法仅依赖于大家熟知的Heine-Borel有限覆盖定理.由此可见罗尔微分中值定理可以是实数的完备性的直接推论. 相似文献
69.
作物残茬覆盖度遥感监测研究进展 总被引:2,自引:0,他引:2
作物残茬作为农田生态系统的重要组成部分,影响着农田生态系统中的营养物质、碳、水和能量的流动与循环。作物残茬覆盖度作为描述作物残茬数量和分布的重要指标,对于农田生态系统C循环和全球气候变化均有实际意义,具备重要的定量监测价值。遥感技术具有准确、经济、快速大面积监测的能力,因此利用遥感监测区域尺度的作物残茬覆盖度,受到国内外学者的关注。工作回顾总结了目前利用遥感监测作物残茬覆盖度的主要方法和最新研究进展,并根据基本方法的差异以及数据源的不同,从五个类别分别介绍了遥感监测原理与技术革新,对每一类方法的优点和缺陷进行分析,并提出了相应的改进措施。最后对作物残茬覆盖度遥感监测方法的发展趋势进行了展望。 相似文献
70.