首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   15580篇
  免费   335篇
  国内免费   80篇
化学   9154篇
晶体学   114篇
力学   507篇
数学   2078篇
物理学   4142篇
  2023年   70篇
  2021年   132篇
  2020年   184篇
  2019年   129篇
  2018年   130篇
  2017年   103篇
  2016年   232篇
  2015年   236篇
  2014年   277篇
  2013年   603篇
  2012年   646篇
  2011年   835篇
  2010年   466篇
  2009年   404篇
  2008年   679篇
  2007年   747篇
  2006年   742篇
  2005年   773篇
  2004年   641篇
  2003年   517篇
  2002年   462篇
  2001年   439篇
  2000年   388篇
  1999年   231篇
  1998年   210篇
  1997年   199篇
  1996年   268篇
  1995年   234篇
  1994年   213篇
  1993年   257篇
  1992年   244篇
  1991年   222篇
  1990年   168篇
  1989年   187篇
  1988年   205篇
  1987年   187篇
  1986年   144篇
  1985年   203篇
  1984年   186篇
  1983年   141篇
  1982年   177篇
  1981年   158篇
  1980年   156篇
  1979年   154篇
  1978年   156篇
  1977年   120篇
  1976年   143篇
  1975年   107篇
  1974年   121篇
  1973年   98篇
排序方式: 共有10000条查询结果,搜索用时 636 毫秒
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号