首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   109578篇
  免费   1430篇
  国内免费   616篇
化学   46574篇
晶体学   1002篇
力学   7406篇
数学   36907篇
物理学   19735篇
  2023年   172篇
  2021年   432篇
  2020年   520篇
  2019年   493篇
  2018年   10677篇
  2017年   10501篇
  2016年   6793篇
  2015年   1569篇
  2014年   1100篇
  2013年   2053篇
  2012年   5605篇
  2011年   12676篇
  2010年   6716篇
  2009年   6964篇
  2008年   8530篇
  2007年   10610篇
  2006年   2245篇
  2005年   3167篇
  2004年   3106篇
  2003年   3327篇
  2002年   2289篇
  2001年   659篇
  2000年   693篇
  1999年   527篇
  1998年   537篇
  1997年   506篇
  1996年   685篇
  1995年   464篇
  1994年   383篇
  1993年   373篇
  1992年   332篇
  1991年   300篇
  1990年   260篇
  1989年   269篇
  1988年   293篇
  1987年   264篇
  1986年   238篇
  1985年   397篇
  1984年   379篇
  1983年   279篇
  1982年   348篇
  1981年   359篇
  1980年   342篇
  1979年   323篇
  1978年   290篇
  1977年   245篇
  1976年   224篇
  1975年   225篇
  1974年   219篇
  1973年   235篇
排序方式: 共有10000条查询结果,搜索用时 453 毫秒
161.
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.  相似文献   
162.
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.  相似文献   
163.
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.  相似文献   
164.
165.
166.
Malmquist indexes can be used to estimate technical change over time. The index generally represents the average effect of technical change on all outputs in a multi-output firm. However, changes in technology do not necessarily affect all outputs involved in the analysis equally. In this paper, a method for estimating the effect of technical change on each of the different outputs is proposed. This estimation is done by a modification of quasi-Malmquist indexes. An artificial data set has been used to validate the method proposed in this paper.  相似文献   
167.
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.  相似文献   
168.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.  相似文献   
169.
Siaw-Lynn Ng 《Order》2004,21(1):1-5
We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain. This revised version was published online in September 2006 with corrections to the Cover Date.  相似文献   
170.
The rotational barriers of the CC bonds of halocarbons are believed to be rather different than those of hydrocarbons. We wish to systematically study the effect of halogen substituents on the conformational flexibility of hydrocarbons. As our initial approach to this problem, we have synthesized the following molecules: Pyrene-(CF2)n-Pyrene (n=3, 4, and 6) and Pyrene-(CF2)n-F (n=4 and 6). We describe here the concentration and temperature dependence of the emissive behavior of these materials.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号