首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27428篇
  免费   1065篇
  国内免费   154篇
化学   19801篇
晶体学   226篇
力学   550篇
数学   3481篇
物理学   4589篇
  2023年   186篇
  2022年   202篇
  2021年   373篇
  2020年   510篇
  2019年   502篇
  2018年   345篇
  2017年   293篇
  2016年   767篇
  2015年   663篇
  2014年   802篇
  2013年   1304篇
  2012年   1729篇
  2011年   1901篇
  2010年   1090篇
  2009年   919篇
  2008年   1585篇
  2007年   1515篇
  2006年   1470篇
  2005年   1379篇
  2004年   1213篇
  2003年   938篇
  2002年   961篇
  2001年   471篇
  2000年   413篇
  1999年   391篇
  1998年   382篇
  1997年   354篇
  1996年   376篇
  1995年   302篇
  1994年   340篇
  1993年   314篇
  1992年   286篇
  1991年   203篇
  1990年   230篇
  1989年   194篇
  1988年   204篇
  1987年   182篇
  1986年   168篇
  1985年   281篇
  1984年   277篇
  1983年   192篇
  1982年   217篇
  1981年   197篇
  1980年   193篇
  1979年   177篇
  1978年   214篇
  1977年   195篇
  1976年   153篇
  1974年   164篇
  1973年   142篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
92.
Thomas McCauley 《Pramana》2006,67(4):681-689
I briefly review the present and future status of the burgeoning field of neutrino astronomy. I outline the astrophysics and particle physics goals, design, and performance of the various current and proposed neutrino telescopes. Also described are present results and future expectations.  相似文献   
93.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.  相似文献   
94.
Signaling in living systems needs to achieve high specificity, to be reversible, and to achieve high signal to noise. Signaling mediated by multiprotein systems has evolved that avoids the requirement for high-affinity binary complexes that would be difficult to reverse and which, in the overcrowded cell, would lead to excessive noise in the system. Symmetrical structures are only occasionally formed. When they are, it is principally to colocate components, for example, the tyrosyl kinases of growth factors, where dimers form. Symmetry is, however, often broken, presumably to create more sensitivity and specificity in the signaling system by assembling other components, into higher-order multiprotein systems. The binding of a single heparin to two 1:1 FGF:FGFR complexes is an example, as is the binding of a single ligase to the Xrcc4 dimer, perhaps so creating a further DNA-binding site.  相似文献   
95.
The palladium-catalyzed α-arylation of ketones on solid support is described. Using modified Buchwald-Hartwig reaction conditions, the coupling of immobilized 4-bromobenzamide with various aromatic, heteroaromatic, and aliphatic ketones was investigated. Subsequent cleavage from the resin provided the desired α-aryl ketones almost in moderate to high yields and good to excellent purities. The scope and limitations of this protocol will be discussed.  相似文献   
96.
Thomas  Hugh 《Order》2002,19(4):327-342
This paper is concerned with the d-dimensional cyclic polytope with n vertices, C(n,d), and the set of its triangulations, S(n,d). We show that there is a bijection between S(n,d) and certain partitions of the set of increasing d-tuples on the integers 1 to n–1. We give a combinatorial characterization of the second higher Stasheff–Tamari poset, which is a partial ordering of S(n,d), and we determine its 2-dimension. There is a well-known representation of triangulations of an n-gon by right bracket vectors. We generalize this to cyclic polytopes of higher dimensions.  相似文献   
97.
We construct a generic extension in which the ℵ2nd canonical function on ℵ1 exists. Supported by NSF and by a Fulbright grant. Publ. 378. Partially supported by the B.S.F.  相似文献   
98.
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we employ two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight line drawings of triconnected planar graphs in linear time. Previously known algorithms run in quadratic time. We show that an algorithm of Fontet can be used to find an embedding in the plane with the maximum number of symmetries, and present a new algorithm for finding a straight line drawing that achieves that maximum. Both algorithms run in linear time.  相似文献   
99.
100.
There does not exist a Borel choice of generators for each finitely generated group which has the property that isomorphic groups are assigned isomorphic Cayley graphs.

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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