全文获取类型
收费全文 | 540848篇 |
免费 | 6771篇 |
国内免费 | 2547篇 |
专业分类
化学 | 291335篇 |
晶体学 | 8392篇 |
力学 | 23086篇 |
综合类 | 66篇 |
数学 | 65519篇 |
物理学 | 161768篇 |
出版年
2020年 | 4272篇 |
2019年 | 4771篇 |
2018年 | 5943篇 |
2017年 | 6001篇 |
2016年 | 9218篇 |
2015年 | 6017篇 |
2014年 | 9089篇 |
2013年 | 24103篇 |
2012年 | 18302篇 |
2011年 | 22419篇 |
2010年 | 15552篇 |
2009年 | 15387篇 |
2008年 | 20660篇 |
2007年 | 20765篇 |
2006年 | 19456篇 |
2005年 | 17747篇 |
2004年 | 16036篇 |
2003年 | 14243篇 |
2002年 | 14056篇 |
2001年 | 15668篇 |
2000年 | 11862篇 |
1999年 | 9184篇 |
1998年 | 7722篇 |
1997年 | 7613篇 |
1996年 | 7327篇 |
1995年 | 6704篇 |
1994年 | 6607篇 |
1993年 | 6548篇 |
1992年 | 7152篇 |
1991年 | 7174篇 |
1990年 | 6798篇 |
1989年 | 6713篇 |
1988年 | 6686篇 |
1987年 | 6545篇 |
1986年 | 6286篇 |
1985年 | 8501篇 |
1984年 | 8730篇 |
1983年 | 7327篇 |
1982年 | 7930篇 |
1981年 | 7481篇 |
1980年 | 7241篇 |
1979年 | 7510篇 |
1978年 | 7895篇 |
1977年 | 7772篇 |
1976年 | 7953篇 |
1975年 | 7294篇 |
1974年 | 7473篇 |
1973年 | 7897篇 |
1972年 | 5465篇 |
1971年 | 4380篇 |
排序方式: 共有10000条查询结果,搜索用时 375 毫秒
931.
A carousel is a dynamical system that describes the movement of an equilateral linkage in which the midpoint of each rod travels parallel to it. They are closely related to the floating body problem. We prove, using the work of Auerbach, that any figure that floats in equilibrium in every position is drawn by a carousel. Of special interest are such figures with rational perimetral density of the floating chords, which are then drawn by carousels. In particular, we prove that for some perimetral densities the only such figure is the circle, as the problem suggests. 相似文献
932.
Periodica Mathematica Hungarica - 相似文献
933.
A note on a generalized Douglas space 总被引:1,自引:0,他引:1
Periodica Mathematica Hungarica - 相似文献
934.
Guzina B. B.; Bonnet M. 《The Quarterly Journal of Mechanics and Applied Mathematics》2004,57(2):161-179
935.
New heuristics for over-constrained flight to gate assignments 总被引:1,自引:0,他引:1
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results. 相似文献
936.
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. 相似文献
937.
We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported. 相似文献
938.
V E Krivonozhko O B Utkin A V Volodin I A Sablin M Patrin 《The Journal of the Operational Research Society》2004,55(10):1049-1058
The aim of the paper is to present and substantiate a technique to visualize DEA modelling results without any loss of mathematical rigour. The proposed family of parametric optimization methods allows one to construct an intersection of the multidimensional frontier with a two-dimensional plane determined by any pair of given directions. This approach reduces the efficiency analysis of production units to the investigation of well-known functions in economics. We also propose constructive methods to calculate marginal rates of substitution, marginal rates of transformation and so on. 相似文献
939.
940.
In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver. 相似文献