全文获取类型
收费全文 | 21535篇 |
免费 | 1940篇 |
国内免费 | 1153篇 |
专业分类
化学 | 4389篇 |
晶体学 | 82篇 |
力学 | 7732篇 |
综合类 | 194篇 |
数学 | 6846篇 |
物理学 | 5385篇 |
出版年
2024年 | 20篇 |
2023年 | 210篇 |
2022年 | 405篇 |
2021年 | 470篇 |
2020年 | 610篇 |
2019年 | 502篇 |
2018年 | 527篇 |
2017年 | 577篇 |
2016年 | 641篇 |
2015年 | 612篇 |
2014年 | 843篇 |
2013年 | 1569篇 |
2012年 | 1062篇 |
2011年 | 1321篇 |
2010年 | 987篇 |
2009年 | 1349篇 |
2008年 | 1281篇 |
2007年 | 1282篇 |
2006年 | 1151篇 |
2005年 | 1011篇 |
2004年 | 953篇 |
2003年 | 847篇 |
2002年 | 742篇 |
2001年 | 587篇 |
2000年 | 600篇 |
1999年 | 521篇 |
1998年 | 548篇 |
1997年 | 490篇 |
1996年 | 432篇 |
1995年 | 342篇 |
1994年 | 304篇 |
1993年 | 275篇 |
1992年 | 263篇 |
1991年 | 211篇 |
1990年 | 175篇 |
1989年 | 142篇 |
1988年 | 133篇 |
1987年 | 92篇 |
1986年 | 89篇 |
1985年 | 97篇 |
1984年 | 93篇 |
1983年 | 43篇 |
1982年 | 86篇 |
1981年 | 32篇 |
1980年 | 21篇 |
1979年 | 17篇 |
1978年 | 19篇 |
1976年 | 7篇 |
1971年 | 6篇 |
1957年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性. 相似文献
92.
93.
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度. 相似文献
94.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
95.
We consider a multipath maximum flow problem introduced by Kishimoto (Networks 27(4)(1996)279-291). The focus is on efficient transformation from arc flows into multipath flows, where a multipath flow is a nonnegative combination of multipaths. A new algorithm that is more efficient than existing ones is proposed for the transformation. 相似文献
96.
Let E
n:y
2=x
3−n
2
x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups
associated with E
n
to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E
n.
2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90 相似文献
97.
98.
99.
We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel. 相似文献
100.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献