全文获取类型
收费全文 | 399208篇 |
免费 | 26251篇 |
国内免费 | 17727篇 |
专业分类
化学 | 217202篇 |
晶体学 | 5881篇 |
力学 | 21105篇 |
综合类 | 37篇 |
数学 | 45927篇 |
物理学 | 153034篇 |
出版年
2021年 | 3391篇 |
2020年 | 3848篇 |
2019年 | 4932篇 |
2018年 | 6209篇 |
2017年 | 6815篇 |
2016年 | 9031篇 |
2015年 | 6027篇 |
2014年 | 8504篇 |
2013年 | 18238篇 |
2012年 | 15199篇 |
2011年 | 18899篇 |
2010年 | 17582篇 |
2009年 | 17933篇 |
2008年 | 15797篇 |
2007年 | 15277篇 |
2006年 | 13910篇 |
2005年 | 13066篇 |
2004年 | 13108篇 |
2003年 | 11343篇 |
2002年 | 11230篇 |
2001年 | 12045篇 |
2000年 | 9151篇 |
1999年 | 7729篇 |
1998年 | 6613篇 |
1997年 | 6435篇 |
1996年 | 6375篇 |
1995年 | 6284篇 |
1994年 | 6461篇 |
1993年 | 6348篇 |
1992年 | 6429篇 |
1991年 | 6290篇 |
1990年 | 5713篇 |
1989年 | 5844篇 |
1988年 | 5697篇 |
1987年 | 5031篇 |
1986年 | 4809篇 |
1985年 | 5699篇 |
1984年 | 5966篇 |
1983年 | 4638篇 |
1982年 | 5151篇 |
1981年 | 4893篇 |
1980年 | 4611篇 |
1979年 | 4855篇 |
1978年 | 5053篇 |
1977年 | 5125篇 |
1976年 | 5434篇 |
1975年 | 4571篇 |
1974年 | 4561篇 |
1973年 | 4806篇 |
1972年 | 3623篇 |
排序方式: 共有10000条查询结果,搜索用时 421 毫秒
911.
912.
W Y Hung S Kucherenko N J Samsatli N Shah 《The Journal of the Operational Research Society》2004,55(8):801-813
In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies. 相似文献
913.
In the data envelopment analysis (DEA) efficiency literature, qualitative characterizations of returns to scale (increasing, constant, or decreasing) are most common. In economics it is standard to use the scale elasticity as a quantification of scale properties for a production function representing efficient operations. Our contributions are to review DEA practices, apply the concept of scale elasticity from economic multi-output production theory to DEA piecewise linear frontier production functions, and develop formulas for scale elasticity for radial projections of inefficient observations in the relative interior of fully dimensional facets. The formulas are applied to both constructed and real data and show the differences between scale elasticities for the two valid projections (input and output orientations). Instead of getting qualitative measures of returns to scale only as was done earlier in the DEA literature, we now get a quantitative range of scale elasticity values providing more information to policy-makers. 相似文献
914.
915.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
916.
We construct the polynomial quantization on the space G/H where G=SL(n,R),H=GL(n–1,R). It is a variant of quantization in the spirit of Berezin. In our case covariant and contravariant symbols are polynomials on G/H. We introduce a multiplication of covariant symbols, establish the correspondence principle, study transformations of symbols (the Berezin transform) and of operators. We write a full asymptotic decomposition of the Berezin transform. 相似文献
917.
We present a characterization of confluence for term rewriting systems, which is then refined for special classes of rewriting systems. The refined characterization is used to obtain a polynomial time algorithm for deciding the confluence of ground term rewrite systems. The same approach also shows the decidability of confluence for shallow and linear term rewriting systems. The decision procedure has a polynomial time complexity under the assumption that the maximum arity of a function symbol in the signature is a constant. 相似文献
918.
We prove here that the surface of the regular icosahedron can be triangulated with 8
non-obtuse and with 12 acute triangles. We also show these numbers to be smallest
possible. 相似文献
919.
Robert Krauthgamer Nathan Linial Avner Magen 《Discrete and Computational Geometry》2004,31(3):339-356
The extensive study of metric spaces and their embeddings
has so far focused on embeddings that preserve pairwise distances.
A very intriguing concept introduced by Feige
allows us to quantify the extent to which larger
structures are preserved by a given embedding.
We investigate this concept, focusing on several major graph families
such as paths, trees, cubes, and expanders.
We find some similarities to the regular (pairwise) distortion,
as well as some striking differences. 相似文献
920.