首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2468篇
  免费   218篇
  国内免费   155篇
化学   146篇
晶体学   3篇
力学   223篇
综合类   14篇
数学   1503篇
物理学   952篇
  2024年   3篇
  2023年   25篇
  2022年   33篇
  2021年   37篇
  2020年   74篇
  2019年   73篇
  2018年   73篇
  2017年   67篇
  2016年   62篇
  2015年   60篇
  2014年   110篇
  2013年   194篇
  2012年   111篇
  2011年   148篇
  2010年   115篇
  2009年   173篇
  2008年   193篇
  2007年   170篇
  2006年   134篇
  2005年   114篇
  2004年   133篇
  2003年   117篇
  2002年   103篇
  2001年   71篇
  2000年   59篇
  1999年   61篇
  1998年   51篇
  1997年   49篇
  1996年   39篇
  1995年   27篇
  1994年   27篇
  1993年   22篇
  1992年   26篇
  1991年   8篇
  1990年   5篇
  1989年   9篇
  1988年   7篇
  1987年   4篇
  1986年   8篇
  1985年   13篇
  1984年   9篇
  1983年   3篇
  1982年   3篇
  1981年   5篇
  1980年   2篇
  1979年   3篇
  1978年   3篇
  1977年   2篇
  1974年   1篇
  1973年   1篇
排序方式: 共有2841条查询结果,搜索用时 15 毫秒
981.
The constrained Modified KP hierarchy is considered from the viewpoint of modification. It is shown that its second Poisson bracket, which has a rather complicated form, is associated to a vastly simpler bracket via a Miura-type map. Similar results are established for a natural reduction of the MKP.  相似文献   
982.
 In this paper, a class of cubic planar graphs is given that have Hamiltonian cycles that can be constructed in linear time. A member of this class is called a layered cubic planar graph, and consists of a sequence of cycles C 0 ,C 1 ,…,C n such that each pair of successive cycles, C i , C i+1 , is joined by a matching. The cycles can be pictured as concentric circles, and the edges of the matchings as radial line segments between successive circles. The subgraph bounded by two successive cycles forms a layer; each face in layer i is incident to a fixed number k i+1 of edges in the matching in layer i+1. The problem that initially motivated this work is that of identifying classes of convex cubic polyhedra that can be easily edge three-colored. Received: September 21, 1998 Final version received: July 21, 1999  相似文献   
983.
It is shown that a Dirac bracket algebra is isomorphic to the original Poisson bracket algebra of first-class functions subject to first-class constraints. The isomorphic image of the Dirac bracket algebra in the star-product commutator algebra is found.  相似文献   
984.
运用集中紧性方法和Ekeland变分原理研究R^2中二阶渐近周期奇异Hamilton系统ue (1 g(t))V‘u(t,u)=0的极小问题,并证明该系统具有两条非平凡同宿轨道。  相似文献   
985.
Summary A semiempirical effective Hamiltonian treatment is proposed for transition metal complexes, taking into accountd-electron correlations, weak covalency of the metal-ligand bonds and the electronic structure of the ligand sphere. The technique uses the variation wave function which differs from the usual Hartree-Fock antisymmetrized product of molecular orbitals extended over the whole complex. The scheme is implemented and parameters describing the metal-ligand interactions are adjusted to reproduced-d-excitation spectra of a number of octahedral MF 6 4– (M=Mn, Fe, Co, Ni) anions, Mn(FH) 6 2+ cation, CoCl 6 4– anion, and a tetrahedral CoCl 4 2– anion. The values of the parameters are reasonable, thus confirming the validity of the proposed scheme.  相似文献   
986.
987.
In this paper, we discuss the Poincare bifurcation of cubic Hamiltonian systems with double centers and prove that the systems may at least generate two limit cycles and at most generate three limit cycles outside the lemniscate after a small cubic perturbation.  相似文献   
988.
A number of results in hamiltonian graph theory are of the form “ implies ”, where is a property of graphs that is NP-hard and is a cycle structure property of graphs that is also NP-hard. An example of such a theorem is the well-known Chvátal–Erd s Theorem, which states that every graph G with κ is hamiltonian. Here κ is the vertex connectivity of G and is the cardinality of a largest set of independent vertices of G. In another paper Chvátal points out that the proof of this result is in fact a polynomial time construction that either produces a Hamilton cycle or a set of more than κ independent vertices. In this note we point out that other theorems in hamiltonian graph theory have a similar character. In particular, we present a constructive proof of a well-known theorem of Jung (Ann. Discrete Math. 3 (1978) 129) for graphs on 16 or more vertices.  相似文献   
989.
We show that the visibility graph of a set of disjoint congruent discs in is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit.  相似文献   
990.
Dirac‘s method which itself is for constrained Boson fields and particle systems is followed and developed to treat Dirac fields in light-front coordinates.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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