全文获取类型
收费全文 | 13583篇 |
免费 | 427篇 |
国内免费 | 322篇 |
专业分类
化学 | 4244篇 |
晶体学 | 127篇 |
力学 | 192篇 |
综合类 | 35篇 |
数学 | 8113篇 |
物理学 | 1621篇 |
出版年
2023年 | 23篇 |
2022年 | 74篇 |
2021年 | 63篇 |
2020年 | 134篇 |
2019年 | 300篇 |
2018年 | 280篇 |
2017年 | 213篇 |
2016年 | 196篇 |
2015年 | 182篇 |
2014年 | 328篇 |
2013年 | 587篇 |
2012年 | 378篇 |
2011年 | 714篇 |
2010年 | 591篇 |
2009年 | 875篇 |
2008年 | 816篇 |
2007年 | 856篇 |
2006年 | 719篇 |
2005年 | 656篇 |
2004年 | 722篇 |
2003年 | 599篇 |
2002年 | 515篇 |
2001年 | 419篇 |
2000年 | 398篇 |
1999年 | 342篇 |
1998年 | 289篇 |
1997年 | 265篇 |
1996年 | 340篇 |
1995年 | 293篇 |
1994年 | 321篇 |
1993年 | 246篇 |
1992年 | 213篇 |
1991年 | 119篇 |
1990年 | 99篇 |
1989年 | 101篇 |
1988年 | 83篇 |
1987年 | 105篇 |
1986年 | 85篇 |
1985年 | 104篇 |
1984年 | 80篇 |
1983年 | 36篇 |
1982年 | 80篇 |
1981年 | 74篇 |
1980年 | 62篇 |
1979年 | 92篇 |
1978年 | 70篇 |
1977年 | 70篇 |
1976年 | 59篇 |
1974年 | 18篇 |
1973年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
4.
5.
G. Panina 《Central European Journal of Mathematics》2003,1(2):157-168
All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible
with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples
of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual
polytope. 相似文献
6.
非线性互补问题的一种全局收敛的显式光滑Newton方法 总被引:2,自引:0,他引:2
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。 相似文献
7.
8.
9.
In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived. 相似文献
10.
For z1,z2,z3∈Zn, the tristance d3(z1,z2,z3) is a generalization of the L1-distance on Zn to a quantity that reflects the relative dispersion of three points rather than two. A tristance anticodeAd of diameter d is a subset of Zn with the property that d3(z1,z2,z3)?d for all z1,z2,z3∈Ad. An anticode is optimal if it has the largest possible cardinality for its diameter d. We determine the cardinality and completely classify the optimal tristance anticodes in Z2 for all diameters d?1. We then generalize this result to two related distance models: a different distance structure on Z2 where d(z1,z2)=1 if z1,z2 are adjacent either horizontally, vertically, or diagonally, and the distance structure obtained when Z2 is replaced by the hexagonal lattice A2. We also investigate optimal tristance anticodes in Z3 and optimal quadristance anticodes in Z2, and provide bounds on their cardinality. We conclude with a brief discussion of the applications of our results to multi-dimensional interleaving schemes and to connectivity loci in the game of Go. 相似文献