首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5339篇
  免费   712篇
  国内免费   329篇
化学   1128篇
晶体学   57篇
力学   541篇
综合类   115篇
数学   2307篇
物理学   2232篇
  2024年   6篇
  2023年   50篇
  2022年   90篇
  2021年   95篇
  2020年   145篇
  2019年   140篇
  2018年   153篇
  2017年   167篇
  2016年   191篇
  2015年   127篇
  2014年   283篇
  2013年   342篇
  2012年   264篇
  2011年   319篇
  2010年   280篇
  2009年   321篇
  2008年   336篇
  2007年   336篇
  2006年   322篇
  2005年   298篇
  2004年   236篇
  2003年   235篇
  2002年   223篇
  2001年   171篇
  2000年   168篇
  1999年   128篇
  1998年   105篇
  1997年   102篇
  1996年   101篇
  1995年   66篇
  1994年   71篇
  1993年   54篇
  1992年   48篇
  1991年   46篇
  1990年   45篇
  1989年   38篇
  1988年   37篇
  1987年   29篇
  1986年   32篇
  1985年   29篇
  1984年   31篇
  1983年   8篇
  1982年   22篇
  1981年   19篇
  1980年   7篇
  1979年   10篇
  1977年   13篇
  1976年   9篇
  1974年   6篇
  1973年   9篇
排序方式: 共有6380条查询结果,搜索用时 31 毫秒
1.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph G is called monochromatic if any two edges on the path have the same color. For k2, an edge-colored graph G is said to be monochromatic k-edge-connected if every two distinct vertices of G are connected by at least k edge-disjoint monochromatic paths, and G is said to be uniformly monochromatic k-edge-connected if every two distinct vertices are connected by at least k edge-disjoint monochromatic paths such that all edges of these k paths are colored with a same color. We use mck(G) and umck(G) to denote the maximum number of colors that ensures G to be monochromatic k-edge-connected and, respectively, G to be uniformly monochromatic k-edge-connected. In this paper, we first conjecture that for any k-edge-connected graph G, mck(G)=e(G)e(H)+k2, where H is a minimum k-edge-connected spanning subgraph of G. We verify the conjecture for k=2. We also prove the conjecture for G=Kk+1 and G=Kk,n with nk3. When G is a minimal k-edge-connected graph, we give an upper bound of mck(G), i.e., mck(G)k1. For the uniformly monochromatic k-edge-connectivity, we prove that for all k, umck(G)=e(G)e(H)+1, where H is a minimum k-edge-connected spanning subgraph of G.  相似文献   
2.
Results from 5D induced-matter and membrane theory with null paths are extended to show that a particle obeys the 4D Klein-Gordon equation but with a variable mass. The Dirac equation also follows, but raises concerns about 4D quantization in the two natural 5D gauges, and reopens the question of a Regge-like trajectory for the spin angular momenta and squared masses of gravitationally-dominated systems.  相似文献   
3.
The NMR properties of nuclei linked to long linear polymer molecules are sensitive to the influence of hard walls. In this context, the residual energy of tensorial spin-spin interactions is calculated using a path integral approach. Several thermodynamic quantities of the polymer system (free energy, equation of state,...) are also expressed, taking chain stiffness effects and the presence of two repulsive walls into consideration.  相似文献   
4.
迈克尔逊干涉仪中补偿板与干涉条纹   总被引:1,自引:0,他引:1  
通过分析缺失补偿板的迈克尔逊干涉仪中的附加光程差,推出干涉条纹满足的方程式,并用计算机模拟了动镜移动过程中变化的干涉条纹,与实验结果相一致.  相似文献   
5.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008  相似文献   
6.
Stability properties of Feynman's operational calculus are addressed in the setting of exponential functions of noncommuting operators. Applications of some of the stability results are presented. In particular, the time-dependent perturbation theory of nonrelativistic quantum mechanics is presented in the setting of the operational calculus and application of the stability results of this paper to the perturbation theory are discussed.  相似文献   
7.
舒兴明 《大学数学》2002,18(3):44-47
本文利用局部比较法 ,在图中定义子图、无效路径、以及可去边 .利用推导的有关定理 ,拆去可去边 ,利用最短路径相同的等价性 ,达到化简图 ,从而求出最短路径  相似文献   
8.
A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta.  相似文献   
9.
A new framework of Gaussian white noise calculus is established, in line with generalized expansion in [3, 4, 7]. A suitable frame of Fock expansion is presented on Gaussian generalized expansion functionals being introduced here, which provides the integral kernel operator decomposition of the second quantization of Koopman operators for chaotic dynamical systems, in terms of annihilation operators dt and its dual, creation operators t*.  相似文献   
10.
介绍了几种光纤干涉仪等臂长技术,比较了各自的优缺点和适用范围,对光纤干涉仪的平衡有较大的参考价值。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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