首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3306篇
  免费   84篇
  国内免费   14篇
化学   2263篇
晶体学   25篇
力学   49篇
数学   709篇
物理学   358篇
  2022年   22篇
  2020年   53篇
  2019年   42篇
  2018年   21篇
  2017年   26篇
  2016年   54篇
  2015年   86篇
  2014年   68篇
  2013年   120篇
  2012年   122篇
  2011年   142篇
  2010年   107篇
  2009年   80篇
  2008年   154篇
  2007年   139篇
  2006年   133篇
  2005年   126篇
  2004年   105篇
  2003年   90篇
  2002年   71篇
  2001年   42篇
  2000年   49篇
  1999年   35篇
  1998年   46篇
  1997年   36篇
  1996年   28篇
  1995年   37篇
  1994年   42篇
  1993年   46篇
  1992年   38篇
  1991年   27篇
  1989年   33篇
  1988年   38篇
  1987年   40篇
  1985年   47篇
  1984年   60篇
  1983年   37篇
  1982年   28篇
  1981年   40篇
  1980年   51篇
  1979年   29篇
  1978年   32篇
  1977年   39篇
  1976年   27篇
  1975年   32篇
  1974年   28篇
  1972年   25篇
  1967年   21篇
  1966年   20篇
  1956年   26篇
排序方式: 共有3404条查询结果,搜索用时 46 毫秒
1.
2.
Summary In the analysis of discretization methods for stiff intial value problems, stability questions have received most part of the attention in the past.B-stability and the equivalent criterion algebraic stability are well known concepts for Runge-Kutta methods applied to dissipative problems. However, for the derivation ofB-convergence results — error bounds which are not affected by stiffness — it is not sufficient in many cases to requireB-stability alone. In this paper, necessary and sufficient conditions forB-convergence are determined.This paper was written while J. Schneid was visiting the Centre for Mathematics and Computer Science with an Erwin-Schrödinger stipend from the Fonds zur Förderung der wissenschaftlichen Forschung  相似文献   
3.
4.
5.
We study a combinatorially defined double complex structure on the ordered chains of any simplicial complex. Its columns are related to the cell complex Kn whose face poset is isomorphic to the subword ordering on words without repetition from an alphabet of size n. This complex is shellable and as an application we give a representation theoretic interpretation for derangement numbers and a related symmetric function considered by Désarménien and Wachs [11].

We analyze the two spectral sequences arising from the double complex in the case of the bar resolution for a group. This spectral sequence converges to the cohomology of the group and provides a method for computing group cohomology in terms of the cohomology of subgroups. Its behavior is influenced by the complex of oriented chains of the simplicial complex of finite subsets of the group, and we examine the Ext class of this complex.  相似文献   

6.
Impact of the internucleotide linkage modification by inserting a methylene group to the P-O bond (—O—PO 2 —O— chain changed for —O—PO 2 —CH2—O—), on the modified oligonucleotide binding ability to the natural DNA strand was studied by molecular dynamics simulation. Complex of (dT)11 with a deoxyadenosine undecamer containing alternating modified and natural internucleotide linkage was studied as a model system. The Amber force field was completed by a set of new parameters needed to model the modified part of the nucleotide. The simulations confirmed existence of a double-helical complex the melting point of which is considerably higher than 300 K. While the thymidine (unmodified) strand possesses a B-type secondary structure, the conformation of the adenosine (modified) strand is not stable at 300 K. The -ggt conformation of the modified linkages is highly preferred, temporary jumps to the -g-gt and ggt conformations were, however, observed.  相似文献   
7.
It is known that every conformai embedding of the disk into the extended complex plane possesses a r2-quasiconformal extension across eachr-level line (the r2-property of a domain). We show here that this is a characteristic property of the disk: any simply connected domain which is not a disk does not admit ther 2-property. Supported by the RiP-program of the Volkswagen-Stiftung in the Mathematisches Forschungsinstitut Oberwolfach.  相似文献   
8.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce.  相似文献   
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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