首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   34725篇
  免费   1146篇
  国内免费   260篇
化学   23908篇
晶体学   241篇
力学   851篇
数学   5847篇
物理学   5284篇
  2022年   235篇
  2021年   443篇
  2020年   538篇
  2019年   515篇
  2018年   399篇
  2017年   384篇
  2016年   871篇
  2015年   782篇
  2014年   839篇
  2013年   1817篇
  2012年   1941篇
  2011年   2439篇
  2010年   1192篇
  2009年   1037篇
  2008年   2075篇
  2007年   2104篇
  2006年   2079篇
  2005年   1971篇
  2004年   1675篇
  2003年   1467篇
  2002年   1359篇
  2001年   451篇
  2000年   431篇
  1999年   382篇
  1998年   353篇
  1997年   387篇
  1996年   520篇
  1995年   375篇
  1994年   329篇
  1993年   301篇
  1992年   304篇
  1991年   270篇
  1990年   229篇
  1989年   232篇
  1988年   259篇
  1987年   214篇
  1986年   201篇
  1985年   386篇
  1984年   374篇
  1983年   276篇
  1982年   347篇
  1981年   353篇
  1980年   333篇
  1979年   306篇
  1978年   290篇
  1977年   252篇
  1976年   239篇
  1975年   235篇
  1974年   249篇
  1973年   246篇
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
161.
The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.  相似文献   
162.
In this article, we report a technique for growing carbon nanotubes in a more controllable fashion, which enables us to synthesize nanotubes directly in various forms of designed patterns. This nanofabrication process is based on a combination of focused ion beam (FIB) and chemical vapor deposition (CVD) techniques. In this process, arrays of conductive patterns were first deposited on silicon substrates by directing a gaseous compound (C(9)H(16)Pt) via the capillary needle-sized nozzles within a FIB system. The substrates were then coated with catalyst and further modified by the FIB to localize the position of the catalyst. Finally, the growth of carbon nanotubes on the designed substrates was carried out by CVD of hydrocarbon gases. This fabrication technique has the advantage of positioning carbon nanotubes in selected locations. This may open up opportunities for the direct synthesis of carbon nanotubes onto almost any substrate material, thus allowing fabrication of carbon nanotube-based devices.  相似文献   
163.
The problem of predicting the short-term future behavior of a sequence, after observing it as long as we please, so as to achieve a specified reliability against all possible sequences is considered. For a particular problem, namely, predicting when in a sequence of 0's and 1's the pair (1, 0) in that order is not coming next, a reliability of 3/4 can be approximated as closely as we please, but not achieved. This article appeared as a Research Memorandum of the Rand Corporation, RM-1570, 12 October 1955.  相似文献   
164.
In previous work, a probabilistic approach to controlling difficulties of density in hyperbolic space led to a workable notion of optimal density for packings of bodies. In this paper we extend an ergodic theorem of Nevo to provide an appropriate definition of those packings to be considered optimally dense. Examples are given to illustrate various aspects of the density problem, in particular the shift in emphasis from the analysis of individual packings to spaces of packings.  相似文献   
165.
A WDM compatible Edge-to-Edge Self-Routed optical packet switched network that simplifies the optical processing is proposed. The system employs all-optical packet label generation and recognition using coded superstructured Fiber Bragg gratings.  相似文献   
166.
For a commutative ring R with set of zero-divisors Z(R), the zero-divisor graph of R is Γ(R)=Z(R)−{0}, with distinct vertices x and y adjacent if and only if xy=0. In this paper, we show that Γ(T(R)) and Γ(R) are isomorphic as graphs, where T(R) is the total quotient ring of R, and that Γ(R) is uniquely complemented if and only if either T(R) is von Neumann regular or Γ(R) is a star graph. We also investigate which cardinal numbers can arise as orders of equivalence classes (related to annihilator conditions) in a von Neumann regular ring.  相似文献   
167.
168.
We report the first total synthesis of the cytotoxic marine alkaloids caulibugulone A-D. This synthesis confirmed the assigned structures and provided sufficient material for further biological testing.  相似文献   
169.
David H Aggen 《Tetrahedron》2004,60(16):3675-3679
Aromatic aldehydes are smoothly converted into the corresponding acylals in good yields in the presence of 3-10 mol% Bi(NO3)3·5H2O. Ketones are not affected under the reaction conditions. The relatively non-toxic nature of the catalyst, its ease of handling, easy availability and low cost make this procedure especially attractive for large-scale synthesis.  相似文献   
170.
Soluble catalysts for the Juliá-Colonna asymmetric epoxidation reaction have been constructed in three different ways, using NH2-PEG-OMe as the support system: suitable solvents have been identified and it is shown that the degree of helicity of the conjugates correlates with the extent of conversion and (to a lesser extent) the enantioselectivity of epoxidation.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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