首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1128篇
  免费   15篇
化学   706篇
晶体学   3篇
力学   36篇
数学   168篇
物理学   230篇
  2022年   11篇
  2021年   12篇
  2020年   19篇
  2019年   12篇
  2018年   17篇
  2017年   21篇
  2016年   32篇
  2015年   17篇
  2014年   17篇
  2013年   37篇
  2012年   36篇
  2011年   43篇
  2010年   21篇
  2009年   24篇
  2008年   34篇
  2007年   24篇
  2006年   28篇
  2005年   14篇
  2004年   15篇
  2003年   27篇
  2001年   14篇
  1998年   12篇
  1997年   11篇
  1995年   13篇
  1994年   13篇
  1993年   13篇
  1992年   16篇
  1991年   17篇
  1987年   11篇
  1986年   13篇
  1984年   15篇
  1980年   10篇
  1979年   21篇
  1978年   14篇
  1977年   26篇
  1976年   24篇
  1975年   29篇
  1974年   17篇
  1973年   26篇
  1972年   28篇
  1971年   18篇
  1970年   18篇
  1969年   23篇
  1968年   31篇
  1967年   26篇
  1966年   19篇
  1965年   13篇
  1963年   23篇
  1962年   35篇
  1961年   13篇
排序方式: 共有1143条查询结果,搜索用时 31 毫秒
1.
2.
3.
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.  相似文献   
4.
On the basis of an effective potential for quarks and gluons, for models with fourfermion interaction, stability is examined both with and without vector fields (gluons). The stability conditions relate the main characteristics of four-quark models with quark and gluon condensates.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 189, pp. 3–9, 1991.  相似文献   
5.
We describe the inclusion of nonequilibrium gain into a self-consistent 2.5D CW spectral laser diode model and report on the use of this model to investigate the origin of gain compression in a 975 nm high-brightness tapered QW laser diode. Nonequilibrium gain is calculated using a dynamic gain model, which simulates the dynamic relaxation of the quantum well carrier energy distributions under the influence of steady-state electrical and optical excitation. Calculated gain and spontaneous emission spectra are included in the laser model via parameterised look up tables. Both simulated and experimentally measured intracavity spontaneous emission spectra show an increased carrier density and a blue-shift of the gain maximum with increasing bias caused by carrier heating and spectral hole burning. The accurate incorporation of nonequilibrium gain compression is therefore vital for the accurate prediction of the operating characteristics of these devices and for the experimental determination of the active region temperature.  相似文献   
6.
7.
8.
1,3-Dimethyl-3-vinyl-1,3-dichlorosiloxane is prepared by partial cohydrolysis of methylvinyldichlorosilane and methyldichlorosilane, and its cohydrolysis with sym-tetra-methyldichlorodisiloxane gives 1-hydro-3-vinylhexamethyl-cyclotetrasiloxane. A study is made of the kinetics of the polymerization of the latter in CCL4 in the presence of H2PtCl6 · 6H2O  相似文献   
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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