首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   99121篇
  免费   4032篇
  国内免费   3623篇
化学   39422篇
晶体学   1143篇
力学   8159篇
综合类   241篇
数学   34200篇
物理学   23611篇
  2023年   351篇
  2022年   586篇
  2021年   667篇
  2020年   817篇
  2019年   767篇
  2018年   10968篇
  2017年   10810篇
  2016年   6942篇
  2015年   1816篇
  2014年   1512篇
  2013年   1948篇
  2012年   5669篇
  2011年   12429篇
  2010年   7008篇
  2009年   7459篇
  2008年   8050篇
  2007年   10105篇
  2006年   1591篇
  2005年   2506篇
  2004年   2417篇
  2003年   2643篇
  2002年   1661篇
  2001年   843篇
  2000年   788篇
  1999年   642篇
  1998年   669篇
  1997年   525篇
  1996年   542篇
  1995年   416篇
  1994年   380篇
  1993年   310篇
  1992年   257篇
  1991年   242篇
  1990年   217篇
  1989年   158篇
  1988年   151篇
  1987年   150篇
  1986年   147篇
  1985年   128篇
  1984年   101篇
  1983年   73篇
  1982年   80篇
  1981年   69篇
  1980年   69篇
  1979年   63篇
  1978年   49篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
171.
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.  相似文献   
172.
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.  相似文献   
173.
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.  相似文献   
174.
175.
176.
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.  相似文献   
177.
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.  相似文献   
178.
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.  相似文献   
179.
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.  相似文献   
180.
We analyse a model for equilibrium configurations of composite systems of nematic liquid crystal with polymer inclusions, in the presence of an external magnetic field. We assume that the system has a periodic structure, and consider the relaxed problem on the unit length constraint of the nematic director field. The relaxation of the Oseen–Frank energy functional is carried out by including bulk as well as surface energy penalty terms, rendering the problem fully non‐linear. We employ two‐scale convergence methods to obtain effective configurations of the system, as the size of the polymeric inclusions tends to zero. We discuss the minimizers of the effective energies for, both, the constrained as well as the unconstrained models. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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