首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   81420篇
  免费   463篇
  国内免费   422篇
化学   26535篇
晶体学   817篇
力学   6861篇
数学   32253篇
物理学   15839篇
  2021年   66篇
  2020年   72篇
  2019年   59篇
  2018年   10467篇
  2017年   10290篇
  2016年   6142篇
  2015年   916篇
  2014年   418篇
  2013年   526篇
  2012年   3986篇
  2011年   10731篇
  2010年   5779篇
  2009年   6219篇
  2008年   6790篇
  2007年   8917篇
  2006年   387篇
  2005年   1454篇
  2004年   1676篇
  2003年   2107篇
  2002年   1158篇
  2001年   344篇
  2000年   395篇
  1999年   209篇
  1998年   243篇
  1997年   190篇
  1996年   255篇
  1995年   163篇
  1994年   118篇
  1993年   136篇
  1992年   80篇
  1991年   89篇
  1990年   73篇
  1989年   90篇
  1988年   74篇
  1987年   82篇
  1986年   82篇
  1985年   79篇
  1984年   70篇
  1983年   65篇
  1982年   60篇
  1981年   59篇
  1980年   58篇
  1979年   57篇
  1978年   46篇
  1976年   36篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
A recent article in this journal employs the capital-asset pricing model for the analysis of the newsboy problem and shows how the covariance risk affects the optimal inventory policy. The purpose of this paper is to sharpen the optimality conditions given by the article and hence to provide a simple method for finding the solution. Under reasonable assumptions, this paper shows that the optimal ordering policy can be described by a single equation, regardless of the sign of the covariance term.  相似文献   
92.
We consider the problem of determining lot sizes of multiple items that are manufactured by a single capacitated facility. The manufacturing facility may represent a bottleneck processing activity on the shop floor or a storeroom that provides components to the shop floor. Items flow from the facility to a downstream facility, where they are assembled according to a specified mix. Just-in-time (JIT) manufacturing requires a balanced flow of items, in the proper mix, between successive facilities. Our model determines lot sizes of the various items based on available capacity and four attributes of each item: demand rate, holding cost, set-up time and processing time. Holding costs for each item accrue until the appropriate mix of items is available for shipment downstream. We develop a lot-sizing heuristic that minimizes total holding cost per time unit over all items, subject to capacity availability and the required mix of items.  相似文献   
93.
An index fund is a portfolio of shares designed to replicate the investment performance of a market index. The index represents the behaviour of the market as a whole. This paper describes the selection of an index fund which minimizes expected tracking error. Using a multivariate model of returns on shares, a development of a univariate model by Taylor, the selection problem is formulated as a quadratic programme. The effects of various constraints on tracking error are demonstrated. Several policies for the readjustment of a fund are examined in the context of the differing objectives of fund managers. As a general rule, regular readjustment is shown to be a more expensive policy than irregular updating.  相似文献   
94.
This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.  相似文献   
95.
Summary. In this paper, we derive a posteriori error estimates for the finite element approximation of quadratic optimal control problem governed by linear parabolic equation. We obtain a posteriori error estimates for both the state and the control approximation. Such estimates, which are apparently not available in the literature, are an important step towards developing reliable adaptive finite element approximation schemes for the control problem. Received July 7, 2000 / Revised version received January 22, 2001 / Published online January 30, 2002 RID="*" ID="*" Supported by EPSRC research grant GR/R31980  相似文献   
96.
97.
This paper investigates the existence of positive solutions of a singular boundary value problem with negative exponent similar to standard Emden-Fowler equation. A necessary and sufficient condition for the existence of C[0, 1] positive solutions as well as C1[0, 1] positive solutions is given by means of the method of lower and upper solutions with the Schauder fixed point theorem.  相似文献   
98.
 We prove that, under the assumption of the Generalized Riemann Hypothesis, the exponent of the ideal class group of a CM-field goes to infinity with its absolute discriminant. This gives a positive answer to a question raised by Louboutin and Okazaki [4]. Received September 10, 2001; in revised form April 5, 2002  相似文献   
99.
 We consider biased random walk on supercritical percolation clusters in ℤ2. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias is small enough, the speed of the random walk is positive. Received: 20 November 2002 / Revised version: 17 January 2003 Published online: 15 April 2003 Research supported by Microsoft Research graduate fellowship. Research partially supported by the DFG under grant SPP 1033. Research partially supported by NSF grant #DMS-0104073 and by a Miller Professorship at UC Berkeley. Mathematics Subject Classification (2000): 60K37; 60K35; 60G50 Key words or phrases: Percolation – Random walk  相似文献   
100.
 Friendly walkers is a stochastic model obtained from independent one-dimensional simple random walks {S k j } j≥0 , k=1,2,…,d by introducing ``non-crossing condition': and ``reward for collisions' characterized by parameters . Here, the reward for collisions is described as follows. If, at a given time n, a site in ℤ is occupied by exactly m≥2 walkers, then the site increases the probabilistic weight for the walkers by multiplicative factor exp (β m )≥1. We study the localization transition of this model in terms of the positivity of the free energy and describe the location and the shape of the critical surface in the (d−1)-dimensional space for the parameters . Received: 13 June 2002 / Revised version: 24 August 2002 Published online: 28 March 2003 Mathematics Subject Classification (2000): 82B41, 82B26, 82D60, 60G50 Key words or phrases: Random walks – Random surfaces – Lattice animals – Phase transitions – Polymers – Random walks  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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