首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4412篇
  免费   59篇
  国内免费   10篇
化学   3122篇
晶体学   20篇
力学   70篇
数学   934篇
物理学   335篇
  2019年   34篇
  2016年   71篇
  2015年   51篇
  2014年   36篇
  2013年   115篇
  2012年   89篇
  2011年   141篇
  2010年   103篇
  2009年   116篇
  2008年   141篇
  2007年   140篇
  2006年   146篇
  2005年   131篇
  2004年   105篇
  2003年   101篇
  2002年   103篇
  2001年   54篇
  2000年   72篇
  1999年   61篇
  1998年   59篇
  1997年   56篇
  1996年   71篇
  1995年   79篇
  1994年   59篇
  1993年   68篇
  1992年   95篇
  1991年   95篇
  1990年   78篇
  1989年   71篇
  1988年   60篇
  1987年   65篇
  1986年   68篇
  1985年   85篇
  1984年   90篇
  1983年   84篇
  1982年   82篇
  1981年   107篇
  1980年   61篇
  1979年   80篇
  1978年   75篇
  1977年   92篇
  1976年   66篇
  1975年   79篇
  1974年   86篇
  1973年   66篇
  1972年   55篇
  1971年   48篇
  1970年   37篇
  1967年   31篇
  1958年   29篇
排序方式: 共有4481条查询结果,搜索用时 15 毫秒
1.
2.
3.
The synthesis of benzazepine analogues of the opium alkaloid noscapine ( 1 ) is described. The benzazepines 2 and 3 were prepared starting from nornarceine ethyl ester ( 4 ; readily available from 1 ) in several steps. X-Ray analysis of compound 2 revealed that it is not a diastereosisomer mixture but a racemate of the threo-form and thus has the same configuration as 1 .  相似文献   
4.
5.
6.
Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size nj. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that nj is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007  相似文献   
7.
8.
This paper presents an analytic approach to the construction cost of fringe-balanced binary search trees. In [7], Mahmoud used a bottom-up approach and an urn model of Pólya. The present method is top-down and uses differential equations and Hwang's quasi-power theorem to derive the asymptotic normality of the number of rotations needed to construct such afringe balanced search tree. We also obtain the exact expectation and variance with this method. Although Pólya's urn model is no longer needed, we also present an elegant analysis of it based on an operator calculus as in [4].This research was supported by the Austrian Research Society (FWF) under the project number P12599-MAT.  相似文献   
9.
10.
We further study the validity of the Monte Carlo Hamiltonian method. The advantage of the method,in comparison with the standard Monte Carlo Lagrangian approach, is its capability to study the excited states. Weconsider two quantum mechanical models: a symmetric one V(x) = |x|/2; and an asymmetric one V(x) = ∞, forx < 0 and V(x) = x, for x ≥ 0. The results for the spectrum, wave functions and thermodynamical observables are inagreement with the analytical or Runge-Kutta calculations.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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