全文获取类型
收费全文 | 30495篇 |
免费 | 3634篇 |
国内免费 | 3183篇 |
专业分类
化学 | 21650篇 |
晶体学 | 380篇 |
力学 | 1501篇 |
综合类 | 238篇 |
数学 | 3634篇 |
物理学 | 9909篇 |
出版年
2024年 | 229篇 |
2023年 | 513篇 |
2022年 | 885篇 |
2021年 | 1043篇 |
2020年 | 1101篇 |
2019年 | 1138篇 |
2018年 | 826篇 |
2017年 | 791篇 |
2016年 | 1191篇 |
2015年 | 1191篇 |
2014年 | 1415篇 |
2013年 | 1979篇 |
2012年 | 2337篇 |
2011年 | 2532篇 |
2010年 | 1792篇 |
2009年 | 1754篇 |
2008年 | 1965篇 |
2007年 | 1783篇 |
2006年 | 1605篇 |
2005年 | 1411篇 |
2004年 | 1133篇 |
2003年 | 913篇 |
2002年 | 887篇 |
2001年 | 744篇 |
2000年 | 623篇 |
1999年 | 583篇 |
1998年 | 510篇 |
1997年 | 445篇 |
1996年 | 477篇 |
1995年 | 387篇 |
1994年 | 375篇 |
1993年 | 346篇 |
1992年 | 326篇 |
1991年 | 278篇 |
1990年 | 238篇 |
1989年 | 198篇 |
1988年 | 171篇 |
1987年 | 135篇 |
1986年 | 149篇 |
1985年 | 163篇 |
1984年 | 110篇 |
1983年 | 67篇 |
1982年 | 75篇 |
1981年 | 56篇 |
1980年 | 53篇 |
1979年 | 59篇 |
1978年 | 41篇 |
1976年 | 37篇 |
1974年 | 40篇 |
1973年 | 45篇 |
排序方式: 共有10000条查询结果,搜索用时 4 毫秒
961.
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v∈V(G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively. 相似文献
962.
In this short paper, a bivariate optimal replacement policy for a repairable system with a geometric process maintenance model is discussed. Zhang [Zhang, Y.L., 1994. A bivariate optimal replacement policy for a repairable system. Journal of Applied Probability 31, 1123–1127] and Sheu [Sheu, S.H., 1999. Extended optimal replacement model for deteriorating systems. European Journal of Operational Research 112, 503–516] obtained different expression of the long-run average cost per unit time (i.e. average cost rate) of the system respectively. We show that both of their results are correct, therefore, Sheu’s comment (1999) on the result of Zhang (1994) is wrong. 相似文献
963.
本文就G为幂零群或G可写成两个子群之直和的情形,给G的Davenport常数D(G)一些非平凡的估计. 相似文献
964.
965.
本文是在求解大型线性方程组Ax=b的系数矩阵A为(1,1)相容次序矩阵且其Jacobi迭代矩阵的特征值均为纯虚数或零的条件下,得到PSD迭代法收敛的充分必要性定理,并在特殊情况下得到了相应的最优参数. 相似文献
966.
Ping Lin 《高等学校计算数学学报(英文版)》2008,1(2)
This special issue of the journal Numerical Mathe-matics: Theory, Methods and Applications is dedicated to Professor Yucheng Su of Nanjing University (China) on the occasion of his eightieth birthday. It consists of eight papers covering computational methods of partial differential equations, where most of the equations are singularly perturbed. 相似文献
967.
Robust output feedback stabilization for two-dimensional continuous systems in roesser form 总被引:1,自引:0,他引:1
James Lam Shengyuan Xu Yun Zou Zhiping Lin K. Galkowski 《Applied Mathematics Letters》2004,17(12):81-1341
This paper considers the problem of robust stabilization via dynamic output feedbackcontrollers for uncertain two-dimensional continuous systems described by the Roesser's state space model. The parameter uncertainties are assumed to be norm-bounded appearing in all the matrices of the system model. A sufficient condition for the existence of dynamic output feedback controllers guaranteeing the asymptotic stability of the closed-loop system for all admissible uncertainties is proposed. A desired dynamic output feedback controller can be constructed by solving a set of linear matrix inequalities. Finally, an illustrative example is provided to demonstrate the applicability and effectiveness of the proposed method. 相似文献
968.
Yong-Kab Choi Kyo-Shin Hwang Tae-Sung Kim Zhengyan Wensheng Lin Wang 《Acta Mathematica Hungarica》2004,103(1-2):43-54
We establish some large increment results for partial sum processes of a dependent stationary Gaussian sequence via estimating upper bounds of large deviation probabilities on suprema of the Gaussian sequence. 相似文献
969.
Shyong Jian Shyu Peng-Yeng Yin Bertrand M.T. Lin 《Annals of Operations Research》2004,131(1-4):283-304
Given an undirected graph and a weighting function defined on the vertex set, the minimum weight vertex cover problem is to find a vertex subset whose total weight is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we introduce a meta-heuristic based upon the Ant Colony Optimization (ACO) approach, to find approximate solutions to the minimum weight vertex cover problem. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. A solution to the minimum weight vertex cover problem however needs not to constitute a path. The ACO algorithm proposed in this paper incorporates several new features so as to select vertices out of the vertex set whereas the total weight can be minimized as much as possible. Computational experiments are designed and conducted to study the performance of our proposed approach. Numerical results evince that the ACO algorithm demonstrates significant effectiveness and robustness in solving the minimum weight vertex cover problem. 相似文献
970.
本试验对抗坏血酸稀土对鱼类的急性毒性进行了研究。结果表明:抗坏血酸稀土对鲢鱼、草鱼、金鱼和泥鳅的96hrTLm值为50.14~495.27mg/l。根据鱼类急性毒性毒物的分级暂定标准,抗坏血酸稀土对鱼类属低毒物质。 相似文献