全文获取类型
收费全文 | 2310篇 |
免费 | 129篇 |
国内免费 | 76篇 |
专业分类
化学 | 327篇 |
力学 | 102篇 |
综合类 | 19篇 |
数学 | 1311篇 |
物理学 | 756篇 |
出版年
2023年 | 22篇 |
2022年 | 60篇 |
2021年 | 88篇 |
2020年 | 56篇 |
2019年 | 45篇 |
2018年 | 41篇 |
2017年 | 36篇 |
2016年 | 67篇 |
2015年 | 53篇 |
2014年 | 83篇 |
2013年 | 155篇 |
2012年 | 90篇 |
2011年 | 124篇 |
2010年 | 96篇 |
2009年 | 171篇 |
2008年 | 158篇 |
2007年 | 158篇 |
2006年 | 114篇 |
2005年 | 103篇 |
2004年 | 81篇 |
2003年 | 74篇 |
2002年 | 65篇 |
2001年 | 58篇 |
2000年 | 81篇 |
1999年 | 55篇 |
1998年 | 72篇 |
1997年 | 44篇 |
1996年 | 36篇 |
1995年 | 23篇 |
1994年 | 34篇 |
1993年 | 20篇 |
1992年 | 13篇 |
1991年 | 14篇 |
1990年 | 11篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 17篇 |
1986年 | 14篇 |
1985年 | 16篇 |
1984年 | 10篇 |
1982年 | 8篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有2515条查询结果,搜索用时 15 毫秒
991.
Gregory L. McColm 《Mathematical Logic Quarterly》1992,38(1):293-298
It is known that for two given countable sets of unary relations A and B on ω there exists an infinite set H ? ω on which A and B are the same. This result can be used to generate counterexamples in expressibility theory. We examine the sharpness of this result. 相似文献
992.
对于一类非单调线性互补问题提出了一个新算法:高阶Dikin型仿射尺度算法,算法的每步迭代.基于线性规划Dikin原始-对偶算法思想来求解一个线性方程组得到迭代方向,再适当选取步长,得到了算法的多项式复杂性。 相似文献
993.
谱绝对值均匀的前馈流密码的线性复杂度的稳定性研究 总被引:2,自引:0,他引:2
本文提出了一种前馈流密码纵向信息泄漏的收集方法,并在此基础上深入地研究了上人有谱绝对值均匀质非线性滤波函数的前馈密码的线性得和杂度稳定性问题。 相似文献
994.
This paper discusses the topic of model selection for finite-dimensional normal regression models. We compare model selection criteria according to prediction errors based upon prediction with refitting, and prediction without refitting. We provide a new lower bound for prediction without refitting, while a lower bound for prediction with refitting was given by Rissanen. Moreover, we specify a set of sufficient conditions for a model selection criterion to achieve these bounds. Then the achievability of the two bounds by the following selection rules are addressed: Rissanen's accumulated prediction error criterion (APE), his stochastic complexity criterion, AIC, BIC and the FPE criteria. In particular, we provide upper bounds on overfitting and underfitting probabilities needed for the achievability. Finally, we offer a brief discussion on the issue of finite-dimensional vs. infinite-dimensional model assumptions.Support from the National Science Foundation, grant DMS 8802378 and support from ARO, grant DAAL03-91-G-007 to B. Yu during the revision are gratefully acknowledged. 相似文献
995.
控制犯两类错误后验概率的统计试验方案设计 总被引:1,自引:0,他引:1
本文用BAYES理论提出了通过控制犯两类错误后验概率来设计试验方案的一种新方法,与以往的方法比较,该方法利用先验分布的信息减少了样本的容量。 相似文献
996.
本文对某一综合性教学医院1982~1991年住院病人进行疾病顺位动态分析与预测.结果表明:①肿瘤、消化、呼吸系统疾病顺位居高不下;②传染病、神经系统和感觉器官疾病顺位逐年下降;③循环、泌尿生殖系统疾病顺位有上升趋势 对疾病变化因素和统计预测进行了讨论. 相似文献
997.
W. P. Baritompa Zhang Baoping R. H. Mladineo G. R. Wood Z. B. Zabinsky 《Journal of Global Optimization》1995,7(1):93-110
The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged. 相似文献
998.
Maurice Tchuente 《Mathematical Social Sciences》1985,9(1):77-82
We are interested in the minimum time T(S) necessary for computing a family S = { < Si, Sj >: ? Si, Sj?Rp, (i, j) ?E } of inner products of order p, on a systolic array of order p × 2. We first prove that the determination of T(S) is equivalent to the partition problem and is thus NP-complete. Then we show that the designing of an algorithm which runs in time T(S) + 1 is equivalent to the problem of finding an undirected bipartite eulerian multigraph with the smallest number of edges, which contains a given undirected bipartite graph, and can therefore be solved in polynomial time. 相似文献
999.
Hiroshi Konno Takahito Kuno Yasutoshi Yajima 《Computational Optimization and Applications》1992,1(2):227-239
We will show that the average number of steps of parametric simplex algorithms for obtaining global minima of rank-one and rank-two bilinear-programming problems are lower-order polynomial functions of the problem size under the standard assumptions on the distribution of the data imposed in the probabilistic analysis of the simplex method. This means that there exist algorithms for some special class of NP-complete problems, whose average number of arithmetics are polynomial order of the problem size. 相似文献
1000.
A phenomenological model is presented to describe weakly charged polymer gels based on the classical elasticity theory. The
structure factor of the gel is calculated considering both thermal and frozen concentration fluctuations as well as the screened
Coulomb interaction. In agreement with the recent experimental finding the result shows anomalous crosslink-density dependence
of the scattering profiles.
Received: 28 March 1997 / Revised: 4 September 1997 / Accepted: 23 October 1997 相似文献