首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5506篇
  免费   426篇
  国内免费   529篇
化学   416篇
晶体学   4篇
力学   347篇
综合类   143篇
数学   5059篇
物理学   492篇
  2024年   5篇
  2023年   64篇
  2022年   86篇
  2021年   103篇
  2020年   117篇
  2019年   118篇
  2018年   139篇
  2017年   147篇
  2016年   158篇
  2015年   112篇
  2014年   227篇
  2013年   384篇
  2012年   252篇
  2011年   320篇
  2010年   286篇
  2009年   379篇
  2008年   376篇
  2007年   338篇
  2006年   337篇
  2005年   283篇
  2004年   237篇
  2003年   283篇
  2002年   233篇
  2001年   220篇
  2000年   181篇
  1999年   176篇
  1998年   185篇
  1997年   162篇
  1996年   102篇
  1995年   72篇
  1994年   60篇
  1993年   50篇
  1992年   37篇
  1991年   28篇
  1990年   20篇
  1989年   15篇
  1988年   13篇
  1987年   12篇
  1986年   9篇
  1985年   24篇
  1984年   20篇
  1983年   12篇
  1982年   21篇
  1981年   17篇
  1980年   18篇
  1979年   5篇
  1978年   6篇
  1977年   2篇
  1976年   5篇
  1974年   3篇
排序方式: 共有6461条查询结果,搜索用时 15 毫秒
91.
92.
93.
94.
95.
96.
Classical problems in integral geometry and geometric probability involve the kinematic measure of congruent segments of fixed length within a convex body in R3. We give this measure from rotational formulae; that is, from isotropic plane sections through a fixed point. From this result we also obtain a new rotational formula for the volume of a convex body; which is proved to be equivalent to the wedge formula for the volume.  相似文献   
97.
In this article, we use some analytic and geometric characters of the smooth points in a sphere to study the isometric extension problem in the separable or reflexive real Banach spaces. We obtain that under some condition the answer to this problem is affirmative.  相似文献   
98.
For every nN, we present a set Sn of O(n3/2logn) points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of Sn. This is the first subquadratic upper bound on the cardinality of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs.  相似文献   
99.
Single crystals of (1,3‐diamino‐5‐azaniumyl‐1,3,5‐trideoxy‐cis‐inositol‐κ3O2,O4,O6)(1,3,5‐triamino‐1,3,5‐trideoxy‐cis‐inositol‐κ3O2,O4,O6)lithium(I) diiodide dihydrate, [Li(C6H16N3O3)(C6H15N3O3)]I2·2H2O or [Li(Htaci)(taci)]I2·2H2O (taci is 1,3,5‐triamino‐1,3,5‐trideoxy‐cis‐inositol), (I), bis(1,3,5‐triamino‐1,3,5‐trideoxy‐cis‐inositol‐κ3O2,O4,O6)sodium(I) iodide, [Na(C6H15N3O3)2]I or [Na(taci)2]I, (II), and bis(1,3,5‐triamino‐1,3,5‐trideoxy‐cis‐inositol‐κ3O2,O4,O6)potassium(I) iodide, [K(C6H15N3O3)2]I or [K(taci)2]I, (III), were grown by diffusion of MeOH into aqueous solutions of the complexes. The structures of the Na and K complexes are isotypic. In all three complexes, the taci ligands adopt a chair conformation with axial hydroxy groups, and the metal cations exhibit exclusive O‐atom coordination. The six O atoms of the resulting MO6 unit define a centrosymmetric trigonal antiprism with approximate D3d symmetry. The interligand O...O distances increase significantly in the order Li < Na < K. The structure of (I) exhibits a complex three‐dimensional network of R—NH2—H...NH2R, R—O—H...NH2R and R—O—H...O(H)—H...NH2R hydrogen bonds. The structures of the Na and K complexes consist of a stack of layers, in which each taci ligand is bonded to three neighbours via pairwise O—H...NH2 interactions between vicinal HO—CH—CH—NH2 groups.  相似文献   
100.
In this paper, the class of possibilistic nested logic programs is introduced. These possibilistic logic programs allow us to use nested expressions in the bodies and heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibilistic logic is defined. In order to define a general method for computing the possibilistic answer sets of a possibilistic nested program, the idea of equivalence between possibilistic nested programs is explored. By considering properties of equivalence between possibilistic programs, a process of transforming a possibilistic nested logic program into a possibilistic disjunctive logic program is defined. Given that our approach is an extension of answer set programming, we also explore the concept of strong equivalence between possibilistic nested logic programs. To this end, we introduce the concept of poss SE-models. Therefore, we show that two possibilistic nested logic programs are strong equivalents whenever they have the same poss SE-models.The expressiveness of the possibilistic nested logic programs is illustrated by a scenario from the medical domain. In particular, we exemplify how possibilistic nested logic programs are expressive enough for capturing medical guidelines which are pervaded by vagueness and qualitative information.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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