首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   86090篇
  免费   1995篇
  国内免费   1414篇
化学   30301篇
晶体学   875篇
力学   7105篇
综合类   89篇
数学   32710篇
物理学   18419篇
  2023年   198篇
  2022年   346篇
  2021年   381篇
  2020年   424篇
  2019年   474篇
  2018年   10728篇
  2017年   10536篇
  2016年   6517篇
  2015年   1323篇
  2014年   855篇
  2013年   992篇
  2012年   4600篇
  2011年   11247篇
  2010年   6194篇
  2009年   6501篇
  2008年   7109篇
  2007年   9235篇
  2006年   633篇
  2005年   1621篇
  2004年   1749篇
  2003年   2178篇
  2002年   1263篇
  2001年   489篇
  2000年   425篇
  1999年   329篇
  1998年   309篇
  1997年   223篇
  1996年   269篇
  1995年   169篇
  1994年   133篇
  1993年   152篇
  1992年   100篇
  1991年   109篇
  1990年   89篇
  1989年   91篇
  1988年   82篇
  1987年   75篇
  1986年   69篇
  1985年   54篇
  1984年   48篇
  1983年   44篇
  1982年   45篇
  1981年   40篇
  1980年   48篇
  1979年   45篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 7 毫秒
101.
We apply the recently improved version of the 0–1 test for chaos to real experimental time series of laser droplet generation process. In particular two marginal regimes of dripping are considered: spontaneous and forced dripping. The outcomes of the test reveal that both spontaneous and forced dripping time series can be characterized as chaotic, which coincides with the previous analysis based on nonlinear time series analysis.  相似文献   
102.
103.
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.  相似文献   
104.
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.  相似文献   
105.
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.  相似文献   
106.
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  相似文献   
107.
108.
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.  相似文献   
109.
 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  相似文献   
110.
 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  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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