首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   85119篇
  免费   1674篇
  国内免费   1322篇
化学   29374篇
晶体学   900篇
力学   7119篇
综合类   56篇
数学   32983篇
物理学   17683篇
  2023年   166篇
  2022年   241篇
  2021年   267篇
  2020年   304篇
  2019年   297篇
  2018年   10606篇
  2017年   10451篇
  2016年   6422篇
  2015年   1231篇
  2014年   809篇
  2013年   881篇
  2012年   4481篇
  2011年   11189篇
  2010年   6083篇
  2009年   6444篇
  2008年   7057篇
  2007年   9097篇
  2006年   604篇
  2005年   1655篇
  2004年   1829篇
  2003年   2187篇
  2002年   1219篇
  2001年   427篇
  2000年   412篇
  1999年   335篇
  1998年   316篇
  1997年   240篇
  1996年   307篇
  1995年   228篇
  1994年   167篇
  1993年   149篇
  1992年   111篇
  1991年   120篇
  1990年   118篇
  1989年   105篇
  1988年   87篇
  1987年   79篇
  1986年   86篇
  1985年   60篇
  1984年   56篇
  1983年   50篇
  1982年   49篇
  1981年   48篇
  1980年   48篇
  1979年   47篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
981.
Orientation control of perovskite compounds was investigated by the application of a seed layer prepared from oxide nanosheets. An aqueous suspension of oxide nanosheets was prepared by the exfoliation of a layered compound of KCa2Nb3O10 oxide grains. A seed layer composed of (TBA)Ca2Nb3O10 nanosheets (TBA = tetrabutylammonium) was formed on a glass substrate by simply dip coating it in the suspension. Two kinds of perovskite compounds, LaNiO3 (LNO) and Pb(Zr,Ti)O3 (PZT) with a preferred orientation of (00l) were successfully grown on this seeded glass substrate. In this study, the relation between lattice mismatch and electrical properties is investigated. A large, oriented PZT film with a size of 5 ×4 cm shows an improved P-E hysteresis behavior by use of this orientation control.  相似文献   
982.
We consider a periodic-review inventory replenishment model with an order-up-to-R operating doctrine for the case of deterministic lead times and a covariance-stationary stochastic demand process. A method is derived for setting the inventory safety stock to achieve an exact desired stockout probability when the autocovariance function for Gaussian demand is known. Because the method does not require that parametric time-series models be fit to the data, it is easily implemented in practice. Moreover, the method is shown to be asymptotically valid when the autocovariance function of demand is estimated from historical data. The effects on the stockout rate of various levels of autocorrelated demand are demonstrated for situations in which autocorrelation in demand goes undetected or is ignored by the inventory manager. Similarly, the changes to the required level of safety stock are demonstrated for varying levels of autocorrelation.  相似文献   
983.
This paper studies the optimal operation of an M/E k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.  相似文献   
984.
Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good.  相似文献   
985.
We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a ij >0 and a ji >0 may be given where a ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//Cmax belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.  相似文献   
986.
We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains n i identical, reconfigurable, breakdown-prone units. Our approach, which follows from the Markov chain balance equations and the recursive properties of Hessenberg matrix determinants, is simpler than previously proposed matrix geometric approaches, and can readily be adapted to the availability analysis of more complicated structures. We illustrate this by computing the steady-state availability of a mixed parallel-serial gracefully degrading replicated system.  相似文献   
987.
LetG be a finite group. If for every primer, whereR 1 Syl r G andR 2 Syl r (L n (q)), thenG L n (q).  相似文献   
988.
989.
Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.  相似文献   
990.
This paper deals with the GI x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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