首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   85584篇
  免费   635篇
  国内免费   380篇
化学   28360篇
晶体学   835篇
力学   6875篇
综合类   1篇
数学   33484篇
物理学   17044篇
  2021年   141篇
  2020年   150篇
  2019年   125篇
  2018年   10525篇
  2017年   10364篇
  2016年   6419篇
  2015年   1099篇
  2014年   613篇
  2013年   1035篇
  2012年   4154篇
  2011年   10903篇
  2010年   5870篇
  2009年   6255篇
  2008年   6798篇
  2007年   8917篇
  2006年   388篇
  2005年   1423篇
  2004年   1648篇
  2003年   2082篇
  2002年   1145篇
  2001年   349篇
  2000年   374篇
  1999年   247篇
  1998年   288篇
  1997年   244篇
  1996年   289篇
  1995年   210篇
  1994年   158篇
  1993年   175篇
  1992年   134篇
  1991年   135篇
  1990年   114篇
  1989年   126篇
  1988年   138篇
  1987年   141篇
  1986年   124篇
  1985年   140篇
  1984年   131篇
  1983年   128篇
  1982年   123篇
  1981年   116篇
  1980年   138篇
  1979年   121篇
  1978年   123篇
  1977年   106篇
  1976年   90篇
  1974年   87篇
  1973年   102篇
  1966年   82篇
  1965年   73篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
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.  相似文献   
992.
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.  相似文献   
993.
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.  相似文献   
994.
Sia dato uno spazio topologicoE con azione di un monoide topologicoH e siaE→B una funzione continue che, su ogni apertoU di una partizione dell'unità diB, sia, a meno di omotopia, la proiezioneU×H→U (ovvero una fibrazione numerabile). Un classico risultato di A. Dold e R. Lashof (1959) permette di costruire, a partire daE→B, una funzione continuaE →B, conE debolmente contraibile e munito di azione diH: laH-fibrazione universale associata daH. Tale funzione, in generale, non è purtroppo numerabile e quindi non si presta alla classificazione delleH-fibrazioni numerabili. Successivamente (1971), M. Fuchs ha trovato un modo di modificare la costruzione di Dold-Lashof per recuperare la numerabilità. La costruzione di Dold-Lashof-Fuchs è, da allora, uno dei principali strumenti nella teoria degli spazi classificanti di monoidi topologici, anche se vi è un uso di topologie alquanto complesse e quindi poco maneggevoli. In questo lavoro ci proponiamo di mostrare come, lavorando nella categoria conveniente deik-spazi, sia possibile descrivere la costruzione di Dold-Lashof-Fuchs in modo estremamente semplificato ed adattarla anche alla classificazione delleF-fibrazioni numerabili.
Conferenza tenuta da R. Piccinini il 15 maggio 1995  相似文献   
995.
It is proved that the even-order equationy (2n) +p(t)y=0 is (n,n) oscillatory at if
  相似文献   
996.
The encapsulation of fine magnetite particles of 10 nm size and marker ANS within asolectin vesicles has been made by sonication of the mixture in water. For the proof of encapsulation of magnetite in vesicles the electron microscope and spectrofluoriphotometer technique were used. The theory for the calculation of the magnetic force acting on the system consisted of non-capsulated magnetic particles dispersed in water and magnetic vesicles was developed.This work was supported by the Slovak Academy of Sciences within the framework of Project GAV No. 1361.  相似文献   
997.
In the framework of the Nilsson model the calculations of the so called shape factor for the first forbidden transitions 5/2+ 241Pu 5/2 241Am and 7/2+ 177Lu 7/2 177Hf are carried out. The dependence on the Nilsson potential parameters is studied. It turns out that for the transitions considered the calculated shape factor depends linearly on the electron energy and its slope is 10–3 per 20 keV. This can affect the analysis of electron spectra if the endpoint energy is sufficiently large.  相似文献   
998.
Dirac's and Proca's equations are unified in the sense that the algebras of Dirac -matrices and Duffin-Kemmer-matrices are shown to furnish two distinct matrix representations of the Lie algebra of the SO(3,3)-group. This fact is then interpreted as evidence for the classical picture of particles described by the above-mentioned equations to be a relativistic top. It is also argued that the shape of the top is rod-like.  相似文献   
999.
Individual extraction constants of nine dicarbollylcobaltate anions in the two-phase water-nitrobenzene system were determined radiometrically assuming that the changes of Gibbs energy of the transfer of the tetraphenylarsonium cation, Ph4As+, and of the tetraphenylborate anion, BPh 4 , from the aqueous into the nitrobenzene phase are equal. The constants obtained by this method were correlated with Hansch's constants of hydrophobity.  相似文献   
1000.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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