首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4038篇
  免费   377篇
  国内免费   245篇
化学   1104篇
力学   148篇
综合类   58篇
数学   2415篇
物理学   935篇
  2024年   7篇
  2023年   54篇
  2022年   66篇
  2021年   71篇
  2020年   104篇
  2019年   130篇
  2018年   114篇
  2017年   140篇
  2016年   165篇
  2015年   119篇
  2014年   194篇
  2013年   314篇
  2012年   191篇
  2011年   220篇
  2010年   205篇
  2009年   261篇
  2008年   241篇
  2007年   256篇
  2006年   224篇
  2005年   189篇
  2004年   159篇
  2003年   164篇
  2002年   141篇
  2001年   103篇
  2000年   101篇
  1999年   102篇
  1998年   70篇
  1997年   91篇
  1996年   55篇
  1995年   59篇
  1994年   46篇
  1993年   33篇
  1992年   31篇
  1991年   26篇
  1990年   35篇
  1989年   23篇
  1988年   21篇
  1987年   15篇
  1986年   19篇
  1985年   18篇
  1984年   20篇
  1983年   6篇
  1982年   15篇
  1981年   7篇
  1980年   4篇
  1979年   14篇
  1978年   4篇
  1977年   4篇
  1974年   2篇
  1973年   2篇
排序方式: 共有4660条查询结果,搜索用时 15 毫秒
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.
In this paper, we study the global (in time) existence of small data solutions to the Cauchy problem for the semilinear wave equation with friction, viscoelastic damping, and a power nonlinearity. We are interested in the connection between regularity assumptions for the data and the admissible range of exponents p in the power nonlinearity.  相似文献   
3.
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.  相似文献   
4.
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.  相似文献   
5.
Structural surface velocity distribution is often used to predict structural borne sound radiation. However the sampling interval of velocity should be chosen carefully to increase the prediction accuracy and to reduce the system cost. In this paper, several factors affecting the sampling interval are theoretically analyzed and discussed for a vibrating baffled rectangular plate. A new rule for the determination of the sampling interval is formulated. Using this rule, the results from both numerical simulations and experiments may be explained well.  相似文献   
6.
迈克尔逊干涉仪中补偿板与干涉条纹   总被引:1,自引:0,他引:1  
通过分析缺失补偿板的迈克尔逊干涉仪中的附加光程差,推出干涉条纹满足的方程式,并用计算机模拟了动镜移动过程中变化的干涉条纹,与实验结果相一致.  相似文献   
7.
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  相似文献   
8.
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.  相似文献   
9.
舒兴明 《大学数学》2002,18(3):44-47
本文利用局部比较法 ,在图中定义子图、无效路径、以及可去边 .利用推导的有关定理 ,拆去可去边 ,利用最短路径相同的等价性 ,达到化简图 ,从而求出最短路径  相似文献   
10.
In this paper, the author studies the Laplace operator on the quaternionic Heisenberg group, construct a fundamental solution for it and use this solution to prove the Lp-boundedness and the weak (1-1) boundedness of certain singular convolution operators on the quaternionic Heisenberg group.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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