首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14560篇
  免费   301篇
  国内免费   73篇
化学   8295篇
晶体学   104篇
力学   503篇
数学   2004篇
物理学   4028篇
  2022年   96篇
  2021年   115篇
  2020年   166篇
  2019年   112篇
  2018年   122篇
  2017年   92篇
  2016年   199篇
  2015年   214篇
  2014年   254篇
  2013年   531篇
  2012年   573篇
  2011年   735篇
  2010年   409篇
  2009年   360篇
  2008年   621篇
  2007年   682篇
  2006年   676篇
  2005年   701篇
  2004年   567篇
  2003年   452篇
  2002年   416篇
  2001年   412篇
  2000年   384篇
  1999年   223篇
  1998年   198篇
  1997年   195篇
  1996年   249篇
  1995年   229篇
  1994年   214篇
  1993年   258篇
  1992年   234篇
  1991年   217篇
  1990年   173篇
  1989年   179篇
  1988年   205篇
  1987年   189篇
  1986年   144篇
  1985年   193篇
  1984年   185篇
  1983年   139篇
  1982年   173篇
  1981年   153篇
  1980年   154篇
  1979年   152篇
  1978年   159篇
  1977年   123篇
  1976年   137篇
  1975年   102篇
  1974年   119篇
  1973年   101篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
41.
A tin(IV) porphyrin was combined with two axial NCN‐pincer platinum(II) fragments by utilizing the oxophilicity of the apical positions on the tin atom and the acidic nature of the NCN‐pincer platinum derived benzoic acid. The solid‐state structure determined by X‐ray crystallography revealed some close contacts between the pincer complexes and the mesop‐tolyl subsitutents of the porphyrin. It was shown by 1H NMR spectroscopy that these close contacts were not present in solution and that this compound can potentially act as a novel building block for supramolecular architectures.  相似文献   
42.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18  相似文献   
43.
We use three different approaches to describe the static spatial configurations of a twisted rod as well as its stability during rigid loading experiments. The first approach considers the rod as infinite in length and predicts an instability causing a jump to self-contact at a certain point of the experiment. Semi-finite corrections, taken into account as a second approach, reveal some possible experiments in which the configuration of a very long rod will be stable through out. Finally, in a third approach, we consider a rod of real finite length and we show that another type of instability may occur, leading to possible hysteresis behavior. As we go from infinite to finite length, we compare the different information given by the three approaches on the possible equilibrium configurations of the rod and their stability. These finite size effects studied here in a 1D elasticity problem could help us guess what are the stability features of other more complicated (2D elastic shells for example) problems for which only the infinite length approach is understood.  相似文献   
44.
45.
46.
Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.

  相似文献   

47.
48.
We show that reductions of KP hierarchies related to the loop algebra of SLn with homogeneous gradation give solutions of the Darboux-Egoroff system of PDE's. Using explicit dressing matrices of the Riemann-Hilbert problem generalized to include a set of commuting additional symmetries, we construct solutions of the Witten– Dijkgraaf–E. Verlinde–H. Verlinde equations.  相似文献   
49.
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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