首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   456087篇
  免费   3899篇
  国内免费   1041篇
化学   215800篇
晶体学   7115篇
力学   23644篇
综合类   8篇
数学   65592篇
物理学   148868篇
  2021年   3650篇
  2020年   3894篇
  2019年   4431篇
  2018年   12285篇
  2017年   12945篇
  2016年   11531篇
  2015年   5403篇
  2014年   8231篇
  2013年   18264篇
  2012年   17439篇
  2011年   26157篇
  2010年   18012篇
  2009年   18086篇
  2008年   23170篇
  2007年   25683篇
  2006年   14199篇
  2005年   16988篇
  2004年   13802篇
  2003年   12754篇
  2002年   11294篇
  2001年   12059篇
  2000年   9097篇
  1999年   6920篇
  1998年   5819篇
  1997年   5598篇
  1996年   5295篇
  1995年   4569篇
  1994年   4515篇
  1993年   4401篇
  1992年   4790篇
  1991年   5066篇
  1990年   4798篇
  1989年   4738篇
  1988年   4449篇
  1987年   4533篇
  1986年   4293篇
  1985年   5331篇
  1984年   5508篇
  1983年   4585篇
  1982年   4704篇
  1981年   4350篇
  1980年   4265篇
  1979年   4561篇
  1978年   4714篇
  1977年   4628篇
  1976年   4536篇
  1975年   4307篇
  1974年   4273篇
  1973年   4306篇
  1972年   3080篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
942.
In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.  相似文献   
943.
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.  相似文献   
944.
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.  相似文献   
945.
946.
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.  相似文献   
947.
The essential self-adjointness on a natural domain of the sharp-time Wick powers of the relativistic free field in two space-time dimension is proven. Other results on Wick powers are reviewed and discussed.  相似文献   
948.
949.
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.  相似文献   
950.
In this paper, we study the global behaviour of an underground waste disposal in order to have an accurate upscaled model suitable for the computations involved in safety assessment processes. We start from a detailed model describing the transport of pollutant leaking from a high number of units. Using the method of homogenization, going to the limit, we obtain first a macroscopic model where the sources are now appearing globally. Then we compute a first‐order matched asymptotic expansion and we give the error estimates for this approximation. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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