首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2884篇
  免费   136篇
  国内免费   12篇
化学   1932篇
晶体学   11篇
力学   60篇
数学   563篇
物理学   466篇
  2023年   20篇
  2022年   11篇
  2021年   29篇
  2020年   39篇
  2019年   35篇
  2018年   51篇
  2017年   43篇
  2016年   111篇
  2015年   103篇
  2014年   92篇
  2013年   175篇
  2012年   193篇
  2011年   213篇
  2010年   128篇
  2009年   99篇
  2008年   151篇
  2007年   164篇
  2006年   162篇
  2005年   143篇
  2004年   131篇
  2003年   105篇
  2002年   94篇
  2001年   59篇
  2000年   39篇
  1999年   25篇
  1998年   29篇
  1997年   31篇
  1996年   32篇
  1995年   28篇
  1994年   26篇
  1993年   24篇
  1992年   24篇
  1991年   23篇
  1990年   29篇
  1989年   17篇
  1988年   13篇
  1987年   10篇
  1986年   17篇
  1985年   27篇
  1984年   32篇
  1983年   20篇
  1982年   31篇
  1981年   21篇
  1980年   22篇
  1978年   15篇
  1977年   12篇
  1976年   18篇
  1974年   10篇
  1973年   10篇
  1934年   12篇
排序方式: 共有3032条查询结果,搜索用时 171 毫秒
1.
A new strategy for the synthesis of tetrahydroisoquinolines based on the Pd0‐catalyzed intramolecular α‐arylation of sulfones is reported. The combination of this Pd‐catalyzed reaction with intermolecular Michael and aza‐Michael reactions allows the development of two‐ and three‐step domino processes to synthesize diversely functionalized scaffolds from readily available starting materials.  相似文献   
2.
3.
4.
5.
6.
We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities. Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.  相似文献   
7.
We prove the Mayberry-Murasugi formula for links in homology 3-spheres, which was proved before only for links in the 3-sphere. Our proof uses Franz-Reidemeister torsions.

  相似文献   

8.
9.
A new oxazolidine derivative was obtained from phenol, 2‐amino‐2‐methylpropane‐1,3‐diol and paraformaldehyde. The reaction of this novel oxazolidine diol with phenylisocyanate lead to a urethane model compound which can be polymerized thermally by oxazolidine ring opening to give a Mannich bridge structure. Linear segmented polyurethanes were prepared by reaction of different ratios of oxazolidine diol and commercial polyethylenglycol (Mw ~ 400) with 4,4′‐methylenbis (cyclohexylisocyanate) (HMDI, 90% isomers mixture). The polyurethanes were thermally characterized and crosslinked by oxazolidine ring opening to obtain materials which showed improved thermal stability. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4965–4973, 2007  相似文献   
10.
 Suppose ? is a set of arbitrary number of smooth points in ℙ2 its defining ideal. In this paper, we study the Rees algebras of the ideals generated by I t , t ≥α. When the points of ? are general, we give a set of defining equations for the Rees algebra . When the points of ? are arbitrary, we show that for all t≫ 0, the Rees algebra is Cohen-Macaulay and its defining ideal is generated by quadratics. A cohomological characterization for arithmetic Cohen-Macaulayness of subvarieties of a product space is also given. Received 4 April 2001  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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