首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   79216篇
  免费   374篇
  国内免费   381篇
化学   25218篇
晶体学   798篇
力学   6737篇
数学   32108篇
物理学   15110篇
  2022年   36篇
  2021年   41篇
  2020年   44篇
  2019年   34篇
  2018年   10445篇
  2017年   10269篇
  2016年   6099篇
  2015年   877篇
  2014年   328篇
  2013年   386篇
  2012年   3881篇
  2011年   10566篇
  2010年   5668篇
  2009年   6064篇
  2008年   6680篇
  2007年   8854篇
  2006年   302篇
  2005年   1388篇
  2004年   1591篇
  2003年   2025篇
  2002年   1067篇
  2001年   258篇
  2000年   298篇
  1999年   161篇
  1998年   206篇
  1997年   160篇
  1996年   216篇
  1995年   120篇
  1994年   82篇
  1993年   103篇
  1992年   64篇
  1991年   70篇
  1990年   53篇
  1989年   63篇
  1988年   63篇
  1987年   60篇
  1986年   63篇
  1985年   57篇
  1984年   54篇
  1983年   41篇
  1982年   46篇
  1981年   44篇
  1980年   51篇
  1979年   47篇
  1978年   36篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 13 毫秒
91.
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.  相似文献   
92.
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.  相似文献   
93.
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.  相似文献   
94.
95.
96.
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.  相似文献   
97.
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.  相似文献   
98.
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.  相似文献   
99.
100.
We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally compact groups on -algebras. Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002 This work is partially supported by Hong Kong RGC Direct Grant.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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