首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3033篇
  免费   110篇
  国内免费   3篇
化学   1671篇
晶体学   23篇
力学   68篇
数学   344篇
物理学   1040篇
  2022年   35篇
  2021年   20篇
  2020年   35篇
  2019年   39篇
  2018年   62篇
  2017年   43篇
  2016年   91篇
  2015年   77篇
  2014年   116篇
  2013年   174篇
  2012年   146篇
  2011年   177篇
  2010年   97篇
  2009年   101篇
  2008年   152篇
  2007年   131篇
  2006年   119篇
  2005年   113篇
  2004年   100篇
  2003年   106篇
  2002年   52篇
  2001年   65篇
  2000年   59篇
  1999年   53篇
  1998年   38篇
  1997年   27篇
  1996年   37篇
  1995年   31篇
  1994年   42篇
  1993年   38篇
  1992年   34篇
  1991年   41篇
  1990年   38篇
  1989年   32篇
  1988年   21篇
  1987年   23篇
  1986年   19篇
  1985年   30篇
  1984年   32篇
  1983年   26篇
  1982年   26篇
  1981年   30篇
  1980年   24篇
  1979年   22篇
  1978年   21篇
  1977年   24篇
  1976年   25篇
  1975年   20篇
  1974年   17篇
  1973年   19篇
排序方式: 共有3146条查询结果,搜索用时 15 毫秒
51.
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.  相似文献   
52.
53.
54.
Using an 11.4MeV/u136Xe beam of the UNILAC accelerator of GSI and anatW target, A=184 isobars were produced and separated by using an on-line mass separator. A new isomeric state was found in184Hf. This state decays with a half-life of 48(10) s and emits three -rays of 73, 482, and 555 keV as well as lower-lying cascade transitions. The hindrance of the 73 keV-E1 transition with K=8 is compared with those of other even-even hafnium isotopes. The half-life of184Lu was estimated to be between 15 and 25s.  相似文献   
55.
Chloride is determined indirectly by Spectrophotometric flow injection analysis. Two systems are compared, both based on the principle of ion exchange of easily detectable anions versus chloride from suitable mercury salts. The first method is based on the exchange of chloride with chloranilate which is detected at 332 nm or at 306 nm in neutral or in acidic medium respectively. In the second case, chloride reacts with Hg(SCN)2. The liberated thiocyanate forms a strongly coloured complex with Fe(III) in acidic solution with an absorption maximum at 460 nm. Both methods have a detection limit of about 5 mol Cl/l (175 ng/ml). In the case of the thiocyanate method, the relative standard deviation is about 2% (7 measurements) in the range of 5 to 150 mol/l and decreases significantly to a value of approximately 0.2% at higher concentrations; for the chloranilate method it is 10% for lower and about 1% for higher concentrations respectively.  相似文献   
56.
The job-shop problem is one of the most difficult NP-hard scheduling problems. A 10×10-problem published in 1963 has been solved only recently by Carlier and Pinson using a branch and bound method. Other branch and bound algorithms have been developed recently. The efficiency of all these branch and bound methods relies on the concept of immediate selection which allows to introduce order relations on the setI of all operations to be processed on the same machine before branching. We present new algorithms for immediate selection. Among them are
  1. anO(max {n logn,f})-algorithm for fixing all disjunctions induced by cliques;
  2. anO(n 2)-algorithm based on concepts which are different from those used by Carlier and Pinson.
Here,n is the number of operations inI andf is the number of induced order relations.  相似文献   
57.
58.
Photoconductivities and photovoltaic currents of ruthenium-doped KNbO3 are orders of magnitude larger than that of undoped and ion-doped crystals. KNbO3:Ru is very sensitive for holographic recording with red light and the photovoltaic current increases sublinearly with light intensity.  相似文献   
59.
60.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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