首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   79772篇
  免费   373篇
  国内免费   384篇
化学   25001篇
晶体学   827篇
力学   6765篇
数学   32224篇
物理学   15712篇
  2018年   10457篇
  2017年   10286篇
  2016年   6105篇
  2015年   874篇
  2014年   357篇
  2013年   451篇
  2012年   3845篇
  2011年   10579篇
  2010年   5695篇
  2009年   6101篇
  2008年   6658篇
  2007年   8798篇
  2006年   253篇
  2005年   1343篇
  2004年   1552篇
  2003年   1994篇
  2002年   1037篇
  2001年   261篇
  2000年   310篇
  1999年   169篇
  1998年   206篇
  1997年   157篇
  1996年   212篇
  1995年   133篇
  1994年   93篇
  1993年   126篇
  1992年   83篇
  1991年   73篇
  1990年   68篇
  1989年   86篇
  1988年   88篇
  1987年   82篇
  1986年   83篇
  1985年   74篇
  1984年   70篇
  1983年   61篇
  1982年   68篇
  1981年   80篇
  1980年   88篇
  1979年   76篇
  1978年   75篇
  1977年   61篇
  1976年   43篇
  1975年   42篇
  1973年   62篇
  1972年   41篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 593 毫秒
31.
C M Srivastava 《Pramana》1989,32(3):251-267
A theory of high temperature superconductivity in YBa2Cu3O7_δ compound has been developed on the basis of the momentum pairing of electrons through the relativistic Darwin interaction. The transport behaviour of electrons is explained in terms of a mechanism of correlated electron transfer arising from the electron-phonon coupling. A model Hamiltonian has been developed to describe the superconducting properties of the system. This gives an energy gap which is higher than the BCS value. Attempts have been made to explain the absence of isotope effect, the linear dependence of specific heat, the presence of larger temperature-independent paramagnetism in the normal phase and the softening of some of the optic phonon modes observed in this system.  相似文献   
32.
33.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.  相似文献   
34.
We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor NM and α±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor MM oppR arising from the entire system of irreducible endomorphisms of M resulting from αplusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S 1 to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001  相似文献   
35.
We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002  相似文献   
36.
37.
38.
We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.  相似文献   
39.
The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.  相似文献   
40.
This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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