首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   87264篇
  免费   505篇
  国内免费   412篇
化学   29505篇
晶体学   872篇
力学   7036篇
数学   33389篇
物理学   17379篇
  2021年   110篇
  2020年   122篇
  2019年   123篇
  2018年   10504篇
  2017年   10309篇
  2016年   6200篇
  2015年   989篇
  2014年   444篇
  2013年   856篇
  2012年   4094篇
  2011年   10856篇
  2010年   5908篇
  2009年   6269篇
  2008年   6932篇
  2007年   9044篇
  2006年   545篇
  2005年   1583篇
  2004年   1834篇
  2003年   2210篇
  2002年   1268篇
  2001年   427篇
  2000年   462篇
  1999年   291篇
  1998年   301篇
  1997年   272篇
  1996年   354篇
  1995年   234篇
  1994年   195篇
  1993年   244篇
  1992年   204篇
  1991年   218篇
  1990年   165篇
  1989年   179篇
  1988年   188篇
  1987年   236篇
  1986年   205篇
  1985年   242篇
  1984年   226篇
  1983年   179篇
  1982年   207篇
  1981年   214篇
  1980年   217篇
  1979年   214篇
  1978年   198篇
  1977年   180篇
  1976年   157篇
  1975年   174篇
  1974年   137篇
  1973年   148篇
  1972年   92篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
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.  相似文献   
132.
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.  相似文献   
133.
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.  相似文献   
134.
135.
136.
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.  相似文献   
137.
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.  相似文献   
138.
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.  相似文献   
139.
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.  相似文献   
140.
This paper is concerned with well‐posedness results for a mathematical model for the transversal vibrations of a two‐dimensional hybrid elastic structure consisting of a rectangular Reissner–Mindlin plate with a Timoshenko beam attached to its free edge. The model incorporates linear dynamic feedback controls along the interface between the plate and the beam. Classical semigroup methods are employed to show the unique solvability of the coupled initial‐boundary‐value problem. We also show that the energy associated with the system exhibits the property of strong stability. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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